./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-race.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 bdf6537ef41e6e97eaabcf1f32a2477c3eb925663d5b8e717e1252d54a113bc0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:35:41,436 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:35:41,493 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:35:41,498 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:35:41,498 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:35:41,528 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:35:41,529 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:35:41,529 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:35:41,529 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:35:41,530 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:35:41,530 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:35:41,531 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:35:41,531 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:35:41,531 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:35:41,532 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:35:41,532 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:35:41,532 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:35:41,532 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:35:41,532 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:35:41,532 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:35:41,532 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:35:41,533 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:35:41,533 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:35:41,533 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:35:41,533 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:35:41,533 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:35:41,533 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:35:41,534 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:35:41,534 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:35:41,534 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:35:41,534 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:35:41,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:35:41,534 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:35:41,534 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:35:41,535 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:35:41,535 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:35:41,536 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:35:41,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:35:41,536 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:35:41,536 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:35:41,536 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:35:41,536 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:35:41,536 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 -> bdf6537ef41e6e97eaabcf1f32a2477c3eb925663d5b8e717e1252d54a113bc0 [2025-02-06 09:35:41,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:35:41,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:35:41,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:35:41,828 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:35:41,828 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:35:41,829 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-race.i [2025-02-06 09:35:43,127 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/422d1df6f/21bf814ce6db407bb8a610fb81f96287/FLAG0cac610f5 [2025-02-06 09:35:43,455 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:35:43,456 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-struct-race.i [2025-02-06 09:35:43,469 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/422d1df6f/21bf814ce6db407bb8a610fb81f96287/FLAG0cac610f5 [2025-02-06 09:35:43,487 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/422d1df6f/21bf814ce6db407bb8a610fb81f96287 [2025-02-06 09:35:43,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:35:43,492 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:35:43,493 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:35:43,493 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:35:43,498 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:35:43,499 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:35:43" (1/1) ... [2025-02-06 09:35:43,500 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@716c37ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:35:43, skipping insertion in model container [2025-02-06 09:35:43,500 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:35:43" (1/1) ... [2025-02-06 09:35:43,550 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:35:43,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:35:43,893 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:35:43,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:35:43,980 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:35:43,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:35:43 WrapperNode [2025-02-06 09:35:43,981 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:35:43,982 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:35:43,982 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:35:43,982 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:35:43,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:35:43" (1/1) ... [2025-02-06 09:35:44,000 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:35:43" (1/1) ... [2025-02-06 09:35:44,026 INFO L138 Inliner]: procedures = 261, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 55 [2025-02-06 09:35:44,026 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:35:44,029 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:35:44,029 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:35:44,029 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:35:44,036 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:35:43" (1/1) ... [2025-02-06 09:35:44,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:35:43" (1/1) ... [2025-02-06 09:35:44,044 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:35:43" (1/1) ... [2025-02-06 09:35:44,044 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:35:43" (1/1) ... [2025-02-06 09:35:44,057 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:35:43" (1/1) ... [2025-02-06 09:35:44,058 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:35:43" (1/1) ... [2025-02-06 09:35:44,059 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:35:43" (1/1) ... [2025-02-06 09:35:44,060 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:35:43" (1/1) ... [2025-02-06 09:35:44,066 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:35:44,067 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:35:44,067 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:35:44,067 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:35:44,071 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:35:43" (1/1) ... [2025-02-06 09:35:44,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:35:44,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:35:44,106 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:35:44,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:35:44,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 09:35:44,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:35:44,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:35:44,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:35:44,133 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-02-06 09:35:44,133 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-02-06 09:35:44,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:35:44,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:35:44,134 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:35:44,243 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:35:44,244 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:35:44,483 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:35:44,483 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:35:44,495 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:35:44,498 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:35:44,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:35:44 BoogieIcfgContainer [2025-02-06 09:35:44,499 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:35:44,501 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:35:44,501 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:35:44,506 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:35:44,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:35:43" (1/3) ... [2025-02-06 09:35:44,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39684f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:35:44, skipping insertion in model container [2025-02-06 09:35:44,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:35:43" (2/3) ... [2025-02-06 09:35:44,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39684f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:35:44, skipping insertion in model container [2025-02-06 09:35:44,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:35:44" (3/3) ... [2025-02-06 09:35:44,510 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-struct-race.i [2025-02-06 09:35:44,521 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:35:44,522 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-struct-race.i that has 2 procedures, 80 locations, 1 initial locations, 2 loop locations, and 3 error locations. [2025-02-06 09:35:44,523 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:35:44,599 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 09:35:44,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 82 transitions, 171 flow [2025-02-06 09:35:44,702 INFO L124 PetriNetUnfolderBase]: 2/112 cut-off events. [2025-02-06 09:35:44,706 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:35:44,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 112 events. 2/112 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 198 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 53. Up to 3 conditions per place. [2025-02-06 09:35:44,712 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 82 transitions, 171 flow [2025-02-06 09:35:44,715 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 82 transitions, 171 flow [2025-02-06 09:35:44,723 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:35:44,733 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;@3437a4d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:35:44,734 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-06 09:35:44,748 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:35:44,749 INFO L124 PetriNetUnfolderBase]: 1/48 cut-off events. [2025-02-06 09:35:44,749 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:35:44,749 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:44,750 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] [2025-02-06 09:35:44,750 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 09:35:44,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:44,757 INFO L85 PathProgramCache]: Analyzing trace with hash -369931614, now seen corresponding path program 1 times [2025-02-06 09:35:44,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:44,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664094823] [2025-02-06 09:35:44,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:35:44,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:44,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 09:35:44,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 09:35:44,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:44,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:45,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:35:45,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:45,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664094823] [2025-02-06 09:35:45,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664094823] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:35:45,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:35:45,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:35:45,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391341061] [2025-02-06 09:35:45,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:35:45,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:35:45,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:35:45,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:35:45,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:35:45,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 82 [2025-02-06 09:35:45,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 82 transitions, 171 flow. Second operand has 6 states, 6 states have (on average 58.5) internal successors, (351), 6 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:45,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:35:45,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 82 [2025-02-06 09:35:45,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:35:46,010 INFO L124 PetriNetUnfolderBase]: 71/365 cut-off events. [2025-02-06 09:35:46,010 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 09:35:46,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 556 conditions, 365 events. 71/365 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1800 event pairs, 32 based on Foata normal form. 1/327 useless extension candidates. Maximal degree in co-relation 471. Up to 151 conditions per place. [2025-02-06 09:35:46,014 INFO L140 encePairwiseOnDemand]: 70/82 looper letters, 23 selfloop transitions, 22 changer transitions 1/102 dead transitions. [2025-02-06 09:35:46,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 102 transitions, 301 flow [2025-02-06 09:35:46,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:35:46,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:35:46,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 389 transitions. [2025-02-06 09:35:46,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.790650406504065 [2025-02-06 09:35:46,036 INFO L175 Difference]: Start difference. First operand has 83 places, 82 transitions, 171 flow. Second operand 6 states and 389 transitions. [2025-02-06 09:35:46,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 102 transitions, 301 flow [2025-02-06 09:35:46,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 102 transitions, 301 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:35:46,048 INFO L231 Difference]: Finished difference. Result has 93 places, 101 transitions, 317 flow [2025-02-06 09:35:46,050 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=317, PETRI_PLACES=93, PETRI_TRANSITIONS=101} [2025-02-06 09:35:46,053 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 10 predicate places. [2025-02-06 09:35:46,054 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 101 transitions, 317 flow [2025-02-06 09:35:46,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.5) internal successors, (351), 6 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:46,054 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:46,054 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] [2025-02-06 09:35:46,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:35:46,055 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 09:35:46,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:46,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1433742296, now seen corresponding path program 1 times [2025-02-06 09:35:46,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:46,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202261749] [2025-02-06 09:35:46,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:35:46,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:46,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 09:35:46,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 09:35:46,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:46,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:46,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:35:46,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:46,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202261749] [2025-02-06 09:35:46,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202261749] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:35:46,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:35:46,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:35:46,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323927281] [2025-02-06 09:35:46,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:35:46,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:35:46,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:35:46,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:35:46,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:35:46,248 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 82 [2025-02-06 09:35:46,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 101 transitions, 317 flow. Second operand has 5 states, 5 states have (on average 69.4) internal successors, (347), 5 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:46,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:35:46,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 82 [2025-02-06 09:35:46,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:35:46,319 INFO L124 PetriNetUnfolderBase]: 33/235 cut-off events. [2025-02-06 09:35:46,320 INFO L125 PetriNetUnfolderBase]: For 28/35 co-relation queries the response was YES. [2025-02-06 09:35:46,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 235 events. 33/235 cut-off events. For 28/35 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 767 event pairs, 0 based on Foata normal form. 2/226 useless extension candidates. Maximal degree in co-relation 310. Up to 45 conditions per place. [2025-02-06 09:35:46,323 INFO L140 encePairwiseOnDemand]: 74/82 looper letters, 11 selfloop transitions, 2 changer transitions 5/106 dead transitions. [2025-02-06 09:35:46,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 106 transitions, 363 flow [2025-02-06 09:35:46,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:35:46,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:35:46,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 427 transitions. [2025-02-06 09:35:46,328 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8678861788617886 [2025-02-06 09:35:46,328 INFO L175 Difference]: Start difference. First operand has 93 places, 101 transitions, 317 flow. Second operand 6 states and 427 transitions. [2025-02-06 09:35:46,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 106 transitions, 363 flow [2025-02-06 09:35:46,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 106 transitions, 363 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:35:46,334 INFO L231 Difference]: Finished difference. Result has 101 places, 101 transitions, 335 flow [2025-02-06 09:35:46,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=335, PETRI_PLACES=101, PETRI_TRANSITIONS=101} [2025-02-06 09:35:46,336 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 18 predicate places. [2025-02-06 09:35:46,336 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 101 transitions, 335 flow [2025-02-06 09:35:46,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.4) internal successors, (347), 5 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:46,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:46,337 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:35:46,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:35:46,337 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 09:35:46,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:46,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1041709226, now seen corresponding path program 1 times [2025-02-06 09:35:46,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:46,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301187733] [2025-02-06 09:35:46,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:35:46,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:46,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 09:35:46,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 09:35:46,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:46,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:46,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:35:46,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:46,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301187733] [2025-02-06 09:35:46,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301187733] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:35:46,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:35:46,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:35:46,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823017785] [2025-02-06 09:35:46,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:35:46,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:35:46,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:35:46,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:35:46,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:35:46,766 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 82 [2025-02-06 09:35:46,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 101 transitions, 335 flow. Second operand has 6 states, 6 states have (on average 64.0) internal successors, (384), 6 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:46,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:35:46,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 82 [2025-02-06 09:35:46,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:35:46,979 INFO L124 PetriNetUnfolderBase]: 130/477 cut-off events. [2025-02-06 09:35:46,980 INFO L125 PetriNetUnfolderBase]: For 139/151 co-relation queries the response was YES. [2025-02-06 09:35:46,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1085 conditions, 477 events. 130/477 cut-off events. For 139/151 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2466 event pairs, 23 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 992. Up to 238 conditions per place. [2025-02-06 09:35:47,000 INFO L140 encePairwiseOnDemand]: 67/82 looper letters, 33 selfloop transitions, 48 changer transitions 8/144 dead transitions. [2025-02-06 09:35:47,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 144 transitions, 653 flow [2025-02-06 09:35:47,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:35:47,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:35:47,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 429 transitions. [2025-02-06 09:35:47,002 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8719512195121951 [2025-02-06 09:35:47,002 INFO L175 Difference]: Start difference. First operand has 101 places, 101 transitions, 335 flow. Second operand 6 states and 429 transitions. [2025-02-06 09:35:47,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 144 transitions, 653 flow [2025-02-06 09:35:47,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 144 transitions, 639 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-02-06 09:35:47,010 INFO L231 Difference]: Finished difference. Result has 103 places, 136 transitions, 693 flow [2025-02-06 09:35:47,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=693, PETRI_PLACES=103, PETRI_TRANSITIONS=136} [2025-02-06 09:35:47,011 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 20 predicate places. [2025-02-06 09:35:47,012 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 136 transitions, 693 flow [2025-02-06 09:35:47,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 64.0) internal successors, (384), 6 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:47,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:47,013 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:35:47,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:35:47,013 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 09:35:47,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:47,014 INFO L85 PathProgramCache]: Analyzing trace with hash -617668600, now seen corresponding path program 1 times [2025-02-06 09:35:47,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:47,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242245936] [2025-02-06 09:35:47,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:35:47,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:47,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 09:35:47,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 09:35:47,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:47,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:47,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:35:47,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:47,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242245936] [2025-02-06 09:35:47,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242245936] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:35:47,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:35:47,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:35:47,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327343217] [2025-02-06 09:35:47,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:35:47,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:35:47,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:35:47,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:35:47,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:35:47,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 82 [2025-02-06 09:35:47,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 136 transitions, 693 flow. Second operand has 6 states, 6 states have (on average 61.166666666666664) internal successors, (367), 6 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:47,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:35:47,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 82 [2025-02-06 09:35:47,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:35:47,632 INFO L124 PetriNetUnfolderBase]: 142/505 cut-off events. [2025-02-06 09:35:47,632 INFO L125 PetriNetUnfolderBase]: For 464/488 co-relation queries the response was YES. [2025-02-06 09:35:47,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1574 conditions, 505 events. 142/505 cut-off events. For 464/488 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2814 event pairs, 10 based on Foata normal form. 0/496 useless extension candidates. Maximal degree in co-relation 1464. Up to 241 conditions per place. [2025-02-06 09:35:47,637 INFO L140 encePairwiseOnDemand]: 71/82 looper letters, 73 selfloop transitions, 25 changer transitions 13/164 dead transitions. [2025-02-06 09:35:47,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 164 transitions, 1076 flow [2025-02-06 09:35:47,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:35:47,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:35:47,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 397 transitions. [2025-02-06 09:35:47,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.806910569105691 [2025-02-06 09:35:47,639 INFO L175 Difference]: Start difference. First operand has 103 places, 136 transitions, 693 flow. Second operand 6 states and 397 transitions. [2025-02-06 09:35:47,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 164 transitions, 1076 flow [2025-02-06 09:35:47,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 164 transitions, 1058 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-02-06 09:35:47,654 INFO L231 Difference]: Finished difference. Result has 105 places, 151 transitions, 910 flow [2025-02-06 09:35:47,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=910, PETRI_PLACES=105, PETRI_TRANSITIONS=151} [2025-02-06 09:35:47,655 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 22 predicate places. [2025-02-06 09:35:47,655 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 151 transitions, 910 flow [2025-02-06 09:35:47,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 61.166666666666664) internal successors, (367), 6 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:47,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:47,656 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:35:47,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:35:47,656 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 09:35:47,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:47,657 INFO L85 PathProgramCache]: Analyzing trace with hash -2047173630, now seen corresponding path program 1 times [2025-02-06 09:35:47,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:47,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300358941] [2025-02-06 09:35:47,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:35:47,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:47,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 09:35:47,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 09:35:47,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:47,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:35:47,683 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:35:47,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 09:35:47,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 09:35:47,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:47,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:35:47,725 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:35:47,725 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:35:47,726 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-02-06 09:35:47,729 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2025-02-06 09:35:47,729 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2025-02-06 09:35:47,729 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2025-02-06 09:35:47,729 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2025-02-06 09:35:47,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:35:47,730 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 09:35:47,733 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:35:47,733 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 09:35:47,754 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 09:35:47,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 100 transitions, 216 flow [2025-02-06 09:35:47,778 INFO L124 PetriNetUnfolderBase]: 4/192 cut-off events. [2025-02-06 09:35:47,778 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 09:35:47,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 192 events. 4/192 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 417 event pairs, 0 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 114. Up to 6 conditions per place. [2025-02-06 09:35:47,779 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 100 transitions, 216 flow [2025-02-06 09:35:47,780 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 100 transitions, 216 flow [2025-02-06 09:35:47,780 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:35:47,781 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;@3437a4d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:35:47,781 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 09:35:47,786 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:35:47,787 INFO L124 PetriNetUnfolderBase]: 1/48 cut-off events. [2025-02-06 09:35:47,787 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:35:47,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:47,787 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] [2025-02-06 09:35:47,788 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 09:35:47,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:47,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1519656838, now seen corresponding path program 1 times [2025-02-06 09:35:47,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:47,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91094360] [2025-02-06 09:35:47,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:35:47,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:47,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 09:35:47,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 09:35:47,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:47,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:48,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:35:48,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:48,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91094360] [2025-02-06 09:35:48,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91094360] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:35:48,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:35:48,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:35:48,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401316166] [2025-02-06 09:35:48,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:35:48,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:35:48,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:35:48,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:35:48,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:35:48,165 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 100 [2025-02-06 09:35:48,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 100 transitions, 216 flow. Second operand has 6 states, 6 states have (on average 70.5) internal successors, (423), 6 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:48,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:35:48,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 100 [2025-02-06 09:35:48,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:35:48,609 INFO L124 PetriNetUnfolderBase]: 903/2672 cut-off events. [2025-02-06 09:35:48,609 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2025-02-06 09:35:48,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4290 conditions, 2672 events. 903/2672 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 20559 event pairs, 529 based on Foata normal form. 1/2404 useless extension candidates. Maximal degree in co-relation 2356. Up to 1385 conditions per place. [2025-02-06 09:35:48,623 INFO L140 encePairwiseOnDemand]: 84/100 looper letters, 30 selfloop transitions, 38 changer transitions 1/137 dead transitions. [2025-02-06 09:35:48,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 137 transitions, 431 flow [2025-02-06 09:35:48,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:35:48,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:35:48,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 484 transitions. [2025-02-06 09:35:48,626 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8066666666666666 [2025-02-06 09:35:48,626 INFO L175 Difference]: Start difference. First operand has 102 places, 100 transitions, 216 flow. Second operand 6 states and 484 transitions. [2025-02-06 09:35:48,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 137 transitions, 431 flow [2025-02-06 09:35:48,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 137 transitions, 431 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:35:48,633 INFO L231 Difference]: Finished difference. Result has 112 places, 135 transitions, 466 flow [2025-02-06 09:35:48,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=466, PETRI_PLACES=112, PETRI_TRANSITIONS=135} [2025-02-06 09:35:48,634 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 10 predicate places. [2025-02-06 09:35:48,634 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 135 transitions, 466 flow [2025-02-06 09:35:48,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.5) internal successors, (423), 6 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:48,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:48,634 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] [2025-02-06 09:35:48,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:35:48,634 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 09:35:48,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:48,635 INFO L85 PathProgramCache]: Analyzing trace with hash -971636548, now seen corresponding path program 1 times [2025-02-06 09:35:48,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:48,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716569292] [2025-02-06 09:35:48,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:35:48,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:48,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 09:35:48,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 09:35:48,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:48,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:48,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:35:48,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:48,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716569292] [2025-02-06 09:35:48,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716569292] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:35:48,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:35:48,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:35:48,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082027125] [2025-02-06 09:35:48,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:35:48,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:35:48,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:35:48,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:35:48,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:35:48,771 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 100 [2025-02-06 09:35:48,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 135 transitions, 466 flow. Second operand has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:48,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:35:48,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 100 [2025-02-06 09:35:48,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:35:48,934 INFO L124 PetriNetUnfolderBase]: 420/1426 cut-off events. [2025-02-06 09:35:48,934 INFO L125 PetriNetUnfolderBase]: For 312/388 co-relation queries the response was YES. [2025-02-06 09:35:48,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2684 conditions, 1426 events. 420/1426 cut-off events. For 312/388 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 9348 event pairs, 112 based on Foata normal form. 2/1356 useless extension candidates. Maximal degree in co-relation 2141. Up to 520 conditions per place. [2025-02-06 09:35:48,946 INFO L140 encePairwiseOnDemand]: 92/100 looper letters, 14 selfloop transitions, 2 changer transitions 5/141 dead transitions. [2025-02-06 09:35:48,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 141 transitions, 520 flow [2025-02-06 09:35:48,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:35:48,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:35:48,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 526 transitions. [2025-02-06 09:35:48,948 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8766666666666667 [2025-02-06 09:35:48,948 INFO L175 Difference]: Start difference. First operand has 112 places, 135 transitions, 466 flow. Second operand 6 states and 526 transitions. [2025-02-06 09:35:48,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 141 transitions, 520 flow [2025-02-06 09:35:48,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 141 transitions, 520 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:35:48,954 INFO L231 Difference]: Finished difference. Result has 120 places, 136 transitions, 488 flow [2025-02-06 09:35:48,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=488, PETRI_PLACES=120, PETRI_TRANSITIONS=136} [2025-02-06 09:35:48,955 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 18 predicate places. [2025-02-06 09:35:48,955 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 136 transitions, 488 flow [2025-02-06 09:35:48,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:48,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:48,956 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] [2025-02-06 09:35:48,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:35:48,957 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 09:35:48,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:48,957 INFO L85 PathProgramCache]: Analyzing trace with hash 471279402, now seen corresponding path program 1 times [2025-02-06 09:35:48,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:48,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661018126] [2025-02-06 09:35:48,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:35:48,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:48,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 09:35:48,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 09:35:48,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:48,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:49,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:35:49,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:49,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661018126] [2025-02-06 09:35:49,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661018126] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:35:49,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:35:49,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:35:49,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575078401] [2025-02-06 09:35:49,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:35:49,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:35:49,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:35:49,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:35:49,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:35:49,310 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 100 [2025-02-06 09:35:49,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 136 transitions, 488 flow. Second operand has 6 states, 6 states have (on average 76.0) internal successors, (456), 6 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:49,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:35:49,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 100 [2025-02-06 09:35:49,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:35:50,011 INFO L124 PetriNetUnfolderBase]: 1866/4588 cut-off events. [2025-02-06 09:35:50,012 INFO L125 PetriNetUnfolderBase]: For 1530/1615 co-relation queries the response was YES. [2025-02-06 09:35:50,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10823 conditions, 4588 events. 1866/4588 cut-off events. For 1530/1615 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 35989 event pairs, 434 based on Foata normal form. 0/4306 useless extension candidates. Maximal degree in co-relation 10729. Up to 2580 conditions per place. [2025-02-06 09:35:50,049 INFO L140 encePairwiseOnDemand]: 81/100 looper letters, 63 selfloop transitions, 92 changer transitions 0/231 dead transitions. [2025-02-06 09:35:50,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 231 transitions, 1234 flow [2025-02-06 09:35:50,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:35:50,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:35:50,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 531 transitions. [2025-02-06 09:35:50,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.885 [2025-02-06 09:35:50,056 INFO L175 Difference]: Start difference. First operand has 120 places, 136 transitions, 488 flow. Second operand 6 states and 531 transitions. [2025-02-06 09:35:50,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 231 transitions, 1234 flow [2025-02-06 09:35:50,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 231 transitions, 1222 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-02-06 09:35:50,072 INFO L231 Difference]: Finished difference. Result has 123 places, 223 transitions, 1312 flow [2025-02-06 09:35:50,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1312, PETRI_PLACES=123, PETRI_TRANSITIONS=223} [2025-02-06 09:35:50,075 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 21 predicate places. [2025-02-06 09:35:50,077 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 223 transitions, 1312 flow [2025-02-06 09:35:50,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.0) internal successors, (456), 6 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:50,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:50,078 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:35:50,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:35:50,078 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 09:35:50,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:50,079 INFO L85 PathProgramCache]: Analyzing trace with hash 966241304, now seen corresponding path program 1 times [2025-02-06 09:35:50,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:50,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055671362] [2025-02-06 09:35:50,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:35:50,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:50,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 09:35:50,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 09:35:50,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:50,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:50,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:35:50,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:50,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055671362] [2025-02-06 09:35:50,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055671362] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:35:50,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:35:50,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:35:50,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695746452] [2025-02-06 09:35:50,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:35:50,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:35:50,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:35:50,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:35:50,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:35:50,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 100 [2025-02-06 09:35:50,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 223 transitions, 1312 flow. Second operand has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:50,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:35:50,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 100 [2025-02-06 09:35:50,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:35:51,296 INFO L124 PetriNetUnfolderBase]: 2323/5522 cut-off events. [2025-02-06 09:35:51,297 INFO L125 PetriNetUnfolderBase]: For 5298/5505 co-relation queries the response was YES. [2025-02-06 09:35:51,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17444 conditions, 5522 events. 2323/5522 cut-off events. For 5298/5505 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 44268 event pairs, 290 based on Foata normal form. 2/5293 useless extension candidates. Maximal degree in co-relation 13989. Up to 3131 conditions per place. [2025-02-06 09:35:51,358 INFO L140 encePairwiseOnDemand]: 85/100 looper letters, 145 selfloop transitions, 76 changer transitions 0/296 dead transitions. [2025-02-06 09:35:51,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 296 transitions, 2246 flow [2025-02-06 09:35:51,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:35:51,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:35:51,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 494 transitions. [2025-02-06 09:35:51,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8233333333333334 [2025-02-06 09:35:51,361 INFO L175 Difference]: Start difference. First operand has 123 places, 223 transitions, 1312 flow. Second operand 6 states and 494 transitions. [2025-02-06 09:35:51,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 296 transitions, 2246 flow [2025-02-06 09:35:51,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 296 transitions, 2228 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-02-06 09:35:51,413 INFO L231 Difference]: Finished difference. Result has 133 places, 294 transitions, 2152 flow [2025-02-06 09:35:51,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=1294, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2152, PETRI_PLACES=133, PETRI_TRANSITIONS=294} [2025-02-06 09:35:51,416 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 31 predicate places. [2025-02-06 09:35:51,417 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 294 transitions, 2152 flow [2025-02-06 09:35:51,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:51,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:51,418 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:35:51,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:35:51,418 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 09:35:51,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:51,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1643354188, now seen corresponding path program 1 times [2025-02-06 09:35:51,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:51,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825369044] [2025-02-06 09:35:51,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:35:51,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:51,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 09:35:51,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 09:35:51,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:51,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:51,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:35:51,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:51,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825369044] [2025-02-06 09:35:51,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825369044] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:35:51,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:35:51,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 09:35:51,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283686015] [2025-02-06 09:35:51,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:35:51,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 09:35:51,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:35:51,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 09:35:51,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-02-06 09:35:52,792 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 100 [2025-02-06 09:35:52,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 294 transitions, 2152 flow. Second operand has 14 states, 14 states have (on average 61.857142857142854) internal successors, (866), 14 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:52,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:35:52,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 100 [2025-02-06 09:35:52,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:35:54,726 INFO L124 PetriNetUnfolderBase]: 4086/9450 cut-off events. [2025-02-06 09:35:54,726 INFO L125 PetriNetUnfolderBase]: For 16419/16958 co-relation queries the response was YES. [2025-02-06 09:35:54,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33993 conditions, 9450 events. 4086/9450 cut-off events. For 16419/16958 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 80931 event pairs, 434 based on Foata normal form. 169/9316 useless extension candidates. Maximal degree in co-relation 28907. Up to 4206 conditions per place. [2025-02-06 09:35:54,889 INFO L140 encePairwiseOnDemand]: 74/100 looper letters, 274 selfloop transitions, 265 changer transitions 0/602 dead transitions. [2025-02-06 09:35:54,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 602 transitions, 5847 flow [2025-02-06 09:35:54,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 09:35:54,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-02-06 09:35:54,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1290 transitions. [2025-02-06 09:35:54,893 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6789473684210526 [2025-02-06 09:35:54,893 INFO L175 Difference]: Start difference. First operand has 133 places, 294 transitions, 2152 flow. Second operand 19 states and 1290 transitions. [2025-02-06 09:35:54,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 602 transitions, 5847 flow [2025-02-06 09:35:54,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 602 transitions, 5703 flow, removed 72 selfloop flow, removed 0 redundant places. [2025-02-06 09:35:54,978 INFO L231 Difference]: Finished difference. Result has 160 places, 532 transitions, 5322 flow [2025-02-06 09:35:54,978 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=2008, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=5322, PETRI_PLACES=160, PETRI_TRANSITIONS=532} [2025-02-06 09:35:54,980 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 58 predicate places. [2025-02-06 09:35:54,980 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 532 transitions, 5322 flow [2025-02-06 09:35:54,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 61.857142857142854) internal successors, (866), 14 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:54,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:54,980 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:35:54,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:35:54,981 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 09:35:54,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:54,981 INFO L85 PathProgramCache]: Analyzing trace with hash 775409578, now seen corresponding path program 1 times [2025-02-06 09:35:54,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:54,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924818244] [2025-02-06 09:35:54,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:35:54,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:54,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 09:35:55,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 09:35:55,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:55,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:55,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:35:55,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:55,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924818244] [2025-02-06 09:35:55,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924818244] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:35:55,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:35:55,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 09:35:55,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173254713] [2025-02-06 09:35:55,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:35:55,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 09:35:55,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:35:55,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 09:35:55,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-02-06 09:35:55,875 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 100 [2025-02-06 09:35:55,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 532 transitions, 5322 flow. Second operand has 14 states, 14 states have (on average 64.5) internal successors, (903), 14 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:55,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:35:55,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 100 [2025-02-06 09:35:55,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:35:57,820 INFO L124 PetriNetUnfolderBase]: 4590/10307 cut-off events. [2025-02-06 09:35:57,820 INFO L125 PetriNetUnfolderBase]: For 28741/29516 co-relation queries the response was YES. [2025-02-06 09:35:57,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43254 conditions, 10307 events. 4590/10307 cut-off events. For 28741/29516 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 88898 event pairs, 91 based on Foata normal form. 260/10367 useless extension candidates. Maximal degree in co-relation 38175. Up to 3661 conditions per place. [2025-02-06 09:35:57,902 INFO L140 encePairwiseOnDemand]: 78/100 looper letters, 460 selfloop transitions, 526 changer transitions 0/1062 dead transitions. [2025-02-06 09:35:57,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 1062 transitions, 12336 flow [2025-02-06 09:35:57,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 09:35:57,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-02-06 09:35:57,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1662 transitions. [2025-02-06 09:35:57,907 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7226086956521739 [2025-02-06 09:35:57,907 INFO L175 Difference]: Start difference. First operand has 160 places, 532 transitions, 5322 flow. Second operand 23 states and 1662 transitions. [2025-02-06 09:35:57,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 1062 transitions, 12336 flow [2025-02-06 09:35:58,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 1062 transitions, 12292 flow, removed 16 selfloop flow, removed 6 redundant places. [2025-02-06 09:35:58,066 INFO L231 Difference]: Finished difference. Result has 188 places, 929 transitions, 11763 flow [2025-02-06 09:35:58,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=5284, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=278, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=11763, PETRI_PLACES=188, PETRI_TRANSITIONS=929} [2025-02-06 09:35:58,068 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 86 predicate places. [2025-02-06 09:35:58,068 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 929 transitions, 11763 flow [2025-02-06 09:35:58,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 64.5) internal successors, (903), 14 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:58,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:58,069 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:35:58,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:35:58,069 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 09:35:58,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:58,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1114276162, now seen corresponding path program 2 times [2025-02-06 09:35:58,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:58,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528288753] [2025-02-06 09:35:58,070 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:35:58,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:58,080 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 1 equivalence classes. [2025-02-06 09:35:58,088 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 09:35:58,088 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:35:58,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:58,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:35:58,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:58,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528288753] [2025-02-06 09:35:58,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528288753] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:35:58,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:35:58,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 09:35:58,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167468163] [2025-02-06 09:35:58,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:35:58,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 09:35:58,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:35:58,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 09:35:58,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-02-06 09:35:59,135 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 100 [2025-02-06 09:35:59,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 929 transitions, 11763 flow. Second operand has 14 states, 14 states have (on average 61.857142857142854) internal successors, (866), 14 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:59,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:35:59,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 100 [2025-02-06 09:35:59,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:01,434 INFO L124 PetriNetUnfolderBase]: 4895/11139 cut-off events. [2025-02-06 09:36:01,434 INFO L125 PetriNetUnfolderBase]: For 58503/59430 co-relation queries the response was YES. [2025-02-06 09:36:01,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56348 conditions, 11139 events. 4895/11139 cut-off events. For 58503/59430 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 96421 event pairs, 325 based on Foata normal form. 202/11033 useless extension candidates. Maximal degree in co-relation 55221. Up to 5749 conditions per place. [2025-02-06 09:36:01,546 INFO L140 encePairwiseOnDemand]: 74/100 looper letters, 629 selfloop transitions, 364 changer transitions 0/1065 dead transitions. [2025-02-06 09:36:01,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 1065 transitions, 15521 flow [2025-02-06 09:36:01,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 09:36:01,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-02-06 09:36:01,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1292 transitions. [2025-02-06 09:36:01,551 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.68 [2025-02-06 09:36:01,551 INFO L175 Difference]: Start difference. First operand has 188 places, 929 transitions, 11763 flow. Second operand 19 states and 1292 transitions. [2025-02-06 09:36:01,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 1065 transitions, 15521 flow [2025-02-06 09:36:01,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 1065 transitions, 15319 flow, removed 95 selfloop flow, removed 6 redundant places. [2025-02-06 09:36:01,979 INFO L231 Difference]: Finished difference. Result has 207 places, 1020 transitions, 14479 flow [2025-02-06 09:36:01,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=11561, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=929, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=278, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=597, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=14479, PETRI_PLACES=207, PETRI_TRANSITIONS=1020} [2025-02-06 09:36:01,980 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 105 predicate places. [2025-02-06 09:36:01,980 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 1020 transitions, 14479 flow [2025-02-06 09:36:01,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 61.857142857142854) internal successors, (866), 14 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:36:01,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:01,981 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:36:01,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:36:01,981 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 09:36:01,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:01,981 INFO L85 PathProgramCache]: Analyzing trace with hash -2062995208, now seen corresponding path program 3 times [2025-02-06 09:36:01,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:01,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133103383] [2025-02-06 09:36:01,982 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 09:36:01,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:01,996 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 3 equivalence classes. [2025-02-06 09:36:02,020 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 09:36:02,020 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 09:36:02,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:02,800 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:02,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:02,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133103383] [2025-02-06 09:36:02,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133103383] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:36:02,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085118883] [2025-02-06 09:36:02,801 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 09:36:02,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:36:02,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:36:02,804 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-06 09:36:02,806 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-06 09:36:02,875 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 3 equivalence classes. [2025-02-06 09:36:02,945 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 09:36:02,945 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 09:36:02,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:02,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 09:36:02,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:36:02,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-06 09:36:03,072 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 09:36:03,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2025-02-06 09:36:03,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-06 09:36:03,238 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-06 09:36:03,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:36:03,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 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-06 09:36:03,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:36:03,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 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-06 09:36:03,379 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 56 treesize of output 45 [2025-02-06 09:36:03,391 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:03,391 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:36:03,429 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_315 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_315) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 2)))) (forall ((v_ArrVal_315 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_315) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)))) (forall ((v_ArrVal_315 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_315) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 3)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_315 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_315) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)))) is different from false [2025-02-06 09:36:03,527 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_315 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_315) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_315 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_315) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_315 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_315) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_315 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_315) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2025-02-06 09:36:15,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:36:15,465 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67 [2025-02-06 09:36:15,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:36:15,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 115 treesize of output 35 [2025-02-06 09:36:15,482 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-02-06 09:36:15,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-02-06 09:36:15,488 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-02-06 09:36:15,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2025-02-06 09:36:15,498 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-02-06 09:36:15,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-02-06 09:36:15,590 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:15,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085118883] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:36:15,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:36:15,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 13] total 31 [2025-02-06 09:36:15,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616285721] [2025-02-06 09:36:15,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:36:15,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-06 09:36:15,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:15,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-06 09:36:15,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=742, Unknown=31, NotChecked=114, Total=992 [2025-02-06 09:36:15,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 100 [2025-02-06 09:36:15,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 1020 transitions, 14479 flow. Second operand has 32 states, 32 states have (on average 38.4375) internal successors, (1230), 32 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:36:15,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:15,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 100 [2025-02-06 09:36:15,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:21,434 INFO L124 PetriNetUnfolderBase]: 10607/21735 cut-off events. [2025-02-06 09:36:21,435 INFO L125 PetriNetUnfolderBase]: For 124843/126734 co-relation queries the response was YES. [2025-02-06 09:36:21,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107466 conditions, 21735 events. 10607/21735 cut-off events. For 124843/126734 co-relation queries the response was YES. Maximal size of possible extension queue 772. Compared 196775 event pairs, 2132 based on Foata normal form. 273/20888 useless extension candidates. Maximal degree in co-relation 105584. Up to 11710 conditions per place. [2025-02-06 09:36:21,719 INFO L140 encePairwiseOnDemand]: 72/100 looper letters, 893 selfloop transitions, 513 changer transitions 2/1451 dead transitions. [2025-02-06 09:36:21,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 1451 transitions, 22606 flow [2025-02-06 09:36:21,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-06 09:36:21,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-02-06 09:36:21,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 1361 transitions. [2025-02-06 09:36:21,723 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45366666666666666 [2025-02-06 09:36:21,723 INFO L175 Difference]: Start difference. First operand has 207 places, 1020 transitions, 14479 flow. Second operand 30 states and 1361 transitions. [2025-02-06 09:36:21,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 1451 transitions, 22606 flow [2025-02-06 09:36:22,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 1451 transitions, 22474 flow, removed 47 selfloop flow, removed 10 redundant places. [2025-02-06 09:36:22,465 INFO L231 Difference]: Finished difference. Result has 231 places, 1264 transitions, 20369 flow [2025-02-06 09:36:22,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=14381, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1020, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=307, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=625, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=20369, PETRI_PLACES=231, PETRI_TRANSITIONS=1264} [2025-02-06 09:36:22,467 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 129 predicate places. [2025-02-06 09:36:22,467 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 1264 transitions, 20369 flow [2025-02-06 09:36:22,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 38.4375) internal successors, (1230), 32 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:36:22,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:22,468 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:36:22,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 09:36:22,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-06 09:36:22,673 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 09:36:22,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:22,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1567581540, now seen corresponding path program 4 times [2025-02-06 09:36:22,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:22,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335639213] [2025-02-06 09:36:22,674 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 09:36:22,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:22,686 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-02-06 09:36:22,701 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 09:36:22,702 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 09:36:22,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:23,236 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:36:23,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:23,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335639213] [2025-02-06 09:36:23,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335639213] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:36:23,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523897539] [2025-02-06 09:36:23,237 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 09:36:23,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:36:23,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:36:23,240 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-06 09:36:23,242 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-06 09:36:23,309 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-02-06 09:36:23,363 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 09:36:23,363 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 09:36:23,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:23,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-06 09:36:23,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:36:23,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-06 09:36:23,430 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 09:36:23,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2025-02-06 09:36:23,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-06 09:36:23,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-06 09:36:23,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2025-02-06 09:36:24,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2025-02-06 09:36:24,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 60 [2025-02-06 09:36:24,171 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:36:24,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:36:26,683 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:36:26,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523897539] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:36:26,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:36:26,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 16] total 42 [2025-02-06 09:36:26,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846912192] [2025-02-06 09:36:26,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:36:26,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-02-06 09:36:26,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:26,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-02-06 09:36:26,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1592, Unknown=0, NotChecked=0, Total=1806 [2025-02-06 09:36:32,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 09:36:37,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 09:36:37,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 100 [2025-02-06 09:36:37,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 1264 transitions, 20369 flow. Second operand has 43 states, 43 states have (on average 58.02325581395349) internal successors, (2495), 43 states have internal predecessors, (2495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:36:37,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:37,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 100 [2025-02-06 09:36:37,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:45,830 INFO L124 PetriNetUnfolderBase]: 9214/20765 cut-off events. [2025-02-06 09:36:45,830 INFO L125 PetriNetUnfolderBase]: For 193918/197035 co-relation queries the response was YES. [2025-02-06 09:36:45,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125265 conditions, 20765 events. 9214/20765 cut-off events. For 193918/197035 co-relation queries the response was YES. Maximal size of possible extension queue 774. Compared 200372 event pairs, 616 based on Foata normal form. 853/21043 useless extension candidates. Maximal degree in co-relation 123644. Up to 7721 conditions per place. [2025-02-06 09:36:46,053 INFO L140 encePairwiseOnDemand]: 69/100 looper letters, 1156 selfloop transitions, 1001 changer transitions 0/2225 dead transitions. [2025-02-06 09:36:46,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 2225 transitions, 42826 flow [2025-02-06 09:36:46,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-06 09:36:46,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-02-06 09:36:46,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 2251 transitions. [2025-02-06 09:36:46,057 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6431428571428571 [2025-02-06 09:36:46,057 INFO L175 Difference]: Start difference. First operand has 231 places, 1264 transitions, 20369 flow. Second operand 35 states and 2251 transitions. [2025-02-06 09:36:46,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 2225 transitions, 42826 flow [2025-02-06 09:36:47,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 2225 transitions, 42373 flow, removed 181 selfloop flow, removed 18 redundant places. [2025-02-06 09:36:47,250 INFO L231 Difference]: Finished difference. Result has 259 places, 1896 transitions, 37279 flow [2025-02-06 09:36:47,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=20100, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=429, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=767, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=37279, PETRI_PLACES=259, PETRI_TRANSITIONS=1896} [2025-02-06 09:36:47,251 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 157 predicate places. [2025-02-06 09:36:47,251 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 1896 transitions, 37279 flow [2025-02-06 09:36:47,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 58.02325581395349) internal successors, (2495), 43 states have internal predecessors, (2495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:36:47,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:47,253 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:36:47,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 09:36:47,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:36:47,453 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 09:36:47,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:47,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1969100530, now seen corresponding path program 5 times [2025-02-06 09:36:47,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:47,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681166666] [2025-02-06 09:36:47,454 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 09:36:47,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:47,462 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 3 equivalence classes. [2025-02-06 09:36:47,469 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 09:36:47,469 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-06 09:36:47,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:47,839 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:36:47,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:47,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681166666] [2025-02-06 09:36:47,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681166666] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:36:47,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108195396] [2025-02-06 09:36:47,839 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 09:36:47,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:36:47,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:36:47,842 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-06 09:36:47,844 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-06 09:36:47,906 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 3 equivalence classes. [2025-02-06 09:36:47,927 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 09:36:47,927 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-06 09:36:47,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:47,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 09:36:47,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:36:47,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-06 09:36:47,953 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 09:36:47,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2025-02-06 09:36:47,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-06 09:36:48,011 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-06 09:36:48,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:36:48,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 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-06 09:36:48,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:36:48,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 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-06 09:36:48,107 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 56 treesize of output 45 [2025-02-06 09:36:48,116 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:36:48,116 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:36:48,140 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_441 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_441) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 2)))) (forall ((v_ArrVal_441 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_441) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_441 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_441) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 3)))) (forall ((v_ArrVal_441 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_441) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)))) is different from false [2025-02-06 09:36:48,198 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_441 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_441) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)))) (forall ((v_ArrVal_441 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_441) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_441 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_441) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_441 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_441) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2025-02-06 09:36:50,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:36:50,829 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 66 [2025-02-06 09:36:50,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:36:50,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 34 [2025-02-06 09:36:50,841 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-02-06 09:36:50,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-02-06 09:36:50,853 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-02-06 09:36:50,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-02-06 09:36:50,858 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-02-06 09:36:50,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-02-06 09:36:50,914 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:36:50,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108195396] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:36:50,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:36:50,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2025-02-06 09:36:50,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91342237] [2025-02-06 09:36:50,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:36:50,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 09:36:50,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:50,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 09:36:50,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=268, Unknown=25, NotChecked=70, Total=420 [2025-02-06 09:36:51,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 100 [2025-02-06 09:36:51,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 1896 transitions, 37279 flow. Second operand has 21 states, 21 states have (on average 49.095238095238095) internal successors, (1031), 21 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:36:51,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:51,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 100 [2025-02-06 09:36:51,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:37:02,880 INFO L124 PetriNetUnfolderBase]: 17820/37567 cut-off events. [2025-02-06 09:37:02,880 INFO L125 PetriNetUnfolderBase]: For 392694/398145 co-relation queries the response was YES. [2025-02-06 09:37:03,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222510 conditions, 37567 events. 17820/37567 cut-off events. For 392694/398145 co-relation queries the response was YES. Maximal size of possible extension queue 1411. Compared 380809 event pairs, 3257 based on Foata normal form. 631/36409 useless extension candidates. Maximal degree in co-relation 220109. Up to 19568 conditions per place. [2025-02-06 09:37:03,573 INFO L140 encePairwiseOnDemand]: 74/100 looper letters, 1043 selfloop transitions, 1345 changer transitions 1/2443 dead transitions. [2025-02-06 09:37:03,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 2443 transitions, 52445 flow [2025-02-06 09:37:03,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 09:37:03,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-02-06 09:37:03,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1169 transitions. [2025-02-06 09:37:03,576 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5845 [2025-02-06 09:37:03,576 INFO L175 Difference]: Start difference. First operand has 259 places, 1896 transitions, 37279 flow. Second operand 20 states and 1169 transitions. [2025-02-06 09:37:03,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 2443 transitions, 52445 flow [2025-02-06 09:37:07,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 2443 transitions, 51860 flow, removed 153 selfloop flow, removed 19 redundant places. [2025-02-06 09:37:07,311 INFO L231 Difference]: Finished difference. Result has 265 places, 2300 transitions, 50090 flow [2025-02-06 09:37:07,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=36716, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1896, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=999, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=819, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=50090, PETRI_PLACES=265, PETRI_TRANSITIONS=2300} [2025-02-06 09:37:07,313 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 163 predicate places. [2025-02-06 09:37:07,313 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 2300 transitions, 50090 flow [2025-02-06 09:37:07,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 49.095238095238095) internal successors, (1031), 21 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:37:07,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:37:07,314 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:37:07,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0