./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-lit/qw2004-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-lit/qw2004-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3fb83c29fe591f537beeb8acce355ea986d79a29cfcecdcee0a9fb1725d601d1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:26:33,777 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:26:33,816 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:26:33,819 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:26:33,820 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:26:33,834 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:26:33,834 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:26:33,834 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:26:33,835 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:26:33,835 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:26:33,835 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:26:33,835 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:26:33,835 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:26:33,835 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:26:33,835 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:26:33,836 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:26:33,836 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:26:33,836 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:26:33,836 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:26:33,836 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:26:33,836 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:26:33,836 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:26:33,836 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:26:33,836 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:26:33,836 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:26:33,836 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:26:33,836 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:26:33,836 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:26:33,836 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:26:33,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:26:33,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:26:33,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:26:33,837 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:26:33,837 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:26:33,837 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:26:33,837 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:26:33,837 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:26:33,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:26:33,837 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:26:33,837 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:26:33,837 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:26:33,837 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:26:33,837 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3fb83c29fe591f537beeb8acce355ea986d79a29cfcecdcee0a9fb1725d601d1 [2025-02-08 05:26:34,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:26:34,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:26:34,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:26:34,027 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:26:34,028 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:26:34,028 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-lit/qw2004-1.i [2025-02-08 05:26:35,240 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a0320388d/eb2c13529c4a4605863d5d05278b5f9f/FLAGfa0db7280 [2025-02-08 05:26:35,587 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:26:35,588 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-lit/qw2004-1.i [2025-02-08 05:26:35,596 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a0320388d/eb2c13529c4a4605863d5d05278b5f9f/FLAGfa0db7280 [2025-02-08 05:26:35,832 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a0320388d/eb2c13529c4a4605863d5d05278b5f9f [2025-02-08 05:26:35,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:26:35,838 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:26:35,839 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:26:35,842 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:26:35,845 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:26:35,846 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:26:35" (1/1) ... [2025-02-08 05:26:35,850 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f773c06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:35, skipping insertion in model container [2025-02-08 05:26:35,850 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:26:35" (1/1) ... [2025-02-08 05:26:35,871 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:26:36,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:26:36,139 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:26:36,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:26:36,208 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:26:36,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:36 WrapperNode [2025-02-08 05:26:36,209 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:26:36,210 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:26:36,210 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:26:36,210 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:26:36,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:36" (1/1) ... [2025-02-08 05:26:36,225 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:36" (1/1) ... [2025-02-08 05:26:36,245 INFO L138 Inliner]: procedures = 174, calls = 20, calls flagged for inlining = 10, calls inlined = 11, statements flattened = 155 [2025-02-08 05:26:36,246 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:26:36,247 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:26:36,247 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:26:36,247 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:26:36,251 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:36" (1/1) ... [2025-02-08 05:26:36,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:36" (1/1) ... [2025-02-08 05:26:36,253 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:36" (1/1) ... [2025-02-08 05:26:36,255 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:36" (1/1) ... [2025-02-08 05:26:36,258 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:36" (1/1) ... [2025-02-08 05:26:36,263 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:36" (1/1) ... [2025-02-08 05:26:36,264 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:36" (1/1) ... [2025-02-08 05:26:36,264 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:36" (1/1) ... [2025-02-08 05:26:36,265 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:26:36,266 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:26:36,266 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:26:36,266 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:26:36,270 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:36" (1/1) ... [2025-02-08 05:26:36,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:26:36,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:26:36,302 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:26:36,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:26:36,333 INFO L130 BoogieDeclarations]: Found specification of procedure BCSP_PnpStop [2025-02-08 05:26:36,333 INFO L138 BoogieDeclarations]: Found implementation of procedure BCSP_PnpStop [2025-02-08 05:26:36,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 05:26:36,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:26:36,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:26:36,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 05:26:36,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:26:36,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:26:36,335 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:26:36,439 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:26:36,441 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:26:36,657 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730: havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; [2025-02-08 05:26:36,657 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-1: havoc __VERIFIER_assert_~cond#1; [2025-02-08 05:26:36,658 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:26:36,659 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:26:36,729 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:26:36,730 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:26:36,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:26:36 BoogieIcfgContainer [2025-02-08 05:26:36,730 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:26:36,732 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:26:36,732 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:26:36,735 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:26:36,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:26:35" (1/3) ... [2025-02-08 05:26:36,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@374e6b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:26:36, skipping insertion in model container [2025-02-08 05:26:36,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:36" (2/3) ... [2025-02-08 05:26:36,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@374e6b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:26:36, skipping insertion in model container [2025-02-08 05:26:36,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:26:36" (3/3) ... [2025-02-08 05:26:36,737 INFO L128 eAbstractionObserver]: Analyzing ICFG qw2004-1.i [2025-02-08 05:26:36,758 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:26:36,762 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG qw2004-1.i that has 2 procedures, 156 locations, 1 initial locations, 0 loop locations, and 19 error locations. [2025-02-08 05:26:36,763 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:26:36,810 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:26:36,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 160 transitions, 324 flow [2025-02-08 05:26:36,898 INFO L124 PetriNetUnfolderBase]: 5/159 cut-off events. [2025-02-08 05:26:36,900 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:26:36,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 159 events. 5/159 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 280 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 118. Up to 2 conditions per place. [2025-02-08 05:26:36,905 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 160 transitions, 324 flow [2025-02-08 05:26:36,908 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 159 transitions, 321 flow [2025-02-08 05:26:36,914 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:26:36,922 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;@6e8c18eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:26:36,922 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-02-08 05:26:36,927 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:26:36,927 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2025-02-08 05:26:36,927 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:26:36,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:36,928 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:26:36,928 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-08 05:26:36,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:36,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1988996391, now seen corresponding path program 1 times [2025-02-08 05:26:36,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:36,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162375593] [2025-02-08 05:26:36,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:36,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:36,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 05:26:36,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 05:26:36,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:36,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:37,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:26:37,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:37,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162375593] [2025-02-08 05:26:37,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162375593] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:37,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:37,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:37,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787381324] [2025-02-08 05:26:37,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:37,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:37,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:37,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:37,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:37,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 160 [2025-02-08 05:26:37,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 159 transitions, 321 flow. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:37,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:37,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 160 [2025-02-08 05:26:37,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:37,169 INFO L124 PetriNetUnfolderBase]: 7/198 cut-off events. [2025-02-08 05:26:37,169 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:26:37,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 198 events. 7/198 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 503 event pairs, 4 based on Foata normal form. 7/184 useless extension candidates. Maximal degree in co-relation 171. Up to 18 conditions per place. [2025-02-08 05:26:37,172 INFO L140 encePairwiseOnDemand]: 145/160 looper letters, 9 selfloop transitions, 2 changer transitions 0/144 dead transitions. [2025-02-08 05:26:37,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 144 transitions, 313 flow [2025-02-08 05:26:37,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:37,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:37,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2025-02-08 05:26:37,182 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.89375 [2025-02-08 05:26:37,183 INFO L175 Difference]: Start difference. First operand has 158 places, 159 transitions, 321 flow. Second operand 3 states and 429 transitions. [2025-02-08 05:26:37,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 144 transitions, 313 flow [2025-02-08 05:26:37,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 144 transitions, 312 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:26:37,189 INFO L231 Difference]: Finished difference. Result has 147 places, 144 transitions, 294 flow [2025-02-08 05:26:37,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=294, PETRI_PLACES=147, PETRI_TRANSITIONS=144} [2025-02-08 05:26:37,194 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, -11 predicate places. [2025-02-08 05:26:37,194 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 144 transitions, 294 flow [2025-02-08 05:26:37,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:37,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:37,195 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] [2025-02-08 05:26:37,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:26:37,195 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-08 05:26:37,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:37,196 INFO L85 PathProgramCache]: Analyzing trace with hash 524888933, now seen corresponding path program 1 times [2025-02-08 05:26:37,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:37,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577395332] [2025-02-08 05:26:37,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:37,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:37,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 05:26:37,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 05:26:37,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:37,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:37,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:26:37,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:37,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577395332] [2025-02-08 05:26:37,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577395332] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:37,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:37,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:37,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527207327] [2025-02-08 05:26:37,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:37,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:37,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:37,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:37,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:37,248 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 160 [2025-02-08 05:26:37,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 144 transitions, 294 flow. Second operand has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:37,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:37,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 160 [2025-02-08 05:26:37,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:37,310 INFO L124 PetriNetUnfolderBase]: 14/319 cut-off events. [2025-02-08 05:26:37,311 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:26:37,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354 conditions, 319 events. 14/319 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1054 event pairs, 8 based on Foata normal form. 0/274 useless extension candidates. Maximal degree in co-relation 330. Up to 27 conditions per place. [2025-02-08 05:26:37,315 INFO L140 encePairwiseOnDemand]: 157/160 looper letters, 10 selfloop transitions, 2 changer transitions 0/143 dead transitions. [2025-02-08 05:26:37,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 143 transitions, 316 flow [2025-02-08 05:26:37,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:37,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:37,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2025-02-08 05:26:37,319 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8645833333333334 [2025-02-08 05:26:37,319 INFO L175 Difference]: Start difference. First operand has 147 places, 144 transitions, 294 flow. Second operand 3 states and 415 transitions. [2025-02-08 05:26:37,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 143 transitions, 316 flow [2025-02-08 05:26:37,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 143 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:37,324 INFO L231 Difference]: Finished difference. Result has 146 places, 143 transitions, 292 flow [2025-02-08 05:26:37,324 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=292, PETRI_PLACES=146, PETRI_TRANSITIONS=143} [2025-02-08 05:26:37,326 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, -12 predicate places. [2025-02-08 05:26:37,326 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 143 transitions, 292 flow [2025-02-08 05:26:37,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:37,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:37,327 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] [2025-02-08 05:26:37,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:26:37,327 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-08 05:26:37,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:37,328 INFO L85 PathProgramCache]: Analyzing trace with hash 580681881, now seen corresponding path program 1 times [2025-02-08 05:26:37,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:37,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376042911] [2025-02-08 05:26:37,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:37,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:37,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 05:26:37,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 05:26:37,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:37,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:37,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:26:37,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:37,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376042911] [2025-02-08 05:26:37,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376042911] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:37,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:37,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:37,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134781089] [2025-02-08 05:26:37,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:37,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:37,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:37,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:37,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:37,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 160 [2025-02-08 05:26:37,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 143 transitions, 292 flow. Second operand has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:37,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:37,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 160 [2025-02-08 05:26:37,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:37,471 INFO L124 PetriNetUnfolderBase]: 20/307 cut-off events. [2025-02-08 05:26:37,471 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:26:37,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 307 events. 20/307 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1263 event pairs, 15 based on Foata normal form. 0/276 useless extension candidates. Maximal degree in co-relation 329. Up to 43 conditions per place. [2025-02-08 05:26:37,476 INFO L140 encePairwiseOnDemand]: 157/160 looper letters, 12 selfloop transitions, 2 changer transitions 0/142 dead transitions. [2025-02-08 05:26:37,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 142 transitions, 318 flow [2025-02-08 05:26:37,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:37,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:37,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 411 transitions. [2025-02-08 05:26:37,478 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.85625 [2025-02-08 05:26:37,478 INFO L175 Difference]: Start difference. First operand has 146 places, 143 transitions, 292 flow. Second operand 3 states and 411 transitions. [2025-02-08 05:26:37,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 142 transitions, 318 flow [2025-02-08 05:26:37,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 142 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:37,482 INFO L231 Difference]: Finished difference. Result has 145 places, 142 transitions, 290 flow [2025-02-08 05:26:37,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=290, PETRI_PLACES=145, PETRI_TRANSITIONS=142} [2025-02-08 05:26:37,486 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, -13 predicate places. [2025-02-08 05:26:37,486 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 142 transitions, 290 flow [2025-02-08 05:26:37,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:37,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:37,487 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] [2025-02-08 05:26:37,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:26:37,487 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-08 05:26:37,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:37,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1570716366, now seen corresponding path program 1 times [2025-02-08 05:26:37,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:37,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395181036] [2025-02-08 05:26:37,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:37,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:37,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 05:26:37,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 05:26:37,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:37,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:37,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:26:37,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:37,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395181036] [2025-02-08 05:26:37,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395181036] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:37,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:37,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:37,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368781050] [2025-02-08 05:26:37,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:37,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:37,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:37,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:37,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:37,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 160 [2025-02-08 05:26:37,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 142 transitions, 290 flow. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:37,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:37,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 160 [2025-02-08 05:26:37,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:37,631 INFO L124 PetriNetUnfolderBase]: 14/251 cut-off events. [2025-02-08 05:26:37,631 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:26:37,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 291 conditions, 251 events. 14/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 790 event pairs, 10 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 257. Up to 32 conditions per place. [2025-02-08 05:26:37,632 INFO L140 encePairwiseOnDemand]: 157/160 looper letters, 11 selfloop transitions, 2 changer transitions 0/141 dead transitions. [2025-02-08 05:26:37,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 141 transitions, 314 flow [2025-02-08 05:26:37,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:37,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:37,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 413 transitions. [2025-02-08 05:26:37,634 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8604166666666667 [2025-02-08 05:26:37,634 INFO L175 Difference]: Start difference. First operand has 145 places, 142 transitions, 290 flow. Second operand 3 states and 413 transitions. [2025-02-08 05:26:37,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 141 transitions, 314 flow [2025-02-08 05:26:37,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 141 transitions, 310 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:37,636 INFO L231 Difference]: Finished difference. Result has 144 places, 141 transitions, 288 flow [2025-02-08 05:26:37,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=288, PETRI_PLACES=144, PETRI_TRANSITIONS=141} [2025-02-08 05:26:37,637 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, -14 predicate places. [2025-02-08 05:26:37,637 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 141 transitions, 288 flow [2025-02-08 05:26:37,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:37,638 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:37,638 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] [2025-02-08 05:26:37,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:26:37,638 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-08 05:26:37,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:37,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1457633330, now seen corresponding path program 1 times [2025-02-08 05:26:37,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:37,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978440497] [2025-02-08 05:26:37,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:37,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:37,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 05:26:37,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 05:26:37,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:37,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:37,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:26:37,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:37,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978440497] [2025-02-08 05:26:37,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978440497] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:37,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:37,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:37,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135579931] [2025-02-08 05:26:37,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:37,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:37,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:37,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:37,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:37,714 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 160 [2025-02-08 05:26:37,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 141 transitions, 288 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:37,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:37,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 160 [2025-02-08 05:26:37,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:37,752 INFO L124 PetriNetUnfolderBase]: 26/411 cut-off events. [2025-02-08 05:26:37,753 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:26:37,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 411 events. 26/411 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2018 event pairs, 9 based on Foata normal form. 0/357 useless extension candidates. Maximal degree in co-relation 431. Up to 40 conditions per place. [2025-02-08 05:26:37,755 INFO L140 encePairwiseOnDemand]: 154/160 looper letters, 11 selfloop transitions, 5 changer transitions 0/146 dead transitions. [2025-02-08 05:26:37,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 146 transitions, 330 flow [2025-02-08 05:26:37,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:37,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:37,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2025-02-08 05:26:37,756 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8854166666666666 [2025-02-08 05:26:37,756 INFO L175 Difference]: Start difference. First operand has 144 places, 141 transitions, 288 flow. Second operand 3 states and 425 transitions. [2025-02-08 05:26:37,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 146 transitions, 330 flow [2025-02-08 05:26:37,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 146 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:37,759 INFO L231 Difference]: Finished difference. Result has 146 places, 145 transitions, 322 flow [2025-02-08 05:26:37,759 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=146, PETRI_TRANSITIONS=145} [2025-02-08 05:26:37,760 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, -12 predicate places. [2025-02-08 05:26:37,760 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 145 transitions, 322 flow [2025-02-08 05:26:37,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:37,760 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:37,760 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] [2025-02-08 05:26:37,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:26:37,761 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-08 05:26:37,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:37,761 INFO L85 PathProgramCache]: Analyzing trace with hash 776801933, now seen corresponding path program 1 times [2025-02-08 05:26:37,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:37,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516939801] [2025-02-08 05:26:37,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:37,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:37,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 05:26:37,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 05:26:37,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:37,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:26:37,772 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:26:37,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 05:26:37,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 05:26:37,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:37,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:26:37,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:26:37,799 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:26:37,799 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE (26 of 27 remaining) [2025-02-08 05:26:37,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE (25 of 27 remaining) [2025-02-08 05:26:37,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE (24 of 27 remaining) [2025-02-08 05:26:37,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (23 of 27 remaining) [2025-02-08 05:26:37,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr3ASSERT_VIOLATIONDATA_RACE (22 of 27 remaining) [2025-02-08 05:26:37,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE (21 of 27 remaining) [2025-02-08 05:26:37,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (20 of 27 remaining) [2025-02-08 05:26:37,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE (19 of 27 remaining) [2025-02-08 05:26:37,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (18 of 27 remaining) [2025-02-08 05:26:37,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (17 of 27 remaining) [2025-02-08 05:26:37,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (16 of 27 remaining) [2025-02-08 05:26:37,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (15 of 27 remaining) [2025-02-08 05:26:37,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (14 of 27 remaining) [2025-02-08 05:26:37,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (13 of 27 remaining) [2025-02-08 05:26:37,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (12 of 27 remaining) [2025-02-08 05:26:37,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 27 remaining) [2025-02-08 05:26:37,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 27 remaining) [2025-02-08 05:26:37,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 27 remaining) [2025-02-08 05:26:37,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 27 remaining) [2025-02-08 05:26:37,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 27 remaining) [2025-02-08 05:26:37,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 27 remaining) [2025-02-08 05:26:37,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE (5 of 27 remaining) [2025-02-08 05:26:37,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (4 of 27 remaining) [2025-02-08 05:26:37,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr3ASSERT_VIOLATIONDATA_RACE (3 of 27 remaining) [2025-02-08 05:26:37,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE (2 of 27 remaining) [2025-02-08 05:26:37,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (1 of 27 remaining) [2025-02-08 05:26:37,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE (0 of 27 remaining) [2025-02-08 05:26:37,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:26:37,804 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-08 05:26:37,832 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:26:37,832 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:26:37,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:26:37 BasicIcfg [2025-02-08 05:26:37,836 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:26:37,837 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:26:37,837 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:26:37,837 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:26:37,837 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:26:36" (3/4) ... [2025-02-08 05:26:37,838 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-08 05:26:37,872 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 4. [2025-02-08 05:26:37,905 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:26:37,905 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:26:37,905 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:26:37,906 INFO L158 Benchmark]: Toolchain (without parser) took 2067.83ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 68.7MB in the end (delta: 35.3MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. [2025-02-08 05:26:37,906 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory was 126.5MB in the beginning and 126.2MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:26:37,906 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.36ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 84.3MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:26:37,906 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.57ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 82.2MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:26:37,906 INFO L158 Benchmark]: Boogie Preprocessor took 18.72ms. Allocated memory is still 142.6MB. Free memory was 82.2MB in the beginning and 81.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:26:37,906 INFO L158 Benchmark]: IcfgBuilder took 464.17ms. Allocated memory is still 142.6MB. Free memory was 81.1MB in the beginning and 59.2MB in the end (delta: 22.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:26:37,907 INFO L158 Benchmark]: TraceAbstraction took 1104.39ms. Allocated memory is still 142.6MB. Free memory was 59.2MB in the beginning and 77.2MB in the end (delta: -18.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:26:37,907 INFO L158 Benchmark]: Witness Printer took 68.39ms. Allocated memory is still 142.6MB. Free memory was 77.2MB in the beginning and 68.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:26:37,908 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.20ms. Allocated memory is still 201.3MB. Free memory was 126.5MB in the beginning and 126.2MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 370.36ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 84.3MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.57ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 82.2MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.72ms. Allocated memory is still 142.6MB. Free memory was 82.2MB in the beginning and 81.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 464.17ms. Allocated memory is still 142.6MB. Free memory was 81.1MB in the beginning and 59.2MB in the end (delta: 22.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1104.39ms. Allocated memory is still 142.6MB. Free memory was 59.2MB in the beginning and 77.2MB in the end (delta: -18.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 68.39ms. Allocated memory is still 142.6MB. Free memory was 77.2MB in the beginning and 68.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 736]: Data race detected Data race detected The following path leads to a data race: [L697] 0 volatile int stoppingFlag; VAL [stoppingFlag=0] [L698] 0 volatile int pendingIo; VAL [pendingIo=0, stoppingFlag=0] [L699] 0 volatile int stoppingEvent; VAL [pendingIo=0, stoppingEvent=0, stoppingFlag=0] [L700] 0 volatile int stopped; VAL [pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=0] [L743] 0 pthread_t t; VAL [pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=0] [L744] 0 pendingIo = 1 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L745] 0 stoppingFlag = 0 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L746] 0 stoppingEvent = 0 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L747] 0 stopped = 0 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L748] FCALL, FORK 0 pthread_create(&t, 0, BCSP_PnpStop, 0) VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0, t=-1] [L736] 1 stoppingFlag = 1 VAL [\old(arg)={0:0}, arg={0:0}, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L749] CALL 0 BCSP_PnpAdd(0) [L727] 0 int status; VAL [\old(arg)={0:0}, arg={0:0}, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L728] CALL 0 BCSP_IoIncrement() [L703] 0 \read(stoppingFlag) [L703] 0 \read(stoppingFlag) [L703] COND TRUE 0 \read(stoppingFlag) VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L736] 1 stoppingFlag = 1 VAL [\old(arg)={0:0}, arg={0:0}, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] Now there is a data race on ~stoppingFlag~0 between C: if (stoppingFlag) { __VERIFIER_atomic_end(); return -1; } else { pendingIo = pendingIo + 1; } [703-708] and C: stoppingFlag = 1 [736] - UnprovableResult [Line: 714]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 738]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 723]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 739]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 744]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 745]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 746]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 747]: 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: 707]: 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: 730]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 723]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 748]: 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 3 procedures, 205 locations, 27 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.0s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 79 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17 mSDsluCounter, 25 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 129 IncrementalHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 25 mSDtfsCounter, 129 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=322occurred in iteration=5, InterpolantAutomatonStates: 15, 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.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 192 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 145 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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-02-08 05:26:37,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)