./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.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 cdf629ba70521b99830442583c87012a34d164ca28f01f7e59d76ae2f1e525ff --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:56:22,770 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:56:22,819 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 21:56:22,825 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:56:22,825 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:56:22,839 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:56:22,839 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:56:22,839 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:56:22,840 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:56:22,840 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:56:22,840 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:56:22,840 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:56:22,840 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:56:22,844 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:56:22,844 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:56:22,845 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:56:22,845 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:56:22,845 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:56:22,845 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:56:22,845 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:56:22,845 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:56:22,845 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:56:22,845 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 21:56:22,845 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 21:56:22,845 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:56:22,845 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:56:22,845 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:56:22,845 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:56:22,845 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:56:22,845 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:56:22,845 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:56:22,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:56:22,845 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:56:22,845 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:56:22,845 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:56:22,846 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:56:22,846 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:56:22,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:56:22,846 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:56:22,846 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:56:22,846 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:56:22,846 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:56:22,846 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 -> cdf629ba70521b99830442583c87012a34d164ca28f01f7e59d76ae2f1e525ff [2025-03-08 21:56:23,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:56:23,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:56:23,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:56:23,062 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:56:23,062 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:56:23,063 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i [2025-03-08 21:56:24,188 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bad7559bb/ee4eb0d8203943699a453862616b80f4/FLAGe5b131d71 [2025-03-08 21:56:24,434 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:56:24,434 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i [2025-03-08 21:56:24,444 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bad7559bb/ee4eb0d8203943699a453862616b80f4/FLAGe5b131d71 [2025-03-08 21:56:24,456 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bad7559bb/ee4eb0d8203943699a453862616b80f4 [2025-03-08 21:56:24,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:56:24,460 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:56:24,461 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:56:24,461 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:56:24,465 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:56:24,466 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:56:24" (1/1) ... [2025-03-08 21:56:24,468 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33215fd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:24, skipping insertion in model container [2025-03-08 21:56:24,468 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:56:24" (1/1) ... [2025-03-08 21:56:24,490 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:56:24,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:56:24,752 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:56:24,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:56:24,817 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:56:24,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:24 WrapperNode [2025-03-08 21:56:24,818 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:56:24,818 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:56:24,818 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:56:24,819 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:56:24,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:24" (1/1) ... [2025-03-08 21:56:24,834 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:24" (1/1) ... [2025-03-08 21:56:24,847 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 74 [2025-03-08 21:56:24,848 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:56:24,849 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:56:24,849 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:56:24,849 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:56:24,852 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:24" (1/1) ... [2025-03-08 21:56:24,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:24" (1/1) ... [2025-03-08 21:56:24,854 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:24" (1/1) ... [2025-03-08 21:56:24,854 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:24" (1/1) ... [2025-03-08 21:56:24,857 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:24" (1/1) ... [2025-03-08 21:56:24,857 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:24" (1/1) ... [2025-03-08 21:56:24,858 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:24" (1/1) ... [2025-03-08 21:56:24,858 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:24" (1/1) ... [2025-03-08 21:56:24,862 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:56:24,863 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:56:24,863 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:56:24,863 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:56:24,864 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:24" (1/1) ... [2025-03-08 21:56:24,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:56:24,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:56:24,887 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 21:56:24,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 21:56:24,903 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-03-08 21:56:24,903 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-03-08 21:56:24,903 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-08 21:56:24,903 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-08 21:56:24,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:56:24,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 21:56:24,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:56:24,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:56:24,904 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 21:56:24,990 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:56:24,992 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:56:25,155 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 21:56:25,155 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:56:25,164 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:56:25,165 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 21:56:25,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:56:25 BoogieIcfgContainer [2025-03-08 21:56:25,166 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:56:25,168 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:56:25,168 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:56:25,171 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:56:25,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:56:24" (1/3) ... [2025-03-08 21:56:25,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65073213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:56:25, skipping insertion in model container [2025-03-08 21:56:25,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:24" (2/3) ... [2025-03-08 21:56:25,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65073213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:56:25, skipping insertion in model container [2025-03-08 21:56:25,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:56:25" (3/3) ... [2025-03-08 21:56:25,173 INFO L128 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-1.i [2025-03-08 21:56:25,182 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:56:25,183 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nondet-loop-bound-1.i that has 3 procedures, 106 locations, 1 initial locations, 1 loop locations, and 9 error locations. [2025-03-08 21:56:25,184 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 21:56:25,226 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 21:56:25,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 111 transitions, 230 flow [2025-03-08 21:56:25,302 INFO L124 PetriNetUnfolderBase]: 6/124 cut-off events. [2025-03-08 21:56:25,307 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:56:25,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 124 events. 6/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 181 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 92. Up to 4 conditions per place. [2025-03-08 21:56:25,311 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 111 transitions, 230 flow [2025-03-08 21:56:25,313 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 110 transitions, 227 flow [2025-03-08 21:56:25,318 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:56:25,325 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;@7f147c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:56:25,325 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-08 21:56:25,330 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:56:25,332 INFO L124 PetriNetUnfolderBase]: 0/19 cut-off events. [2025-03-08 21:56:25,332 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:56:25,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:56:25,332 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:56:25,333 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-08 21:56:25,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:56:25,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1575499532, now seen corresponding path program 1 times [2025-03-08 21:56:25,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:56:25,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158056665] [2025-03-08 21:56:25,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:56:25,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:56:25,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 21:56:25,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 21:56:25,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:25,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:56:25,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:56:25,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:56:25,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158056665] [2025-03-08 21:56:25,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158056665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:56:25,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:56:25,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:56:25,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924677888] [2025-03-08 21:56:25,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:56:25,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:56:25,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:56:25,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:56:25,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:56:25,515 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 111 [2025-03-08 21:56:25,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 110 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:25,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:56:25,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 111 [2025-03-08 21:56:25,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:56:25,582 INFO L124 PetriNetUnfolderBase]: 12/229 cut-off events. [2025-03-08 21:56:25,582 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 21:56:25,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 229 events. 12/229 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 795 event pairs, 11 based on Foata normal form. 18/205 useless extension candidates. Maximal degree in co-relation 209. Up to 31 conditions per place. [2025-03-08 21:56:25,584 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 9 selfloop transitions, 2 changer transitions 1/103 dead transitions. [2025-03-08 21:56:25,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 103 transitions, 235 flow [2025-03-08 21:56:25,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:56:25,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:56:25,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2025-03-08 21:56:25,600 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8948948948948949 [2025-03-08 21:56:25,601 INFO L175 Difference]: Start difference. First operand has 111 places, 110 transitions, 227 flow. Second operand 3 states and 298 transitions. [2025-03-08 21:56:25,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 103 transitions, 235 flow [2025-03-08 21:56:25,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 103 transitions, 234 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:56:25,610 INFO L231 Difference]: Finished difference. Result has 109 places, 102 transitions, 214 flow [2025-03-08 21:56:25,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=109, PETRI_TRANSITIONS=102} [2025-03-08 21:56:25,614 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, -2 predicate places. [2025-03-08 21:56:25,614 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 102 transitions, 214 flow [2025-03-08 21:56:25,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:25,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:56:25,614 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:56:25,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:56:25,614 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-08 21:56:25,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:56:25,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1848836055, now seen corresponding path program 1 times [2025-03-08 21:56:25,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:56:25,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434538813] [2025-03-08 21:56:25,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:56:25,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:56:25,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 21:56:25,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 21:56:25,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:25,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:56:25,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:56:25,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:56:25,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434538813] [2025-03-08 21:56:25,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434538813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:56:25,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:56:25,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:56:25,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466616109] [2025-03-08 21:56:25,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:56:25,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:56:25,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:56:25,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:56:25,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:56:25,692 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 111 [2025-03-08 21:56:25,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 102 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:25,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:56:25,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 111 [2025-03-08 21:56:25,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:56:25,725 INFO L124 PetriNetUnfolderBase]: 6/184 cut-off events. [2025-03-08 21:56:25,725 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 21:56:25,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 184 events. 6/184 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 520 event pairs, 5 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 193. Up to 23 conditions per place. [2025-03-08 21:56:25,727 INFO L140 encePairwiseOnDemand]: 108/111 looper letters, 10 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2025-03-08 21:56:25,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 101 transitions, 236 flow [2025-03-08 21:56:25,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:56:25,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:56:25,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2025-03-08 21:56:25,729 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8768768768768769 [2025-03-08 21:56:25,729 INFO L175 Difference]: Start difference. First operand has 109 places, 102 transitions, 214 flow. Second operand 3 states and 292 transitions. [2025-03-08 21:56:25,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 101 transitions, 236 flow [2025-03-08 21:56:25,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 101 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:56:25,731 INFO L231 Difference]: Finished difference. Result has 107 places, 101 transitions, 212 flow [2025-03-08 21:56:25,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=212, PETRI_PLACES=107, PETRI_TRANSITIONS=101} [2025-03-08 21:56:25,732 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, -4 predicate places. [2025-03-08 21:56:25,732 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 101 transitions, 212 flow [2025-03-08 21:56:25,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:25,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:56:25,732 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:56:25,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:56:25,733 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-08 21:56:25,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:56:25,733 INFO L85 PathProgramCache]: Analyzing trace with hash -440048971, now seen corresponding path program 1 times [2025-03-08 21:56:25,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:56:25,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965291238] [2025-03-08 21:56:25,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:56:25,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:56:25,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 21:56:25,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 21:56:25,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:25,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:56:25,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:56:25,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:56:25,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965291238] [2025-03-08 21:56:25,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965291238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:56:25,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:56:25,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:56:25,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189654694] [2025-03-08 21:56:25,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:56:25,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:56:25,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:56:25,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:56:25,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:56:25,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 111 [2025-03-08 21:56:25,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 101 transitions, 212 flow. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:25,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:56:25,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 111 [2025-03-08 21:56:25,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:56:25,824 INFO L124 PetriNetUnfolderBase]: 11/218 cut-off events. [2025-03-08 21:56:25,824 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 21:56:25,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 218 events. 11/218 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 791 event pairs, 10 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 231. Up to 32 conditions per place. [2025-03-08 21:56:25,825 INFO L140 encePairwiseOnDemand]: 106/111 looper letters, 10 selfloop transitions, 1 changer transitions 0/97 dead transitions. [2025-03-08 21:56:25,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 97 transitions, 226 flow [2025-03-08 21:56:25,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:56:25,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:56:25,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions. [2025-03-08 21:56:25,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8648648648648649 [2025-03-08 21:56:25,830 INFO L175 Difference]: Start difference. First operand has 107 places, 101 transitions, 212 flow. Second operand 3 states and 288 transitions. [2025-03-08 21:56:25,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 97 transitions, 226 flow [2025-03-08 21:56:25,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 97 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:56:25,832 INFO L231 Difference]: Finished difference. Result has 103 places, 97 transitions, 202 flow [2025-03-08 21:56:25,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=103, PETRI_TRANSITIONS=97} [2025-03-08 21:56:25,832 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, -8 predicate places. [2025-03-08 21:56:25,832 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 97 transitions, 202 flow [2025-03-08 21:56:25,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:25,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:56:25,833 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:56:25,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:56:25,833 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-08 21:56:25,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:56:25,834 INFO L85 PathProgramCache]: Analyzing trace with hash 850059090, now seen corresponding path program 1 times [2025-03-08 21:56:25,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:56:25,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592987688] [2025-03-08 21:56:25,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:56:25,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:56:25,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 21:56:25,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 21:56:25,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:25,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:56:25,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:56:25,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:56:25,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592987688] [2025-03-08 21:56:25,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592987688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:56:25,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:56:25,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:56:25,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100744302] [2025-03-08 21:56:25,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:56:25,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:56:25,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:56:25,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:56:25,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:56:25,925 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 111 [2025-03-08 21:56:25,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 97 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:25,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:56:25,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 111 [2025-03-08 21:56:25,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:56:25,949 INFO L124 PetriNetUnfolderBase]: 8/175 cut-off events. [2025-03-08 21:56:25,949 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 21:56:25,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 175 events. 8/175 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 491 event pairs, 2 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 180. Up to 19 conditions per place. [2025-03-08 21:56:25,951 INFO L140 encePairwiseOnDemand]: 105/111 looper letters, 9 selfloop transitions, 4 changer transitions 0/100 dead transitions. [2025-03-08 21:56:25,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 100 transitions, 237 flow [2025-03-08 21:56:25,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:56:25,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:56:25,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2025-03-08 21:56:25,953 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9099099099099099 [2025-03-08 21:56:25,953 INFO L175 Difference]: Start difference. First operand has 103 places, 97 transitions, 202 flow. Second operand 3 states and 303 transitions. [2025-03-08 21:56:25,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 100 transitions, 237 flow [2025-03-08 21:56:25,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 100 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:56:25,956 INFO L231 Difference]: Finished difference. Result has 105 places, 99 transitions, 229 flow [2025-03-08 21:56:25,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=229, PETRI_PLACES=105, PETRI_TRANSITIONS=99} [2025-03-08 21:56:25,958 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, -6 predicate places. [2025-03-08 21:56:25,958 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 99 transitions, 229 flow [2025-03-08 21:56:25,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:25,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:56:25,958 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:56:25,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:56:25,958 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-08 21:56:25,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:56:25,959 INFO L85 PathProgramCache]: Analyzing trace with hash 654261382, now seen corresponding path program 1 times [2025-03-08 21:56:25,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:56:25,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678660573] [2025-03-08 21:56:25,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:56:25,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:56:25,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 21:56:25,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 21:56:25,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:25,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:56:26,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:56:26,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:56:26,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678660573] [2025-03-08 21:56:26,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678660573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:56:26,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:56:26,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:56:26,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117301744] [2025-03-08 21:56:26,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:56:26,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:56:26,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:56:26,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:56:26,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:56:26,033 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 111 [2025-03-08 21:56:26,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 99 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:26,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:56:26,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 111 [2025-03-08 21:56:26,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:56:26,060 INFO L124 PetriNetUnfolderBase]: 7/210 cut-off events. [2025-03-08 21:56:26,061 INFO L125 PetriNetUnfolderBase]: For 23/25 co-relation queries the response was YES. [2025-03-08 21:56:26,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 210 events. 7/210 cut-off events. For 23/25 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 686 event pairs, 2 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 247. Up to 23 conditions per place. [2025-03-08 21:56:26,062 INFO L140 encePairwiseOnDemand]: 106/111 looper letters, 11 selfloop transitions, 4 changer transitions 0/102 dead transitions. [2025-03-08 21:56:26,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 102 transitions, 269 flow [2025-03-08 21:56:26,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:56:26,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:56:26,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 302 transitions. [2025-03-08 21:56:26,064 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9069069069069069 [2025-03-08 21:56:26,064 INFO L175 Difference]: Start difference. First operand has 105 places, 99 transitions, 229 flow. Second operand 3 states and 302 transitions. [2025-03-08 21:56:26,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 102 transitions, 269 flow [2025-03-08 21:56:26,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 102 transitions, 259 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:56:26,066 INFO L231 Difference]: Finished difference. Result has 107 places, 102 transitions, 253 flow [2025-03-08 21:56:26,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=253, PETRI_PLACES=107, PETRI_TRANSITIONS=102} [2025-03-08 21:56:26,068 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, -4 predicate places. [2025-03-08 21:56:26,069 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 102 transitions, 253 flow [2025-03-08 21:56:26,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:26,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:56:26,069 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:56:26,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:56:26,069 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-08 21:56:26,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:56:26,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1086289045, now seen corresponding path program 1 times [2025-03-08 21:56:26,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:56:26,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095826227] [2025-03-08 21:56:26,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:56:26,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:56:26,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 21:56:26,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 21:56:26,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:26,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:56:26,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:56:26,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:56:26,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095826227] [2025-03-08 21:56:26,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095826227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:56:26,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:56:26,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:56:26,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579762941] [2025-03-08 21:56:26,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:56:26,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 21:56:26,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:56:26,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 21:56:26,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:56:26,209 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 111 [2025-03-08 21:56:26,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 102 transitions, 253 flow. Second operand has 5 states, 5 states have (on average 92.4) internal successors, (462), 5 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:26,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:56:26,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 111 [2025-03-08 21:56:26,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:56:26,251 INFO L124 PetriNetUnfolderBase]: 4/197 cut-off events. [2025-03-08 21:56:26,252 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-08 21:56:26,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 197 events. 4/197 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 581 event pairs, 1 based on Foata normal form. 1/186 useless extension candidates. Maximal degree in co-relation 236. Up to 16 conditions per place. [2025-03-08 21:56:26,254 INFO L140 encePairwiseOnDemand]: 107/111 looper letters, 14 selfloop transitions, 0 changer transitions 4/105 dead transitions. [2025-03-08 21:56:26,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 105 transitions, 295 flow [2025-03-08 21:56:26,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:56:26,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 21:56:26,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 469 transitions. [2025-03-08 21:56:26,255 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8450450450450451 [2025-03-08 21:56:26,255 INFO L175 Difference]: Start difference. First operand has 107 places, 102 transitions, 253 flow. Second operand 5 states and 469 transitions. [2025-03-08 21:56:26,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 105 transitions, 295 flow [2025-03-08 21:56:26,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 105 transitions, 287 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:56:26,257 INFO L231 Difference]: Finished difference. Result has 112 places, 101 transitions, 249 flow [2025-03-08 21:56:26,257 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=249, PETRI_PLACES=112, PETRI_TRANSITIONS=101} [2025-03-08 21:56:26,259 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 1 predicate places. [2025-03-08 21:56:26,259 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 101 transitions, 249 flow [2025-03-08 21:56:26,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.4) internal successors, (462), 5 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:26,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:56:26,260 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:56:26,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:56:26,260 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-08 21:56:26,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:56:26,261 INFO L85 PathProgramCache]: Analyzing trace with hash -361098031, now seen corresponding path program 1 times [2025-03-08 21:56:26,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:56:26,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415273045] [2025-03-08 21:56:26,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:56:26,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:56:26,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 21:56:26,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 21:56:26,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:26,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:56:26,284 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 21:56:26,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 21:56:26,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 21:56:26,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:26,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:56:26,317 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 21:56:26,318 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 21:56:26,318 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining) [2025-03-08 21:56:26,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2025-03-08 21:56:26,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2025-03-08 21:56:26,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2025-03-08 21:56:26,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2025-03-08 21:56:26,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2025-03-08 21:56:26,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2025-03-08 21:56:26,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2025-03-08 21:56:26,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2025-03-08 21:56:26,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2025-03-08 21:56:26,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2025-03-08 21:56:26,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 15 remaining) [2025-03-08 21:56:26,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2025-03-08 21:56:26,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2025-03-08 21:56:26,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2025-03-08 21:56:26,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 21:56:26,321 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:56:26,371 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 21:56:26,371 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 21:56:26,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:56:26 BasicIcfg [2025-03-08 21:56:26,376 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 21:56:26,377 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 21:56:26,377 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 21:56:26,377 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 21:56:26,378 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:56:25" (3/4) ... [2025-03-08 21:56:26,378 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 21:56:26,428 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 6. [2025-03-08 21:56:26,461 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 21:56:26,462 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 21:56:26,462 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 21:56:26,463 INFO L158 Benchmark]: Toolchain (without parser) took 2002.22ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 63.1MB in the end (delta: 48.4MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. [2025-03-08 21:56:26,463 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:56:26,464 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.79ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 91.6MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 21:56:26,464 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.99ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 90.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:56:26,466 INFO L158 Benchmark]: Boogie Preprocessor took 13.44ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 89.3MB in the end (delta: 821.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 21:56:26,466 INFO L158 Benchmark]: IcfgBuilder took 303.42ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 74.4MB in the end (delta: 14.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 21:56:26,466 INFO L158 Benchmark]: TraceAbstraction took 1208.64ms. Allocated memory is still 142.6MB. Free memory was 73.9MB in the beginning and 74.4MB in the end (delta: -538.9kB). Peak memory consumption was 1.5MB. Max. memory is 16.1GB. [2025-03-08 21:56:26,466 INFO L158 Benchmark]: Witness Printer took 84.74ms. Allocated memory is still 142.6MB. Free memory was 74.4MB in the beginning and 63.1MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 21:56:26,467 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 356.79ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 91.6MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.99ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 90.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 13.44ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 89.3MB in the end (delta: 821.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 303.42ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 74.4MB in the end (delta: 14.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1208.64ms. Allocated memory is still 142.6MB. Free memory was 73.9MB in the beginning and 74.4MB in the end (delta: -538.9kB). Peak memory consumption was 1.5MB. Max. memory is 16.1GB. * Witness Printer took 84.74ms. Allocated memory is still 142.6MB. Free memory was 74.4MB in the beginning and 63.1MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 693]: Data race detected Data race detected The following path leads to a data race: [L690] 0 volatile int x; VAL [x=0] [L691] 0 volatile int n; VAL [n=0, x=0] [L701] 0 pthread_t t1, t2; VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=0, x=0] [L702] 0 int i; VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=0, x=0] [L703] 0 x = 0 VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=0, x=0] [L704] 0 n = __VERIFIER_nondet_uint() VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=39, x=0] [L705] EXPR 0 n >= 20 VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=39, x=0] [L705] EXPR 0 n >= 20 && n < 40 VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=39, x=0] [L705] EXPR 0 n < 40 VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=39, x=0] [L705] EXPR 0 n >= 20 && n < 40 VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=39, x=0] [L705] CALL 0 assume_abort_if_not(n >= 20 && n < 40) [L687] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, n=39, x=0] [L705] RET 0 assume_abort_if_not(n >= 20 && n < 40) [L706] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=39, t1=-1, x=0] [L707] 0 i = 0 VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, i=0, n=39, t1=-1, x=0] [L707] COND TRUE 0 i < n [L707] 0 i < n VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, i=0, n=39, t1=-1, x=0] [L707] COND TRUE 0 i < n VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, i=0, n=39, t1=-1, x=0] [L708] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [\old(arg)={0:0}, \old(argc)=52, \old(argv)={53:51}, argc=52, i=0, n=39, t1=-1, t2=0, x=0] [L696] 2 int t; VAL [\old(arg)={0:0}, arg={0:0}, n=39, x=0] [L693] 1 x < n VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, n=39, x=0] [L697] 2 t = x VAL [\old(arg)={0:0}, arg={0:0}, n=39, t=0, x=0] [L698] 2 x = t + 1 VAL [\old(arg)={0:0}, arg={0:0}, n=39, t=0, x=1] [L693] 1 x < n VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, n=39, t=0, x=1] Now there is a data race on ~x~0 between C: x = t + 1 [698] and C: x < n [693] - UnprovableResult [Line: 697]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 704]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 142 locations, 147 edges, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.1s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 147 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 51 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 153 IncrementalHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 27 mSDtfsCounter, 153 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=253occurred in iteration=5, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 308 NumberOfCodeBlocks, 308 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 236 ConstructedInterpolants, 0 QuantifiedInterpolants, 253 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-08 21:56:26,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)