./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-lit/qw2004-2.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-2.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 a0f042164bf78d3595348b117153fa7346585efa21c060e488a9879023a64e1b --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:26:34,598 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:26:34,656 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:34,660 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:26:34,660 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:26:34,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:26:34,672 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:26:34,672 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:26:34,673 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:26:34,673 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:26:34,673 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:26:34,673 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:26:34,673 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:26:34,673 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:26:34,673 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:26:34,673 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:26:34,673 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:26:34,673 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:26:34,673 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:26:34,673 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:26:34,674 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:26:34,674 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:26:34,674 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:26:34,674 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:26:34,674 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:26:34,674 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:26:34,674 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:26:34,674 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:26:34,674 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:26:34,674 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:26:34,674 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:26:34,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:26:34,674 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:26:34,674 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:26:34,674 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:26:34,674 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:26:34,674 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:26:34,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:26:34,675 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:26:34,675 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:26:34,675 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:26:34,675 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:26:34,675 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 -> a0f042164bf78d3595348b117153fa7346585efa21c060e488a9879023a64e1b [2025-02-08 05:26:34,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:26:34,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:26:34,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:26:34,883 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:26:34,883 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:26:34,884 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-lit/qw2004-2.i [2025-02-08 05:26:36,084 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2792d7306/b574284c559f4b30b18eb5edf06ebf42/FLAG976555e49 [2025-02-08 05:26:36,438 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:26:36,439 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-lit/qw2004-2.i [2025-02-08 05:26:36,454 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2792d7306/b574284c559f4b30b18eb5edf06ebf42/FLAG976555e49 [2025-02-08 05:26:36,472 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2792d7306/b574284c559f4b30b18eb5edf06ebf42 [2025-02-08 05:26:36,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:26:36,476 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:26:36,477 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:26:36,478 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:26:36,481 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:26:36,481 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:26:36" (1/1) ... [2025-02-08 05:26:36,482 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63f915dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:36, skipping insertion in model container [2025-02-08 05:26:36,483 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:26:36" (1/1) ... [2025-02-08 05:26:36,512 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:26:36,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:26:36,736 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:26:36,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:26:36,795 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:26:36,796 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,796 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:26:36,797 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:26:36,797 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:26:36,797 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:26:36,802 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,814 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,833 INFO L138 Inliner]: procedures = 174, calls = 29, calls flagged for inlining = 10, calls inlined = 11, statements flattened = 170 [2025-02-08 05:26:36,834 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:26:36,836 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:26:36,836 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:26:36,836 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:26:36,840 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,840 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,842 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,842 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,848 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,849 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,850 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,851 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,853 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:26:36,857 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:26:36,857 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:26:36,857 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:26:36,857 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,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:26:36,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:26:36,882 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,885 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,903 INFO L130 BoogieDeclarations]: Found specification of procedure BCSP_PnpStop [2025-02-08 05:26:36,904 INFO L138 BoogieDeclarations]: Found implementation of procedure BCSP_PnpStop [2025-02-08 05:26:36,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 05:26:36,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:26:36,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:26:36,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 05:26:36,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:26:36,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:26:36,905 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,999 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:26:37,001 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:26:37,250 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L737: havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; [2025-02-08 05:26:37,251 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L737-1: havoc __VERIFIER_assert_~cond#1; [2025-02-08 05:26:37,251 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:26:37,252 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:26:37,328 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:26:37,328 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:26:37,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:26:37 BoogieIcfgContainer [2025-02-08 05:26:37,329 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:26:37,330 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:26:37,330 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:26:37,334 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:26:37,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:26:36" (1/3) ... [2025-02-08 05:26:37,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41e3e33e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:26:37, skipping insertion in model container [2025-02-08 05:26:37,335 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:37,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41e3e33e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:26:37, skipping insertion in model container [2025-02-08 05:26:37,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:26:37" (3/3) ... [2025-02-08 05:26:37,340 INFO L128 eAbstractionObserver]: Analyzing ICFG qw2004-2.i [2025-02-08 05:26:37,362 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:26:37,363 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG qw2004-2.i that has 2 procedures, 147 locations, 1 initial locations, 0 loop locations, and 19 error locations. [2025-02-08 05:26:37,363 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:26:37,424 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:26:37,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 151 transitions, 306 flow [2025-02-08 05:26:37,515 INFO L124 PetriNetUnfolderBase]: 5/150 cut-off events. [2025-02-08 05:26:37,519 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:26:37,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 150 events. 5/150 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 199 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 109. Up to 2 conditions per place. [2025-02-08 05:26:37,526 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 151 transitions, 306 flow [2025-02-08 05:26:37,531 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 150 transitions, 303 flow [2025-02-08 05:26:37,541 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:26:37,556 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;@ddffe6f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:26:37,557 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-02-08 05:26:37,564 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:26:37,564 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2025-02-08 05:26:37,564 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:26:37,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:37,565 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:37,566 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:37,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:37,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1355056894, now seen corresponding path program 1 times [2025-02-08 05:26:37,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:37,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330688361] [2025-02-08 05:26:37,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:37,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:37,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 05:26:37,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 05:26:37,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:37,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:37,697 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,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:37,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330688361] [2025-02-08 05:26:37,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330688361] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:37,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:37,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:37,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936108105] [2025-02-08 05:26:37,700 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,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:37,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:37,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:37,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 151 [2025-02-08 05:26:37,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 150 transitions, 303 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:37,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 151 [2025-02-08 05:26:37,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:37,835 INFO L124 PetriNetUnfolderBase]: 29/364 cut-off events. [2025-02-08 05:26:37,835 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:26:37,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 431 conditions, 364 events. 29/364 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1518 event pairs, 17 based on Foata normal form. 13/341 useless extension candidates. Maximal degree in co-relation 380. Up to 61 conditions per place. [2025-02-08 05:26:37,839 INFO L140 encePairwiseOnDemand]: 132/151 looper letters, 14 selfloop transitions, 2 changer transitions 0/131 dead transitions. [2025-02-08 05:26:37,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 131 transitions, 297 flow [2025-02-08 05:26:37,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:37,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:37,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2025-02-08 05:26:37,850 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.847682119205298 [2025-02-08 05:26:37,851 INFO L175 Difference]: Start difference. First operand has 149 places, 150 transitions, 303 flow. Second operand 3 states and 384 transitions. [2025-02-08 05:26:37,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 131 transitions, 297 flow [2025-02-08 05:26:37,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 131 transitions, 296 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:26:37,857 INFO L231 Difference]: Finished difference. Result has 134 places, 131 transitions, 268 flow [2025-02-08 05:26:37,859 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=134, PETRI_TRANSITIONS=131} [2025-02-08 05:26:37,861 INFO L279 CegarLoopForPetriNet]: 149 programPoint places, -15 predicate places. [2025-02-08 05:26:37,861 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 131 transitions, 268 flow [2025-02-08 05:26:37,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:37,862 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,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:26:37,862 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,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:37,863 INFO L85 PathProgramCache]: Analyzing trace with hash 745227627, now seen corresponding path program 1 times [2025-02-08 05:26:37,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:37,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067613986] [2025-02-08 05:26:37,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:37,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:37,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 05:26:37,888 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,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:37,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:37,923 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,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:37,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067613986] [2025-02-08 05:26:37,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067613986] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:37,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:37,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:37,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968960916] [2025-02-08 05:26:37,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:37,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:37,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:37,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:37,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:37,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 151 [2025-02-08 05:26:37,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 131 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:37,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 151 [2025-02-08 05:26:37,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:37,987 INFO L124 PetriNetUnfolderBase]: 29/363 cut-off events. [2025-02-08 05:26:37,987 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:26:37,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432 conditions, 363 events. 29/363 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1516 event pairs, 17 based on Foata normal form. 0/328 useless extension candidates. Maximal degree in co-relation 408. Up to 61 conditions per place. [2025-02-08 05:26:37,990 INFO L140 encePairwiseOnDemand]: 148/151 looper letters, 14 selfloop transitions, 2 changer transitions 0/130 dead transitions. [2025-02-08 05:26:37,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 130 transitions, 298 flow [2025-02-08 05:26:37,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:37,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:37,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2025-02-08 05:26:37,992 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8123620309050773 [2025-02-08 05:26:37,992 INFO L175 Difference]: Start difference. First operand has 134 places, 131 transitions, 268 flow. Second operand 3 states and 368 transitions. [2025-02-08 05:26:37,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 130 transitions, 298 flow [2025-02-08 05:26:37,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 130 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:37,995 INFO L231 Difference]: Finished difference. Result has 133 places, 130 transitions, 266 flow [2025-02-08 05:26:37,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=266, PETRI_PLACES=133, PETRI_TRANSITIONS=130} [2025-02-08 05:26:37,996 INFO L279 CegarLoopForPetriNet]: 149 programPoint places, -16 predicate places. [2025-02-08 05:26:37,996 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 130 transitions, 266 flow [2025-02-08 05:26:37,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:37,996 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,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:26:37,997 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,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:37,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1774402528, now seen corresponding path program 1 times [2025-02-08 05:26:37,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:37,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012168934] [2025-02-08 05:26:37,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:37,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:38,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 05:26:38,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 05:26:38,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:38,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:38,034 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:38,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:38,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012168934] [2025-02-08 05:26:38,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012168934] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:38,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:38,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:38,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782153656] [2025-02-08 05:26:38,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:38,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:38,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:38,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:38,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:38,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 151 [2025-02-08 05:26:38,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 130 transitions, 266 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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:38,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:38,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 151 [2025-02-08 05:26:38,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:38,100 INFO L124 PetriNetUnfolderBase]: 29/362 cut-off events. [2025-02-08 05:26:38,100 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:26:38,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 431 conditions, 362 events. 29/362 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1514 event pairs, 17 based on Foata normal form. 0/328 useless extension candidates. Maximal degree in co-relation 402. Up to 61 conditions per place. [2025-02-08 05:26:38,103 INFO L140 encePairwiseOnDemand]: 148/151 looper letters, 14 selfloop transitions, 2 changer transitions 0/129 dead transitions. [2025-02-08 05:26:38,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 129 transitions, 296 flow [2025-02-08 05:26:38,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:38,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:38,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2025-02-08 05:26:38,104 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8123620309050773 [2025-02-08 05:26:38,104 INFO L175 Difference]: Start difference. First operand has 133 places, 130 transitions, 266 flow. Second operand 3 states and 368 transitions. [2025-02-08 05:26:38,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 129 transitions, 296 flow [2025-02-08 05:26:38,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 129 transitions, 292 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:38,106 INFO L231 Difference]: Finished difference. Result has 132 places, 129 transitions, 264 flow [2025-02-08 05:26:38,106 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=132, PETRI_TRANSITIONS=129} [2025-02-08 05:26:38,107 INFO L279 CegarLoopForPetriNet]: 149 programPoint places, -17 predicate places. [2025-02-08 05:26:38,107 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 129 transitions, 264 flow [2025-02-08 05:26:38,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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:38,107 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:38,107 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:38,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:26:38,108 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:38,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:38,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1991909353, now seen corresponding path program 1 times [2025-02-08 05:26:38,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:38,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444442991] [2025-02-08 05:26:38,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:38,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:38,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 05:26:38,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 05:26:38,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:38,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:38,133 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:38,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:38,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444442991] [2025-02-08 05:26:38,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444442991] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:38,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:38,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:38,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162778614] [2025-02-08 05:26:38,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:38,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:38,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:38,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:38,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:38,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 151 [2025-02-08 05:26:38,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 129 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 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:38,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:38,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 151 [2025-02-08 05:26:38,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:38,191 INFO L124 PetriNetUnfolderBase]: 41/418 cut-off events. [2025-02-08 05:26:38,192 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:26:38,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 418 events. 41/418 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1847 event pairs, 27 based on Foata normal form. 0/379 useless extension candidates. Maximal degree in co-relation 477. Up to 85 conditions per place. [2025-02-08 05:26:38,193 INFO L140 encePairwiseOnDemand]: 148/151 looper letters, 16 selfloop transitions, 2 changer transitions 0/128 dead transitions. [2025-02-08 05:26:38,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 128 transitions, 298 flow [2025-02-08 05:26:38,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:38,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:38,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2025-02-08 05:26:38,195 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8035320088300221 [2025-02-08 05:26:38,195 INFO L175 Difference]: Start difference. First operand has 132 places, 129 transitions, 264 flow. Second operand 3 states and 364 transitions. [2025-02-08 05:26:38,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 128 transitions, 298 flow [2025-02-08 05:26:38,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 128 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:38,197 INFO L231 Difference]: Finished difference. Result has 131 places, 128 transitions, 262 flow [2025-02-08 05:26:38,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=262, PETRI_PLACES=131, PETRI_TRANSITIONS=128} [2025-02-08 05:26:38,197 INFO L279 CegarLoopForPetriNet]: 149 programPoint places, -18 predicate places. [2025-02-08 05:26:38,197 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 128 transitions, 262 flow [2025-02-08 05:26:38,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 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:38,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:38,198 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] [2025-02-08 05:26:38,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:26:38,198 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-08 05:26:38,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:38,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1048695043, now seen corresponding path program 1 times [2025-02-08 05:26:38,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:38,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519585627] [2025-02-08 05:26:38,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:38,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:38,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-08 05:26:38,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-08 05:26:38,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:38,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:38,266 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:38,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:38,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519585627] [2025-02-08 05:26:38,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519585627] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:38,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:38,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:38,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412381500] [2025-02-08 05:26:38,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:38,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:38,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:38,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:38,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:38,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 151 [2025-02-08 05:26:38,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 128 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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:38,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:38,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 151 [2025-02-08 05:26:38,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:38,350 INFO L124 PetriNetUnfolderBase]: 39/431 cut-off events. [2025-02-08 05:26:38,351 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:26:38,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 431 events. 39/431 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1945 event pairs, 17 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 482. Up to 61 conditions per place. [2025-02-08 05:26:38,353 INFO L140 encePairwiseOnDemand]: 147/151 looper letters, 18 selfloop transitions, 3 changer transitions 0/134 dead transitions. [2025-02-08 05:26:38,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 134 transitions, 316 flow [2025-02-08 05:26:38,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:38,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:38,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2025-02-08 05:26:38,354 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8366445916114791 [2025-02-08 05:26:38,354 INFO L175 Difference]: Start difference. First operand has 131 places, 128 transitions, 262 flow. Second operand 3 states and 379 transitions. [2025-02-08 05:26:38,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 134 transitions, 316 flow [2025-02-08 05:26:38,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 134 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:38,357 INFO L231 Difference]: Finished difference. Result has 133 places, 130 transitions, 280 flow [2025-02-08 05:26:38,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=280, PETRI_PLACES=133, PETRI_TRANSITIONS=130} [2025-02-08 05:26:38,358 INFO L279 CegarLoopForPetriNet]: 149 programPoint places, -16 predicate places. [2025-02-08 05:26:38,358 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 130 transitions, 280 flow [2025-02-08 05:26:38,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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:38,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:38,359 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-02-08 05:26:38,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:26:38,359 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-08 05:26:38,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:38,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1332718540, now seen corresponding path program 1 times [2025-02-08 05:26:38,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:38,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745385124] [2025-02-08 05:26:38,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:38,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:38,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 05:26:38,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 05:26:38,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:38,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:38,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:38,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:38,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745385124] [2025-02-08 05:26:38,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745385124] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:38,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:38,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 05:26:38,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763506171] [2025-02-08 05:26:38,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:38,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:26:38,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:38,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:26:38,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:26:38,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 151 [2025-02-08 05:26:38,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 130 transitions, 280 flow. Second operand has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 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:38,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:38,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 151 [2025-02-08 05:26:38,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:38,769 INFO L124 PetriNetUnfolderBase]: 81/556 cut-off events. [2025-02-08 05:26:38,770 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:26:38,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 771 conditions, 556 events. 81/556 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3183 event pairs, 8 based on Foata normal form. 0/518 useless extension candidates. Maximal degree in co-relation 725. Up to 95 conditions per place. [2025-02-08 05:26:38,772 INFO L140 encePairwiseOnDemand]: 143/151 looper letters, 23 selfloop transitions, 3 changer transitions 30/167 dead transitions. [2025-02-08 05:26:38,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 167 transitions, 466 flow [2025-02-08 05:26:38,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:26:38,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 05:26:38,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1208 transitions. [2025-02-08 05:26:38,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8 [2025-02-08 05:26:38,775 INFO L175 Difference]: Start difference. First operand has 133 places, 130 transitions, 280 flow. Second operand 10 states and 1208 transitions. [2025-02-08 05:26:38,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 167 transitions, 466 flow [2025-02-08 05:26:38,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 167 transitions, 460 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:38,778 INFO L231 Difference]: Finished difference. Result has 147 places, 131 transitions, 309 flow [2025-02-08 05:26:38,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=309, PETRI_PLACES=147, PETRI_TRANSITIONS=131} [2025-02-08 05:26:38,779 INFO L279 CegarLoopForPetriNet]: 149 programPoint places, -2 predicate places. [2025-02-08 05:26:38,779 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 131 transitions, 309 flow [2025-02-08 05:26:38,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 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:38,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:38,780 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] [2025-02-08 05:26:38,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:26:38,780 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-08 05:26:38,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:38,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1711073540, now seen corresponding path program 1 times [2025-02-08 05:26:38,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:38,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075189881] [2025-02-08 05:26:38,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:38,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:38,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 05:26:38,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 05:26:38,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:38,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:38,822 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:38,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:38,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075189881] [2025-02-08 05:26:38,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075189881] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:38,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:38,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:38,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887029640] [2025-02-08 05:26:38,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:38,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:38,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:38,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:38,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:38,837 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 151 [2025-02-08 05:26:38,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 131 transitions, 309 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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:38,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:38,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 151 [2025-02-08 05:26:38,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:38,895 INFO L124 PetriNetUnfolderBase]: 51/578 cut-off events. [2025-02-08 05:26:38,895 INFO L125 PetriNetUnfolderBase]: For 126/133 co-relation queries the response was YES. [2025-02-08 05:26:38,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 824 conditions, 578 events. 51/578 cut-off events. For 126/133 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3050 event pairs, 34 based on Foata normal form. 0/535 useless extension candidates. Maximal degree in co-relation 771. Up to 96 conditions per place. [2025-02-08 05:26:38,897 INFO L140 encePairwiseOnDemand]: 146/151 looper letters, 16 selfloop transitions, 4 changer transitions 29/139 dead transitions. [2025-02-08 05:26:38,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 139 transitions, 391 flow [2025-02-08 05:26:38,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:38,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:38,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2025-02-08 05:26:38,899 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8322295805739515 [2025-02-08 05:26:38,899 INFO L175 Difference]: Start difference. First operand has 147 places, 131 transitions, 309 flow. Second operand 3 states and 377 transitions. [2025-02-08 05:26:38,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 139 transitions, 391 flow [2025-02-08 05:26:38,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 139 transitions, 382 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-02-08 05:26:38,902 INFO L231 Difference]: Finished difference. Result has 139 places, 107 transitions, 262 flow [2025-02-08 05:26:38,902 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=262, PETRI_PLACES=139, PETRI_TRANSITIONS=107} [2025-02-08 05:26:38,903 INFO L279 CegarLoopForPetriNet]: 149 programPoint places, -10 predicate places. [2025-02-08 05:26:38,903 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 107 transitions, 262 flow [2025-02-08 05:26:38,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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:38,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:38,903 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:26:38,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:26:38,904 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-08 05:26:38,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:38,908 INFO L85 PathProgramCache]: Analyzing trace with hash -663573026, now seen corresponding path program 1 times [2025-02-08 05:26:38,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:38,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20817874] [2025-02-08 05:26:38,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:38,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:38,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-08 05:26:38,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-08 05:26:38,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:38,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:26:38,953 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:26:38,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-08 05:26:38,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-08 05:26:38,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:38,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:26:38,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:26:38,983 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:26:38,984 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (26 of 27 remaining) [2025-02-08 05:26:38,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE (25 of 27 remaining) [2025-02-08 05:26:38,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE (24 of 27 remaining) [2025-02-08 05:26:38,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (23 of 27 remaining) [2025-02-08 05:26:38,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr3ASSERT_VIOLATIONDATA_RACE (22 of 27 remaining) [2025-02-08 05:26:38,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (21 of 27 remaining) [2025-02-08 05:26:38,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE (20 of 27 remaining) [2025-02-08 05:26:38,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE (19 of 27 remaining) [2025-02-08 05:26:38,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (18 of 27 remaining) [2025-02-08 05:26:38,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (17 of 27 remaining) [2025-02-08 05:26:38,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (16 of 27 remaining) [2025-02-08 05:26:38,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (15 of 27 remaining) [2025-02-08 05:26:38,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (14 of 27 remaining) [2025-02-08 05:26:38,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (13 of 27 remaining) [2025-02-08 05:26:38,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (12 of 27 remaining) [2025-02-08 05:26:38,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (11 of 27 remaining) [2025-02-08 05:26:38,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 27 remaining) [2025-02-08 05:26:38,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 27 remaining) [2025-02-08 05:26:38,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 27 remaining) [2025-02-08 05:26:38,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 27 remaining) [2025-02-08 05:26:38,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE (6 of 27 remaining) [2025-02-08 05:26:38,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE (5 of 27 remaining) [2025-02-08 05:26:38,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (4 of 27 remaining) [2025-02-08 05:26:38,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr3ASSERT_VIOLATIONDATA_RACE (3 of 27 remaining) [2025-02-08 05:26:38,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (2 of 27 remaining) [2025-02-08 05:26:38,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE (1 of 27 remaining) [2025-02-08 05:26:38,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE (0 of 27 remaining) [2025-02-08 05:26:38,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:26:38,988 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:26:39,039 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:26:39,039 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:26:39,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:26:39 BasicIcfg [2025-02-08 05:26:39,048 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:26:39,048 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:26:39,048 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:26:39,049 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:26:39,049 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:37" (3/4) ... [2025-02-08 05:26:39,053 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-08 05:26:39,107 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 14. [2025-02-08 05:26:39,149 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:26:39,149 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:26:39,149 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:26:39,150 INFO L158 Benchmark]: Toolchain (without parser) took 2674.38ms. Allocated memory is still 167.8MB. Free memory was 129.5MB in the beginning and 106.8MB in the end (delta: 22.7MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. [2025-02-08 05:26:39,150 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 226.5MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:26:39,151 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.55ms. Allocated memory is still 167.8MB. Free memory was 129.5MB in the beginning and 109.6MB in the end (delta: 19.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 05:26:39,151 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.81ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 107.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:26:39,152 INFO L158 Benchmark]: Boogie Preprocessor took 16.80ms. Allocated memory is still 167.8MB. Free memory was 107.0MB in the beginning and 106.1MB in the end (delta: 888.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:26:39,152 INFO L158 Benchmark]: IcfgBuilder took 472.02ms. Allocated memory is still 167.8MB. Free memory was 106.1MB in the beginning and 81.8MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 05:26:39,153 INFO L158 Benchmark]: TraceAbstraction took 1717.65ms. Allocated memory is still 167.8MB. Free memory was 80.9MB in the beginning and 119.4MB in the end (delta: -38.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:26:39,153 INFO L158 Benchmark]: Witness Printer took 100.99ms. Allocated memory is still 167.8MB. Free memory was 119.4MB in the beginning and 106.8MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:26:39,154 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 226.5MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 319.55ms. Allocated memory is still 167.8MB. Free memory was 129.5MB in the beginning and 109.6MB in the end (delta: 19.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.81ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 107.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.80ms. Allocated memory is still 167.8MB. Free memory was 107.0MB in the beginning and 106.1MB in the end (delta: 888.1kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 472.02ms. Allocated memory is still 167.8MB. Free memory was 106.1MB in the beginning and 81.8MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1717.65ms. Allocated memory is still 167.8MB. Free memory was 80.9MB in the beginning and 119.4MB in the end (delta: -38.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 100.99ms. Allocated memory is still 167.8MB. Free memory was 119.4MB in the beginning and 106.8MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 737]: 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] [L755] 0 pthread_t t; VAL [pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=0] [L756] 0 pendingIo = 1 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L757] 0 stoppingFlag = 0 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L758] 0 stoppingEvent = 0 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L759] 0 stopped = 0 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L760] FCALL, FORK 0 pthread_create(&t, 0, BCSP_PnpStop, 0) VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0, t=-1] [L761] CALL 0 BCSP_PnpAdd(0) [L734] 0 int status; VAL [\old(arg)={0:0}, arg={0:0}, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L735] CALL, EXPR 0 BCSP_IoIncrement() [L703] 0 int lsf = stoppingFlag; VAL [lsf=0, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L705] COND FALSE 0 !(\read(lsf)) VAL [lsf=0, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L709] 0 int lp = pendingIo; VAL [lp=1, lsf=0, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L744] 1 stoppingFlag = 1 VAL [\old(arg)={0:0}, arg={0:0}, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L746] CALL 1 BCSP_IoDecrement() [L725] 1 int pending; VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L726] CALL, EXPR 1 dec() [L719] 1 pendingIo-- [L720] 1 int tmp = pendingIo; VAL [pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=1, tmp=0] [L722] 1 return tmp; VAL [\result=0, pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=1, tmp=0] [L726] RET, EXPR 1 dec() [L726] 1 pending = dec() VAL [pending=0, pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=1] [L727] COND TRUE 1 pending == 0 VAL [pending=0, pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=1] [L729] 1 stoppingEvent = 1 VAL [pending=0, pendingIo=0, stopped=0, stoppingEvent=1, stoppingFlag=1] [L746] RET 1 BCSP_IoDecrement() [L748] 1 int lse = stoppingEvent; VAL [\old(arg)={0:0}, arg={0:0}, lse=1, pendingIo=0, stopped=0, stoppingEvent=1, stoppingFlag=1] [L750] CALL 1 assume_abort_if_not(lse) [L686] COND FALSE 1 !(!cond) VAL [\old(cond)=1, cond=1, pendingIo=0, stopped=0, stoppingEvent=1, stoppingFlag=1] [L750] RET 1 assume_abort_if_not(lse) [L751] 1 stopped = 1 VAL [\old(arg)={0:0}, arg={0:0}, lse=1, pendingIo=0, stopped=1, stoppingEvent=1, stoppingFlag=1] [L712] 0 pendingIo = lp + 1 VAL [lp=1, lsf=0, pendingIo=2, stopped=1, stoppingEvent=1, stoppingFlag=1] [L715] 0 return 0; VAL [\result=0, lsf=0, pendingIo=2, stopped=1, stoppingEvent=1, stoppingFlag=1] [L735] RET, EXPR 0 BCSP_IoIncrement() [L735] 0 status = BCSP_IoIncrement() VAL [\old(arg)={0:0}, arg={0:0}, pendingIo=2, status=0, stopped=1, stoppingEvent=1, stoppingFlag=1] [L736] COND TRUE 0 status == 0 VAL [\old(arg)={0:0}, arg={0:0}, pendingIo=2, status=0, stopped=1, stoppingEvent=1, stoppingFlag=1] [L737] 0 !stopped VAL [\old(arg)={0:0}, arg={0:0}, pendingIo=2, status=0, stopped=1, stoppingEvent=1, stoppingFlag=1] [L751] 1 stopped = 1 VAL [\old(arg)={0:0}, arg={0:0}, lse=1, pendingIo=2, stopped=1, stoppingEvent=1, stoppingFlag=1] [L737] 0 !stopped VAL [\old(arg)={0:0}, arg={0:0}, pendingIo=2, status=0, stopped=1, stoppingEvent=1, stoppingFlag=1] Now there is a data race on ~stopped~0 between C: stopped = 1 [751] and C: !stopped [737] - 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: 719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 720]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 729]: 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 there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 751]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 756]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 757]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 758]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 759]: 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: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 720]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 729]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 760]: 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, 187 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.5s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 145 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 68 mSDsluCounter, 96 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 339 IncrementalHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 55 mSDtfsCounter, 339 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=309occurred in iteration=6, InterpolantAutomatonStates: 28, 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.4s InterpolantComputationTime, 371 NumberOfCodeBlocks, 371 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 356 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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:39,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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)