./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 47827fdca8ccc83dae99015d656cdcf2872ea585121905304e5ffb2ef40b4eac --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:08:01,927 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:08:02,062 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-09 07:08:02,072 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:08:02,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:08:02,115 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:08:02,122 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:08:02,126 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:08:02,126 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:08:02,127 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:08:02,127 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:08:02,127 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:08:02,128 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:08:02,128 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:08:02,128 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:08:02,128 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:08:02,129 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:08:02,129 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:08:02,134 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:08:02,134 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:08:02,135 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:08:02,137 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:08:02,137 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 07:08:02,137 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:08:02,138 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:08:02,138 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:08:02,138 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:08:02,138 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:08:02,139 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:08:02,139 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:08:02,139 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:08:02,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:08:02,139 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:08:02,140 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:08:02,148 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 07:08:02,149 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:08:02,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:08:02,149 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:08:02,149 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:08:02,150 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:08:02,150 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:08:02,153 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 47827fdca8ccc83dae99015d656cdcf2872ea585121905304e5ffb2ef40b4eac [2024-11-09 07:08:02,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:08:02,756 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:08:02,759 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:08:02,764 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:08:02,765 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:08:02,766 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race.i [2024-11-09 07:08:04,589 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:08:04,837 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:08:04,838 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race.i [2024-11-09 07:08:04,855 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20a3715a4/47aacc715faa473cae8aedf7a8f100df/FLAGa9647c158 [2024-11-09 07:08:04,870 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20a3715a4/47aacc715faa473cae8aedf7a8f100df [2024-11-09 07:08:04,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:08:04,874 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:08:04,877 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:08:04,878 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:08:04,883 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:08:04,884 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:08:04" (1/1) ... [2024-11-09 07:08:04,885 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32247240 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:08:04, skipping insertion in model container [2024-11-09 07:08:04,885 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:08:04" (1/1) ... [2024-11-09 07:08:04,930 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:08:05,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:08:05,356 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:08:05,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:08:05,447 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:08:05,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:08:05 WrapperNode [2024-11-09 07:08:05,448 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:08:05,449 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:08:05,449 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:08:05,449 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:08:05,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:08:05" (1/1) ... [2024-11-09 07:08:05,472 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:08:05" (1/1) ... [2024-11-09 07:08:05,493 INFO L138 Inliner]: procedures = 159, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 59 [2024-11-09 07:08:05,494 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:08:05,494 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:08:05,494 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:08:05,495 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:08:05,502 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:08:05" (1/1) ... [2024-11-09 07:08:05,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:08:05" (1/1) ... [2024-11-09 07:08:05,506 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:08:05" (1/1) ... [2024-11-09 07:08:05,506 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:08:05" (1/1) ... [2024-11-09 07:08:05,515 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:08:05" (1/1) ... [2024-11-09 07:08:05,518 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:08:05" (1/1) ... [2024-11-09 07:08:05,520 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:08:05" (1/1) ... [2024-11-09 07:08:05,522 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:08:05" (1/1) ... [2024-11-09 07:08:05,524 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:08:05,525 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:08:05,525 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:08:05,525 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:08:05,526 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:08:05" (1/1) ... [2024-11-09 07:08:05,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:08:05,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:08:05,571 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:08:05,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:08:05,616 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 07:08:05,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:08:05,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 07:08:05,617 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-09 07:08:05,617 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-09 07:08:05,617 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 07:08:05,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:08:05,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:08:05,619 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 07:08:05,740 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:08:05,742 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:08:05,890 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 07:08:05,891 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:08:05,914 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:08:05,914 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 07:08:05,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:08:05 BoogieIcfgContainer [2024-11-09 07:08:05,914 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:08:05,917 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:08:05,917 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:08:05,920 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:08:05,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:08:04" (1/3) ... [2024-11-09 07:08:05,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e1ec7b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:08:05, skipping insertion in model container [2024-11-09 07:08:05,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:08:05" (2/3) ... [2024-11-09 07:08:05,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e1ec7b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:08:05, skipping insertion in model container [2024-11-09 07:08:05,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:08:05" (3/3) ... [2024-11-09 07:08:05,924 INFO L112 eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer-race.i [2024-11-09 07:08:05,940 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:08:05,940 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-09 07:08:05,941 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 07:08:05,998 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 07:08:06,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 95 transitions, 194 flow [2024-11-09 07:08:06,081 INFO L124 PetriNetUnfolderBase]: 7/127 cut-off events. [2024-11-09 07:08:06,082 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 07:08:06,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 127 events. 7/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 187 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 67. Up to 4 conditions per place. [2024-11-09 07:08:06,087 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 95 transitions, 194 flow [2024-11-09 07:08:06,093 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 95 transitions, 194 flow [2024-11-09 07:08:06,100 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:08:06,105 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;@3bfb3a25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:08:06,106 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-09 07:08:06,113 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 07:08:06,113 INFO L124 PetriNetUnfolderBase]: 2/31 cut-off events. [2024-11-09 07:08:06,114 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 07:08:06,117 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:08:06,118 INFO L204 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] [2024-11-09 07:08:06,118 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-09 07:08:06,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:08:06,124 INFO L85 PathProgramCache]: Analyzing trace with hash -771403590, now seen corresponding path program 1 times [2024-11-09 07:08:06,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:08:06,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955536724] [2024-11-09 07:08:06,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:08:06,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:08:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:08:06,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:08:06,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:08:06,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955536724] [2024-11-09 07:08:06,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955536724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:08:06,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:08:06,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:08:06,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436655801] [2024-11-09 07:08:06,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:08:06,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:08:06,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:08:06,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:08:06,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:08:06,501 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 95 [2024-11-09 07:08:06,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 95 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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) [2024-11-09 07:08:06,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:08:06,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 95 [2024-11-09 07:08:06,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:08:06,581 INFO L124 PetriNetUnfolderBase]: 32/293 cut-off events. [2024-11-09 07:08:06,584 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 07:08:06,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380 conditions, 293 events. 32/293 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1168 event pairs, 7 based on Foata normal form. 7/269 useless extension candidates. Maximal degree in co-relation 310. Up to 59 conditions per place. [2024-11-09 07:08:06,590 INFO L140 encePairwiseOnDemand]: 81/95 looper letters, 16 selfloop transitions, 8 changer transitions 1/102 dead transitions. [2024-11-09 07:08:06,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 102 transitions, 256 flow [2024-11-09 07:08:06,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:08:06,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:08:06,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2024-11-09 07:08:06,603 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2024-11-09 07:08:06,605 INFO L175 Difference]: Start difference. First operand has 94 places, 95 transitions, 194 flow. Second operand 3 states and 266 transitions. [2024-11-09 07:08:06,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 102 transitions, 256 flow [2024-11-09 07:08:06,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 102 transitions, 256 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:08:06,611 INFO L231 Difference]: Finished difference. Result has 98 places, 99 transitions, 256 flow [2024-11-09 07:08:06,613 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=98, PETRI_TRANSITIONS=99} [2024-11-09 07:08:06,616 INFO L277 CegarLoopForPetriNet]: 94 programPoint places, 4 predicate places. [2024-11-09 07:08:06,617 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 99 transitions, 256 flow [2024-11-09 07:08:06,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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) [2024-11-09 07:08:06,617 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:08:06,617 INFO L204 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] [2024-11-09 07:08:06,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:08:06,618 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-09 07:08:06,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:08:06,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1485688194, now seen corresponding path program 1 times [2024-11-09 07:08:06,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:08:06,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278482228] [2024-11-09 07:08:06,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:08:06,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:08:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:08:06,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:08:06,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:08:06,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278482228] [2024-11-09 07:08:06,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278482228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:08:06,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:08:06,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:08:06,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72651598] [2024-11-09 07:08:06,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:08:06,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:08:06,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:08:06,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:08:06,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:08:06,703 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 95 [2024-11-09 07:08:06,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 99 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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) [2024-11-09 07:08:06,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:08:06,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 95 [2024-11-09 07:08:06,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:08:06,795 INFO L124 PetriNetUnfolderBase]: 27/308 cut-off events. [2024-11-09 07:08:06,795 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-09 07:08:06,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 308 events. 27/308 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1401 event pairs, 5 based on Foata normal form. 0/277 useless extension candidates. Maximal degree in co-relation 359. Up to 45 conditions per place. [2024-11-09 07:08:06,798 INFO L140 encePairwiseOnDemand]: 91/95 looper letters, 8 selfloop transitions, 3 changer transitions 0/103 dead transitions. [2024-11-09 07:08:06,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 103 transitions, 286 flow [2024-11-09 07:08:06,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:08:06,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:08:06,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 267 transitions. [2024-11-09 07:08:06,811 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9368421052631579 [2024-11-09 07:08:06,811 INFO L175 Difference]: Start difference. First operand has 98 places, 99 transitions, 256 flow. Second operand 3 states and 267 transitions. [2024-11-09 07:08:06,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 103 transitions, 286 flow [2024-11-09 07:08:06,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 103 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:08:06,826 INFO L231 Difference]: Finished difference. Result has 99 places, 101 transitions, 262 flow [2024-11-09 07:08:06,826 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=262, PETRI_PLACES=99, PETRI_TRANSITIONS=101} [2024-11-09 07:08:06,831 INFO L277 CegarLoopForPetriNet]: 94 programPoint places, 5 predicate places. [2024-11-09 07:08:06,831 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 101 transitions, 262 flow [2024-11-09 07:08:06,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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) [2024-11-09 07:08:06,832 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:08:06,832 INFO L204 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] [2024-11-09 07:08:06,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:08:06,832 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-09 07:08:06,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:08:06,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1941359717, now seen corresponding path program 1 times [2024-11-09 07:08:06,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:08:06,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508266394] [2024-11-09 07:08:06,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:08:06,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:08:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:08:07,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:08:07,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:08:07,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508266394] [2024-11-09 07:08:07,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508266394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:08:07,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:08:07,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:08:07,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412275681] [2024-11-09 07:08:07,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:08:07,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:08:07,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:08:07,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:08:07,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:08:07,119 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 95 [2024-11-09 07:08:07,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 101 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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) [2024-11-09 07:08:07,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:08:07,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 95 [2024-11-09 07:08:07,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:08:07,253 INFO L124 PetriNetUnfolderBase]: 54/456 cut-off events. [2024-11-09 07:08:07,253 INFO L125 PetriNetUnfolderBase]: For 63/71 co-relation queries the response was YES. [2024-11-09 07:08:07,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 456 events. 54/456 cut-off events. For 63/71 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2519 event pairs, 23 based on Foata normal form. 4/416 useless extension candidates. Maximal degree in co-relation 627. Up to 104 conditions per place. [2024-11-09 07:08:07,260 INFO L140 encePairwiseOnDemand]: 89/95 looper letters, 19 selfloop transitions, 7 changer transitions 0/108 dead transitions. [2024-11-09 07:08:07,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 108 transitions, 334 flow [2024-11-09 07:08:07,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:08:07,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:08:07,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 255 transitions. [2024-11-09 07:08:07,263 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8947368421052632 [2024-11-09 07:08:07,263 INFO L175 Difference]: Start difference. First operand has 99 places, 101 transitions, 262 flow. Second operand 3 states and 255 transitions. [2024-11-09 07:08:07,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 108 transitions, 334 flow [2024-11-09 07:08:07,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 108 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:08:07,272 INFO L231 Difference]: Finished difference. Result has 101 places, 106 transitions, 312 flow [2024-11-09 07:08:07,273 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=312, PETRI_PLACES=101, PETRI_TRANSITIONS=106} [2024-11-09 07:08:07,274 INFO L277 CegarLoopForPetriNet]: 94 programPoint places, 7 predicate places. [2024-11-09 07:08:07,275 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 106 transitions, 312 flow [2024-11-09 07:08:07,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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) [2024-11-09 07:08:07,276 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:08:07,276 INFO L204 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] [2024-11-09 07:08:07,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:08:07,277 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-09 07:08:07,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:08:07,278 INFO L85 PathProgramCache]: Analyzing trace with hash -347289839, now seen corresponding path program 1 times [2024-11-09 07:08:07,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:08:07,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869628841] [2024-11-09 07:08:07,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:08:07,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:08:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:08:07,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:08:07,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:08:07,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869628841] [2024-11-09 07:08:07,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869628841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:08:07,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:08:07,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:08:07,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486989851] [2024-11-09 07:08:07,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:08:07,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:08:07,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:08:07,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:08:07,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:08:07,404 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 95 [2024-11-09 07:08:07,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 106 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 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) [2024-11-09 07:08:07,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:08:07,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 95 [2024-11-09 07:08:07,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:08:07,480 INFO L124 PetriNetUnfolderBase]: 36/366 cut-off events. [2024-11-09 07:08:07,484 INFO L125 PetriNetUnfolderBase]: For 63/70 co-relation queries the response was YES. [2024-11-09 07:08:07,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 574 conditions, 366 events. 36/366 cut-off events. For 63/70 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1960 event pairs, 8 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 495. Up to 51 conditions per place. [2024-11-09 07:08:07,487 INFO L140 encePairwiseOnDemand]: 90/95 looper letters, 8 selfloop transitions, 5 changer transitions 0/109 dead transitions. [2024-11-09 07:08:07,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 109 transitions, 346 flow [2024-11-09 07:08:07,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:08:07,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:08:07,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2024-11-09 07:08:07,493 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9192982456140351 [2024-11-09 07:08:07,493 INFO L175 Difference]: Start difference. First operand has 101 places, 106 transitions, 312 flow. Second operand 3 states and 262 transitions. [2024-11-09 07:08:07,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 109 transitions, 346 flow [2024-11-09 07:08:07,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 109 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:08:07,502 INFO L231 Difference]: Finished difference. Result has 103 places, 109 transitions, 334 flow [2024-11-09 07:08:07,502 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=334, PETRI_PLACES=103, PETRI_TRANSITIONS=109} [2024-11-09 07:08:07,507 INFO L277 CegarLoopForPetriNet]: 94 programPoint places, 9 predicate places. [2024-11-09 07:08:07,507 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 109 transitions, 334 flow [2024-11-09 07:08:07,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 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) [2024-11-09 07:08:07,507 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:08:07,508 INFO L204 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] [2024-11-09 07:08:07,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:08:07,508 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-09 07:08:07,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:08:07,509 INFO L85 PathProgramCache]: Analyzing trace with hash 127402969, now seen corresponding path program 1 times [2024-11-09 07:08:07,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:08:07,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570695661] [2024-11-09 07:08:07,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:08:07,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:08:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:08:07,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:08:07,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:08:07,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570695661] [2024-11-09 07:08:07,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570695661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:08:07,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:08:07,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:08:07,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270032416] [2024-11-09 07:08:07,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:08:07,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:08:07,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:08:07,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:08:07,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:08:07,634 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 95 [2024-11-09 07:08:07,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 109 transitions, 334 flow. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 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) [2024-11-09 07:08:07,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:08:07,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 95 [2024-11-09 07:08:07,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:08:07,689 INFO L124 PetriNetUnfolderBase]: 64/479 cut-off events. [2024-11-09 07:08:07,690 INFO L125 PetriNetUnfolderBase]: For 157/165 co-relation queries the response was YES. [2024-11-09 07:08:07,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 880 conditions, 479 events. 64/479 cut-off events. For 157/165 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2719 event pairs, 13 based on Foata normal form. 1/447 useless extension candidates. Maximal degree in co-relation 796. Up to 109 conditions per place. [2024-11-09 07:08:07,692 INFO L140 encePairwiseOnDemand]: 88/95 looper letters, 16 selfloop transitions, 11 changer transitions 1/116 dead transitions. [2024-11-09 07:08:07,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 116 transitions, 416 flow [2024-11-09 07:08:07,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:08:07,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:08:07,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 258 transitions. [2024-11-09 07:08:07,694 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9052631578947369 [2024-11-09 07:08:07,695 INFO L175 Difference]: Start difference. First operand has 103 places, 109 transitions, 334 flow. Second operand 3 states and 258 transitions. [2024-11-09 07:08:07,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 116 transitions, 416 flow [2024-11-09 07:08:07,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 116 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:08:07,698 INFO L231 Difference]: Finished difference. Result has 105 places, 115 transitions, 408 flow [2024-11-09 07:08:07,699 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=105, PETRI_TRANSITIONS=115} [2024-11-09 07:08:07,699 INFO L277 CegarLoopForPetriNet]: 94 programPoint places, 11 predicate places. [2024-11-09 07:08:07,700 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 115 transitions, 408 flow [2024-11-09 07:08:07,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 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) [2024-11-09 07:08:07,700 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:08:07,700 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:08:07,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:08:07,701 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-09 07:08:07,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:08:07,701 INFO L85 PathProgramCache]: Analyzing trace with hash -2054069050, now seen corresponding path program 1 times [2024-11-09 07:08:07,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:08:07,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817306741] [2024-11-09 07:08:07,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:08:07,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:08:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:08:07,722 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 07:08:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:08:07,767 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 07:08:07,768 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 07:08:07,769 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2024-11-09 07:08:07,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2024-11-09 07:08:07,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2024-11-09 07:08:07,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2024-11-09 07:08:07,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2024-11-09 07:08:07,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2024-11-09 07:08:07,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2024-11-09 07:08:07,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2024-11-09 07:08:07,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2024-11-09 07:08:07,773 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2024-11-09 07:08:07,773 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2024-11-09 07:08:07,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:08:07,773 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-09 07:08:07,775 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 07:08:07,777 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-09 07:08:07,807 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 07:08:07,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 123 transitions, 256 flow [2024-11-09 07:08:07,876 INFO L124 PetriNetUnfolderBase]: 10/195 cut-off events. [2024-11-09 07:08:07,877 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 07:08:07,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 195 events. 10/195 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 324 event pairs, 0 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 128. Up to 6 conditions per place. [2024-11-09 07:08:07,878 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 123 transitions, 256 flow [2024-11-09 07:08:07,880 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 123 transitions, 256 flow [2024-11-09 07:08:07,881 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:08:07,882 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;@3bfb3a25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:08:07,884 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-09 07:08:07,887 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 07:08:07,888 INFO L124 PetriNetUnfolderBase]: 2/31 cut-off events. [2024-11-09 07:08:07,888 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 07:08:07,889 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:08:07,889 INFO L204 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] [2024-11-09 07:08:07,889 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-09 07:08:07,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:08:07,890 INFO L85 PathProgramCache]: Analyzing trace with hash 761156949, now seen corresponding path program 1 times [2024-11-09 07:08:07,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:08:07,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749093287] [2024-11-09 07:08:07,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:08:07,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:08:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:08:07,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:08:07,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:08:07,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749093287] [2024-11-09 07:08:07,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749093287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:08:07,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:08:07,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:08:07,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480415788] [2024-11-09 07:08:07,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:08:07,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:08:07,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:08:07,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:08:07,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:08:07,973 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 123 [2024-11-09 07:08:07,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 123 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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) [2024-11-09 07:08:07,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:08:07,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 123 [2024-11-09 07:08:07,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:08:08,278 INFO L124 PetriNetUnfolderBase]: 563/2345 cut-off events. [2024-11-09 07:08:08,278 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-11-09 07:08:08,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3375 conditions, 2345 events. 563/2345 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 19508 event pairs, 195 based on Foata normal form. 53/2141 useless extension candidates. Maximal degree in co-relation 2679. Up to 666 conditions per place. [2024-11-09 07:08:08,299 INFO L140 encePairwiseOnDemand]: 105/123 looper letters, 26 selfloop transitions, 11 changer transitions 1/136 dead transitions. [2024-11-09 07:08:08,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 136 transitions, 361 flow [2024-11-09 07:08:08,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:08:08,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:08:08,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2024-11-09 07:08:08,301 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9295392953929539 [2024-11-09 07:08:08,302 INFO L175 Difference]: Start difference. First operand has 124 places, 123 transitions, 256 flow. Second operand 3 states and 343 transitions. [2024-11-09 07:08:08,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 136 transitions, 361 flow [2024-11-09 07:08:08,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 136 transitions, 361 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:08:08,305 INFO L231 Difference]: Finished difference. Result has 128 places, 130 transitions, 344 flow [2024-11-09 07:08:08,305 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=128, PETRI_TRANSITIONS=130} [2024-11-09 07:08:08,306 INFO L277 CegarLoopForPetriNet]: 124 programPoint places, 4 predicate places. [2024-11-09 07:08:08,306 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 130 transitions, 344 flow [2024-11-09 07:08:08,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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) [2024-11-09 07:08:08,307 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:08:08,307 INFO L204 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] [2024-11-09 07:08:08,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:08:08,308 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-09 07:08:08,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:08:08,308 INFO L85 PathProgramCache]: Analyzing trace with hash -278185895, now seen corresponding path program 1 times [2024-11-09 07:08:08,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:08:08,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040203074] [2024-11-09 07:08:08,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:08:08,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:08:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:08:08,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:08:08,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:08:08,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040203074] [2024-11-09 07:08:08,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040203074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:08:08,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:08:08,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:08:08,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448682830] [2024-11-09 07:08:08,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:08:08,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:08:08,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:08:08,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:08:08,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:08:08,355 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 123 [2024-11-09 07:08:08,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 130 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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) [2024-11-09 07:08:08,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:08:08,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 123 [2024-11-09 07:08:08,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:08:08,683 INFO L124 PetriNetUnfolderBase]: 499/2664 cut-off events. [2024-11-09 07:08:08,684 INFO L125 PetriNetUnfolderBase]: For 238/248 co-relation queries the response was YES. [2024-11-09 07:08:08,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4080 conditions, 2664 events. 499/2664 cut-off events. For 238/248 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 24916 event pairs, 168 based on Foata normal form. 0/2374 useless extension candidates. Maximal degree in co-relation 3212. Up to 510 conditions per place. [2024-11-09 07:08:08,714 INFO L140 encePairwiseOnDemand]: 118/123 looper letters, 14 selfloop transitions, 4 changer transitions 0/137 dead transitions. [2024-11-09 07:08:08,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 137 transitions, 394 flow [2024-11-09 07:08:08,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:08:08,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:08:08,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2024-11-09 07:08:08,716 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9376693766937669 [2024-11-09 07:08:08,716 INFO L175 Difference]: Start difference. First operand has 128 places, 130 transitions, 344 flow. Second operand 3 states and 346 transitions. [2024-11-09 07:08:08,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 137 transitions, 394 flow [2024-11-09 07:08:08,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 137 transitions, 372 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:08:08,722 INFO L231 Difference]: Finished difference. Result has 129 places, 133 transitions, 352 flow [2024-11-09 07:08:08,722 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=352, PETRI_PLACES=129, PETRI_TRANSITIONS=133} [2024-11-09 07:08:08,724 INFO L277 CegarLoopForPetriNet]: 124 programPoint places, 5 predicate places. [2024-11-09 07:08:08,725 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 133 transitions, 352 flow [2024-11-09 07:08:08,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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) [2024-11-09 07:08:08,725 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:08:08,726 INFO L204 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] [2024-11-09 07:08:08,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:08:08,726 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-09 07:08:08,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:08:08,726 INFO L85 PathProgramCache]: Analyzing trace with hash 719225445, now seen corresponding path program 1 times [2024-11-09 07:08:08,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:08:08,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5239938] [2024-11-09 07:08:08,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:08:08,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:08:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:08:08,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:08:08,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:08:08,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5239938] [2024-11-09 07:08:08,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5239938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:08:08,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:08:08,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:08:08,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786067769] [2024-11-09 07:08:08,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:08:08,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:08:08,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:08:08,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:08:08,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:08:08,823 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 123 [2024-11-09 07:08:08,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 133 transitions, 352 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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) [2024-11-09 07:08:08,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:08:08,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 123 [2024-11-09 07:08:08,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:08:09,005 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([316] L704-4-->L704-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][37], [69#L704-1true, 132#true, Black: 127#true, 37#L692-2true, 83#L689-3true, Black: 134#(= |#race~data~0| 0), 137#true, 123#true, 125#true]) [2024-11-09 07:08:09,007 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2024-11-09 07:08:09,007 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-09 07:08:09,007 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-09 07:08:09,007 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2024-11-09 07:08:09,164 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([316] L704-4-->L704-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][37], [69#L704-1true, 8#L691-3true, 132#true, Black: 127#true, 37#L692-2true, 137#true, Black: 134#(= |#race~data~0| 0), 123#true, 125#true]) [2024-11-09 07:08:09,165 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2024-11-09 07:08:09,165 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-09 07:08:09,165 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-09 07:08:09,165 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-09 07:08:09,417 INFO L124 PetriNetUnfolderBase]: 1078/4632 cut-off events. [2024-11-09 07:08:09,418 INFO L125 PetriNetUnfolderBase]: For 832/973 co-relation queries the response was YES. [2024-11-09 07:08:09,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7774 conditions, 4632 events. 1078/4632 cut-off events. For 832/973 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 46249 event pairs, 540 based on Foata normal form. 39/4073 useless extension candidates. Maximal degree in co-relation 6529. Up to 1374 conditions per place. [2024-11-09 07:08:09,453 INFO L140 encePairwiseOnDemand]: 115/123 looper letters, 28 selfloop transitions, 12 changer transitions 0/147 dead transitions. [2024-11-09 07:08:09,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 147 transitions, 476 flow [2024-11-09 07:08:09,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:08:09,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:08:09,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2024-11-09 07:08:09,455 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9024390243902439 [2024-11-09 07:08:09,455 INFO L175 Difference]: Start difference. First operand has 129 places, 133 transitions, 352 flow. Second operand 3 states and 333 transitions. [2024-11-09 07:08:09,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 147 transitions, 476 flow [2024-11-09 07:08:09,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 147 transitions, 468 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:08:09,460 INFO L231 Difference]: Finished difference. Result has 131 places, 143 transitions, 450 flow [2024-11-09 07:08:09,460 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=450, PETRI_PLACES=131, PETRI_TRANSITIONS=143} [2024-11-09 07:08:09,461 INFO L277 CegarLoopForPetriNet]: 124 programPoint places, 7 predicate places. [2024-11-09 07:08:09,461 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 143 transitions, 450 flow [2024-11-09 07:08:09,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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) [2024-11-09 07:08:09,461 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:08:09,461 INFO L204 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] [2024-11-09 07:08:09,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:08:09,462 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-09 07:08:09,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:08:09,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1390000554, now seen corresponding path program 1 times [2024-11-09 07:08:09,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:08:09,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404062088] [2024-11-09 07:08:09,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:08:09,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:08:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:08:09,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:08:09,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:08:09,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404062088] [2024-11-09 07:08:09,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404062088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:08:09,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:08:09,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:08:09,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093514546] [2024-11-09 07:08:09,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:08:09,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:08:09,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:08:09,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:08:09,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:08:09,545 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 123 [2024-11-09 07:08:09,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 143 transitions, 450 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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) [2024-11-09 07:08:09,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:08:09,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 123 [2024-11-09 07:08:09,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:08:09,889 INFO L124 PetriNetUnfolderBase]: 734/3778 cut-off events. [2024-11-09 07:08:09,890 INFO L125 PetriNetUnfolderBase]: For 974/1208 co-relation queries the response was YES. [2024-11-09 07:08:09,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6438 conditions, 3778 events. 734/3778 cut-off events. For 974/1208 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 38843 event pairs, 223 based on Foata normal form. 3/3313 useless extension candidates. Maximal degree in co-relation 4259. Up to 663 conditions per place. [2024-11-09 07:08:09,916 INFO L140 encePairwiseOnDemand]: 117/123 looper letters, 16 selfloop transitions, 7 changer transitions 0/151 dead transitions. [2024-11-09 07:08:09,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 151 transitions, 523 flow [2024-11-09 07:08:09,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:08:09,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:08:09,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2024-11-09 07:08:09,920 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.926829268292683 [2024-11-09 07:08:09,920 INFO L175 Difference]: Start difference. First operand has 131 places, 143 transitions, 450 flow. Second operand 3 states and 342 transitions. [2024-11-09 07:08:09,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 151 transitions, 523 flow [2024-11-09 07:08:09,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 151 transitions, 499 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:08:09,927 INFO L231 Difference]: Finished difference. Result has 133 places, 148 transitions, 482 flow [2024-11-09 07:08:09,928 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=482, PETRI_PLACES=133, PETRI_TRANSITIONS=148} [2024-11-09 07:08:09,929 INFO L277 CegarLoopForPetriNet]: 124 programPoint places, 9 predicate places. [2024-11-09 07:08:09,929 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 148 transitions, 482 flow [2024-11-09 07:08:09,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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) [2024-11-09 07:08:09,929 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:08:09,929 INFO L204 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] [2024-11-09 07:08:09,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:08:09,930 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-09 07:08:09,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:08:09,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1523152655, now seen corresponding path program 1 times [2024-11-09 07:08:09,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:08:09,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891422720] [2024-11-09 07:08:09,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:08:09,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:08:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:08:09,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:08:09,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:08:09,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891422720] [2024-11-09 07:08:09,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891422720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:08:09,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:08:09,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:08:09,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79226851] [2024-11-09 07:08:09,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:08:09,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:08:09,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:08:09,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:08:09,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:08:10,007 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 123 [2024-11-09 07:08:10,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 148 transitions, 482 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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) [2024-11-09 07:08:10,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:08:10,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 123 [2024-11-09 07:08:10,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:08:10,111 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([316] L704-4-->L704-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][37], [69#L704-1true, Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 127#true, 147#true, 83#L689-3true, 37#L692-2true, Black: 134#(= |#race~data~0| 0), 123#true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 142#true, 125#true]) [2024-11-09 07:08:10,111 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2024-11-09 07:08:10,111 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-09 07:08:10,111 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-09 07:08:10,111 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2024-11-09 07:08:10,280 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([316] L704-4-->L704-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][37], [69#L704-1true, Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 8#L691-3true, Black: 127#true, 147#true, 37#L692-2true, Black: 134#(= |#race~data~0| 0), 123#true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 142#true, 125#true]) [2024-11-09 07:08:10,281 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2024-11-09 07:08:10,281 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-09 07:08:10,281 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-09 07:08:10,281 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-09 07:08:10,392 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([316] L704-4-->L704-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][121], [69#L704-1true, Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 127#true, 147#true, 110#L692-2true, Black: 134#(= |#race~data~0| 0), 76#L692-7true, 123#true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 142#true, 125#true]) [2024-11-09 07:08:10,392 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2024-11-09 07:08:10,393 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2024-11-09 07:08:10,393 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2024-11-09 07:08:10,393 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-11-09 07:08:10,508 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([316] L704-4-->L704-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][37], [69#L704-1true, Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 127#true, 147#true, 110#L692-2true, Black: 134#(= |#race~data~0| 0), 123#true, 53#L693true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 142#true, 125#true]) [2024-11-09 07:08:10,508 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2024-11-09 07:08:10,509 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-11-09 07:08:10,509 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-09 07:08:10,509 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-11-09 07:08:10,573 INFO L124 PetriNetUnfolderBase]: 1587/6317 cut-off events. [2024-11-09 07:08:10,573 INFO L125 PetriNetUnfolderBase]: For 3309/3589 co-relation queries the response was YES. [2024-11-09 07:08:10,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12392 conditions, 6317 events. 1587/6317 cut-off events. For 3309/3589 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 66637 event pairs, 516 based on Foata normal form. 46/5552 useless extension candidates. Maximal degree in co-relation 10314. Up to 1835 conditions per place. [2024-11-09 07:08:10,604 INFO L140 encePairwiseOnDemand]: 114/123 looper letters, 31 selfloop transitions, 19 changer transitions 0/166 dead transitions. [2024-11-09 07:08:10,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 166 transitions, 667 flow [2024-11-09 07:08:10,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:08:10,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:08:10,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions. [2024-11-09 07:08:10,606 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9132791327913279 [2024-11-09 07:08:10,606 INFO L175 Difference]: Start difference. First operand has 133 places, 148 transitions, 482 flow. Second operand 3 states and 337 transitions. [2024-11-09 07:08:10,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 166 transitions, 667 flow [2024-11-09 07:08:10,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 166 transitions, 653 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:08:10,610 INFO L231 Difference]: Finished difference. Result has 135 places, 163 transitions, 650 flow [2024-11-09 07:08:10,611 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=650, PETRI_PLACES=135, PETRI_TRANSITIONS=163} [2024-11-09 07:08:10,611 INFO L277 CegarLoopForPetriNet]: 124 programPoint places, 11 predicate places. [2024-11-09 07:08:10,611 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 163 transitions, 650 flow [2024-11-09 07:08:10,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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) [2024-11-09 07:08:10,612 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:08:10,612 INFO L204 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] [2024-11-09 07:08:10,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:08:10,612 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-09 07:08:10,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:08:10,612 INFO L85 PathProgramCache]: Analyzing trace with hash -846781257, now seen corresponding path program 1 times [2024-11-09 07:08:10,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:08:10,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079594419] [2024-11-09 07:08:10,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:08:10,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:08:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:08:10,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:08:10,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:08:10,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079594419] [2024-11-09 07:08:10,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079594419] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:08:10,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902235307] [2024-11-09 07:08:10,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:08:10,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:08:10,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:08:10,684 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:08:10,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 07:08:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:08:10,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:08:10,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:08:10,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:08:10,847 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:08:10,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902235307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:08:10,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:08:10,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-09 07:08:10,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835737476] [2024-11-09 07:08:10,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:08:10,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:08:10,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:08:10,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:08:10,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:08:10,872 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 123 [2024-11-09 07:08:10,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 163 transitions, 650 flow. Second operand has 5 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 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) [2024-11-09 07:08:10,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:08:10,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 123 [2024-11-09 07:08:10,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:08:11,594 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([316] L704-4-->L704-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][127], [69#L704-1true, Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 147#true, Black: 127#true, 110#L692-2true, Black: 149#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 134#(= |#race~data~0| 0), 123#true, 76#L692-7true, 152#true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 125#true]) [2024-11-09 07:08:11,594 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2024-11-09 07:08:11,594 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-11-09 07:08:11,594 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2024-11-09 07:08:11,594 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2024-11-09 07:08:11,596 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([316] L704-4-->L704-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][127], [69#L704-1true, Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 147#true, Black: 127#true, 156#(<= 1 ~threads_alive~0), 110#L692-2true, Black: 149#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 134#(= |#race~data~0| 0), 123#true, 76#L692-7true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 125#true]) [2024-11-09 07:08:11,596 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2024-11-09 07:08:11,596 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2024-11-09 07:08:11,596 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2024-11-09 07:08:11,596 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-11-09 07:08:11,662 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([316] L704-4-->L704-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][37], [69#L704-1true, Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 127#true, 147#true, Black: 149#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 134#(= |#race~data~0| 0), 80#L692-1true, 123#true, 53#L693true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 152#true, 125#true]) [2024-11-09 07:08:11,663 INFO L294 olderBase$Statistics]: this new event has 112 ancestors and is cut-off event [2024-11-09 07:08:11,663 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2024-11-09 07:08:11,663 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2024-11-09 07:08:11,663 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2024-11-09 07:08:11,665 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([316] L704-4-->L704-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][37], [69#L704-1true, Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 127#true, 147#true, 110#L692-2true, Black: 149#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 134#(= |#race~data~0| 0), 123#true, 53#L693true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 152#true, 125#true]) [2024-11-09 07:08:11,665 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2024-11-09 07:08:11,665 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-09 07:08:11,665 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-11-09 07:08:11,665 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-11-09 07:08:11,699 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([316] L704-4-->L704-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][37], [69#L704-1true, Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 127#true, 147#true, 110#L692-2true, Black: 149#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 134#(= |#race~data~0| 0), 123#true, 53#L693true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 152#true, 125#true]) [2024-11-09 07:08:11,699 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2024-11-09 07:08:11,699 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-09 07:08:11,699 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-11-09 07:08:11,699 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-11-09 07:08:11,700 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-09 07:08:11,701 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([316] L704-4-->L704-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][37], [69#L704-1true, Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 127#true, 147#true, 156#(<= 1 ~threads_alive~0), 110#L692-2true, Black: 149#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 134#(= |#race~data~0| 0), 123#true, 53#L693true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 125#true]) [2024-11-09 07:08:11,701 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2024-11-09 07:08:11,701 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-09 07:08:11,701 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-11-09 07:08:11,701 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-11-09 07:08:11,750 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([296] L699-5-->L699-6: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_3| |v_#race~threads_alive~0_4|) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|, #race~threads_alive~0=|v_#race~threads_alive~0_4|} AuxVars[] AssignedVars[#race~threads_alive~0][38], [Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 129#(= |#race~threads_alive~0| 0), 147#true, 110#L692-2true, Black: 149#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 134#(= |#race~data~0| 0), 63#L699-6true, 123#true, 53#L693true, 345#(and (<= 0 |ULTIMATE.start_main_#t~post7#1|) (<= 1 ~threads_alive~0)), Black: 137#true, 125#true]) [2024-11-09 07:08:11,750 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is not cut-off event [2024-11-09 07:08:11,750 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2024-11-09 07:08:11,750 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2024-11-09 07:08:11,751 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2024-11-09 07:08:11,955 INFO L124 PetriNetUnfolderBase]: 2671/9850 cut-off events. [2024-11-09 07:08:11,955 INFO L125 PetriNetUnfolderBase]: For 7644/8678 co-relation queries the response was YES. [2024-11-09 07:08:11,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21259 conditions, 9850 events. 2671/9850 cut-off events. For 7644/8678 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 113272 event pairs, 388 based on Foata normal form. 101/8792 useless extension candidates. Maximal degree in co-relation 16920. Up to 2237 conditions per place. [2024-11-09 07:08:12,010 INFO L140 encePairwiseOnDemand]: 115/123 looper letters, 36 selfloop transitions, 14 changer transitions 2/198 dead transitions. [2024-11-09 07:08:12,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 198 transitions, 825 flow [2024-11-09 07:08:12,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:08:12,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 07:08:12,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 781 transitions. [2024-11-09 07:08:12,012 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9070847851335656 [2024-11-09 07:08:12,012 INFO L175 Difference]: Start difference. First operand has 135 places, 163 transitions, 650 flow. Second operand 7 states and 781 transitions. [2024-11-09 07:08:12,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 198 transitions, 825 flow [2024-11-09 07:08:12,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 198 transitions, 787 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:08:12,038 INFO L231 Difference]: Finished difference. Result has 142 places, 176 transitions, 691 flow [2024-11-09 07:08:12,038 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=691, PETRI_PLACES=142, PETRI_TRANSITIONS=176} [2024-11-09 07:08:12,039 INFO L277 CegarLoopForPetriNet]: 124 programPoint places, 18 predicate places. [2024-11-09 07:08:12,039 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 176 transitions, 691 flow [2024-11-09 07:08:12,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 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) [2024-11-09 07:08:12,040 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:08:12,040 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:08:12,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 07:08:12,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-09 07:08:12,245 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-09 07:08:12,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:08:12,246 INFO L85 PathProgramCache]: Analyzing trace with hash -904098375, now seen corresponding path program 1 times [2024-11-09 07:08:12,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:08:12,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595530489] [2024-11-09 07:08:12,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:08:12,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:08:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:08:12,259 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 07:08:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:08:12,270 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 07:08:12,271 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 07:08:12,271 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr1ASSERT_VIOLATIONDATA_RACE (13 of 14 remaining) [2024-11-09 07:08:12,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2024-11-09 07:08:12,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2024-11-09 07:08:12,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2024-11-09 07:08:12,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2024-11-09 07:08:12,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 14 remaining) [2024-11-09 07:08:12,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2024-11-09 07:08:12,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2024-11-09 07:08:12,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2024-11-09 07:08:12,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2024-11-09 07:08:12,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2024-11-09 07:08:12,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2024-11-09 07:08:12,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2024-11-09 07:08:12,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2024-11-09 07:08:12,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:08:12,273 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:08:12,304 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2024-11-09 07:08:12,305 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:08:12,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:08:12 BasicIcfg [2024-11-09 07:08:12,309 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:08:12,310 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:08:12,310 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:08:12,310 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:08:12,310 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:08:05" (3/4) ... [2024-11-09 07:08:12,311 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 07:08:12,350 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 07:08:12,350 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:08:12,351 INFO L158 Benchmark]: Toolchain (without parser) took 7476.44ms. Allocated memory was 176.2MB in the beginning and 545.3MB in the end (delta: 369.1MB). Free memory was 105.9MB in the beginning and 285.2MB in the end (delta: -179.3MB). Peak memory consumption was 190.0MB. Max. memory is 16.1GB. [2024-11-09 07:08:12,351 INFO L158 Benchmark]: CDTParser took 4.05ms. Allocated memory is still 176.2MB. Free memory was 135.3MB in the beginning and 135.1MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:08:12,351 INFO L158 Benchmark]: CACSL2BoogieTranslator took 570.87ms. Allocated memory is still 176.2MB. Free memory was 105.7MB in the beginning and 137.9MB in the end (delta: -32.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 07:08:12,351 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.84ms. Allocated memory is still 176.2MB. Free memory was 137.9MB in the beginning and 135.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:08:12,351 INFO L158 Benchmark]: Boogie Preprocessor took 30.04ms. Allocated memory is still 176.2MB. Free memory was 135.7MB in the beginning and 134.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:08:12,352 INFO L158 Benchmark]: RCFGBuilder took 389.28ms. Allocated memory is still 176.2MB. Free memory was 134.5MB in the beginning and 119.0MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 07:08:12,352 INFO L158 Benchmark]: TraceAbstraction took 6392.33ms. Allocated memory was 176.2MB in the beginning and 545.3MB in the end (delta: 369.1MB). Free memory was 118.6MB in the beginning and 294.6MB in the end (delta: -176.0MB). Peak memory consumption was 196.2MB. Max. memory is 16.1GB. [2024-11-09 07:08:12,352 INFO L158 Benchmark]: Witness Printer took 40.69ms. Allocated memory is still 545.3MB. Free memory was 294.6MB in the beginning and 285.2MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 07:08:12,353 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 4.05ms. Allocated memory is still 176.2MB. Free memory was 135.3MB in the beginning and 135.1MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 570.87ms. Allocated memory is still 176.2MB. Free memory was 105.7MB in the beginning and 137.9MB in the end (delta: -32.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.84ms. Allocated memory is still 176.2MB. Free memory was 137.9MB in the beginning and 135.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.04ms. Allocated memory is still 176.2MB. Free memory was 135.7MB in the beginning and 134.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 389.28ms. Allocated memory is still 176.2MB. Free memory was 134.5MB in the beginning and 119.0MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6392.33ms. Allocated memory was 176.2MB in the beginning and 545.3MB in the end (delta: 369.1MB). Free memory was 118.6MB in the beginning and 294.6MB in the end (delta: -176.0MB). Peak memory consumption was 196.2MB. Max. memory is 16.1GB. * Witness Printer took 40.69ms. Allocated memory is still 545.3MB. Free memory was 294.6MB in the beginning and 285.2MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 692]: Data race detected Data race detected The following path leads to a data race: [L685] 0 int threads_alive = 0; VAL [threads_alive=0] [L686] 0 int data = 0; VAL [data=0, threads_alive=0] [L687] 0 pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [data=0, data_mutex={1:0}, threads_alive=0] [L696] 0 int threads_total = __VERIFIER_nondet_int(); VAL [data=0, data_mutex={1:0}, threads_alive=0, threads_total=2] [L697] CALL 0 assume_abort_if_not(threads_total >= 0) [L682] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, data=0, data_mutex={1:0}, threads_alive=0] [L697] RET 0 assume_abort_if_not(threads_total >= 0) [L698] 0 int i = 0; VAL [data=0, data_mutex={1:0}, i=0, threads_alive=0, threads_total=2] [L698] COND TRUE 0 i < threads_total VAL [data=0, data_mutex={1:0}, i=0, threads_alive=0, threads_total=2] [L699] 0 threads_alive++ VAL [data=0, data_mutex={1:0}, i=0, threads_alive=1, threads_total=2] [L700] 0 pthread_t tid; VAL [data=0, data_mutex={1:0}, i=0, threads_alive=1, threads_total=2] [L701] FCALL, FORK 0 pthread_create(&tid, ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=0, threads_alive=1, threads_total=2, tid=-1] [L690] 1 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_alive=1] [L698] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_alive=1, threads_total=2] [L698] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_alive=1, threads_total=2] [L699] 0 threads_alive++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_alive=1, threads_total=2] [L692] 1 threads_alive-- VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_alive=1] [L699] 0 threads_alive++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_alive=2, threads_total=2] [L692] 1 threads_alive-- VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_alive=2] Now there is a data race on ~threads_alive~0 between C: threads_alive++ [699] and C: threads_alive-- [692] - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 704]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 120 locations, 11 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.7s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 118 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 135 IncrementalHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 34 mSDtfsCounter, 135 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=408occurred in iteration=5, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 259 NumberOfCodeBlocks, 259 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 192 ConstructedInterpolants, 0 QuantifiedInterpolants, 202 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 148 locations, 14 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: 4.5s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 227 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 104 mSDsluCounter, 45 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 287 IncrementalHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 37 mSDtfsCounter, 287 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=691occurred in iteration=6, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 390 NumberOfCodeBlocks, 390 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 314 ConstructedInterpolants, 0 QuantifiedInterpolants, 520 SizeOfPredicates, 2 NumberOfNonLiveVariables, 117 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 1/2 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-09 07:08:12,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE