./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3061b6dc 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-2.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 d12d10876782f724294e520e736e39c29f3c74eafacabb114f7449f7b8388c75 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:05:45,538 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:05:45,600 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-19 06:05:45,619 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:05:45,620 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:05:45,654 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:05:45,654 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:05:45,654 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:05:45,655 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:05:45,655 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:05:45,656 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:05:45,656 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:05:45,656 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:05:45,657 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:05:45,659 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:05:45,659 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:05:45,660 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:05:45,664 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:05:45,664 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:05:45,664 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:05:45,664 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:05:45,665 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:05:45,665 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 06:05:45,667 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:05:45,668 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:05:45,668 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:05:45,669 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:05:45,669 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:05:45,669 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:05:45,669 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:05:45,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:05:45,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:05:45,670 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:05:45,671 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:05:45,671 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 06:05:45,671 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:05:45,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:05:45,672 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:05:45,672 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:05:45,673 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:05:45,673 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:05:45,673 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 -> d12d10876782f724294e520e736e39c29f3c74eafacabb114f7449f7b8388c75 [2024-11-19 06:05:45,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:05:45,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:05:45,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:05:45,947 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:05:45,949 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:05:45,950 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-2.i [2024-11-19 06:05:47,353 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:05:47,608 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:05:47,610 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-2.i [2024-11-19 06:05:47,628 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1501f3d9c/27d606a617be4fb5b19c2cba84d6ae82/FLAG004dcaa7d [2024-11-19 06:05:47,641 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1501f3d9c/27d606a617be4fb5b19c2cba84d6ae82 [2024-11-19 06:05:47,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:05:47,644 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:05:47,647 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:05:47,648 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:05:47,653 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:05:47,654 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:05:47" (1/1) ... [2024-11-19 06:05:47,657 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f2c3595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:05:47, skipping insertion in model container [2024-11-19 06:05:47,657 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:05:47" (1/1) ... [2024-11-19 06:05:47,700 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:05:48,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:05:48,075 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:05:48,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:05:48,185 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:05:48,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:05:48 WrapperNode [2024-11-19 06:05:48,185 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:05:48,187 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:05:48,187 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:05:48,187 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:05:48,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:05:48" (1/1) ... [2024-11-19 06:05:48,207 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:05:48" (1/1) ... [2024-11-19 06:05:48,233 INFO L138 Inliner]: procedures = 159, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 198 [2024-11-19 06:05:48,234 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:05:48,235 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:05:48,235 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:05:48,235 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:05:48,244 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:05:48" (1/1) ... [2024-11-19 06:05:48,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:05:48" (1/1) ... [2024-11-19 06:05:48,248 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:05:48" (1/1) ... [2024-11-19 06:05:48,248 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:05:48" (1/1) ... [2024-11-19 06:05:48,260 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:05:48" (1/1) ... [2024-11-19 06:05:48,264 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:05:48" (1/1) ... [2024-11-19 06:05:48,266 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:05:48" (1/1) ... [2024-11-19 06:05:48,268 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:05:48" (1/1) ... [2024-11-19 06:05:48,271 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:05:48,272 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:05:48,272 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:05:48,272 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:05:48,273 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:05:48" (1/1) ... [2024-11-19 06:05:48,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:05:48,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:05:48,311 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-19 06:05:48,318 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-19 06:05:48,368 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-19 06:05:48,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:05:48,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 06:05:48,369 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-19 06:05:48,369 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-19 06:05:48,369 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-19 06:05:48,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:05:48,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:05:48,371 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 06:05:48,550 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:05:48,552 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:05:48,847 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 06:05:48,848 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:05:48,900 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:05:48,904 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 06:05:48,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:05:48 BoogieIcfgContainer [2024-11-19 06:05:48,905 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:05:48,907 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:05:48,907 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:05:48,911 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:05:48,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:05:47" (1/3) ... [2024-11-19 06:05:48,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a7b83ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:05:48, skipping insertion in model container [2024-11-19 06:05:48,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:05:48" (2/3) ... [2024-11-19 06:05:48,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a7b83ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:05:48, skipping insertion in model container [2024-11-19 06:05:48,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:05:48" (3/3) ... [2024-11-19 06:05:48,914 INFO L112 eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer-race-2.i [2024-11-19 06:05:48,931 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:05:48,932 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-19 06:05:48,932 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 06:05:49,010 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 06:05:49,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 234 transitions, 472 flow [2024-11-19 06:05:49,266 INFO L124 PetriNetUnfolderBase]: 7/276 cut-off events. [2024-11-19 06:05:49,267 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 06:05:49,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 276 events. 7/276 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 239 event pairs, 0 based on Foata normal form. 0/256 useless extension candidates. Maximal degree in co-relation 193. Up to 4 conditions per place. [2024-11-19 06:05:49,279 INFO L82 GeneralOperation]: Start removeDead. Operand has 233 places, 234 transitions, 472 flow [2024-11-19 06:05:49,287 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 233 places, 234 transitions, 472 flow [2024-11-19 06:05:49,301 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:05:49,308 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;@3aa5abe0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:05:49,308 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-19 06:05:49,338 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 06:05:49,339 INFO L124 PetriNetUnfolderBase]: 2/160 cut-off events. [2024-11-19 06:05:49,339 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 06:05:49,339 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:05:49,340 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:05:49,341 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-19 06:05:49,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:05:49,346 INFO L85 PathProgramCache]: Analyzing trace with hash -548724940, now seen corresponding path program 1 times [2024-11-19 06:05:49,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:05:49,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123081955] [2024-11-19 06:05:49,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:05:49,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:05:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:05:49,823 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-19 06:05:49,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:05:49,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123081955] [2024-11-19 06:05:49,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123081955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:05:49,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:05:49,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:05:49,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762707825] [2024-11-19 06:05:49,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:05:49,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:05:49,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:05:49,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:05:49,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:05:49,897 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 234 [2024-11-19 06:05:49,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 234 transitions, 472 flow. Second operand has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 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-19 06:05:49,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:05:49,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 234 [2024-11-19 06:05:49,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:05:50,184 INFO L124 PetriNetUnfolderBase]: 116/821 cut-off events. [2024-11-19 06:05:50,185 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 06:05:50,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1091 conditions, 821 events. 116/821 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 4322 event pairs, 37 based on Foata normal form. 8/755 useless extension candidates. Maximal degree in co-relation 880. Up to 144 conditions per place. [2024-11-19 06:05:50,195 INFO L140 encePairwiseOnDemand]: 220/234 looper letters, 32 selfloop transitions, 8 changer transitions 1/249 dead transitions. [2024-11-19 06:05:50,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 249 transitions, 582 flow [2024-11-19 06:05:50,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:05:50,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:05:50,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 675 transitions. [2024-11-19 06:05:50,212 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9615384615384616 [2024-11-19 06:05:50,214 INFO L175 Difference]: Start difference. First operand has 233 places, 234 transitions, 472 flow. Second operand 3 states and 675 transitions. [2024-11-19 06:05:50,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 249 transitions, 582 flow [2024-11-19 06:05:50,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 249 transitions, 582 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:05:50,230 INFO L231 Difference]: Finished difference. Result has 237 places, 238 transitions, 534 flow [2024-11-19 06:05:50,233 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=534, PETRI_PLACES=237, PETRI_TRANSITIONS=238} [2024-11-19 06:05:50,237 INFO L277 CegarLoopForPetriNet]: 233 programPoint places, 4 predicate places. [2024-11-19 06:05:50,238 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 238 transitions, 534 flow [2024-11-19 06:05:50,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 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-19 06:05:50,239 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:05:50,240 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:05:50,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:05:50,240 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-19 06:05:50,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:05:50,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1331078444, now seen corresponding path program 1 times [2024-11-19 06:05:50,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:05:50,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864841986] [2024-11-19 06:05:50,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:05:50,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:05:50,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:05:50,437 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-19 06:05:50,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:05:50,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864841986] [2024-11-19 06:05:50,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864841986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:05:50,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:05:50,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:05:50,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936564816] [2024-11-19 06:05:50,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:05:50,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:05:50,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:05:50,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:05:50,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:05:50,495 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 234 [2024-11-19 06:05:50,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 238 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 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-19 06:05:50,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:05:50,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 234 [2024-11-19 06:05:50,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:05:50,701 INFO L124 PetriNetUnfolderBase]: 134/959 cut-off events. [2024-11-19 06:05:50,702 INFO L125 PetriNetUnfolderBase]: For 166/171 co-relation queries the response was YES. [2024-11-19 06:05:50,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1449 conditions, 959 events. 134/959 cut-off events. For 166/171 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 5602 event pairs, 84 based on Foata normal form. 4/886 useless extension candidates. Maximal degree in co-relation 1226. Up to 266 conditions per place. [2024-11-19 06:05:50,711 INFO L140 encePairwiseOnDemand]: 228/234 looper letters, 29 selfloop transitions, 7 changer transitions 0/247 dead transitions. [2024-11-19 06:05:50,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 247 transitions, 634 flow [2024-11-19 06:05:50,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:05:50,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:05:50,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions. [2024-11-19 06:05:50,714 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9373219373219374 [2024-11-19 06:05:50,714 INFO L175 Difference]: Start difference. First operand has 237 places, 238 transitions, 534 flow. Second operand 3 states and 658 transitions. [2024-11-19 06:05:50,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 247 transitions, 634 flow [2024-11-19 06:05:50,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 247 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:05:50,724 INFO L231 Difference]: Finished difference. Result has 238 places, 243 transitions, 574 flow [2024-11-19 06:05:50,726 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=574, PETRI_PLACES=238, PETRI_TRANSITIONS=243} [2024-11-19 06:05:50,727 INFO L277 CegarLoopForPetriNet]: 233 programPoint places, 5 predicate places. [2024-11-19 06:05:50,727 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 243 transitions, 574 flow [2024-11-19 06:05:50,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 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-19 06:05:50,728 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:05:50,728 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:05:50,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:05:50,729 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-19 06:05:50,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:05:50,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1295908703, now seen corresponding path program 1 times [2024-11-19 06:05:50,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:05:50,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088085257] [2024-11-19 06:05:50,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:05:50,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:05:50,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:05:50,827 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-19 06:05:50,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:05:50,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088085257] [2024-11-19 06:05:50,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088085257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:05:50,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:05:50,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:05:50,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96319801] [2024-11-19 06:05:50,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:05:50,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:05:50,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:05:50,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:05:50,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:05:50,843 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 234 [2024-11-19 06:05:50,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 243 transitions, 574 flow. Second operand has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 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-19 06:05:50,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:05:50,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 234 [2024-11-19 06:05:50,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:05:51,006 INFO L124 PetriNetUnfolderBase]: 93/896 cut-off events. [2024-11-19 06:05:51,007 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-11-19 06:05:51,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1253 conditions, 896 events. 93/896 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5218 event pairs, 51 based on Foata normal form. 0/833 useless extension candidates. Maximal degree in co-relation 1035. Up to 147 conditions per place. [2024-11-19 06:05:51,014 INFO L140 encePairwiseOnDemand]: 230/234 looper letters, 17 selfloop transitions, 3 changer transitions 1/249 dead transitions. [2024-11-19 06:05:51,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 249 transitions, 628 flow [2024-11-19 06:05:51,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:05:51,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:05:51,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 670 transitions. [2024-11-19 06:05:51,017 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9544159544159544 [2024-11-19 06:05:51,017 INFO L175 Difference]: Start difference. First operand has 238 places, 243 transitions, 574 flow. Second operand 3 states and 670 transitions. [2024-11-19 06:05:51,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 249 transitions, 628 flow [2024-11-19 06:05:51,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 249 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:05:51,026 INFO L231 Difference]: Finished difference. Result has 240 places, 245 transitions, 582 flow [2024-11-19 06:05:51,026 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=582, PETRI_PLACES=240, PETRI_TRANSITIONS=245} [2024-11-19 06:05:51,027 INFO L277 CegarLoopForPetriNet]: 233 programPoint places, 7 predicate places. [2024-11-19 06:05:51,028 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 245 transitions, 582 flow [2024-11-19 06:05:51,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 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-19 06:05:51,029 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:05:51,029 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:05:51,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:05:51,030 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-19 06:05:51,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:05:51,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1173892455, now seen corresponding path program 1 times [2024-11-19 06:05:51,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:05:51,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997455342] [2024-11-19 06:05:51,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:05:51,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:05:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:05:51,167 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-19 06:05:51,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:05:51,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997455342] [2024-11-19 06:05:51,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997455342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:05:51,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:05:51,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:05:51,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405477050] [2024-11-19 06:05:51,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:05:51,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:05:51,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:05:51,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:05:51,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:05:51,207 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 234 [2024-11-19 06:05:51,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 245 transitions, 582 flow. Second operand has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 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-19 06:05:51,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:05:51,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 234 [2024-11-19 06:05:51,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:05:51,370 INFO L124 PetriNetUnfolderBase]: 175/1102 cut-off events. [2024-11-19 06:05:51,370 INFO L125 PetriNetUnfolderBase]: For 174/181 co-relation queries the response was YES. [2024-11-19 06:05:51,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1759 conditions, 1102 events. 175/1102 cut-off events. For 174/181 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 6768 event pairs, 79 based on Foata normal form. 3/1032 useless extension candidates. Maximal degree in co-relation 1622. Up to 303 conditions per place. [2024-11-19 06:05:51,377 INFO L140 encePairwiseOnDemand]: 227/234 looper letters, 30 selfloop transitions, 11 changer transitions 0/258 dead transitions. [2024-11-19 06:05:51,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 258 transitions, 704 flow [2024-11-19 06:05:51,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:05:51,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:05:51,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 665 transitions. [2024-11-19 06:05:51,380 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9472934472934473 [2024-11-19 06:05:51,380 INFO L175 Difference]: Start difference. First operand has 240 places, 245 transitions, 582 flow. Second operand 3 states and 665 transitions. [2024-11-19 06:05:51,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 258 transitions, 704 flow [2024-11-19 06:05:51,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 258 transitions, 698 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:05:51,387 INFO L231 Difference]: Finished difference. Result has 242 places, 252 transitions, 664 flow [2024-11-19 06:05:51,387 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=664, PETRI_PLACES=242, PETRI_TRANSITIONS=252} [2024-11-19 06:05:51,388 INFO L277 CegarLoopForPetriNet]: 233 programPoint places, 9 predicate places. [2024-11-19 06:05:51,389 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 252 transitions, 664 flow [2024-11-19 06:05:51,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 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-19 06:05:51,389 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:05:51,390 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:05:51,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 06:05:51,390 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-19 06:05:51,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:05:51,391 INFO L85 PathProgramCache]: Analyzing trace with hash -988774254, now seen corresponding path program 1 times [2024-11-19 06:05:51,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:05:51,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173132419] [2024-11-19 06:05:51,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:05:51,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:05:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:05:51,659 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:05:51,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:05:51,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173132419] [2024-11-19 06:05:51,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173132419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:05:51,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:05:51,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:05:51,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633518540] [2024-11-19 06:05:51,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:05:51,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:05:51,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:05:51,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:05:51,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:05:51,675 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 234 [2024-11-19 06:05:51,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 252 transitions, 664 flow. Second operand has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 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-19 06:05:51,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:05:51,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 234 [2024-11-19 06:05:51,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:05:51,762 INFO L124 PetriNetUnfolderBase]: 23/510 cut-off events. [2024-11-19 06:05:51,762 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2024-11-19 06:05:51,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 717 conditions, 510 events. 23/510 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1835 event pairs, 7 based on Foata normal form. 6/497 useless extension candidates. Maximal degree in co-relation 496. Up to 44 conditions per place. [2024-11-19 06:05:51,764 INFO L140 encePairwiseOnDemand]: 225/234 looper letters, 6 selfloop transitions, 9 changer transitions 2/234 dead transitions. [2024-11-19 06:05:51,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 234 transitions, 566 flow [2024-11-19 06:05:51,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:05:51,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:05:51,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 678 transitions. [2024-11-19 06:05:51,766 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9658119658119658 [2024-11-19 06:05:51,766 INFO L175 Difference]: Start difference. First operand has 242 places, 252 transitions, 664 flow. Second operand 3 states and 678 transitions. [2024-11-19 06:05:51,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 234 transitions, 566 flow [2024-11-19 06:05:51,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 234 transitions, 532 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-11-19 06:05:51,772 INFO L231 Difference]: Finished difference. Result has 234 places, 231 transitions, 523 flow [2024-11-19 06:05:51,772 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=523, PETRI_PLACES=234, PETRI_TRANSITIONS=231} [2024-11-19 06:05:51,773 INFO L277 CegarLoopForPetriNet]: 233 programPoint places, 1 predicate places. [2024-11-19 06:05:51,773 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 231 transitions, 523 flow [2024-11-19 06:05:51,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 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-19 06:05:51,774 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:05:51,774 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:05:51,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 06:05:51,775 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-19 06:05:51,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:05:51,775 INFO L85 PathProgramCache]: Analyzing trace with hash 388988448, now seen corresponding path program 1 times [2024-11-19 06:05:51,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:05:51,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570738469] [2024-11-19 06:05:51,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:05:51,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:05:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:05:51,857 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-19 06:05:51,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:05:51,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570738469] [2024-11-19 06:05:51,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570738469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:05:51,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:05:51,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:05:51,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440342159] [2024-11-19 06:05:51,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:05:51,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:05:51,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:05:51,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:05:51,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:05:51,871 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 234 [2024-11-19 06:05:51,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 231 transitions, 523 flow. Second operand has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 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-19 06:05:51,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:05:51,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 234 [2024-11-19 06:05:51,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:05:51,983 INFO L124 PetriNetUnfolderBase]: 65/676 cut-off events. [2024-11-19 06:05:51,983 INFO L125 PetriNetUnfolderBase]: For 139/148 co-relation queries the response was YES. [2024-11-19 06:05:51,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1086 conditions, 676 events. 65/676 cut-off events. For 139/148 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3244 event pairs, 31 based on Foata normal form. 1/657 useless extension candidates. Maximal degree in co-relation 866. Up to 137 conditions per place. [2024-11-19 06:05:51,986 INFO L140 encePairwiseOnDemand]: 229/234 looper letters, 23 selfloop transitions, 4 changer transitions 3/240 dead transitions. [2024-11-19 06:05:51,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 240 transitions, 619 flow [2024-11-19 06:05:51,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:05:51,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:05:51,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 669 transitions. [2024-11-19 06:05:51,988 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9529914529914529 [2024-11-19 06:05:51,988 INFO L175 Difference]: Start difference. First operand has 234 places, 231 transitions, 523 flow. Second operand 3 states and 669 transitions. [2024-11-19 06:05:51,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 240 transitions, 619 flow [2024-11-19 06:05:51,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 240 transitions, 604 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 06:05:51,993 INFO L231 Difference]: Finished difference. Result has 237 places, 231 transitions, 536 flow [2024-11-19 06:05:51,993 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=536, PETRI_PLACES=237, PETRI_TRANSITIONS=231} [2024-11-19 06:05:51,994 INFO L277 CegarLoopForPetriNet]: 233 programPoint places, 4 predicate places. [2024-11-19 06:05:51,994 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 231 transitions, 536 flow [2024-11-19 06:05:51,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 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-19 06:05:51,995 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:05:51,995 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:05:51,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 06:05:51,996 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-19 06:05:51,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:05:51,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1428460310, now seen corresponding path program 1 times [2024-11-19 06:05:51,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:05:51,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752107305] [2024-11-19 06:05:51,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:05:51,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:05:52,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:05:52,044 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 06:05:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:05:52,146 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 06:05:52,147 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 06:05:52,148 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2024-11-19 06:05:52,149 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2024-11-19 06:05:52,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2024-11-19 06:05:52,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2024-11-19 06:05:52,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2024-11-19 06:05:52,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2024-11-19 06:05:52,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2024-11-19 06:05:52,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2024-11-19 06:05:52,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2024-11-19 06:05:52,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2024-11-19 06:05:52,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2024-11-19 06:05:52,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 06:05:52,151 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:05:52,154 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-19 06:05:52,154 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-19 06:05:52,176 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 06:05:52,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 267 places, 266 transitions, 542 flow [2024-11-19 06:05:52,224 INFO L124 PetriNetUnfolderBase]: 10/358 cut-off events. [2024-11-19 06:05:52,224 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 06:05:52,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366 conditions, 358 events. 10/358 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 413 event pairs, 0 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 277. Up to 6 conditions per place. [2024-11-19 06:05:52,226 INFO L82 GeneralOperation]: Start removeDead. Operand has 267 places, 266 transitions, 542 flow [2024-11-19 06:05:52,228 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 267 places, 266 transitions, 542 flow [2024-11-19 06:05:52,230 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:05:52,230 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;@3aa5abe0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:05:52,231 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-19 06:05:52,242 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 06:05:52,243 INFO L124 PetriNetUnfolderBase]: 2/160 cut-off events. [2024-11-19 06:05:52,243 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 06:05:52,243 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:05:52,243 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:05:52,244 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-19 06:05:52,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:05:52,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1521434764, now seen corresponding path program 1 times [2024-11-19 06:05:52,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:05:52,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214902115] [2024-11-19 06:05:52,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:05:52,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:05:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:05:52,320 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-19 06:05:52,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:05:52,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214902115] [2024-11-19 06:05:52,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214902115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:05:52,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:05:52,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:05:52,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464947013] [2024-11-19 06:05:52,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:05:52,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:05:52,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:05:52,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:05:52,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:05:52,355 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 266 [2024-11-19 06:05:52,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 266 transitions, 542 flow. Second operand has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 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-19 06:05:52,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:05:52,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 266 [2024-11-19 06:05:52,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:05:53,740 INFO L124 PetriNetUnfolderBase]: 2700/8735 cut-off events. [2024-11-19 06:05:53,741 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2024-11-19 06:05:53,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13188 conditions, 8735 events. 2700/8735 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 88776 event pairs, 968 based on Foata normal form. 85/7831 useless extension candidates. Maximal degree in co-relation 5927. Up to 2282 conditions per place. [2024-11-19 06:05:53,797 INFO L140 encePairwiseOnDemand]: 248/266 looper letters, 46 selfloop transitions, 11 changer transitions 1/289 dead transitions. [2024-11-19 06:05:53,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 289 transitions, 707 flow [2024-11-19 06:05:53,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:05:53,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:05:53,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 762 transitions. [2024-11-19 06:05:53,800 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9548872180451128 [2024-11-19 06:05:53,800 INFO L175 Difference]: Start difference. First operand has 267 places, 266 transitions, 542 flow. Second operand 3 states and 762 transitions. [2024-11-19 06:05:53,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 289 transitions, 707 flow [2024-11-19 06:05:53,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 289 transitions, 707 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:05:53,872 INFO L231 Difference]: Finished difference. Result has 271 places, 273 transitions, 630 flow [2024-11-19 06:05:53,873 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=271, PETRI_TRANSITIONS=273} [2024-11-19 06:05:53,873 INFO L277 CegarLoopForPetriNet]: 267 programPoint places, 4 predicate places. [2024-11-19 06:05:53,873 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 273 transitions, 630 flow [2024-11-19 06:05:53,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 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-19 06:05:53,874 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:05:53,874 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:05:53,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 06:05:53,874 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-19 06:05:53,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:05:53,875 INFO L85 PathProgramCache]: Analyzing trace with hash 137137014, now seen corresponding path program 1 times [2024-11-19 06:05:53,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:05:53,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536164659] [2024-11-19 06:05:53,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:05:53,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:05:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:05:53,951 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-19 06:05:53,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:05:53,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536164659] [2024-11-19 06:05:53,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536164659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:05:53,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:05:53,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:05:53,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616386964] [2024-11-19 06:05:53,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:05:53,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:05:53,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:05:53,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:05:53,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:05:53,997 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 266 [2024-11-19 06:05:53,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 273 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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-19 06:05:53,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:05:53,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 266 [2024-11-19 06:05:53,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:05:55,907 INFO L124 PetriNetUnfolderBase]: 2944/10783 cut-off events. [2024-11-19 06:05:55,908 INFO L125 PetriNetUnfolderBase]: For 3011/3115 co-relation queries the response was YES. [2024-11-19 06:05:55,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18652 conditions, 10783 events. 2944/10783 cut-off events. For 3011/3115 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 119273 event pairs, 1867 based on Foata normal form. 56/9768 useless extension candidates. Maximal degree in co-relation 16666. Up to 4168 conditions per place. [2024-11-19 06:05:55,982 INFO L140 encePairwiseOnDemand]: 258/266 looper letters, 42 selfloop transitions, 12 changer transitions 0/291 dead transitions. [2024-11-19 06:05:55,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 291 transitions, 798 flow [2024-11-19 06:05:55,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:05:55,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:05:55,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 746 transitions. [2024-11-19 06:05:55,985 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348370927318296 [2024-11-19 06:05:55,986 INFO L175 Difference]: Start difference. First operand has 271 places, 273 transitions, 630 flow. Second operand 3 states and 746 transitions. [2024-11-19 06:05:55,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 291 transitions, 798 flow [2024-11-19 06:05:55,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 291 transitions, 768 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:05:55,997 INFO L231 Difference]: Finished difference. Result has 272 places, 283 transitions, 714 flow [2024-11-19 06:05:55,998 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=714, PETRI_PLACES=272, PETRI_TRANSITIONS=283} [2024-11-19 06:05:56,001 INFO L277 CegarLoopForPetriNet]: 267 programPoint places, 5 predicate places. [2024-11-19 06:05:56,001 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 283 transitions, 714 flow [2024-11-19 06:05:56,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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-19 06:05:56,003 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:05:56,003 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:05:56,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 06:05:56,004 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-19 06:05:56,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:05:56,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1356536993, now seen corresponding path program 1 times [2024-11-19 06:05:56,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:05:56,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552682346] [2024-11-19 06:05:56,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:05:56,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:05:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:05:56,067 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-19 06:05:56,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:05:56,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552682346] [2024-11-19 06:05:56,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552682346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:05:56,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:05:56,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:05:56,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205752295] [2024-11-19 06:05:56,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:05:56,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:05:56,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:05:56,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:05:56,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:05:56,082 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 266 [2024-11-19 06:05:56,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 283 transitions, 714 flow. Second operand has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 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-19 06:05:56,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:05:56,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 266 [2024-11-19 06:05:56,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:05:57,746 INFO L124 PetriNetUnfolderBase]: 2291/10347 cut-off events. [2024-11-19 06:05:57,746 INFO L125 PetriNetUnfolderBase]: For 1030/1094 co-relation queries the response was YES. [2024-11-19 06:05:57,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16095 conditions, 10347 events. 2291/10347 cut-off events. For 1030/1094 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 119641 event pairs, 1380 based on Foata normal form. 4/9331 useless extension candidates. Maximal degree in co-relation 14478. Up to 2487 conditions per place. [2024-11-19 06:05:57,925 INFO L140 encePairwiseOnDemand]: 261/266 looper letters, 28 selfloop transitions, 4 changer transitions 0/294 dead transitions. [2024-11-19 06:05:57,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 294 transitions, 800 flow [2024-11-19 06:05:57,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:05:57,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:05:57,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 759 transitions. [2024-11-19 06:05:57,928 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9511278195488722 [2024-11-19 06:05:57,928 INFO L175 Difference]: Start difference. First operand has 272 places, 283 transitions, 714 flow. Second operand 3 states and 759 transitions. [2024-11-19 06:05:57,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 294 transitions, 800 flow [2024-11-19 06:05:57,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 294 transitions, 776 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:05:57,942 INFO L231 Difference]: Finished difference. Result has 274 places, 286 transitions, 720 flow [2024-11-19 06:05:57,943 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=720, PETRI_PLACES=274, PETRI_TRANSITIONS=286} [2024-11-19 06:05:57,944 INFO L277 CegarLoopForPetriNet]: 267 programPoint places, 7 predicate places. [2024-11-19 06:05:57,945 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 286 transitions, 720 flow [2024-11-19 06:05:57,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 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-19 06:05:57,945 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:05:57,946 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:05:57,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 06:05:57,946 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-19 06:05:57,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:05:57,950 INFO L85 PathProgramCache]: Analyzing trace with hash 491341624, now seen corresponding path program 1 times [2024-11-19 06:05:57,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:05:57,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370940488] [2024-11-19 06:05:57,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:05:57,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:05:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:05:58,013 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-19 06:05:58,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:05:58,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370940488] [2024-11-19 06:05:58,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370940488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:05:58,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:05:58,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:05:58,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289874538] [2024-11-19 06:05:58,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:05:58,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:05:58,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:05:58,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:05:58,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:05:58,048 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 266 [2024-11-19 06:05:58,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 286 transitions, 720 flow. Second operand has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 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-19 06:05:58,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:05:58,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 266 [2024-11-19 06:05:58,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:05:58,966 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([722] L713-6-->L712-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][251], [Black: 270#true, 268#true, 200#L712-1true, Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 243#L692-2true, 280#true, Black: 282#(= |#race~data~0| 0), 266#true, 68#L692-7true, 285#true]) [2024-11-19 06:05:58,967 INFO L294 olderBase$Statistics]: this new event has 228 ancestors and is cut-off event [2024-11-19 06:05:58,967 INFO L297 olderBase$Statistics]: existing Event has 223 ancestors and is cut-off event [2024-11-19 06:05:58,967 INFO L297 olderBase$Statistics]: existing Event has 223 ancestors and is cut-off event [2024-11-19 06:05:58,967 INFO L297 olderBase$Statistics]: existing Event has 228 ancestors and is cut-off event [2024-11-19 06:05:59,137 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([722] L713-6-->L712-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][172], [Black: 270#true, 200#L712-1true, 268#true, Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 243#L692-2true, 280#true, Black: 282#(= |#race~data~0| 0), 266#true, 285#true, 209#L694true]) [2024-11-19 06:05:59,137 INFO L294 olderBase$Statistics]: this new event has 230 ancestors and is cut-off event [2024-11-19 06:05:59,137 INFO L297 olderBase$Statistics]: existing Event has 225 ancestors and is cut-off event [2024-11-19 06:05:59,137 INFO L297 olderBase$Statistics]: existing Event has 225 ancestors and is cut-off event [2024-11-19 06:05:59,138 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2024-11-19 06:05:59,196 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([722] L713-6-->L712-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][172], [112#L694-3true, Black: 270#true, 268#true, 200#L712-1true, Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 243#L692-2true, 280#true, Black: 282#(= |#race~data~0| 0), 266#true, 285#true]) [2024-11-19 06:05:59,196 INFO L294 olderBase$Statistics]: this new event has 231 ancestors and is cut-off event [2024-11-19 06:05:59,196 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2024-11-19 06:05:59,196 INFO L297 olderBase$Statistics]: existing Event has 226 ancestors and is cut-off event [2024-11-19 06:05:59,196 INFO L297 olderBase$Statistics]: existing Event has 226 ancestors and is cut-off event [2024-11-19 06:05:59,300 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([722] L713-6-->L712-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][172], [Black: 270#true, 200#L712-1true, 268#true, Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 243#L692-2true, 280#true, Black: 282#(= |#race~data~0| 0), 266#true, 222#L695-3true, 285#true]) [2024-11-19 06:05:59,300 INFO L294 olderBase$Statistics]: this new event has 233 ancestors and is cut-off event [2024-11-19 06:05:59,300 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2024-11-19 06:05:59,300 INFO L297 olderBase$Statistics]: existing Event has 228 ancestors and is cut-off event [2024-11-19 06:05:59,300 INFO L297 olderBase$Statistics]: existing Event has 228 ancestors and is cut-off event [2024-11-19 06:05:59,914 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([722] L713-6-->L712-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][172], [Black: 270#true, 200#L712-1true, 268#true, Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 243#L692-2true, 280#true, Black: 282#(= |#race~data~0| 0), 266#true, 264#L697-3true, 285#true]) [2024-11-19 06:05:59,915 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2024-11-19 06:05:59,915 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2024-11-19 06:05:59,915 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-11-19 06:05:59,915 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2024-11-19 06:06:00,542 INFO L124 PetriNetUnfolderBase]: 4357/14868 cut-off events. [2024-11-19 06:06:00,542 INFO L125 PetriNetUnfolderBase]: For 5382/5814 co-relation queries the response was YES. [2024-11-19 06:06:00,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27211 conditions, 14868 events. 4357/14868 cut-off events. For 5382/5814 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 169246 event pairs, 2217 based on Foata normal form. 111/13359 useless extension candidates. Maximal degree in co-relation 25085. Up to 5572 conditions per place. [2024-11-19 06:06:00,646 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 49 selfloop transitions, 19 changer transitions 0/312 dead transitions. [2024-11-19 06:06:00,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 312 transitions, 957 flow [2024-11-19 06:06:00,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:06:00,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:06:00,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 754 transitions. [2024-11-19 06:06:00,649 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9448621553884712 [2024-11-19 06:06:00,649 INFO L175 Difference]: Start difference. First operand has 274 places, 286 transitions, 720 flow. Second operand 3 states and 754 transitions. [2024-11-19 06:06:00,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 312 transitions, 957 flow [2024-11-19 06:06:00,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 312 transitions, 949 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:06:00,667 INFO L231 Difference]: Finished difference. Result has 276 places, 301 transitions, 894 flow [2024-11-19 06:06:00,667 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=276, PETRI_TRANSITIONS=301} [2024-11-19 06:06:00,668 INFO L277 CegarLoopForPetriNet]: 267 programPoint places, 9 predicate places. [2024-11-19 06:06:00,669 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 301 transitions, 894 flow [2024-11-19 06:06:00,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 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-19 06:06:00,670 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:06:00,670 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:06:00,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 06:06:00,670 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-19 06:06:00,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:06:00,671 INFO L85 PathProgramCache]: Analyzing trace with hash 621024817, now seen corresponding path program 1 times [2024-11-19 06:06:00,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:06:00,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968175196] [2024-11-19 06:06:00,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:06:00,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:06:00,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:06:00,887 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:06:00,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:06:00,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968175196] [2024-11-19 06:06:00,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968175196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:06:00,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:06:00,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:06:00,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016954181] [2024-11-19 06:06:00,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:06:00,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:06:00,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:06:00,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:06:00,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:06:00,901 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 266 [2024-11-19 06:06:00,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 301 transitions, 894 flow. Second operand has 3 states, 3 states have (on average 248.0) internal successors, (744), 3 states have internal predecessors, (744), 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-19 06:06:00,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:06:00,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 266 [2024-11-19 06:06:00,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:06:01,455 INFO L124 PetriNetUnfolderBase]: 455/3435 cut-off events. [2024-11-19 06:06:01,455 INFO L125 PetriNetUnfolderBase]: For 773/816 co-relation queries the response was YES. [2024-11-19 06:06:01,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5476 conditions, 3435 events. 455/3435 cut-off events. For 773/816 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 32232 event pairs, 150 based on Foata normal form. 71/3267 useless extension candidates. Maximal degree in co-relation 2748. Up to 485 conditions per place. [2024-11-19 06:06:01,474 INFO L140 encePairwiseOnDemand]: 254/266 looper letters, 15 selfloop transitions, 12 changer transitions 0/301 dead transitions. [2024-11-19 06:06:01,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 301 transitions, 883 flow [2024-11-19 06:06:01,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:06:01,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:06:01,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 770 transitions. [2024-11-19 06:06:01,477 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9649122807017544 [2024-11-19 06:06:01,477 INFO L175 Difference]: Start difference. First operand has 276 places, 301 transitions, 894 flow. Second operand 3 states and 770 transitions. [2024-11-19 06:06:01,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 301 transitions, 883 flow [2024-11-19 06:06:01,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 301 transitions, 861 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:06:01,485 INFO L231 Difference]: Finished difference. Result has 277 places, 298 transitions, 846 flow [2024-11-19 06:06:01,486 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=846, PETRI_PLACES=277, PETRI_TRANSITIONS=298} [2024-11-19 06:06:01,487 INFO L277 CegarLoopForPetriNet]: 267 programPoint places, 10 predicate places. [2024-11-19 06:06:01,487 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 298 transitions, 846 flow [2024-11-19 06:06:01,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.0) internal successors, (744), 3 states have internal predecessors, (744), 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-19 06:06:01,488 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:06:01,488 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:06:01,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 06:06:01,489 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-19 06:06:01,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:06:01,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1998787519, now seen corresponding path program 1 times [2024-11-19 06:06:01,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:06:01,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372746904] [2024-11-19 06:06:01,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:06:01,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:06:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:06:01,556 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-19 06:06:01,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:06:01,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372746904] [2024-11-19 06:06:01,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372746904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:06:01,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:06:01,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:06:01,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020397625] [2024-11-19 06:06:01,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:06:01,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:06:01,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:06:01,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:06:01,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:06:01,577 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 266 [2024-11-19 06:06:01,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 298 transitions, 846 flow. Second operand has 3 states, 3 states have (on average 243.0) internal successors, (729), 3 states have internal predecessors, (729), 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-19 06:06:01,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:06:01,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 266 [2024-11-19 06:06:01,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:06:02,330 INFO L124 PetriNetUnfolderBase]: 1326/5995 cut-off events. [2024-11-19 06:06:02,330 INFO L125 PetriNetUnfolderBase]: For 2522/2706 co-relation queries the response was YES. [2024-11-19 06:06:02,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11965 conditions, 5995 events. 1326/5995 cut-off events. For 2522/2706 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 60886 event pairs, 634 based on Foata normal form. 8/5612 useless extension candidates. Maximal degree in co-relation 10722. Up to 1800 conditions per place. [2024-11-19 06:06:02,366 INFO L140 encePairwiseOnDemand]: 260/266 looper letters, 45 selfloop transitions, 7 changer transitions 0/318 dead transitions. [2024-11-19 06:06:02,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 318 transitions, 1036 flow [2024-11-19 06:06:02,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:06:02,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:06:02,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 759 transitions. [2024-11-19 06:06:02,369 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9511278195488722 [2024-11-19 06:06:02,369 INFO L175 Difference]: Start difference. First operand has 277 places, 298 transitions, 846 flow. Second operand 3 states and 759 transitions. [2024-11-19 06:06:02,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 318 transitions, 1036 flow [2024-11-19 06:06:02,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 318 transitions, 1015 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 06:06:02,378 INFO L231 Difference]: Finished difference. Result has 280 places, 303 transitions, 890 flow [2024-11-19 06:06:02,378 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=890, PETRI_PLACES=280, PETRI_TRANSITIONS=303} [2024-11-19 06:06:02,379 INFO L277 CegarLoopForPetriNet]: 267 programPoint places, 13 predicate places. [2024-11-19 06:06:02,379 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 303 transitions, 890 flow [2024-11-19 06:06:02,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.0) internal successors, (729), 3 states have internal predecessors, (729), 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-19 06:06:02,380 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:06:02,380 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:06:02,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 06:06:02,380 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-19 06:06:02,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:06:02,381 INFO L85 PathProgramCache]: Analyzing trace with hash 630969115, now seen corresponding path program 1 times [2024-11-19 06:06:02,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:06:02,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879159317] [2024-11-19 06:06:02,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:06:02,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:06:02,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:06:02,463 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-19 06:06:02,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:06:02,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879159317] [2024-11-19 06:06:02,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879159317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:06:02,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:06:02,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:06:02,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123867907] [2024-11-19 06:06:02,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:06:02,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:06:02,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:06:02,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:06:02,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:06:02,498 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 266 [2024-11-19 06:06:02,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 303 transitions, 890 flow. Second operand has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 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-19 06:06:02,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:06:02,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 266 [2024-11-19 06:06:02,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:06:03,017 INFO L124 PetriNetUnfolderBase]: 820/4565 cut-off events. [2024-11-19 06:06:03,018 INFO L125 PetriNetUnfolderBase]: For 2639/2996 co-relation queries the response was YES. [2024-11-19 06:06:03,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9256 conditions, 4565 events. 820/4565 cut-off events. For 2639/2996 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 45949 event pairs, 395 based on Foata normal form. 8/4297 useless extension candidates. Maximal degree in co-relation 8261. Up to 1381 conditions per place. [2024-11-19 06:06:03,040 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 56 selfloop transitions, 11 changer transitions 0/318 dead transitions. [2024-11-19 06:06:03,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 318 transitions, 1092 flow [2024-11-19 06:06:03,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:06:03,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:06:03,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 749 transitions. [2024-11-19 06:06:03,043 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9385964912280702 [2024-11-19 06:06:03,043 INFO L175 Difference]: Start difference. First operand has 280 places, 303 transitions, 890 flow. Second operand 3 states and 749 transitions. [2024-11-19 06:06:03,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 318 transitions, 1092 flow [2024-11-19 06:06:03,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 318 transitions, 1078 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:06:03,053 INFO L231 Difference]: Finished difference. Result has 282 places, 310 transitions, 974 flow [2024-11-19 06:06:03,054 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=974, PETRI_PLACES=282, PETRI_TRANSITIONS=310} [2024-11-19 06:06:03,054 INFO L277 CegarLoopForPetriNet]: 267 programPoint places, 15 predicate places. [2024-11-19 06:06:03,054 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 310 transitions, 974 flow [2024-11-19 06:06:03,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 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-19 06:06:03,055 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:06:03,055 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:06:03,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 06:06:03,056 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-19 06:06:03,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:06:03,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1889572392, now seen corresponding path program 1 times [2024-11-19 06:06:03,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:06:03,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508300180] [2024-11-19 06:06:03,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:06:03,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:06:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:06:03,088 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 06:06:03,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:06:03,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 06:06:03,162 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 06:06:03,162 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 14 remaining) [2024-11-19 06:06:03,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2024-11-19 06:06:03,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2024-11-19 06:06:03,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2024-11-19 06:06:03,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 14 remaining) [2024-11-19 06:06:03,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2024-11-19 06:06:03,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2024-11-19 06:06:03,164 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2024-11-19 06:06:03,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2024-11-19 06:06:03,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2024-11-19 06:06:03,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2024-11-19 06:06:03,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2024-11-19 06:06:03,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2024-11-19 06:06:03,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2024-11-19 06:06:03,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 06:06:03,166 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:06:03,359 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-11-19 06:06:03,360 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-11-19 06:06:03,364 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-11-19 06:06:03,374 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2024-11-19 06:06:03,374 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 06:06:03,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:06:03 BasicIcfg [2024-11-19 06:06:03,380 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 06:06:03,381 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 06:06:03,381 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 06:06:03,381 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 06:06:03,381 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:05:48" (3/4) ... [2024-11-19 06:06:03,382 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 06:06:03,508 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-11-19 06:06:03,508 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-11-19 06:06:03,509 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-11-19 06:06:03,548 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 06:06:03,548 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 06:06:03,549 INFO L158 Benchmark]: Toolchain (without parser) took 15904.26ms. Allocated memory was 174.1MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 117.8MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 917.4MB. Max. memory is 16.1GB. [2024-11-19 06:06:03,549 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 174.1MB. Free memory is still 141.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:06:03,549 INFO L158 Benchmark]: CACSL2BoogieTranslator took 538.58ms. Allocated memory is still 174.1MB. Free memory was 117.4MB in the beginning and 94.4MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-19 06:06:03,549 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.47ms. Allocated memory is still 174.1MB. Free memory was 94.4MB in the beginning and 91.8MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 06:06:03,550 INFO L158 Benchmark]: Boogie Preprocessor took 36.07ms. Allocated memory is still 174.1MB. Free memory was 91.8MB in the beginning and 89.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 06:06:03,550 INFO L158 Benchmark]: RCFGBuilder took 633.30ms. Allocated memory is still 174.1MB. Free memory was 89.3MB in the beginning and 65.8MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-19 06:06:03,550 INFO L158 Benchmark]: TraceAbstraction took 14473.65ms. Allocated memory was 174.1MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 65.4MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 797.9MB. Max. memory is 16.1GB. [2024-11-19 06:06:03,551 INFO L158 Benchmark]: Witness Printer took 167.32ms. Allocated memory is still 4.8GB. Free memory was 3.9GB in the beginning and 3.8GB in the end (delta: 67.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2024-11-19 06:06:03,552 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 174.1MB. Free memory is still 141.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 538.58ms. Allocated memory is still 174.1MB. Free memory was 117.4MB in the beginning and 94.4MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.47ms. Allocated memory is still 174.1MB. Free memory was 94.4MB in the beginning and 91.8MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.07ms. Allocated memory is still 174.1MB. Free memory was 91.8MB in the beginning and 89.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 633.30ms. Allocated memory is still 174.1MB. Free memory was 89.3MB in the beginning and 65.8MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 14473.65ms. Allocated memory was 174.1MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 65.4MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 797.9MB. Max. memory is 16.1GB. * Witness Printer took 167.32ms. Allocated memory is still 4.8GB. Free memory was 3.9GB in the beginning and 3.8GB in the end (delta: 67.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 715]: 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 pthread_mutex_t threads_alive_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [threads_alive=0, threads_alive_mutex={1:0}] [L687] 0 pthread_cond_t threads_alive_cond = { { {0}, {0}, {0, 0}, {0, 0}, 0, 0, {0, 0} } }; VAL [threads_alive=0, threads_alive_mutex={1:0}] [L688] 0 int data = 0; VAL [data=0, threads_alive=0, threads_alive_mutex={1:0}] [L689] 0 pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}] [L701] 0 int threads_total = __VERIFIER_nondet_int(); VAL [data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L702] CALL 0 assume_abort_if_not(threads_total >= 0) [L682] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}] [L702] RET 0 assume_abort_if_not(threads_total >= 0) [L703] 0 int i = 0; VAL [data=0, data_mutex={2:0}, i=0, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L703] COND TRUE 0 i < threads_total VAL [data=0, data_mutex={2:0}, i=0, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L705] 0 threads_alive++ VAL [data=0, data_mutex={2:0}, i=0, threads_alive=1, threads_alive_mutex={1:0}, threads_total=1] [L707] 0 pthread_t tid; VAL [data=0, data_mutex={2:0}, i=0, threads_alive=1, threads_alive_mutex={1:0}, threads_total=1] [L708] FCALL, FORK 0 pthread_create(&tid, ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={2:0}, i=0, threads_alive=1, threads_alive_mutex={1:0}, threads_total=1, tid=-1] [L692] 1 threads_alive-- VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}] [L696] 1 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}] [L703] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, i=1, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L703] COND FALSE 0 !(i < threads_total) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, i=1, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L712] COND FALSE 0 !(\read(threads_alive)) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L715] 0 return data; VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L696] 1 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}] [L715] 0 return data; VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] Now there is a data race on ~data~0 between C: data = __VERIFIER_nondet_int() [696] and C: return data; [715] - 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: 712]: 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: 708]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 692]: 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. - UnprovableResult [Line: 696]: 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, 263 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: 3.1s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 138 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 63 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 266 IncrementalHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 17 mSDtfsCounter, 266 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=664occurred in iteration=4, InterpolantAutomatonStates: 18, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1226 NumberOfCodeBlocks, 1226 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1025 ConstructedInterpolants, 0 QuantifiedInterpolants, 1059 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 9/9 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, 295 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: 11.0s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 281 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 126 mSDsluCounter, 36 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 464 IncrementalHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 36 mSDtfsCounter, 464 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=974occurred in iteration=7, InterpolantAutomatonStates: 21, 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, 1444 NumberOfCodeBlocks, 1444 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1229 ConstructedInterpolants, 0 QuantifiedInterpolants, 1265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 28/28 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-19 06:06:03,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE