./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 43a7b886f1e454dafac7facab2674c64a0fa591a6bf106acb1f8b320d6c92508 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:20:26,604 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:20:26,664 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:20:26,668 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:20:26,669 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:20:26,689 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:20:26,690 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:20:26,690 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:20:26,690 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:20:26,690 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:20:26,690 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:20:26,690 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:20:26,690 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:20:26,692 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:20:26,693 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:20:26,693 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:20:26,693 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:20:26,693 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:20:26,693 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:20:26,693 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:20:26,693 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:20:26,693 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:20:26,694 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:20:26,694 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:20:26,694 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:20:26,694 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:20:26,694 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:20:26,694 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:20:26,694 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:20:26,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:20:26,694 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:20:26,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:20:26,695 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:20:26,695 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:20:26,695 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:20:26,695 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:20:26,695 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:20:26,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:20:26,695 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:20:26,695 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:20:26,695 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:20:26,695 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:20:26,695 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 43a7b886f1e454dafac7facab2674c64a0fa591a6bf106acb1f8b320d6c92508 [2025-03-14 01:20:26,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:20:26,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:20:26,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:20:26,913 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:20:26,914 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:20:26,914 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i [2025-03-14 01:20:28,084 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1df25de9/1d848f4db0174f639947c52abd3ce983/FLAGdc6a651f2 [2025-03-14 01:20:28,361 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:20:28,361 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i [2025-03-14 01:20:28,375 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1df25de9/1d848f4db0174f639947c52abd3ce983/FLAGdc6a651f2 [2025-03-14 01:20:28,387 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1df25de9/1d848f4db0174f639947c52abd3ce983 [2025-03-14 01:20:28,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:20:28,391 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:20:28,392 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:20:28,392 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:20:28,395 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:20:28,396 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:20:28" (1/1) ... [2025-03-14 01:20:28,396 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58c76f3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:20:28, skipping insertion in model container [2025-03-14 01:20:28,397 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:20:28" (1/1) ... [2025-03-14 01:20:28,427 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:20:28,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:20:28,640 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:20:28,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:20:28,713 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:20:28,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:20:28 WrapperNode [2025-03-14 01:20:28,714 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:20:28,715 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:20:28,715 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:20:28,715 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:20:28,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:20:28" (1/1) ... [2025-03-14 01:20:28,730 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:20:28" (1/1) ... [2025-03-14 01:20:28,748 INFO L138 Inliner]: procedures = 169, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2025-03-14 01:20:28,749 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:20:28,750 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:20:28,751 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:20:28,751 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:20:28,756 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:20:28" (1/1) ... [2025-03-14 01:20:28,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:20:28" (1/1) ... [2025-03-14 01:20:28,760 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:20:28" (1/1) ... [2025-03-14 01:20:28,761 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:20:28" (1/1) ... [2025-03-14 01:20:28,768 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:20:28" (1/1) ... [2025-03-14 01:20:28,768 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:20:28" (1/1) ... [2025-03-14 01:20:28,769 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:20:28" (1/1) ... [2025-03-14 01:20:28,770 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:20:28" (1/1) ... [2025-03-14 01:20:28,775 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:20:28,776 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:20:28,776 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:20:28,776 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:20:28,776 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:20:28" (1/1) ... [2025-03-14 01:20:28,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:20:28,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:20:28,807 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:20:28,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:20:28,829 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-14 01:20:28,829 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-14 01:20:28,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-14 01:20:28,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:20:28,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:20:28,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-14 01:20:28,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:20:28,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:20:28,830 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:20:28,920 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:20:28,923 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:20:29,016 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:20:29,017 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:20:29,017 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:20:29,055 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:20:29,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:20:29 BoogieIcfgContainer [2025-03-14 01:20:29,058 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:20:29,061 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:20:29,061 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:20:29,065 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:20:29,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:20:28" (1/3) ... [2025-03-14 01:20:29,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@273a65ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:20:29, skipping insertion in model container [2025-03-14 01:20:29,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:20:28" (2/3) ... [2025-03-14 01:20:29,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@273a65ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:20:29, skipping insertion in model container [2025-03-14 01:20:29,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:20:29" (3/3) ... [2025-03-14 01:20:29,067 INFO L128 eAbstractionObserver]: Analyzing ICFG 45_monabsex1_vs.i [2025-03-14 01:20:29,078 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:20:29,080 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 45_monabsex1_vs.i that has 2 procedures, 40 locations, 1 initial locations, 1 loop locations, and 3 error locations. [2025-03-14 01:20:29,082 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:20:29,122 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:20:29,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 40 transitions, 84 flow [2025-03-14 01:20:29,181 INFO L124 PetriNetUnfolderBase]: 0/47 cut-off events. [2025-03-14 01:20:29,185 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:20:29,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 47 events. 0/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-03-14 01:20:29,189 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 40 transitions, 84 flow [2025-03-14 01:20:29,191 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 40 transitions, 84 flow [2025-03-14 01:20:29,201 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:20:29,213 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;@7dd2f01d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:20:29,215 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-14 01:20:29,220 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:20:29,221 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-03-14 01:20:29,221 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:20:29,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:20:29,222 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:20:29,222 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 01:20:29,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:20:29,226 INFO L85 PathProgramCache]: Analyzing trace with hash -937087091, now seen corresponding path program 1 times [2025-03-14 01:20:29,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:20:29,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500377682] [2025-03-14 01:20:29,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:20:29,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:20:29,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-14 01:20:29,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-14 01:20:29,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:29,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:20:29,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:20:29,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:20:29,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500377682] [2025-03-14 01:20:29,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500377682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:20:29,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:20:29,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:20:29,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022144202] [2025-03-14 01:20:29,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:20:29,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:20:29,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:20:29,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:20:29,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:20:29,437 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 40 [2025-03-14 01:20:29,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 40 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:29,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:20:29,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 40 [2025-03-14 01:20:29,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:20:29,457 INFO L124 PetriNetUnfolderBase]: 0/36 cut-off events. [2025-03-14 01:20:29,459 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:20:29,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 36 events. 0/36 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 7 event pairs, 0 based on Foata normal form. 4/40 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2025-03-14 01:20:29,460 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 6 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2025-03-14 01:20:29,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 33 transitions, 86 flow [2025-03-14 01:20:29,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:20:29,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:20:29,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-03-14 01:20:29,474 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.775 [2025-03-14 01:20:29,475 INFO L175 Difference]: Start difference. First operand has 43 places, 40 transitions, 84 flow. Second operand 3 states and 93 transitions. [2025-03-14 01:20:29,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 33 transitions, 86 flow [2025-03-14 01:20:29,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 33 transitions, 86 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:20:29,481 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 74 flow [2025-03-14 01:20:29,484 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2025-03-14 01:20:29,487 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -5 predicate places. [2025-03-14 01:20:29,487 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 74 flow [2025-03-14 01:20:29,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:29,488 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:20:29,489 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:20:29,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:20:29,489 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 01:20:29,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:20:29,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1868936967, now seen corresponding path program 1 times [2025-03-14 01:20:29,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:20:29,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175586987] [2025-03-14 01:20:29,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:20:29,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:20:29,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-14 01:20:29,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:20:29,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:29,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:20:29,524 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:20:29,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-14 01:20:29,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:20:29,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:29,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:20:29,555 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:20:29,555 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:20:29,557 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-03-14 01:20:29,558 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2025-03-14 01:20:29,558 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2025-03-14 01:20:29,558 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2025-03-14 01:20:29,558 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2025-03-14 01:20:29,559 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2025-03-14 01:20:29,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:20:29,559 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-14 01:20:29,562 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:20:29,562 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-14 01:20:29,585 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:20:29,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 53 transitions, 116 flow [2025-03-14 01:20:29,608 INFO L124 PetriNetUnfolderBase]: 0/67 cut-off events. [2025-03-14 01:20:29,609 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:20:29,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 67 events. 0/67 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 102 event pairs, 0 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2025-03-14 01:20:29,610 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 53 transitions, 116 flow [2025-03-14 01:20:29,611 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 53 transitions, 116 flow [2025-03-14 01:20:29,612 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:20:29,613 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;@7dd2f01d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:20:29,613 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-14 01:20:29,618 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:20:29,619 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-03-14 01:20:29,619 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:20:29,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:20:29,619 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:20:29,619 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 01:20:29,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:20:29,619 INFO L85 PathProgramCache]: Analyzing trace with hash 165287266, now seen corresponding path program 1 times [2025-03-14 01:20:29,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:20:29,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840556311] [2025-03-14 01:20:29,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:20:29,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:20:29,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-14 01:20:29,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-14 01:20:29,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:29,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:20:29,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:20:29,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:20:29,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840556311] [2025-03-14 01:20:29,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840556311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:20:29,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:20:29,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:20:29,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838939158] [2025-03-14 01:20:29,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:20:29,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:20:29,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:20:29,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:20:29,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:20:29,688 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 53 [2025-03-14 01:20:29,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:29,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:20:29,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 53 [2025-03-14 01:20:29,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:20:29,726 INFO L124 PetriNetUnfolderBase]: 6/80 cut-off events. [2025-03-14 01:20:29,726 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-14 01:20:29,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 80 events. 6/80 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 141 event pairs, 6 based on Foata normal form. 13/91 useless extension candidates. Maximal degree in co-relation 31. Up to 22 conditions per place. [2025-03-14 01:20:29,728 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 9 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2025-03-14 01:20:29,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 44 transitions, 120 flow [2025-03-14 01:20:29,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:20:29,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:20:29,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2025-03-14 01:20:29,729 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7672955974842768 [2025-03-14 01:20:29,729 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 116 flow. Second operand 3 states and 122 transitions. [2025-03-14 01:20:29,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 44 transitions, 120 flow [2025-03-14 01:20:29,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 44 transitions, 120 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:20:29,731 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 102 flow [2025-03-14 01:20:29,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2025-03-14 01:20:29,731 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2025-03-14 01:20:29,731 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 102 flow [2025-03-14 01:20:29,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:29,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:20:29,733 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:20:29,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:20:29,733 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 01:20:29,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:20:29,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1200795982, now seen corresponding path program 1 times [2025-03-14 01:20:29,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:20:29,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220026174] [2025-03-14 01:20:29,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:20:29,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:20:29,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-14 01:20:29,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-14 01:20:29,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:29,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:20:29,760 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:20:29,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-14 01:20:29,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-14 01:20:29,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:29,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:20:29,777 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:20:29,777 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:20:29,777 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-03-14 01:20:29,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2025-03-14 01:20:29,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2025-03-14 01:20:29,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2025-03-14 01:20:29,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2025-03-14 01:20:29,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2025-03-14 01:20:29,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2025-03-14 01:20:29,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2025-03-14 01:20:29,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:20:29,778 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-14 01:20:29,779 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:20:29,779 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-14 01:20:29,802 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:20:29,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 66 transitions, 150 flow [2025-03-14 01:20:29,818 INFO L124 PetriNetUnfolderBase]: 0/87 cut-off events. [2025-03-14 01:20:29,818 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-14 01:20:29,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 87 events. 0/87 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 174 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2025-03-14 01:20:29,818 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 66 transitions, 150 flow [2025-03-14 01:20:29,819 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 66 transitions, 150 flow [2025-03-14 01:20:29,820 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:20:29,820 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;@7dd2f01d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:20:29,820 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-14 01:20:29,824 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:20:29,824 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-03-14 01:20:29,824 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:20:29,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:20:29,824 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:20:29,824 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-14 01:20:29,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:20:29,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1619092452, now seen corresponding path program 1 times [2025-03-14 01:20:29,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:20:29,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227556361] [2025-03-14 01:20:29,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:20:29,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:20:29,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-14 01:20:29,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-14 01:20:29,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:29,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:20:29,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:20:29,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:20:29,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227556361] [2025-03-14 01:20:29,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227556361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:20:29,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:20:29,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:20:29,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80048774] [2025-03-14 01:20:29,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:20:29,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:20:29,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:20:29,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:20:29,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:20:29,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 66 [2025-03-14 01:20:29,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 66 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:29,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:20:29,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 66 [2025-03-14 01:20:29,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:20:29,950 INFO L124 PetriNetUnfolderBase]: 42/219 cut-off events. [2025-03-14 01:20:29,950 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-03-14 01:20:29,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357 conditions, 219 events. 42/219 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 975 event pairs, 42 based on Foata normal form. 40/248 useless extension candidates. Maximal degree in co-relation 112. Up to 85 conditions per place. [2025-03-14 01:20:29,953 INFO L140 encePairwiseOnDemand]: 56/66 looper letters, 12 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2025-03-14 01:20:29,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 55 transitions, 156 flow [2025-03-14 01:20:29,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:20:29,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:20:29,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2025-03-14 01:20:29,955 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7626262626262627 [2025-03-14 01:20:29,955 INFO L175 Difference]: Start difference. First operand has 73 places, 66 transitions, 150 flow. Second operand 3 states and 151 transitions. [2025-03-14 01:20:29,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 55 transitions, 156 flow [2025-03-14 01:20:29,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 55 transitions, 154 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-14 01:20:29,956 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 130 flow [2025-03-14 01:20:29,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2025-03-14 01:20:29,959 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -9 predicate places. [2025-03-14 01:20:29,959 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 130 flow [2025-03-14 01:20:29,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:29,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:20:29,959 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:20:29,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:20:29,960 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-14 01:20:29,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:20:29,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1029731378, now seen corresponding path program 1 times [2025-03-14 01:20:29,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:20:29,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850869414] [2025-03-14 01:20:29,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:20:29,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:20:29,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-14 01:20:29,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-14 01:20:29,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:29,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:20:29,982 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:20:29,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-14 01:20:29,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-14 01:20:29,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:29,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:20:30,005 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:20:30,005 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:20:30,005 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-14 01:20:30,006 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-14 01:20:30,006 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-14 01:20:30,006 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-14 01:20:30,006 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-03-14 01:20:30,006 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-03-14 01:20:30,006 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-14 01:20:30,006 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-14 01:20:30,006 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-14 01:20:30,006 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-14 01:20:30,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:20:30,006 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-14 01:20:30,007 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:20:30,007 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-14 01:20:30,034 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:20:30,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 79 transitions, 186 flow [2025-03-14 01:20:30,049 INFO L124 PetriNetUnfolderBase]: 0/107 cut-off events. [2025-03-14 01:20:30,049 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-14 01:20:30,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 107 events. 0/107 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 244 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2025-03-14 01:20:30,050 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 79 transitions, 186 flow [2025-03-14 01:20:30,050 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 79 transitions, 186 flow [2025-03-14 01:20:30,051 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:20:30,051 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;@7dd2f01d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:20:30,051 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-14 01:20:30,059 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:20:30,059 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-03-14 01:20:30,060 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:20:30,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:20:30,060 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:20:30,060 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-14 01:20:30,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:20:30,060 INFO L85 PathProgramCache]: Analyzing trace with hash -870638829, now seen corresponding path program 1 times [2025-03-14 01:20:30,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:20:30,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904789939] [2025-03-14 01:20:30,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:20:30,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:20:30,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-14 01:20:30,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-14 01:20:30,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:30,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:20:30,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:20:30,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:20:30,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904789939] [2025-03-14 01:20:30,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904789939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:20:30,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:20:30,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:20:30,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409263697] [2025-03-14 01:20:30,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:20:30,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:20:30,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:20:30,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:20:30,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:20:30,101 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 79 [2025-03-14 01:20:30,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 79 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:30,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:20:30,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 79 [2025-03-14 01:20:30,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:20:30,216 INFO L124 PetriNetUnfolderBase]: 204/680 cut-off events. [2025-03-14 01:20:30,216 INFO L125 PetriNetUnfolderBase]: For 394/394 co-relation queries the response was YES. [2025-03-14 01:20:30,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1197 conditions, 680 events. 204/680 cut-off events. For 394/394 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4446 event pairs, 204 based on Foata normal form. 121/759 useless extension candidates. Maximal degree in co-relation 348. Up to 328 conditions per place. [2025-03-14 01:20:30,225 INFO L140 encePairwiseOnDemand]: 67/79 looper letters, 15 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2025-03-14 01:20:30,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 66 transitions, 194 flow [2025-03-14 01:20:30,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:20:30,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:20:30,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2025-03-14 01:20:30,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.759493670886076 [2025-03-14 01:20:30,229 INFO L175 Difference]: Start difference. First operand has 88 places, 79 transitions, 186 flow. Second operand 3 states and 180 transitions. [2025-03-14 01:20:30,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 66 transitions, 194 flow [2025-03-14 01:20:30,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 66 transitions, 188 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-14 01:20:30,233 INFO L231 Difference]: Finished difference. Result has 77 places, 66 transitions, 158 flow [2025-03-14 01:20:30,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=77, PETRI_TRANSITIONS=66} [2025-03-14 01:20:30,234 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -11 predicate places. [2025-03-14 01:20:30,234 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 66 transitions, 158 flow [2025-03-14 01:20:30,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:30,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:20:30,235 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:20:30,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:20:30,235 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-14 01:20:30,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:20:30,236 INFO L85 PathProgramCache]: Analyzing trace with hash -992367161, now seen corresponding path program 1 times [2025-03-14 01:20:30,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:20:30,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062550285] [2025-03-14 01:20:30,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:20:30,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:20:30,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-14 01:20:30,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-14 01:20:30,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:30,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:20:30,261 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:20:30,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-14 01:20:30,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-14 01:20:30,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:30,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:20:30,277 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:20:30,277 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:20:30,277 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2025-03-14 01:20:30,277 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2025-03-14 01:20:30,277 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2025-03-14 01:20:30,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2025-03-14 01:20:30,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2025-03-14 01:20:30,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2025-03-14 01:20:30,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2025-03-14 01:20:30,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2025-03-14 01:20:30,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2025-03-14 01:20:30,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2025-03-14 01:20:30,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2025-03-14 01:20:30,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2025-03-14 01:20:30,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:20:30,282 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-14 01:20:30,283 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:20:30,283 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-14 01:20:30,312 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:20:30,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 92 transitions, 224 flow [2025-03-14 01:20:30,327 INFO L124 PetriNetUnfolderBase]: 0/127 cut-off events. [2025-03-14 01:20:30,327 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-14 01:20:30,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 127 events. 0/127 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 321 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2025-03-14 01:20:30,328 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 92 transitions, 224 flow [2025-03-14 01:20:30,331 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 92 transitions, 224 flow [2025-03-14 01:20:30,333 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:20:30,333 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;@7dd2f01d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:20:30,333 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-14 01:20:30,335 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:20:30,336 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-03-14 01:20:30,336 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:20:30,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:20:30,336 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:20:30,336 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2025-03-14 01:20:30,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:20:30,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1286028015, now seen corresponding path program 1 times [2025-03-14 01:20:30,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:20:30,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493858624] [2025-03-14 01:20:30,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:20:30,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:20:30,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-14 01:20:30,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-14 01:20:30,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:30,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:20:30,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:20:30,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:20:30,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493858624] [2025-03-14 01:20:30,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493858624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:20:30,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:20:30,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:20:30,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369635211] [2025-03-14 01:20:30,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:20:30,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:20:30,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:20:30,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:20:30,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:20:30,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 92 [2025-03-14 01:20:30,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 92 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:30,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:20:30,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 92 [2025-03-14 01:20:30,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:20:30,665 INFO L124 PetriNetUnfolderBase]: 852/2215 cut-off events. [2025-03-14 01:20:30,665 INFO L125 PetriNetUnfolderBase]: For 1829/1829 co-relation queries the response was YES. [2025-03-14 01:20:30,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4110 conditions, 2215 events. 852/2215 cut-off events. For 1829/1829 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 17615 event pairs, 852 based on Foata normal form. 364/2440 useless extension candidates. Maximal degree in co-relation 1208. Up to 1219 conditions per place. [2025-03-14 01:20:30,681 INFO L140 encePairwiseOnDemand]: 78/92 looper letters, 18 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2025-03-14 01:20:30,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 77 transitions, 234 flow [2025-03-14 01:20:30,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:20:30,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:20:30,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2025-03-14 01:20:30,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7572463768115942 [2025-03-14 01:20:30,683 INFO L175 Difference]: Start difference. First operand has 103 places, 92 transitions, 224 flow. Second operand 3 states and 209 transitions. [2025-03-14 01:20:30,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 77 transitions, 234 flow [2025-03-14 01:20:30,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 77 transitions, 222 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-14 01:20:30,691 INFO L231 Difference]: Finished difference. Result has 90 places, 77 transitions, 186 flow [2025-03-14 01:20:30,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=90, PETRI_TRANSITIONS=77} [2025-03-14 01:20:30,692 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, -13 predicate places. [2025-03-14 01:20:30,692 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 77 transitions, 186 flow [2025-03-14 01:20:30,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:30,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:20:30,693 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:20:30,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:20:30,693 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2025-03-14 01:20:30,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:20:30,693 INFO L85 PathProgramCache]: Analyzing trace with hash -965411207, now seen corresponding path program 1 times [2025-03-14 01:20:30,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:20:30,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116039792] [2025-03-14 01:20:30,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:20:30,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:20:30,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-14 01:20:30,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-14 01:20:30,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:30,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:20:30,712 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:20:30,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-14 01:20:30,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-14 01:20:30,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:30,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:20:30,729 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:20:30,729 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:20:30,732 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-03-14 01:20:30,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-03-14 01:20:30,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-03-14 01:20:30,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-03-14 01:20:30,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-03-14 01:20:30,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2025-03-14 01:20:30,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-03-14 01:20:30,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-03-14 01:20:30,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-03-14 01:20:30,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-03-14 01:20:30,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-03-14 01:20:30,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-03-14 01:20:30,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-03-14 01:20:30,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-03-14 01:20:30,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:20:30,733 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-14 01:20:30,734 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:20:30,734 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-03-14 01:20:30,769 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:20:30,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 105 transitions, 264 flow [2025-03-14 01:20:30,783 INFO L124 PetriNetUnfolderBase]: 0/147 cut-off events. [2025-03-14 01:20:30,784 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-03-14 01:20:30,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 147 events. 0/147 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 397 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2025-03-14 01:20:30,784 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 105 transitions, 264 flow [2025-03-14 01:20:30,785 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 105 transitions, 264 flow [2025-03-14 01:20:30,786 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:20:30,787 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;@7dd2f01d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:20:30,787 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-14 01:20:30,789 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:20:30,789 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-03-14 01:20:30,789 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:20:30,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:20:30,790 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:20:30,790 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-14 01:20:30,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:20:30,790 INFO L85 PathProgramCache]: Analyzing trace with hash -500841608, now seen corresponding path program 1 times [2025-03-14 01:20:30,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:20:30,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498747094] [2025-03-14 01:20:30,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:20:30,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:20:30,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-14 01:20:30,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-14 01:20:30,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:30,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:20:30,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:20:30,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:20:30,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498747094] [2025-03-14 01:20:30,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498747094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:20:30,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:20:30,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:20:30,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932013429] [2025-03-14 01:20:30,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:20:30,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:20:30,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:20:30,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:20:30,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:20:30,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 105 [2025-03-14 01:20:30,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 105 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:30,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:20:30,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 105 [2025-03-14 01:20:30,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:20:31,670 INFO L124 PetriNetUnfolderBase]: 3282/7296 cut-off events. [2025-03-14 01:20:31,670 INFO L125 PetriNetUnfolderBase]: For 7882/7882 co-relation queries the response was YES. [2025-03-14 01:20:31,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14052 conditions, 7296 events. 3282/7296 cut-off events. For 7882/7882 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 66480 event pairs, 3282 based on Foata normal form. 1093/7955 useless extension candidates. Maximal degree in co-relation 4201. Up to 4378 conditions per place. [2025-03-14 01:20:31,730 INFO L140 encePairwiseOnDemand]: 89/105 looper letters, 21 selfloop transitions, 2 changer transitions 0/88 dead transitions. [2025-03-14 01:20:31,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 88 transitions, 276 flow [2025-03-14 01:20:31,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:20:31,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:20:31,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 238 transitions. [2025-03-14 01:20:31,733 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7555555555555555 [2025-03-14 01:20:31,733 INFO L175 Difference]: Start difference. First operand has 118 places, 105 transitions, 264 flow. Second operand 3 states and 238 transitions. [2025-03-14 01:20:31,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 88 transitions, 276 flow [2025-03-14 01:20:31,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 88 transitions, 256 flow, removed 10 selfloop flow, removed 0 redundant places. [2025-03-14 01:20:31,740 INFO L231 Difference]: Finished difference. Result has 103 places, 88 transitions, 214 flow [2025-03-14 01:20:31,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=103, PETRI_TRANSITIONS=88} [2025-03-14 01:20:31,741 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -15 predicate places. [2025-03-14 01:20:31,742 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 88 transitions, 214 flow [2025-03-14 01:20:31,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:31,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:20:31,743 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:20:31,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:20:31,743 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-14 01:20:31,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:20:31,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1040966948, now seen corresponding path program 1 times [2025-03-14 01:20:31,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:20:31,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124273455] [2025-03-14 01:20:31,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:20:31,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:20:31,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-14 01:20:31,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-14 01:20:31,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:31,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:20:31,765 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:20:31,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-14 01:20:31,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-14 01:20:31,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:31,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:20:31,789 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:20:31,789 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:20:31,789 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-03-14 01:20:31,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2025-03-14 01:20:31,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-03-14 01:20:31,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-03-14 01:20:31,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-03-14 01:20:31,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-03-14 01:20:31,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2025-03-14 01:20:31,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2025-03-14 01:20:31,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2025-03-14 01:20:31,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2025-03-14 01:20:31,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-03-14 01:20:31,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-03-14 01:20:31,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-03-14 01:20:31,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-03-14 01:20:31,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-03-14 01:20:31,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-03-14 01:20:31,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:20:31,792 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-14 01:20:31,793 WARN L246 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:20:31,795 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2025-03-14 01:20:31,826 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:20:31,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 118 transitions, 306 flow [2025-03-14 01:20:31,839 INFO L124 PetriNetUnfolderBase]: 0/167 cut-off events. [2025-03-14 01:20:31,839 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-03-14 01:20:31,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 167 events. 0/167 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 478 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2025-03-14 01:20:31,839 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 118 transitions, 306 flow [2025-03-14 01:20:31,841 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 118 transitions, 306 flow [2025-03-14 01:20:31,841 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:20:31,842 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;@7dd2f01d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:20:31,842 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-14 01:20:31,843 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:20:31,843 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-03-14 01:20:31,843 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:20:31,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:20:31,844 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:20:31,844 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-14 01:20:31,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:20:31,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1936280402, now seen corresponding path program 1 times [2025-03-14 01:20:31,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:20:31,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698720327] [2025-03-14 01:20:31,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:20:31,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:20:31,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-14 01:20:31,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-14 01:20:31,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:31,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:20:31,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:20:31,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:20:31,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698720327] [2025-03-14 01:20:31,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698720327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:20:31,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:20:31,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:20:31,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543441915] [2025-03-14 01:20:31,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:20:31,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:20:31,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:20:31,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:20:31,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:20:31,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 118 [2025-03-14 01:20:31,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 118 transitions, 306 flow. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:31,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:20:31,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 118 [2025-03-14 01:20:31,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:20:34,255 INFO L124 PetriNetUnfolderBase]: 12030/23987 cut-off events. [2025-03-14 01:20:34,256 INFO L125 PetriNetUnfolderBase]: For 32188/32188 co-relation queries the response was YES. [2025-03-14 01:20:34,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47511 conditions, 23987 events. 12030/23987 cut-off events. For 32188/32188 co-relation queries the response was YES. Maximal size of possible extension queue 1278. Compared 237823 event pairs, 12030 based on Foata normal form. 3280/25944 useless extension candidates. Maximal degree in co-relation 14385. Up to 15313 conditions per place. [2025-03-14 01:20:34,471 INFO L140 encePairwiseOnDemand]: 100/118 looper letters, 24 selfloop transitions, 2 changer transitions 0/99 dead transitions. [2025-03-14 01:20:34,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 99 transitions, 320 flow [2025-03-14 01:20:34,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:20:34,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:20:34,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 267 transitions. [2025-03-14 01:20:34,472 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7542372881355932 [2025-03-14 01:20:34,472 INFO L175 Difference]: Start difference. First operand has 133 places, 118 transitions, 306 flow. Second operand 3 states and 267 transitions. [2025-03-14 01:20:34,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 99 transitions, 320 flow [2025-03-14 01:20:34,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 99 transitions, 290 flow, removed 15 selfloop flow, removed 0 redundant places. [2025-03-14 01:20:34,491 INFO L231 Difference]: Finished difference. Result has 116 places, 99 transitions, 242 flow [2025-03-14 01:20:34,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=116, PETRI_TRANSITIONS=99} [2025-03-14 01:20:34,493 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, -17 predicate places. [2025-03-14 01:20:34,493 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 99 transitions, 242 flow [2025-03-14 01:20:34,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:34,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:20:34,493 INFO L206 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:20:34,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:20:34,494 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-14 01:20:34,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:20:34,494 INFO L85 PathProgramCache]: Analyzing trace with hash 52381960, now seen corresponding path program 1 times [2025-03-14 01:20:34,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:20:34,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580355524] [2025-03-14 01:20:34,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:20:34,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:20:34,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-14 01:20:34,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-14 01:20:34,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:34,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:20:34,511 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:20:34,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-14 01:20:34,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-14 01:20:34,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:34,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:20:34,532 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:20:34,532 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:20:34,533 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-03-14 01:20:34,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-03-14 01:20:34,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-03-14 01:20:34,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-03-14 01:20:34,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-03-14 01:20:34,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-03-14 01:20:34,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-03-14 01:20:34,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-03-14 01:20:34,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-03-14 01:20:34,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-03-14 01:20:34,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-03-14 01:20:34,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-03-14 01:20:34,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-03-14 01:20:34,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-03-14 01:20:34,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-03-14 01:20:34,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-03-14 01:20:34,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-03-14 01:20:34,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-03-14 01:20:34,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:20:34,534 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-14 01:20:34,535 WARN L246 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:20:34,535 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2025-03-14 01:20:34,563 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:20:34,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 131 transitions, 350 flow [2025-03-14 01:20:34,573 INFO L124 PetriNetUnfolderBase]: 0/187 cut-off events. [2025-03-14 01:20:34,574 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-03-14 01:20:34,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 187 events. 0/187 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 550 event pairs, 0 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 0. Up to 9 conditions per place. [2025-03-14 01:20:34,574 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 131 transitions, 350 flow [2025-03-14 01:20:34,575 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 131 transitions, 350 flow [2025-03-14 01:20:34,575 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:20:34,576 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7dd2f01d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:20:34,576 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-03-14 01:20:34,577 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:20:34,577 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-03-14 01:20:34,577 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:20:34,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:20:34,577 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:20:34,577 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-14 01:20:34,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:20:34,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1274678929, now seen corresponding path program 1 times [2025-03-14 01:20:34,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:20:34,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735779833] [2025-03-14 01:20:34,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:20:34,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:20:34,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-14 01:20:34,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-14 01:20:34,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:34,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:20:34,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:20:34,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:20:34,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735779833] [2025-03-14 01:20:34,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735779833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:20:34,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:20:34,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:20:34,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212964650] [2025-03-14 01:20:34,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:20:34,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:20:34,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:20:34,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:20:34,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:20:34,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 131 [2025-03-14 01:20:34,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 131 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:34,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:20:34,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 131 [2025-03-14 01:20:34,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:20:42,458 INFO L124 PetriNetUnfolderBase]: 42648/78424 cut-off events. [2025-03-14 01:20:42,459 INFO L125 PetriNetUnfolderBase]: For 126236/126236 co-relation queries the response was YES. [2025-03-14 01:20:42,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158811 conditions, 78424 events. 42648/78424 cut-off events. For 126236/126236 co-relation queries the response was YES. Maximal size of possible extension queue 3426. Compared 829423 event pairs, 42648 based on Foata normal form. 9841/84271 useless extension candidates. Maximal degree in co-relation 48572. Up to 52492 conditions per place. [2025-03-14 01:20:43,428 INFO L140 encePairwiseOnDemand]: 111/131 looper letters, 27 selfloop transitions, 2 changer transitions 0/110 dead transitions. [2025-03-14 01:20:43,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 110 transitions, 366 flow [2025-03-14 01:20:43,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:20:43,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:20:43,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2025-03-14 01:20:43,430 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7531806615776081 [2025-03-14 01:20:43,430 INFO L175 Difference]: Start difference. First operand has 148 places, 131 transitions, 350 flow. Second operand 3 states and 296 transitions. [2025-03-14 01:20:43,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 110 transitions, 366 flow [2025-03-14 01:20:43,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 110 transitions, 324 flow, removed 21 selfloop flow, removed 0 redundant places. [2025-03-14 01:20:43,488 INFO L231 Difference]: Finished difference. Result has 129 places, 110 transitions, 270 flow [2025-03-14 01:20:43,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=129, PETRI_TRANSITIONS=110} [2025-03-14 01:20:43,490 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, -19 predicate places. [2025-03-14 01:20:43,491 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 110 transitions, 270 flow [2025-03-14 01:20:43,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:43,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:20:43,491 INFO L206 CegarLoopForPetriNet]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:20:43,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:20:43,491 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-14 01:20:43,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:20:43,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1466527387, now seen corresponding path program 1 times [2025-03-14 01:20:43,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:20:43,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502045610] [2025-03-14 01:20:43,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:20:43,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:20:43,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-14 01:20:43,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-14 01:20:43,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:43,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:20:43,511 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:20:43,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-14 01:20:43,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-14 01:20:43,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:43,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:20:43,535 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:20:43,537 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:20:43,537 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 20 remaining) [2025-03-14 01:20:43,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (18 of 20 remaining) [2025-03-14 01:20:43,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (17 of 20 remaining) [2025-03-14 01:20:43,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 20 remaining) [2025-03-14 01:20:43,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (15 of 20 remaining) [2025-03-14 01:20:43,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (14 of 20 remaining) [2025-03-14 01:20:43,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 20 remaining) [2025-03-14 01:20:43,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 20 remaining) [2025-03-14 01:20:43,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 20 remaining) [2025-03-14 01:20:43,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (10 of 20 remaining) [2025-03-14 01:20:43,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 20 remaining) [2025-03-14 01:20:43,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 20 remaining) [2025-03-14 01:20:43,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 20 remaining) [2025-03-14 01:20:43,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 20 remaining) [2025-03-14 01:20:43,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 20 remaining) [2025-03-14 01:20:43,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 20 remaining) [2025-03-14 01:20:43,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 20 remaining) [2025-03-14 01:20:43,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 20 remaining) [2025-03-14 01:20:43,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 20 remaining) [2025-03-14 01:20:43,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 20 remaining) [2025-03-14 01:20:43,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:20:43,540 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-14 01:20:43,540 WARN L246 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:20:43,540 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2025-03-14 01:20:43,572 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:20:43,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 144 transitions, 396 flow [2025-03-14 01:20:43,586 INFO L124 PetriNetUnfolderBase]: 0/207 cut-off events. [2025-03-14 01:20:43,587 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2025-03-14 01:20:43,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 207 events. 0/207 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 625 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 0. Up to 10 conditions per place. [2025-03-14 01:20:43,587 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 144 transitions, 396 flow [2025-03-14 01:20:43,588 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 163 places, 144 transitions, 396 flow [2025-03-14 01:20:43,589 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:20:43,590 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;@7dd2f01d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:20:43,590 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-14 01:20:43,591 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:20:43,591 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-03-14 01:20:43,591 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:20:43,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:20:43,592 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:20:43,592 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 18 more)] === [2025-03-14 01:20:43,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:20:43,592 INFO L85 PathProgramCache]: Analyzing trace with hash 542101793, now seen corresponding path program 1 times [2025-03-14 01:20:43,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:20:43,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189631440] [2025-03-14 01:20:43,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:20:43,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:20:43,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-14 01:20:43,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-14 01:20:43,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:43,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:20:43,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:20:43,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:20:43,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189631440] [2025-03-14 01:20:43,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189631440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:20:43,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:20:43,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:20:43,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429018332] [2025-03-14 01:20:43,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:20:43,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:20:43,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:20:43,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:20:43,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:20:43,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 144 [2025-03-14 01:20:43,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 144 transitions, 396 flow. Second operand has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:43,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:20:43,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 144 [2025-03-14 01:20:43,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand