./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_07-tricky_address2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/06-symbeq_07-tricky_address2.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 c18dd13658bb5739ed2db8c4c80ae330682b7c3cebd2ad85657518c27ca325b9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:31:09,336 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:31:09,385 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:31:09,389 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:31:09,389 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:31:09,411 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:31:09,411 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:31:09,411 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:31:09,412 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:31:09,412 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:31:09,412 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:31:09,412 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:31:09,412 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:31:09,412 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:31:09,412 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:31:09,413 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:31:09,413 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:31:09,413 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:31:09,413 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:31:09,413 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:31:09,413 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:31:09,413 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:31:09,413 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:31:09,413 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:31:09,413 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:31:09,413 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:31:09,414 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:31:09,414 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:31:09,414 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:31:09,414 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:31:09,414 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:31:09,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:31:09,414 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:31:09,414 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:31:09,414 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:31:09,414 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:31:09,415 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:31:09,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:31:09,415 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:31:09,415 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:31:09,415 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:31:09,415 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:31:09,415 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 -> c18dd13658bb5739ed2db8c4c80ae330682b7c3cebd2ad85657518c27ca325b9 [2025-02-08 05:31:09,649 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:31:09,654 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:31:09,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:31:09,659 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:31:09,660 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:31:09,660 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_07-tricky_address2.i [2025-02-08 05:31:10,793 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eaf4a92db/2a58afa80db84666801446b78565b274/FLAG8dfa97fdd [2025-02-08 05:31:11,085 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:31:11,085 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_07-tricky_address2.i [2025-02-08 05:31:11,098 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eaf4a92db/2a58afa80db84666801446b78565b274/FLAG8dfa97fdd [2025-02-08 05:31:11,369 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eaf4a92db/2a58afa80db84666801446b78565b274 [2025-02-08 05:31:11,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:31:11,373 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:31:11,375 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:31:11,375 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:31:11,379 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:31:11,379 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:31:11" (1/1) ... [2025-02-08 05:31:11,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b78f840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:11, skipping insertion in model container [2025-02-08 05:31:11,380 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:31:11" (1/1) ... [2025-02-08 05:31:11,412 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:31:11,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:31:11,727 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:31:11,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:31:11,827 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:31:11,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:11 WrapperNode [2025-02-08 05:31:11,827 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:31:11,828 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:31:11,828 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:31:11,828 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:31:11,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:11" (1/1) ... [2025-02-08 05:31:11,843 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:11" (1/1) ... [2025-02-08 05:31:11,869 INFO L138 Inliner]: procedures = 265, calls = 74, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 148 [2025-02-08 05:31:11,869 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:31:11,869 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:31:11,869 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:31:11,869 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:31:11,875 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:11" (1/1) ... [2025-02-08 05:31:11,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:11" (1/1) ... [2025-02-08 05:31:11,878 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:11" (1/1) ... [2025-02-08 05:31:11,878 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:11" (1/1) ... [2025-02-08 05:31:11,887 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:11" (1/1) ... [2025-02-08 05:31:11,888 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:11" (1/1) ... [2025-02-08 05:31:11,889 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:11" (1/1) ... [2025-02-08 05:31:11,890 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:11" (1/1) ... [2025-02-08 05:31:11,891 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:31:11,892 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:31:11,892 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:31:11,892 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:31:11,893 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:11" (1/1) ... [2025-02-08 05:31:11,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:31:11,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:31:11,930 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-08 05:31:11,933 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-08 05:31:11,948 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:31:11,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:31:11,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:31:11,948 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:31:11,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:31:11,948 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 05:31:11,949 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 05:31:11,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:31:11,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:31:11,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:31:11,949 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:31:12,036 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:31:12,038 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:31:12,320 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:31:12,320 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:31:12,343 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:31:12,344 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:31:12,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:31:12 BoogieIcfgContainer [2025-02-08 05:31:12,345 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:31:12,346 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:31:12,347 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:31:12,350 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:31:12,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:31:11" (1/3) ... [2025-02-08 05:31:12,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46291317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:31:12, skipping insertion in model container [2025-02-08 05:31:12,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:11" (2/3) ... [2025-02-08 05:31:12,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46291317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:31:12, skipping insertion in model container [2025-02-08 05:31:12,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:31:12" (3/3) ... [2025-02-08 05:31:12,353 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_07-tricky_address2.i [2025-02-08 05:31:12,365 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:31:12,368 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_07-tricky_address2.i that has 2 procedures, 158 locations, 1 initial locations, 1 loop locations, and 4 error locations. [2025-02-08 05:31:12,368 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:31:12,429 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:31:12,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 160 transitions, 324 flow [2025-02-08 05:31:12,545 INFO L124 PetriNetUnfolderBase]: 3/159 cut-off events. [2025-02-08 05:31:12,547 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:31:12,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 159 events. 3/159 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 83 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2025-02-08 05:31:12,553 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 160 transitions, 324 flow [2025-02-08 05:31:12,558 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 159 transitions, 321 flow [2025-02-08 05:31:12,567 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:31:12,582 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;@52e12712, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:31:12,583 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-08 05:31:12,614 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:31:12,615 INFO L124 PetriNetUnfolderBase]: 3/112 cut-off events. [2025-02-08 05:31:12,615 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:31:12,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:12,615 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:12,616 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 05:31:12,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:12,621 INFO L85 PathProgramCache]: Analyzing trace with hash 489885583, now seen corresponding path program 1 times [2025-02-08 05:31:12,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:12,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288931393] [2025-02-08 05:31:12,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:12,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:12,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 05:31:12,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 05:31:12,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:12,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:12,951 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-08 05:31:12,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:12,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288931393] [2025-02-08 05:31:12,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288931393] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:12,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:12,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:31:12,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939302452] [2025-02-08 05:31:12,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:12,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:31:12,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:12,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:31:12,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:31:12,997 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 160 [2025-02-08 05:31:13,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 159 transitions, 321 flow. Second operand has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 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-08 05:31:13,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:13,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 160 [2025-02-08 05:31:13,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:13,071 INFO L124 PetriNetUnfolderBase]: 7/221 cut-off events. [2025-02-08 05:31:13,072 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:31:13,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 221 events. 7/221 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 324 event pairs, 6 based on Foata normal form. 5/214 useless extension candidates. Maximal degree in co-relation 144. Up to 24 conditions per place. [2025-02-08 05:31:13,075 INFO L140 encePairwiseOnDemand]: 155/160 looper letters, 10 selfloop transitions, 2 changer transitions 1/158 dead transitions. [2025-02-08 05:31:13,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 158 transitions, 343 flow [2025-02-08 05:31:13,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:31:13,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:31:13,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 456 transitions. [2025-02-08 05:31:13,087 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.95 [2025-02-08 05:31:13,088 INFO L175 Difference]: Start difference. First operand has 160 places, 159 transitions, 321 flow. Second operand 3 states and 456 transitions. [2025-02-08 05:31:13,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 158 transitions, 343 flow [2025-02-08 05:31:13,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 158 transitions, 342 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:31:13,097 INFO L231 Difference]: Finished difference. Result has 162 places, 157 transitions, 326 flow [2025-02-08 05:31:13,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=162, PETRI_TRANSITIONS=157} [2025-02-08 05:31:13,101 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 2 predicate places. [2025-02-08 05:31:13,101 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 157 transitions, 326 flow [2025-02-08 05:31:13,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 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-08 05:31:13,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:13,102 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:13,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:31:13,102 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 05:31:13,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:13,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1681250623, now seen corresponding path program 1 times [2025-02-08 05:31:13,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:13,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916763218] [2025-02-08 05:31:13,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:13,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:13,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 05:31:13,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 05:31:13,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:13,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:13,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:13,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:13,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916763218] [2025-02-08 05:31:13,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916763218] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:31:13,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565568120] [2025-02-08 05:31:13,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:13,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:31:13,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:31:13,294 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:31:13,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 05:31:13,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 05:31:13,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 05:31:13,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:13,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:13,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 05:31:13,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:31:13,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:13,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:31:13,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:13,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565568120] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:31:13,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:31:13,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-08 05:31:13,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116325940] [2025-02-08 05:31:13,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:31:13,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:31:13,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:13,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:31:13,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 05:31:13,526 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 160 [2025-02-08 05:31:13,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 157 transitions, 326 flow. Second operand has 10 states, 10 states have (on average 146.0) internal successors, (1460), 10 states have internal predecessors, (1460), 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-08 05:31:13,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:13,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 160 [2025-02-08 05:31:13,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:13,665 INFO L124 PetriNetUnfolderBase]: 7/227 cut-off events. [2025-02-08 05:31:13,665 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:31:13,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 227 events. 7/227 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 319 event pairs, 6 based on Foata normal form. 2/218 useless extension candidates. Maximal degree in co-relation 191. Up to 24 conditions per place. [2025-02-08 05:31:13,667 INFO L140 encePairwiseOnDemand]: 154/160 looper letters, 14 selfloop transitions, 9 changer transitions 0/165 dead transitions. [2025-02-08 05:31:13,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 165 transitions, 390 flow [2025-02-08 05:31:13,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:31:13,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:31:13,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1321 transitions. [2025-02-08 05:31:13,674 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9173611111111111 [2025-02-08 05:31:13,674 INFO L175 Difference]: Start difference. First operand has 162 places, 157 transitions, 326 flow. Second operand 9 states and 1321 transitions. [2025-02-08 05:31:13,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 165 transitions, 390 flow [2025-02-08 05:31:13,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 165 transitions, 388 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:31:13,678 INFO L231 Difference]: Finished difference. Result has 171 places, 163 transitions, 374 flow [2025-02-08 05:31:13,679 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=374, PETRI_PLACES=171, PETRI_TRANSITIONS=163} [2025-02-08 05:31:13,679 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 11 predicate places. [2025-02-08 05:31:13,680 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 163 transitions, 374 flow [2025-02-08 05:31:13,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 146.0) internal successors, (1460), 10 states have internal predecessors, (1460), 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-08 05:31:13,681 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:13,681 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:31:13,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 05:31:13,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:31:13,883 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 05:31:13,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:13,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1189937025, now seen corresponding path program 2 times [2025-02-08 05:31:13,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:13,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064165067] [2025-02-08 05:31:13,884 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:31:13,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:13,902 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 109 statements into 2 equivalence classes. [2025-02-08 05:31:13,914 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 94 of 109 statements. [2025-02-08 05:31:13,914 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:31:13,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:14,368 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-08 05:31:14,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:14,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064165067] [2025-02-08 05:31:14,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064165067] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:14,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:14,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:31:14,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264074669] [2025-02-08 05:31:14,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:14,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:31:14,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:14,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:31:14,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:31:14,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 160 [2025-02-08 05:31:14,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 163 transitions, 374 flow. Second operand has 6 states, 6 states have (on average 135.66666666666666) internal successors, (814), 6 states have internal predecessors, (814), 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-08 05:31:14,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:14,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 160 [2025-02-08 05:31:14,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:15,052 INFO L124 PetriNetUnfolderBase]: 129/676 cut-off events. [2025-02-08 05:31:15,053 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:31:15,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1006 conditions, 676 events. 129/676 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3539 event pairs, 46 based on Foata normal form. 0/616 useless extension candidates. Maximal degree in co-relation 893. Up to 178 conditions per place. [2025-02-08 05:31:15,058 INFO L140 encePairwiseOnDemand]: 149/160 looper letters, 43 selfloop transitions, 22 changer transitions 0/204 dead transitions. [2025-02-08 05:31:15,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 204 transitions, 586 flow [2025-02-08 05:31:15,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:31:15,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:31:15,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 870 transitions. [2025-02-08 05:31:15,062 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.90625 [2025-02-08 05:31:15,062 INFO L175 Difference]: Start difference. First operand has 171 places, 163 transitions, 374 flow. Second operand 6 states and 870 transitions. [2025-02-08 05:31:15,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 204 transitions, 586 flow [2025-02-08 05:31:15,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 204 transitions, 580 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-08 05:31:15,068 INFO L231 Difference]: Finished difference. Result has 179 places, 185 transitions, 514 flow [2025-02-08 05:31:15,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=514, PETRI_PLACES=179, PETRI_TRANSITIONS=185} [2025-02-08 05:31:15,068 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 19 predicate places. [2025-02-08 05:31:15,068 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 185 transitions, 514 flow [2025-02-08 05:31:15,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 135.66666666666666) internal successors, (814), 6 states have internal predecessors, (814), 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-08 05:31:15,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:15,069 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:31:15,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:31:15,069 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 05:31:15,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:15,073 INFO L85 PathProgramCache]: Analyzing trace with hash 591590064, now seen corresponding path program 1 times [2025-02-08 05:31:15,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:15,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985010147] [2025-02-08 05:31:15,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:15,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:15,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-08 05:31:15,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-08 05:31:15,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:15,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:15,249 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:15,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:15,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985010147] [2025-02-08 05:31:15,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985010147] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:31:15,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754908108] [2025-02-08 05:31:15,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:15,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:31:15,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:31:15,252 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:31:15,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 05:31:15,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-08 05:31:15,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-08 05:31:15,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:15,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:15,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 05:31:15,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:31:15,392 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:15,392 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:31:15,472 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:15,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754908108] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:31:15,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:31:15,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-02-08 05:31:15,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170741089] [2025-02-08 05:31:15,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:31:15,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 05:31:15,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:15,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 05:31:15,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-02-08 05:31:15,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 160 [2025-02-08 05:31:15,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 185 transitions, 514 flow. Second operand has 18 states, 18 states have (on average 146.0) internal successors, (2628), 18 states have internal predecessors, (2628), 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-08 05:31:15,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:15,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 160 [2025-02-08 05:31:15,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:15,705 INFO L124 PetriNetUnfolderBase]: 41/503 cut-off events. [2025-02-08 05:31:15,705 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-02-08 05:31:15,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 814 conditions, 503 events. 41/503 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2247 event pairs, 16 based on Foata normal form. 4/480 useless extension candidates. Maximal degree in co-relation 626. Up to 55 conditions per place. [2025-02-08 05:31:15,708 INFO L140 encePairwiseOnDemand]: 154/160 looper letters, 18 selfloop transitions, 21 changer transitions 0/203 dead transitions. [2025-02-08 05:31:15,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 203 transitions, 680 flow [2025-02-08 05:31:15,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-08 05:31:15,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-02-08 05:31:15,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3067 transitions. [2025-02-08 05:31:15,713 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.912797619047619 [2025-02-08 05:31:15,713 INFO L175 Difference]: Start difference. First operand has 179 places, 185 transitions, 514 flow. Second operand 21 states and 3067 transitions. [2025-02-08 05:31:15,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 203 transitions, 680 flow [2025-02-08 05:31:15,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 203 transitions, 680 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:31:15,721 INFO L231 Difference]: Finished difference. Result has 204 places, 198 transitions, 644 flow [2025-02-08 05:31:15,721 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=644, PETRI_PLACES=204, PETRI_TRANSITIONS=198} [2025-02-08 05:31:15,722 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 44 predicate places. [2025-02-08 05:31:15,723 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 198 transitions, 644 flow [2025-02-08 05:31:15,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 146.0) internal successors, (2628), 18 states have internal predecessors, (2628), 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-08 05:31:15,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:15,724 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:31:15,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 05:31:15,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:31:15,925 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 05:31:15,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:15,926 INFO L85 PathProgramCache]: Analyzing trace with hash -184331216, now seen corresponding path program 2 times [2025-02-08 05:31:15,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:15,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027969970] [2025-02-08 05:31:15,926 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:31:15,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:15,937 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 137 statements into 2 equivalence classes. [2025-02-08 05:31:15,946 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 102 of 137 statements. [2025-02-08 05:31:15,946 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:31:15,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:16,273 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-08 05:31:16,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:16,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027969970] [2025-02-08 05:31:16,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027969970] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:16,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:16,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:31:16,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058167031] [2025-02-08 05:31:16,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:16,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:31:16,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:16,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:31:16,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:31:16,640 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 160 [2025-02-08 05:31:16,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 198 transitions, 644 flow. Second operand has 6 states, 6 states have (on average 130.66666666666666) internal successors, (784), 6 states have internal predecessors, (784), 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-08 05:31:16,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:16,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 160 [2025-02-08 05:31:16,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:16,918 INFO L124 PetriNetUnfolderBase]: 306/1335 cut-off events. [2025-02-08 05:31:16,919 INFO L125 PetriNetUnfolderBase]: For 286/296 co-relation queries the response was YES. [2025-02-08 05:31:16,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2502 conditions, 1335 events. 306/1335 cut-off events. For 286/296 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 9028 event pairs, 116 based on Foata normal form. 5/1228 useless extension candidates. Maximal degree in co-relation 2305. Up to 464 conditions per place. [2025-02-08 05:31:16,924 INFO L140 encePairwiseOnDemand]: 145/160 looper letters, 72 selfloop transitions, 36 changer transitions 2/255 dead transitions. [2025-02-08 05:31:16,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 255 transitions, 1016 flow [2025-02-08 05:31:16,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:31:16,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:31:16,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 856 transitions. [2025-02-08 05:31:16,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8916666666666667 [2025-02-08 05:31:16,926 INFO L175 Difference]: Start difference. First operand has 204 places, 198 transitions, 644 flow. Second operand 6 states and 856 transitions. [2025-02-08 05:31:16,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 255 transitions, 1016 flow [2025-02-08 05:31:16,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 255 transitions, 992 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-02-08 05:31:16,931 INFO L231 Difference]: Finished difference. Result has 207 places, 230 transitions, 872 flow [2025-02-08 05:31:16,932 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=872, PETRI_PLACES=207, PETRI_TRANSITIONS=230} [2025-02-08 05:31:16,932 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 47 predicate places. [2025-02-08 05:31:16,932 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 230 transitions, 872 flow [2025-02-08 05:31:16,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.66666666666666) internal successors, (784), 6 states have internal predecessors, (784), 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-08 05:31:16,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:16,934 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:31:16,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:31:16,935 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 05:31:16,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:16,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1149960540, now seen corresponding path program 1 times [2025-02-08 05:31:16,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:16,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287142920] [2025-02-08 05:31:16,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:16,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:16,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-08 05:31:16,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-08 05:31:16,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:16,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:17,189 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:17,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:17,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287142920] [2025-02-08 05:31:17,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287142920] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:31:17,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767704959] [2025-02-08 05:31:17,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:17,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:31:17,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:31:17,192 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:31:17,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 05:31:17,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-08 05:31:17,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-08 05:31:17,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:17,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:17,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 05:31:17,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:31:17,359 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:17,359 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:31:17,526 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:17,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767704959] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:31:17,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:31:17,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-02-08 05:31:17,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773000712] [2025-02-08 05:31:17,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:31:17,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-08 05:31:17,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:17,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 05:31:17,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-02-08 05:31:17,556 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 160 [2025-02-08 05:31:17,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 230 transitions, 872 flow. Second operand has 23 states, 23 states have (on average 146.08695652173913) internal successors, (3360), 23 states have internal predecessors, (3360), 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-08 05:31:17,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:17,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 160 [2025-02-08 05:31:17,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:17,902 INFO L124 PetriNetUnfolderBase]: 120/935 cut-off events. [2025-02-08 05:31:17,902 INFO L125 PetriNetUnfolderBase]: For 414/414 co-relation queries the response was YES. [2025-02-08 05:31:17,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1833 conditions, 935 events. 120/935 cut-off events. For 414/414 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5974 event pairs, 33 based on Foata normal form. 3/879 useless extension candidates. Maximal degree in co-relation 1557. Up to 134 conditions per place. [2025-02-08 05:31:17,908 INFO L140 encePairwiseOnDemand]: 154/160 looper letters, 21 selfloop transitions, 30 changer transitions 0/247 dead transitions. [2025-02-08 05:31:17,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 247 transitions, 1096 flow [2025-02-08 05:31:17,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-08 05:31:17,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-02-08 05:31:17,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4374 transitions. [2025-02-08 05:31:17,916 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.91125 [2025-02-08 05:31:17,917 INFO L175 Difference]: Start difference. First operand has 207 places, 230 transitions, 872 flow. Second operand 30 states and 4374 transitions. [2025-02-08 05:31:17,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 247 transitions, 1096 flow [2025-02-08 05:31:17,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 247 transitions, 1072 flow, removed 12 selfloop flow, removed 0 redundant places. [2025-02-08 05:31:17,924 INFO L231 Difference]: Finished difference. Result has 239 places, 240 transitions, 1000 flow [2025-02-08 05:31:17,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1000, PETRI_PLACES=239, PETRI_TRANSITIONS=240} [2025-02-08 05:31:17,925 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 79 predicate places. [2025-02-08 05:31:17,925 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 240 transitions, 1000 flow [2025-02-08 05:31:17,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 146.08695652173913) internal successors, (3360), 23 states have internal predecessors, (3360), 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-08 05:31:17,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:17,926 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:31:17,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 05:31:18,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:31:18,127 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 05:31:18,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:18,128 INFO L85 PathProgramCache]: Analyzing trace with hash 2056736754, now seen corresponding path program 2 times [2025-02-08 05:31:18,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:18,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648472673] [2025-02-08 05:31:18,128 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:31:18,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:18,149 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 154 statements into 2 equivalence classes. [2025-02-08 05:31:18,154 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 104 of 154 statements. [2025-02-08 05:31:18,155 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:31:18,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:18,355 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:31:18,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:18,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648472673] [2025-02-08 05:31:18,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648472673] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:18,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:18,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:31:18,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746149111] [2025-02-08 05:31:18,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:18,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:31:18,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:18,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:31:18,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:31:18,792 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 160 [2025-02-08 05:31:18,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 240 transitions, 1000 flow. Second operand has 6 states, 6 states have (on average 137.5) internal successors, (825), 6 states have internal predecessors, (825), 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-08 05:31:18,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:18,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 160 [2025-02-08 05:31:18,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:18,997 INFO L124 PetriNetUnfolderBase]: 300/1427 cut-off events. [2025-02-08 05:31:18,997 INFO L125 PetriNetUnfolderBase]: For 878/918 co-relation queries the response was YES. [2025-02-08 05:31:19,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3261 conditions, 1427 events. 300/1427 cut-off events. For 878/918 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10116 event pairs, 66 based on Foata normal form. 10/1390 useless extension candidates. Maximal degree in co-relation 2983. Up to 443 conditions per place. [2025-02-08 05:31:19,005 INFO L140 encePairwiseOnDemand]: 149/160 looper letters, 79 selfloop transitions, 49 changer transitions 0/306 dead transitions. [2025-02-08 05:31:19,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 306 transitions, 1555 flow [2025-02-08 05:31:19,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:31:19,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:31:19,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 880 transitions. [2025-02-08 05:31:19,008 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2025-02-08 05:31:19,008 INFO L175 Difference]: Start difference. First operand has 239 places, 240 transitions, 1000 flow. Second operand 6 states and 880 transitions. [2025-02-08 05:31:19,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 306 transitions, 1555 flow [2025-02-08 05:31:19,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 306 transitions, 1509 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-02-08 05:31:19,020 INFO L231 Difference]: Finished difference. Result has 230 places, 281 transitions, 1370 flow [2025-02-08 05:31:19,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=954, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1370, PETRI_PLACES=230, PETRI_TRANSITIONS=281} [2025-02-08 05:31:19,022 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 70 predicate places. [2025-02-08 05:31:19,022 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 281 transitions, 1370 flow [2025-02-08 05:31:19,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 137.5) internal successors, (825), 6 states have internal predecessors, (825), 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-08 05:31:19,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:19,023 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:31:19,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:31:19,023 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 05:31:19,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:19,024 INFO L85 PathProgramCache]: Analyzing trace with hash -162158218, now seen corresponding path program 1 times [2025-02-08 05:31:19,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:19,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653355185] [2025-02-08 05:31:19,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:19,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:19,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-08 05:31:19,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-08 05:31:19,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:19,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:19,356 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:31:19,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:19,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653355185] [2025-02-08 05:31:19,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653355185] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:19,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:19,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:31:19,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461045298] [2025-02-08 05:31:19,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:19,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:31:19,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:19,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:31:19,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:31:19,649 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 160 [2025-02-08 05:31:19,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 281 transitions, 1370 flow. Second operand has 6 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 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-08 05:31:19,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:19,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 160 [2025-02-08 05:31:19,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:20,017 INFO L124 PetriNetUnfolderBase]: 569/2203 cut-off events. [2025-02-08 05:31:20,017 INFO L125 PetriNetUnfolderBase]: For 2425/2485 co-relation queries the response was YES. [2025-02-08 05:31:20,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5833 conditions, 2203 events. 569/2203 cut-off events. For 2425/2485 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 17212 event pairs, 130 based on Foata normal form. 12/2129 useless extension candidates. Maximal degree in co-relation 5572. Up to 803 conditions per place. [2025-02-08 05:31:20,027 INFO L140 encePairwiseOnDemand]: 145/160 looper letters, 118 selfloop transitions, 78 changer transitions 11/375 dead transitions. [2025-02-08 05:31:20,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 375 transitions, 2308 flow [2025-02-08 05:31:20,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:31:20,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:31:20,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 866 transitions. [2025-02-08 05:31:20,029 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9020833333333333 [2025-02-08 05:31:20,029 INFO L175 Difference]: Start difference. First operand has 230 places, 281 transitions, 1370 flow. Second operand 6 states and 866 transitions. [2025-02-08 05:31:20,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 375 transitions, 2308 flow [2025-02-08 05:31:20,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 375 transitions, 2306 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-08 05:31:20,041 INFO L231 Difference]: Finished difference. Result has 239 places, 329 transitions, 1974 flow [2025-02-08 05:31:20,041 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=1368, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1974, PETRI_PLACES=239, PETRI_TRANSITIONS=329} [2025-02-08 05:31:20,042 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 79 predicate places. [2025-02-08 05:31:20,042 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 329 transitions, 1974 flow [2025-02-08 05:31:20,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 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-08 05:31:20,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:20,043 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:31:20,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:31:20,043 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 05:31:20,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:20,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1021934499, now seen corresponding path program 1 times [2025-02-08 05:31:20,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:20,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214145054] [2025-02-08 05:31:20,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:20,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:20,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-08 05:31:20,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-08 05:31:20,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:20,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:24,064 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:31:24,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:24,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214145054] [2025-02-08 05:31:24,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214145054] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:24,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:24,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-08 05:31:24,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867620733] [2025-02-08 05:31:24,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:24,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 05:31:24,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:24,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 05:31:24,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-02-08 05:31:25,244 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 160 [2025-02-08 05:31:25,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 329 transitions, 1974 flow. Second operand has 13 states, 13 states have (on average 121.07692307692308) internal successors, (1574), 13 states have internal predecessors, (1574), 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-08 05:31:25,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:25,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 160 [2025-02-08 05:31:25,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:26,506 INFO L124 PetriNetUnfolderBase]: 1232/4499 cut-off events. [2025-02-08 05:31:26,506 INFO L125 PetriNetUnfolderBase]: For 9425/9666 co-relation queries the response was YES. [2025-02-08 05:31:26,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14333 conditions, 4499 events. 1232/4499 cut-off events. For 9425/9666 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 42015 event pairs, 133 based on Foata normal form. 159/4607 useless extension candidates. Maximal degree in co-relation 14056. Up to 884 conditions per place. [2025-02-08 05:31:26,535 INFO L140 encePairwiseOnDemand]: 133/160 looper letters, 364 selfloop transitions, 83 changer transitions 93/697 dead transitions. [2025-02-08 05:31:26,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 697 transitions, 6113 flow [2025-02-08 05:31:26,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-08 05:31:26,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-02-08 05:31:26,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2449 transitions. [2025-02-08 05:31:26,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8055921052631579 [2025-02-08 05:31:26,539 INFO L175 Difference]: Start difference. First operand has 239 places, 329 transitions, 1974 flow. Second operand 19 states and 2449 transitions. [2025-02-08 05:31:26,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 697 transitions, 6113 flow [2025-02-08 05:31:26,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 697 transitions, 6027 flow, removed 43 selfloop flow, removed 0 redundant places. [2025-02-08 05:31:26,572 INFO L231 Difference]: Finished difference. Result has 268 places, 402 transitions, 3022 flow [2025-02-08 05:31:26,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=1940, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3022, PETRI_PLACES=268, PETRI_TRANSITIONS=402} [2025-02-08 05:31:26,573 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 108 predicate places. [2025-02-08 05:31:26,573 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 402 transitions, 3022 flow [2025-02-08 05:31:26,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 121.07692307692308) internal successors, (1574), 13 states have internal predecessors, (1574), 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-08 05:31:26,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:26,574 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:31:26,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:31:26,574 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 05:31:26,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:26,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1499352263, now seen corresponding path program 2 times [2025-02-08 05:31:26,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:26,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514319905] [2025-02-08 05:31:26,575 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:31:26,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:26,585 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 168 statements into 2 equivalence classes. [2025-02-08 05:31:26,603 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 118 of 168 statements. [2025-02-08 05:31:26,603 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:31:26,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:29,808 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:31:29,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:29,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514319905] [2025-02-08 05:31:29,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514319905] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:29,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:29,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-08 05:31:29,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713719507] [2025-02-08 05:31:29,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:29,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 05:31:29,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:29,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 05:31:29,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-02-08 05:31:31,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 160 [2025-02-08 05:31:31,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 402 transitions, 3022 flow. Second operand has 14 states, 14 states have (on average 120.92857142857143) internal successors, (1693), 14 states have internal predecessors, (1693), 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-08 05:31:31,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:31,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 160 [2025-02-08 05:31:31,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:33,586 INFO L124 PetriNetUnfolderBase]: 1203/4432 cut-off events. [2025-02-08 05:31:33,586 INFO L125 PetriNetUnfolderBase]: For 13720/14008 co-relation queries the response was YES. [2025-02-08 05:31:33,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16372 conditions, 4432 events. 1203/4432 cut-off events. For 13720/14008 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 41749 event pairs, 182 based on Foata normal form. 166/4543 useless extension candidates. Maximal degree in co-relation 16083. Up to 1196 conditions per place. [2025-02-08 05:31:33,615 INFO L140 encePairwiseOnDemand]: 133/160 looper letters, 309 selfloop transitions, 119 changer transitions 74/659 dead transitions. [2025-02-08 05:31:33,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 659 transitions, 6426 flow [2025-02-08 05:31:33,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 05:31:33,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-02-08 05:31:33,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2177 transitions. [2025-02-08 05:31:33,618 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8003676470588236 [2025-02-08 05:31:33,618 INFO L175 Difference]: Start difference. First operand has 268 places, 402 transitions, 3022 flow. Second operand 17 states and 2177 transitions. [2025-02-08 05:31:33,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 659 transitions, 6426 flow [2025-02-08 05:31:33,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 659 transitions, 6409 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-02-08 05:31:33,680 INFO L231 Difference]: Finished difference. Result has 283 places, 435 transitions, 3807 flow [2025-02-08 05:31:33,681 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=3007, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3807, PETRI_PLACES=283, PETRI_TRANSITIONS=435} [2025-02-08 05:31:33,681 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 123 predicate places. [2025-02-08 05:31:33,681 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 435 transitions, 3807 flow [2025-02-08 05:31:33,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 120.92857142857143) internal successors, (1693), 14 states have internal predecessors, (1693), 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-08 05:31:33,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:33,682 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:31:33,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:31:33,682 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 05:31:33,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:33,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1849998044, now seen corresponding path program 1 times [2025-02-08 05:31:33,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:33,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334224401] [2025-02-08 05:31:33,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:33,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:33,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-08 05:31:33,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-08 05:31:33,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:33,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:37,619 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:31:37,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:37,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334224401] [2025-02-08 05:31:37,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334224401] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:37,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:37,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-08 05:31:37,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427475729] [2025-02-08 05:31:37,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:37,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 05:31:37,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:37,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 05:31:37,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-02-08 05:31:39,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 160 [2025-02-08 05:31:39,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 435 transitions, 3807 flow. Second operand has 14 states, 14 states have (on average 125.5) internal successors, (1757), 14 states have internal predecessors, (1757), 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-08 05:31:39,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:39,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 160 [2025-02-08 05:31:39,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:41,183 INFO L124 PetriNetUnfolderBase]: 1464/5713 cut-off events. [2025-02-08 05:31:41,184 INFO L125 PetriNetUnfolderBase]: For 28072/28585 co-relation queries the response was YES. [2025-02-08 05:31:41,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23274 conditions, 5713 events. 1464/5713 cut-off events. For 28072/28585 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 59614 event pairs, 116 based on Foata normal form. 205/5864 useless extension candidates. Maximal degree in co-relation 22978. Up to 1022 conditions per place. [2025-02-08 05:31:41,226 INFO L140 encePairwiseOnDemand]: 138/160 looper letters, 395 selfloop transitions, 116 changer transitions 86/789 dead transitions. [2025-02-08 05:31:41,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 789 transitions, 9096 flow [2025-02-08 05:31:41,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-08 05:31:41,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-02-08 05:31:41,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2868 transitions. [2025-02-08 05:31:41,228 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8147727272727273 [2025-02-08 05:31:41,228 INFO L175 Difference]: Start difference. First operand has 283 places, 435 transitions, 3807 flow. Second operand 22 states and 2868 transitions. [2025-02-08 05:31:41,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 789 transitions, 9096 flow [2025-02-08 05:31:41,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 789 transitions, 8981 flow, removed 28 selfloop flow, removed 10 redundant places. [2025-02-08 05:31:41,359 INFO L231 Difference]: Finished difference. Result has 307 places, 514 transitions, 5043 flow [2025-02-08 05:31:41,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=3736, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=5043, PETRI_PLACES=307, PETRI_TRANSITIONS=514} [2025-02-08 05:31:41,360 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 147 predicate places. [2025-02-08 05:31:41,361 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 514 transitions, 5043 flow [2025-02-08 05:31:41,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 125.5) internal successors, (1757), 14 states have internal predecessors, (1757), 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-08 05:31:41,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:41,362 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:31:41,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:31:41,362 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 05:31:41,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:41,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1356481397, now seen corresponding path program 3 times [2025-02-08 05:31:41,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:41,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251811945] [2025-02-08 05:31:41,365 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 05:31:41,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:41,377 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 168 statements into 11 equivalence classes. [2025-02-08 05:31:41,394 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 118 of 168 statements. [2025-02-08 05:31:41,394 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 05:31:41,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:44,482 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:31:44,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:44,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251811945] [2025-02-08 05:31:44,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251811945] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:44,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:44,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-08 05:31:44,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287296467] [2025-02-08 05:31:44,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:44,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 05:31:44,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:44,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 05:31:44,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-02-08 05:31:47,113 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 160 [2025-02-08 05:31:47,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 514 transitions, 5043 flow. Second operand has 14 states, 14 states have (on average 120.92857142857143) internal successors, (1693), 14 states have internal predecessors, (1693), 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-08 05:31:47,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:47,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 160 [2025-02-08 05:31:47,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:49,001 INFO L124 PetriNetUnfolderBase]: 1778/6420 cut-off events. [2025-02-08 05:31:49,001 INFO L125 PetriNetUnfolderBase]: For 37379/37766 co-relation queries the response was YES. [2025-02-08 05:31:49,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28698 conditions, 6420 events. 1778/6420 cut-off events. For 37379/37766 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 66237 event pairs, 255 based on Foata normal form. 310/6663 useless extension candidates. Maximal degree in co-relation 28391. Up to 1442 conditions per place. [2025-02-08 05:31:49,043 INFO L140 encePairwiseOnDemand]: 135/160 looper letters, 304 selfloop transitions, 208 changer transitions 55/730 dead transitions. [2025-02-08 05:31:49,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 730 transitions, 8732 flow [2025-02-08 05:31:49,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 05:31:49,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-02-08 05:31:49,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2048 transitions. [2025-02-08 05:31:49,046 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8 [2025-02-08 05:31:49,046 INFO L175 Difference]: Start difference. First operand has 307 places, 514 transitions, 5043 flow. Second operand 16 states and 2048 transitions. [2025-02-08 05:31:49,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 730 transitions, 8732 flow [2025-02-08 05:31:49,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 730 transitions, 8640 flow, removed 37 selfloop flow, removed 7 redundant places. [2025-02-08 05:31:49,200 INFO L231 Difference]: Finished difference. Result has 320 places, 539 transitions, 6003 flow [2025-02-08 05:31:49,200 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=4999, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=6003, PETRI_PLACES=320, PETRI_TRANSITIONS=539} [2025-02-08 05:31:49,202 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 160 predicate places. [2025-02-08 05:31:49,202 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 539 transitions, 6003 flow [2025-02-08 05:31:49,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 120.92857142857143) internal successors, (1693), 14 states have internal predecessors, (1693), 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-08 05:31:49,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:49,203 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:31:49,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:31:49,203 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 05:31:49,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:49,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1231867683, now seen corresponding path program 4 times [2025-02-08 05:31:49,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:49,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214626008] [2025-02-08 05:31:49,204 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 05:31:49,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:49,216 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 168 statements into 2 equivalence classes. [2025-02-08 05:31:49,228 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 168 of 168 statements. [2025-02-08 05:31:49,228 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 05:31:49,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:49,778 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-02-08 05:31:49,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:49,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214626008] [2025-02-08 05:31:49,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214626008] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:49,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:49,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-08 05:31:49,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875838076] [2025-02-08 05:31:49,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:49,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 05:31:49,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:49,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 05:31:49,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-02-08 05:31:51,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 160 [2025-02-08 05:31:51,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 539 transitions, 6003 flow. Second operand has 14 states, 14 states have (on average 120.92857142857143) internal successors, (1693), 14 states have internal predecessors, (1693), 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-08 05:31:51,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:51,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 160 [2025-02-08 05:31:51,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:53,855 INFO L124 PetriNetUnfolderBase]: 2579/8835 cut-off events. [2025-02-08 05:31:53,855 INFO L125 PetriNetUnfolderBase]: For 71233/71717 co-relation queries the response was YES. [2025-02-08 05:31:53,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43884 conditions, 8835 events. 2579/8835 cut-off events. For 71233/71717 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 94167 event pairs, 288 based on Foata normal form. 265/9014 useless extension candidates. Maximal degree in co-relation 43572. Up to 1994 conditions per place. [2025-02-08 05:31:53,913 INFO L140 encePairwiseOnDemand]: 136/160 looper letters, 583 selfloop transitions, 177 changer transitions 84/1007 dead transitions. [2025-02-08 05:31:53,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 1007 transitions, 13984 flow [2025-02-08 05:31:53,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-08 05:31:53,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-02-08 05:31:53,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2604 transitions. [2025-02-08 05:31:53,915 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.81375 [2025-02-08 05:31:53,915 INFO L175 Difference]: Start difference. First operand has 320 places, 539 transitions, 6003 flow. Second operand 20 states and 2604 transitions. [2025-02-08 05:31:53,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 1007 transitions, 13984 flow [2025-02-08 05:31:54,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 1007 transitions, 13735 flow, removed 62 selfloop flow, removed 10 redundant places. [2025-02-08 05:31:54,247 INFO L231 Difference]: Finished difference. Result has 344 places, 636 transitions, 8418 flow [2025-02-08 05:31:54,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=5872, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=8418, PETRI_PLACES=344, PETRI_TRANSITIONS=636} [2025-02-08 05:31:54,248 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 184 predicate places. [2025-02-08 05:31:54,248 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 636 transitions, 8418 flow [2025-02-08 05:31:54,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 120.92857142857143) internal successors, (1693), 14 states have internal predecessors, (1693), 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-08 05:31:54,248 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:54,248 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:31:54,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:31:54,248 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 05:31:54,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:54,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1752553379, now seen corresponding path program 5 times [2025-02-08 05:31:54,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:54,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228130157] [2025-02-08 05:31:54,249 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 05:31:54,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:54,259 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 168 statements into 11 equivalence classes. [2025-02-08 05:31:54,267 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 168 of 168 statements. [2025-02-08 05:31:54,268 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-02-08 05:31:54,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:54,820 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-02-08 05:31:54,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:54,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228130157] [2025-02-08 05:31:54,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228130157] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:54,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:54,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 05:31:54,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828717280] [2025-02-08 05:31:54,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:54,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 05:31:54,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:54,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 05:31:54,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-02-08 05:31:55,771 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 160 [2025-02-08 05:31:55,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 636 transitions, 8418 flow. Second operand has 11 states, 11 states have (on average 126.9090909090909) internal successors, (1396), 11 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:55,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:55,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 160 [2025-02-08 05:31:55,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:57,851 INFO L124 PetriNetUnfolderBase]: 2479/8867 cut-off events. [2025-02-08 05:31:57,851 INFO L125 PetriNetUnfolderBase]: For 88122/88572 co-relation queries the response was YES. [2025-02-08 05:31:57,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46914 conditions, 8867 events. 2479/8867 cut-off events. For 88122/88572 co-relation queries the response was YES. Maximal size of possible extension queue 588. Compared 98160 event pairs, 412 based on Foata normal form. 361/9128 useless extension candidates. Maximal degree in co-relation 46762. Up to 1909 conditions per place. [2025-02-08 05:31:57,907 INFO L140 encePairwiseOnDemand]: 141/160 looper letters, 322 selfloop transitions, 286 changer transitions 39/821 dead transitions. [2025-02-08 05:31:57,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 821 transitions, 12120 flow [2025-02-08 05:31:57,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 05:31:57,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 05:31:57,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1639 transitions. [2025-02-08 05:31:57,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8536458333333333 [2025-02-08 05:31:57,909 INFO L175 Difference]: Start difference. First operand has 344 places, 636 transitions, 8418 flow. Second operand 12 states and 1639 transitions. [2025-02-08 05:31:57,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 821 transitions, 12120 flow [2025-02-08 05:31:58,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 821 transitions, 12054 flow, removed 18 selfloop flow, removed 5 redundant places. [2025-02-08 05:31:58,298 INFO L231 Difference]: Finished difference. Result has 351 places, 656 transitions, 9435 flow [2025-02-08 05:31:58,298 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=8367, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=636, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=263, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=9435, PETRI_PLACES=351, PETRI_TRANSITIONS=656} [2025-02-08 05:31:58,298 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 191 predicate places. [2025-02-08 05:31:58,299 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 656 transitions, 9435 flow [2025-02-08 05:31:58,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 126.9090909090909) internal successors, (1396), 11 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:58,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:58,299 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:31:58,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:31:58,299 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 05:31:58,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:58,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1540095389, now seen corresponding path program 6 times [2025-02-08 05:31:58,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:58,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017678918] [2025-02-08 05:31:58,300 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 05:31:58,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:58,311 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 168 statements into 11 equivalence classes. [2025-02-08 05:31:58,315 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 116 of 168 statements. [2025-02-08 05:31:58,315 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 05:31:58,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:58,665 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-02-08 05:31:58,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:58,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017678918] [2025-02-08 05:31:58,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017678918] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:58,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:58,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:31:58,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070550467] [2025-02-08 05:31:58,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:58,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:31:58,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:58,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:31:58,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-08 05:31:59,638 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 160 [2025-02-08 05:31:59,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 656 transitions, 9435 flow. Second operand has 10 states, 10 states have (on average 127.1) internal successors, (1271), 10 states have internal predecessors, (1271), 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-08 05:31:59,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:59,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 160 [2025-02-08 05:31:59,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:02,370 INFO L124 PetriNetUnfolderBase]: 2903/10146 cut-off events. [2025-02-08 05:32:02,370 INFO L125 PetriNetUnfolderBase]: For 128161/128700 co-relation queries the response was YES. [2025-02-08 05:32:02,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58499 conditions, 10146 events. 2903/10146 cut-off events. For 128161/128700 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 114367 event pairs, 398 based on Foata normal form. 305/10320 useless extension candidates. Maximal degree in co-relation 58171. Up to 2182 conditions per place. [2025-02-08 05:32:02,474 INFO L140 encePairwiseOnDemand]: 142/160 looper letters, 553 selfloop transitions, 253 changer transitions 52/1032 dead transitions. [2025-02-08 05:32:02,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 1032 transitions, 17415 flow [2025-02-08 05:32:02,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 05:32:02,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-08 05:32:02,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2034 transitions. [2025-02-08 05:32:02,476 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8475 [2025-02-08 05:32:02,476 INFO L175 Difference]: Start difference. First operand has 351 places, 656 transitions, 9435 flow. Second operand 15 states and 2034 transitions. [2025-02-08 05:32:02,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 1032 transitions, 17415 flow [2025-02-08 05:32:03,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 1032 transitions, 16742 flow, removed 23 selfloop flow, removed 6 redundant places. [2025-02-08 05:32:03,240 INFO L231 Difference]: Finished difference. Result has 368 places, 770 transitions, 12452 flow [2025-02-08 05:32:03,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=9007, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=656, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=12452, PETRI_PLACES=368, PETRI_TRANSITIONS=770} [2025-02-08 05:32:03,241 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 208 predicate places. [2025-02-08 05:32:03,241 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 770 transitions, 12452 flow [2025-02-08 05:32:03,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 127.1) internal successors, (1271), 10 states have internal predecessors, (1271), 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-08 05:32:03,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:03,241 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:32:03,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:32:03,242 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 05:32:03,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:03,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1344438187, now seen corresponding path program 7 times [2025-02-08 05:32:03,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:03,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780227188] [2025-02-08 05:32:03,243 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 05:32:03,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:03,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-08 05:32:03,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-08 05:32:03,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:03,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:07,463 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:32:07,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:07,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780227188] [2025-02-08 05:32:07,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780227188] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:32:07,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689264382] [2025-02-08 05:32:07,464 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 05:32:07,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:32:07,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:32:07,465 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:32:07,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 05:32:07,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-08 05:32:07,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-08 05:32:07,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:07,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:07,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-02-08 05:32:07,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:32:07,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-08 05:32:07,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-08 05:32:07,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-02-08 05:32:08,069 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 05:32:08,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2025-02-08 05:32:08,082 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:32:08,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2025-02-08 05:32:08,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:32:08,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2025-02-08 05:32:08,134 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2025-02-08 05:32:08,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 63 treesize of output 71 [2025-02-08 05:32:08,295 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 214 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 05:32:08,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:32:08,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2025-02-08 05:32:08,857 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-02-08 05:32:08,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689264382] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 05:32:08,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 05:32:08,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13, 23] total 40 [2025-02-08 05:32:08,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659075883] [2025-02-08 05:32:08,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:08,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 05:32:08,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:08,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 05:32:08,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1478, Unknown=0, NotChecked=0, Total=1640 [2025-02-08 05:32:09,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 160 [2025-02-08 05:32:09,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 770 transitions, 12452 flow. Second operand has 11 states, 11 states have (on average 124.9090909090909) internal successors, (1374), 11 states have internal predecessors, (1374), 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-08 05:32:09,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:09,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 160 [2025-02-08 05:32:09,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:13,757 INFO L124 PetriNetUnfolderBase]: 4158/13170 cut-off events. [2025-02-08 05:32:13,758 INFO L125 PetriNetUnfolderBase]: For 197151/198045 co-relation queries the response was YES. [2025-02-08 05:32:13,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82219 conditions, 13170 events. 4158/13170 cut-off events. For 197151/198045 co-relation queries the response was YES. Maximal size of possible extension queue 883. Compared 149201 event pairs, 401 based on Foata normal form. 463/13510 useless extension candidates. Maximal degree in co-relation 81882. Up to 2509 conditions per place. [2025-02-08 05:32:13,864 INFO L140 encePairwiseOnDemand]: 135/160 looper letters, 537 selfloop transitions, 507 changer transitions 111/1313 dead transitions. [2025-02-08 05:32:13,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 1313 transitions, 23611 flow [2025-02-08 05:32:13,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 05:32:13,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-08 05:32:13,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2035 transitions. [2025-02-08 05:32:13,866 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8479166666666667 [2025-02-08 05:32:13,866 INFO L175 Difference]: Start difference. First operand has 368 places, 770 transitions, 12452 flow. Second operand 15 states and 2035 transitions. [2025-02-08 05:32:13,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 1313 transitions, 23611 flow [2025-02-08 05:32:14,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 1313 transitions, 23340 flow, removed 109 selfloop flow, removed 5 redundant places. [2025-02-08 05:32:14,987 INFO L231 Difference]: Finished difference. Result has 384 places, 934 transitions, 17398 flow [2025-02-08 05:32:14,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=12244, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=770, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=339, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=17398, PETRI_PLACES=384, PETRI_TRANSITIONS=934} [2025-02-08 05:32:14,988 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 224 predicate places. [2025-02-08 05:32:14,988 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 934 transitions, 17398 flow [2025-02-08 05:32:14,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 124.9090909090909) internal successors, (1374), 11 states have internal predecessors, (1374), 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-08 05:32:14,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:14,989 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:32:15,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 05:32:15,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-08 05:32:15,189 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 05:32:15,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:15,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1440121757, now seen corresponding path program 8 times [2025-02-08 05:32:15,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:15,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472677782] [2025-02-08 05:32:15,191 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:32:15,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:15,201 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 168 statements into 2 equivalence classes. [2025-02-08 05:32:15,218 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 116 of 168 statements. [2025-02-08 05:32:15,218 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:32:15,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:21,336 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-02-08 05:32:21,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:21,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472677782] [2025-02-08 05:32:21,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472677782] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:21,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:21,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-08 05:32:21,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410465272] [2025-02-08 05:32:21,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:21,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 05:32:21,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:21,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 05:32:21,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-02-08 05:32:24,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 160 [2025-02-08 05:32:24,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 934 transitions, 17398 flow. Second operand has 14 states, 14 states have (on average 120.92857142857143) internal successors, (1693), 14 states have internal predecessors, (1693), 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-08 05:32:24,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:24,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 160 [2025-02-08 05:32:24,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:30,418 INFO L124 PetriNetUnfolderBase]: 3817/12773 cut-off events. [2025-02-08 05:32:30,418 INFO L125 PetriNetUnfolderBase]: For 221169/221981 co-relation queries the response was YES. [2025-02-08 05:32:30,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83620 conditions, 12773 events. 3817/12773 cut-off events. For 221169/221981 co-relation queries the response was YES. Maximal size of possible extension queue 853. Compared 146356 event pairs, 488 based on Foata normal form. 397/13034 useless extension candidates. Maximal degree in co-relation 83277. Up to 2925 conditions per place. [2025-02-08 05:32:30,564 INFO L140 encePairwiseOnDemand]: 137/160 looper letters, 725 selfloop transitions, 401 changer transitions 52/1344 dead transitions. [2025-02-08 05:32:30,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 1344 transitions, 26146 flow [2025-02-08 05:32:30,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-08 05:32:30,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-02-08 05:32:30,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2847 transitions. [2025-02-08 05:32:30,567 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8088068181818182 [2025-02-08 05:32:30,567 INFO L175 Difference]: Start difference. First operand has 384 places, 934 transitions, 17398 flow. Second operand 22 states and 2847 transitions. [2025-02-08 05:32:30,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 1344 transitions, 26146 flow [2025-02-08 05:32:31,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 1344 transitions, 25438 flow, removed 104 selfloop flow, removed 2 redundant places. [2025-02-08 05:32:31,977 INFO L231 Difference]: Finished difference. Result has 412 places, 978 transitions, 19042 flow [2025-02-08 05:32:31,978 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=16803, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=934, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=357, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=537, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=19042, PETRI_PLACES=412, PETRI_TRANSITIONS=978} [2025-02-08 05:32:31,978 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 252 predicate places. [2025-02-08 05:32:31,978 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 978 transitions, 19042 flow [2025-02-08 05:32:31,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 120.92857142857143) internal successors, (1693), 14 states have internal predecessors, (1693), 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-08 05:32:31,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:31,979 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:32:31,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:32:31,979 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 05:32:31,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:31,980 INFO L85 PathProgramCache]: Analyzing trace with hash 779078243, now seen corresponding path program 9 times [2025-02-08 05:32:31,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:31,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625770323] [2025-02-08 05:32:31,981 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 05:32:31,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:31,990 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 168 statements into 11 equivalence classes. [2025-02-08 05:32:31,993 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 116 of 168 statements. [2025-02-08 05:32:31,994 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 05:32:31,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:32,284 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-02-08 05:32:32,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:32,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625770323] [2025-02-08 05:32:32,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625770323] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:32,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:32,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:32:32,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016770743] [2025-02-08 05:32:32,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:32,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:32:32,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:32,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:32:32,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-08 05:32:33,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 160 [2025-02-08 05:32:33,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 978 transitions, 19042 flow. Second operand has 10 states, 10 states have (on average 127.1) internal successors, (1271), 10 states have internal predecessors, (1271), 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-08 05:32:33,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:33,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 160 [2025-02-08 05:32:33,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand