./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/clever.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/clever.wvr.c -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 f1b460e4dbdd0bf3097d690d1720c7a2141566e2aa4ca1ed003c7fa25661851d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 15:31:46,624 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 15:31:46,698 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-24 15:31:46,703 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 15:31:46,705 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 15:31:46,726 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 15:31:46,728 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 15:31:46,728 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 15:31:46,728 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 15:31:46,731 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 15:31:46,731 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 15:31:46,732 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 15:31:46,732 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 15:31:46,732 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 15:31:46,732 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 15:31:46,732 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 15:31:46,733 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 15:31:46,734 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 15:31:46,734 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 15:31:46,734 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 15:31:46,735 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 15:31:46,735 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 15:31:46,735 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-24 15:31:46,735 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 15:31:46,735 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 15:31:46,736 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 15:31:46,736 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 15:31:46,736 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 15:31:46,736 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 15:31:46,736 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 15:31:46,736 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 15:31:46,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:31:46,737 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 15:31:46,737 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 15:31:46,737 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 15:31:46,737 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 15:31:46,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 15:31:46,737 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 15:31:46,737 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 15:31:46,737 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 15:31:46,738 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 15:31:46,739 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 -> f1b460e4dbdd0bf3097d690d1720c7a2141566e2aa4ca1ed003c7fa25661851d [2024-10-24 15:31:46,940 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 15:31:46,959 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 15:31:46,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 15:31:46,963 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 15:31:46,964 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 15:31:46,965 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/clever.wvr.c [2024-10-24 15:31:48,164 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 15:31:48,313 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 15:31:48,314 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/clever.wvr.c [2024-10-24 15:31:48,321 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13dc36ed7/266dff8a7956405b8d36a1fde49317b9/FLAG90eb3b529 [2024-10-24 15:31:48,725 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13dc36ed7/266dff8a7956405b8d36a1fde49317b9 [2024-10-24 15:31:48,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 15:31:48,729 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 15:31:48,730 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 15:31:48,730 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 15:31:48,734 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 15:31:48,734 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:31:48" (1/1) ... [2024-10-24 15:31:48,735 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bd75d36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:48, skipping insertion in model container [2024-10-24 15:31:48,735 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:31:48" (1/1) ... [2024-10-24 15:31:48,755 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:31:48,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:31:48,971 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 15:31:48,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:31:49,001 INFO L204 MainTranslator]: Completed translation [2024-10-24 15:31:49,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:49 WrapperNode [2024-10-24 15:31:49,001 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 15:31:49,002 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 15:31:49,002 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 15:31:49,002 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 15:31:49,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:49" (1/1) ... [2024-10-24 15:31:49,015 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:49" (1/1) ... [2024-10-24 15:31:49,030 INFO L138 Inliner]: procedures = 18, calls = 12, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 134 [2024-10-24 15:31:49,030 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 15:31:49,031 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 15:31:49,031 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 15:31:49,031 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 15:31:49,038 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:49" (1/1) ... [2024-10-24 15:31:49,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:49" (1/1) ... [2024-10-24 15:31:49,040 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:49" (1/1) ... [2024-10-24 15:31:49,040 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:49" (1/1) ... [2024-10-24 15:31:49,044 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:49" (1/1) ... [2024-10-24 15:31:49,049 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:49" (1/1) ... [2024-10-24 15:31:49,050 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:49" (1/1) ... [2024-10-24 15:31:49,052 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:49" (1/1) ... [2024-10-24 15:31:49,054 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 15:31:49,055 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 15:31:49,055 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 15:31:49,055 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 15:31:49,056 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:49" (1/1) ... [2024-10-24 15:31:49,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:31:49,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 15:31:49,083 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-10-24 15:31:49,086 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-10-24 15:31:49,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 15:31:49,123 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-24 15:31:49,124 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-24 15:31:49,124 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-24 15:31:49,124 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-24 15:31:49,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-24 15:31:49,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 15:31:49,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 15:31:49,125 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-24 15:31:49,223 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 15:31:49,224 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 15:31:49,511 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 15:31:49,511 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 15:31:49,529 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 15:31:49,530 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-24 15:31:49,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:31:49 BoogieIcfgContainer [2024-10-24 15:31:49,530 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 15:31:49,533 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 15:31:49,533 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 15:31:49,536 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 15:31:49,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:31:48" (1/3) ... [2024-10-24 15:31:49,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba16c71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:31:49, skipping insertion in model container [2024-10-24 15:31:49,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:31:49" (2/3) ... [2024-10-24 15:31:49,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba16c71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:31:49, skipping insertion in model container [2024-10-24 15:31:49,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:31:49" (3/3) ... [2024-10-24 15:31:49,540 INFO L112 eAbstractionObserver]: Analyzing ICFG clever.wvr.c [2024-10-24 15:31:49,552 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 15:31:49,553 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2024-10-24 15:31:49,553 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 15:31:49,619 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-24 15:31:49,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 261 places, 266 transitions, 546 flow [2024-10-24 15:31:49,717 INFO L124 PetriNetUnfolderBase]: 12/264 cut-off events. [2024-10-24 15:31:49,718 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-24 15:31:49,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 264 events. 12/264 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 440 event pairs, 0 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 204. Up to 2 conditions per place. [2024-10-24 15:31:49,726 INFO L82 GeneralOperation]: Start removeDead. Operand has 261 places, 266 transitions, 546 flow [2024-10-24 15:31:49,734 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 243 places, 247 transitions, 506 flow [2024-10-24 15:31:49,744 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 15:31:49,751 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;@468251d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 15:31:49,751 INFO L334 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2024-10-24 15:31:49,757 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 15:31:49,757 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2024-10-24 15:31:49,757 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 15:31:49,758 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:49,758 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] [2024-10-24 15:31:49,759 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-24 15:31:49,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:49,762 INFO L85 PathProgramCache]: Analyzing trace with hash 578639531, now seen corresponding path program 1 times [2024-10-24 15:31:49,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:49,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603273229] [2024-10-24 15:31:49,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:49,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:49,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:49,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:49,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603273229] [2024-10-24 15:31:49,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603273229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:49,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:49,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:31:49,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702575703] [2024-10-24 15:31:49,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:49,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:31:49,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:49,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:31:49,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:31:49,972 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 266 [2024-10-24 15:31:49,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 247 transitions, 506 flow. Second operand has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 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-10-24 15:31:49,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:49,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 266 [2024-10-24 15:31:49,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:31:50,051 INFO L124 PetriNetUnfolderBase]: 13/361 cut-off events. [2024-10-24 15:31:50,051 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-24 15:31:50,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 393 conditions, 361 events. 13/361 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1009 event pairs, 3 based on Foata normal form. 13/306 useless extension candidates. Maximal degree in co-relation 231. Up to 18 conditions per place. [2024-10-24 15:31:50,055 INFO L140 encePairwiseOnDemand]: 258/266 looper letters, 9 selfloop transitions, 2 changer transitions 2/241 dead transitions. [2024-10-24 15:31:50,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 241 transitions, 516 flow [2024-10-24 15:31:50,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:31:50,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:31:50,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 755 transitions. [2024-10-24 15:31:50,072 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9461152882205514 [2024-10-24 15:31:50,077 INFO L175 Difference]: Start difference. First operand has 243 places, 247 transitions, 506 flow. Second operand 3 states and 755 transitions. [2024-10-24 15:31:50,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 241 transitions, 516 flow [2024-10-24 15:31:50,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 241 transitions, 508 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-24 15:31:50,085 INFO L231 Difference]: Finished difference. Result has 240 places, 239 transitions, 486 flow [2024-10-24 15:31:50,087 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=486, PETRI_PLACES=240, PETRI_TRANSITIONS=239} [2024-10-24 15:31:50,090 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -3 predicate places. [2024-10-24 15:31:50,090 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 239 transitions, 486 flow [2024-10-24 15:31:50,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 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-10-24 15:31:50,091 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:50,091 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:31:50,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 15:31:50,091 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-24 15:31:50,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:50,092 INFO L85 PathProgramCache]: Analyzing trace with hash 917335090, now seen corresponding path program 1 times [2024-10-24 15:31:50,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:50,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286185858] [2024-10-24 15:31:50,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:50,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:50,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:50,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:50,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286185858] [2024-10-24 15:31:50,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286185858] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:50,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:50,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:31:50,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167117637] [2024-10-24 15:31:50,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:50,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:31:50,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:50,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:31:50,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:31:50,204 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 266 [2024-10-24 15:31:50,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 239 transitions, 486 flow. Second operand has 3 states, 3 states have (on average 246.33333333333334) internal successors, (739), 3 states have internal predecessors, (739), 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-10-24 15:31:50,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:50,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 266 [2024-10-24 15:31:50,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:31:50,240 INFO L124 PetriNetUnfolderBase]: 10/279 cut-off events. [2024-10-24 15:31:50,241 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2024-10-24 15:31:50,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 279 events. 10/279 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 591 event pairs, 3 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 274. Up to 17 conditions per place. [2024-10-24 15:31:50,245 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 10 selfloop transitions, 2 changer transitions 0/238 dead transitions. [2024-10-24 15:31:50,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 238 transitions, 508 flow [2024-10-24 15:31:50,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:31:50,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:31:50,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 748 transitions. [2024-10-24 15:31:50,249 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9373433583959899 [2024-10-24 15:31:50,249 INFO L175 Difference]: Start difference. First operand has 240 places, 239 transitions, 486 flow. Second operand 3 states and 748 transitions. [2024-10-24 15:31:50,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 238 transitions, 508 flow [2024-10-24 15:31:50,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 238 transitions, 504 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:31:50,255 INFO L231 Difference]: Finished difference. Result has 237 places, 238 transitions, 484 flow [2024-10-24 15:31:50,257 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=484, PETRI_PLACES=237, PETRI_TRANSITIONS=238} [2024-10-24 15:31:50,257 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -6 predicate places. [2024-10-24 15:31:50,257 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 238 transitions, 484 flow [2024-10-24 15:31:50,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.33333333333334) internal successors, (739), 3 states have internal predecessors, (739), 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-10-24 15:31:50,258 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:50,258 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] [2024-10-24 15:31:50,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 15:31:50,259 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-24 15:31:50,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:50,259 INFO L85 PathProgramCache]: Analyzing trace with hash -385693522, now seen corresponding path program 1 times [2024-10-24 15:31:50,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:50,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872234841] [2024-10-24 15:31:50,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:50,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:50,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:50,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:50,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:50,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872234841] [2024-10-24 15:31:50,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872234841] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:50,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:50,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:31:50,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651060671] [2024-10-24 15:31:50,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:50,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:31:50,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:50,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:31:50,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:31:50,356 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 266 [2024-10-24 15:31:50,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 238 transitions, 484 flow. Second operand has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 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-10-24 15:31:50,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:50,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 266 [2024-10-24 15:31:50,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:31:50,392 INFO L124 PetriNetUnfolderBase]: 11/298 cut-off events. [2024-10-24 15:31:50,392 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-24 15:31:50,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 298 events. 11/298 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 688 event pairs, 3 based on Foata normal form. 0/247 useless extension candidates. Maximal degree in co-relation 292. Up to 22 conditions per place. [2024-10-24 15:31:50,396 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 14 selfloop transitions, 2 changer transitions 0/237 dead transitions. [2024-10-24 15:31:50,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 237 transitions, 514 flow [2024-10-24 15:31:50,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:31:50,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:31:50,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 740 transitions. [2024-10-24 15:31:50,398 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9273182957393483 [2024-10-24 15:31:50,398 INFO L175 Difference]: Start difference. First operand has 237 places, 238 transitions, 484 flow. Second operand 3 states and 740 transitions. [2024-10-24 15:31:50,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 237 transitions, 514 flow [2024-10-24 15:31:50,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 237 transitions, 510 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:31:50,402 INFO L231 Difference]: Finished difference. Result has 236 places, 237 transitions, 482 flow [2024-10-24 15:31:50,402 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=482, PETRI_PLACES=236, PETRI_TRANSITIONS=237} [2024-10-24 15:31:50,403 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -7 predicate places. [2024-10-24 15:31:50,403 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 237 transitions, 482 flow [2024-10-24 15:31:50,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 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-10-24 15:31:50,404 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:50,404 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] [2024-10-24 15:31:50,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 15:31:50,405 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-24 15:31:50,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:50,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1229539445, now seen corresponding path program 1 times [2024-10-24 15:31:50,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:50,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251342110] [2024-10-24 15:31:50,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:50,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:50,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:50,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:50,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251342110] [2024-10-24 15:31:50,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251342110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:50,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:50,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:31:50,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262561214] [2024-10-24 15:31:50,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:50,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:31:50,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:50,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:31:50,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:31:50,474 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 266 [2024-10-24 15:31:50,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 237 transitions, 482 flow. Second operand has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 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-10-24 15:31:50,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:50,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 266 [2024-10-24 15:31:50,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:31:50,503 INFO L124 PetriNetUnfolderBase]: 10/273 cut-off events. [2024-10-24 15:31:50,503 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2024-10-24 15:31:50,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 273 events. 10/273 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 571 event pairs, 3 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 253. Up to 19 conditions per place. [2024-10-24 15:31:50,505 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 11 selfloop transitions, 2 changer transitions 0/236 dead transitions. [2024-10-24 15:31:50,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 236 transitions, 506 flow [2024-10-24 15:31:50,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:31:50,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:31:50,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 746 transitions. [2024-10-24 15:31:50,508 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348370927318296 [2024-10-24 15:31:50,508 INFO L175 Difference]: Start difference. First operand has 236 places, 237 transitions, 482 flow. Second operand 3 states and 746 transitions. [2024-10-24 15:31:50,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 236 transitions, 506 flow [2024-10-24 15:31:50,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 236 transitions, 502 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:31:50,511 INFO L231 Difference]: Finished difference. Result has 235 places, 236 transitions, 480 flow [2024-10-24 15:31:50,511 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=480, PETRI_PLACES=235, PETRI_TRANSITIONS=236} [2024-10-24 15:31:50,512 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -8 predicate places. [2024-10-24 15:31:50,513 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 236 transitions, 480 flow [2024-10-24 15:31:50,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 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-10-24 15:31:50,513 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:50,513 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] [2024-10-24 15:31:50,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 15:31:50,514 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-24 15:31:50,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:50,514 INFO L85 PathProgramCache]: Analyzing trace with hash 578115641, now seen corresponding path program 1 times [2024-10-24 15:31:50,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:50,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424055178] [2024-10-24 15:31:50,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:50,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:50,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:50,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:50,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:50,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424055178] [2024-10-24 15:31:50,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424055178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:50,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:50,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:31:50,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280862433] [2024-10-24 15:31:50,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:50,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:31:50,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:50,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:31:50,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:31:50,586 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 266 [2024-10-24 15:31:50,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 236 transitions, 480 flow. Second operand has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 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-10-24 15:31:50,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:50,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 266 [2024-10-24 15:31:50,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:31:50,646 INFO L124 PetriNetUnfolderBase]: 14/387 cut-off events. [2024-10-24 15:31:50,646 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2024-10-24 15:31:50,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 419 conditions, 387 events. 14/387 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1032 event pairs, 4 based on Foata normal form. 0/318 useless extension candidates. Maximal degree in co-relation 364. Up to 20 conditions per place. [2024-10-24 15:31:50,648 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 11 selfloop transitions, 2 changer transitions 0/235 dead transitions. [2024-10-24 15:31:50,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 235 transitions, 504 flow [2024-10-24 15:31:50,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:31:50,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:31:50,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 746 transitions. [2024-10-24 15:31:50,650 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348370927318296 [2024-10-24 15:31:50,650 INFO L175 Difference]: Start difference. First operand has 235 places, 236 transitions, 480 flow. Second operand 3 states and 746 transitions. [2024-10-24 15:31:50,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 235 transitions, 504 flow [2024-10-24 15:31:50,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 235 transitions, 500 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:31:50,653 INFO L231 Difference]: Finished difference. Result has 234 places, 235 transitions, 478 flow [2024-10-24 15:31:50,654 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=478, PETRI_PLACES=234, PETRI_TRANSITIONS=235} [2024-10-24 15:31:50,655 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -9 predicate places. [2024-10-24 15:31:50,655 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 235 transitions, 478 flow [2024-10-24 15:31:50,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 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-10-24 15:31:50,656 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:50,656 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:31:50,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 15:31:50,657 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-24 15:31:50,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:50,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1185114072, now seen corresponding path program 1 times [2024-10-24 15:31:50,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:50,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730753292] [2024-10-24 15:31:50,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:50,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:50,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:50,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:50,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730753292] [2024-10-24 15:31:50,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730753292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:50,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:50,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:31:50,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389345428] [2024-10-24 15:31:50,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:50,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:31:50,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:50,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:31:50,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:31:50,731 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 266 [2024-10-24 15:31:50,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 235 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 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-10-24 15:31:50,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:50,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 266 [2024-10-24 15:31:50,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:31:50,760 INFO L124 PetriNetUnfolderBase]: 10/310 cut-off events. [2024-10-24 15:31:50,760 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2024-10-24 15:31:50,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336 conditions, 310 events. 10/310 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 643 event pairs, 2 based on Foata normal form. 0/259 useless extension candidates. Maximal degree in co-relation 273. Up to 16 conditions per place. [2024-10-24 15:31:50,762 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 11 selfloop transitions, 2 changer transitions 0/234 dead transitions. [2024-10-24 15:31:50,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 234 transitions, 502 flow [2024-10-24 15:31:50,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:31:50,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:31:50,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 746 transitions. [2024-10-24 15:31:50,764 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348370927318296 [2024-10-24 15:31:50,764 INFO L175 Difference]: Start difference. First operand has 234 places, 235 transitions, 478 flow. Second operand 3 states and 746 transitions. [2024-10-24 15:31:50,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 234 transitions, 502 flow [2024-10-24 15:31:50,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 234 transitions, 498 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:31:50,767 INFO L231 Difference]: Finished difference. Result has 233 places, 234 transitions, 476 flow [2024-10-24 15:31:50,768 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=476, PETRI_PLACES=233, PETRI_TRANSITIONS=234} [2024-10-24 15:31:50,768 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -10 predicate places. [2024-10-24 15:31:50,769 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 234 transitions, 476 flow [2024-10-24 15:31:50,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 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-10-24 15:31:50,769 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:50,769 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] [2024-10-24 15:31:50,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 15:31:50,769 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-24 15:31:50,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:50,770 INFO L85 PathProgramCache]: Analyzing trace with hash 443216440, now seen corresponding path program 1 times [2024-10-24 15:31:50,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:50,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443312587] [2024-10-24 15:31:50,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:50,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:50,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:50,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:50,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443312587] [2024-10-24 15:31:50,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443312587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:50,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:50,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:31:50,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49970617] [2024-10-24 15:31:50,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:50,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:31:50,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:50,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:31:50,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:31:50,837 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 266 [2024-10-24 15:31:50,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 234 transitions, 476 flow. Second operand has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 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-10-24 15:31:50,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:50,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 266 [2024-10-24 15:31:50,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:31:50,860 INFO L124 PetriNetUnfolderBase]: 8/237 cut-off events. [2024-10-24 15:31:50,860 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-10-24 15:31:50,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 237 events. 8/237 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 430 event pairs, 2 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 191. Up to 16 conditions per place. [2024-10-24 15:31:50,861 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 11 selfloop transitions, 2 changer transitions 0/233 dead transitions. [2024-10-24 15:31:50,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 233 transitions, 500 flow [2024-10-24 15:31:50,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:31:50,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:31:50,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 746 transitions. [2024-10-24 15:31:50,863 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348370927318296 [2024-10-24 15:31:50,863 INFO L175 Difference]: Start difference. First operand has 233 places, 234 transitions, 476 flow. Second operand 3 states and 746 transitions. [2024-10-24 15:31:50,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 233 transitions, 500 flow [2024-10-24 15:31:50,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 233 transitions, 496 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:31:50,866 INFO L231 Difference]: Finished difference. Result has 232 places, 233 transitions, 474 flow [2024-10-24 15:31:50,866 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=474, PETRI_PLACES=232, PETRI_TRANSITIONS=233} [2024-10-24 15:31:50,867 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -11 predicate places. [2024-10-24 15:31:50,867 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 233 transitions, 474 flow [2024-10-24 15:31:50,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 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-10-24 15:31:50,868 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:50,868 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] [2024-10-24 15:31:50,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 15:31:50,868 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-24 15:31:50,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:50,868 INFO L85 PathProgramCache]: Analyzing trace with hash 732440509, now seen corresponding path program 1 times [2024-10-24 15:31:50,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:50,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304518550] [2024-10-24 15:31:50,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:50,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:50,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:50,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:50,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304518550] [2024-10-24 15:31:50,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304518550] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:50,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:50,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:31:50,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413929548] [2024-10-24 15:31:50,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:50,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:31:50,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:50,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:31:50,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:31:50,941 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 266 [2024-10-24 15:31:50,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 233 transitions, 474 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-10-24 15:31:50,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:50,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 266 [2024-10-24 15:31:50,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:31:50,970 INFO L124 PetriNetUnfolderBase]: 13/289 cut-off events. [2024-10-24 15:31:50,970 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-24 15:31:50,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 289 events. 13/289 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 688 event pairs, 4 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 254. Up to 26 conditions per place. [2024-10-24 15:31:50,971 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 17 selfloop transitions, 3 changer transitions 0/229 dead transitions. [2024-10-24 15:31:50,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 229 transitions, 507 flow [2024-10-24 15:31:50,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:31:50,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:31:50,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 731 transitions. [2024-10-24 15:31:50,973 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9160401002506265 [2024-10-24 15:31:50,973 INFO L175 Difference]: Start difference. First operand has 232 places, 233 transitions, 474 flow. Second operand 3 states and 731 transitions. [2024-10-24 15:31:50,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 229 transitions, 507 flow [2024-10-24 15:31:50,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 229 transitions, 503 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:31:50,976 INFO L231 Difference]: Finished difference. Result has 227 places, 228 transitions, 471 flow [2024-10-24 15:31:50,977 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=471, PETRI_PLACES=227, PETRI_TRANSITIONS=228} [2024-10-24 15:31:50,978 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -16 predicate places. [2024-10-24 15:31:50,978 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 228 transitions, 471 flow [2024-10-24 15:31:50,978 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-10-24 15:31:50,978 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:50,979 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] [2024-10-24 15:31:50,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 15:31:50,979 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-24 15:31:50,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:50,979 INFO L85 PathProgramCache]: Analyzing trace with hash -499292250, now seen corresponding path program 1 times [2024-10-24 15:31:50,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:50,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999883524] [2024-10-24 15:31:50,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:50,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:51,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:51,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:51,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999883524] [2024-10-24 15:31:51,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999883524] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:51,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:51,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:31:51,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857722146] [2024-10-24 15:31:51,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:51,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:31:51,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:51,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:31:51,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:31:51,036 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 266 [2024-10-24 15:31:51,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 228 transitions, 471 flow. Second operand has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 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-10-24 15:31:51,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:51,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 266 [2024-10-24 15:31:51,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:31:51,078 INFO L124 PetriNetUnfolderBase]: 12/263 cut-off events. [2024-10-24 15:31:51,078 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-10-24 15:31:51,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 263 events. 12/263 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 568 event pairs, 4 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 211. Up to 20 conditions per place. [2024-10-24 15:31:51,079 INFO L140 encePairwiseOnDemand]: 260/266 looper letters, 11 selfloop transitions, 3 changer transitions 0/227 dead transitions. [2024-10-24 15:31:51,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 227 transitions, 498 flow [2024-10-24 15:31:51,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:31:51,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:31:51,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 749 transitions. [2024-10-24 15:31:51,081 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9385964912280702 [2024-10-24 15:31:51,081 INFO L175 Difference]: Start difference. First operand has 227 places, 228 transitions, 471 flow. Second operand 3 states and 749 transitions. [2024-10-24 15:31:51,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 227 transitions, 498 flow [2024-10-24 15:31:51,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 227 transitions, 495 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 15:31:51,087 INFO L231 Difference]: Finished difference. Result has 226 places, 226 transitions, 475 flow [2024-10-24 15:31:51,088 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=475, PETRI_PLACES=226, PETRI_TRANSITIONS=226} [2024-10-24 15:31:51,088 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -17 predicate places. [2024-10-24 15:31:51,088 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 226 transitions, 475 flow [2024-10-24 15:31:51,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 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-10-24 15:31:51,089 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:51,089 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] [2024-10-24 15:31:51,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 15:31:51,089 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-24 15:31:51,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:51,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1625983613, now seen corresponding path program 1 times [2024-10-24 15:31:51,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:51,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658041933] [2024-10-24 15:31:51,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:51,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:51,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:51,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:51,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658041933] [2024-10-24 15:31:51,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658041933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:51,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:51,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:31:51,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689777885] [2024-10-24 15:31:51,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:51,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:31:51,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:51,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:31:51,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:31:51,159 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 266 [2024-10-24 15:31:51,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 226 transitions, 475 flow. Second operand has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 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-10-24 15:31:51,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:51,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 266 [2024-10-24 15:31:51,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:31:51,207 INFO L124 PetriNetUnfolderBase]: 16/385 cut-off events. [2024-10-24 15:31:51,207 INFO L125 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2024-10-24 15:31:51,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 385 events. 16/385 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1129 event pairs, 1 based on Foata normal form. 0/339 useless extension candidates. Maximal degree in co-relation 333. Up to 17 conditions per place. [2024-10-24 15:31:51,209 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 14 selfloop transitions, 4 changer transitions 0/229 dead transitions. [2024-10-24 15:31:51,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 229 transitions, 521 flow [2024-10-24 15:31:51,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:31:51,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:31:51,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 753 transitions. [2024-10-24 15:31:51,211 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.943609022556391 [2024-10-24 15:31:51,211 INFO L175 Difference]: Start difference. First operand has 226 places, 226 transitions, 475 flow. Second operand 3 states and 753 transitions. [2024-10-24 15:31:51,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 229 transitions, 521 flow [2024-10-24 15:31:51,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 229 transitions, 518 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 15:31:51,215 INFO L231 Difference]: Finished difference. Result has 225 places, 225 transitions, 486 flow [2024-10-24 15:31:51,216 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=486, PETRI_PLACES=225, PETRI_TRANSITIONS=225} [2024-10-24 15:31:51,217 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -18 predicate places. [2024-10-24 15:31:51,217 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 225 transitions, 486 flow [2024-10-24 15:31:51,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 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-10-24 15:31:51,217 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:51,218 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] [2024-10-24 15:31:51,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 15:31:51,218 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-24 15:31:51,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:51,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1498306685, now seen corresponding path program 1 times [2024-10-24 15:31:51,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:51,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676520270] [2024-10-24 15:31:51,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:51,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:51,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:51,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:51,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676520270] [2024-10-24 15:31:51,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676520270] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:51,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:51,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:31:51,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120917062] [2024-10-24 15:31:51,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:51,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:31:51,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:51,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:31:51,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:31:51,274 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 266 [2024-10-24 15:31:51,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 225 transitions, 486 flow. Second operand has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 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-10-24 15:31:51,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:51,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 266 [2024-10-24 15:31:51,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:31:51,327 INFO L124 PetriNetUnfolderBase]: 27/553 cut-off events. [2024-10-24 15:31:51,327 INFO L125 PetriNetUnfolderBase]: For 12/16 co-relation queries the response was YES. [2024-10-24 15:31:51,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 649 conditions, 553 events. 27/553 cut-off events. For 12/16 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2637 event pairs, 2 based on Foata normal form. 1/493 useless extension candidates. Maximal degree in co-relation 407. Up to 30 conditions per place. [2024-10-24 15:31:51,330 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 10 selfloop transitions, 3 changer transitions 7/228 dead transitions. [2024-10-24 15:31:51,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 228 transitions, 530 flow [2024-10-24 15:31:51,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:31:51,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:31:51,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 752 transitions. [2024-10-24 15:31:51,332 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9423558897243107 [2024-10-24 15:31:51,332 INFO L175 Difference]: Start difference. First operand has 225 places, 225 transitions, 486 flow. Second operand 3 states and 752 transitions. [2024-10-24 15:31:51,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 228 transitions, 530 flow [2024-10-24 15:31:51,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 228 transitions, 526 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 15:31:51,335 INFO L231 Difference]: Finished difference. Result has 224 places, 218 transitions, 474 flow [2024-10-24 15:31:51,335 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=474, PETRI_PLACES=224, PETRI_TRANSITIONS=218} [2024-10-24 15:31:51,336 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -19 predicate places. [2024-10-24 15:31:51,336 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 218 transitions, 474 flow [2024-10-24 15:31:51,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 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-10-24 15:31:51,336 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:51,336 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] [2024-10-24 15:31:51,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 15:31:51,337 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-24 15:31:51,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:51,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1127054599, now seen corresponding path program 1 times [2024-10-24 15:31:51,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:51,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900499108] [2024-10-24 15:31:51,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:51,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:51,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:51,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:51,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900499108] [2024-10-24 15:31:51,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900499108] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:51,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:51,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:31:51,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501110183] [2024-10-24 15:31:51,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:51,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:31:51,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:51,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:31:51,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:31:51,375 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 266 [2024-10-24 15:31:51,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 218 transitions, 474 flow. Second operand has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 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-10-24 15:31:51,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:51,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 266 [2024-10-24 15:31:51,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:31:51,458 INFO L124 PetriNetUnfolderBase]: 66/1009 cut-off events. [2024-10-24 15:31:51,458 INFO L125 PetriNetUnfolderBase]: For 24/28 co-relation queries the response was YES. [2024-10-24 15:31:51,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1222 conditions, 1009 events. 66/1009 cut-off events. For 24/28 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 5988 event pairs, 20 based on Foata normal form. 0/877 useless extension candidates. Maximal degree in co-relation 658. Up to 92 conditions per place. [2024-10-24 15:31:51,461 INFO L140 encePairwiseOnDemand]: 262/266 looper letters, 9 selfloop transitions, 1 changer transitions 0/215 dead transitions. [2024-10-24 15:31:51,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 215 transitions, 488 flow [2024-10-24 15:31:51,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:31:51,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:31:51,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 748 transitions. [2024-10-24 15:31:51,463 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9373433583959899 [2024-10-24 15:31:51,463 INFO L175 Difference]: Start difference. First operand has 224 places, 218 transitions, 474 flow. Second operand 3 states and 748 transitions. [2024-10-24 15:31:51,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 215 transitions, 488 flow [2024-10-24 15:31:51,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 215 transitions, 485 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 15:31:51,466 INFO L231 Difference]: Finished difference. Result has 218 places, 215 transitions, 467 flow [2024-10-24 15:31:51,467 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=467, PETRI_PLACES=218, PETRI_TRANSITIONS=215} [2024-10-24 15:31:51,468 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -25 predicate places. [2024-10-24 15:31:51,468 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 215 transitions, 467 flow [2024-10-24 15:31:51,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 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-10-24 15:31:51,469 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:51,469 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] [2024-10-24 15:31:51,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 15:31:51,469 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-24 15:31:51,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:51,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1772561207, now seen corresponding path program 1 times [2024-10-24 15:31:51,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:51,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404993710] [2024-10-24 15:31:51,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:51,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:51,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:51,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:51,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404993710] [2024-10-24 15:31:51,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404993710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:51,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:51,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:31:51,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361697109] [2024-10-24 15:31:51,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:51,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:31:51,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:51,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:31:51,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:31:51,513 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 266 [2024-10-24 15:31:51,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 215 transitions, 467 flow. Second operand has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 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-10-24 15:31:51,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:51,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 266 [2024-10-24 15:31:51,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:31:51,587 INFO L124 PetriNetUnfolderBase]: 80/1099 cut-off events. [2024-10-24 15:31:51,588 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-10-24 15:31:51,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1338 conditions, 1099 events. 80/1099 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 7313 event pairs, 16 based on Foata normal form. 0/974 useless extension candidates. Maximal degree in co-relation 636. Up to 108 conditions per place. [2024-10-24 15:31:51,593 INFO L140 encePairwiseOnDemand]: 262/266 looper letters, 9 selfloop transitions, 2 changer transitions 0/216 dead transitions. [2024-10-24 15:31:51,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 216 transitions, 492 flow [2024-10-24 15:31:51,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:31:51,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:31:51,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 757 transitions. [2024-10-24 15:31:51,595 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9486215538847118 [2024-10-24 15:31:51,595 INFO L175 Difference]: Start difference. First operand has 218 places, 215 transitions, 467 flow. Second operand 3 states and 757 transitions. [2024-10-24 15:31:51,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 216 transitions, 492 flow [2024-10-24 15:31:51,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 216 transitions, 491 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 15:31:51,599 INFO L231 Difference]: Finished difference. Result has 218 places, 215 transitions, 476 flow [2024-10-24 15:31:51,599 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=476, PETRI_PLACES=218, PETRI_TRANSITIONS=215} [2024-10-24 15:31:51,601 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -25 predicate places. [2024-10-24 15:31:51,601 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 215 transitions, 476 flow [2024-10-24 15:31:51,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 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-10-24 15:31:51,602 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:51,602 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] [2024-10-24 15:31:51,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 15:31:51,602 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-24 15:31:51,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:51,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1046373861, now seen corresponding path program 1 times [2024-10-24 15:31:51,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:51,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303556407] [2024-10-24 15:31:51,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:51,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:51,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:51,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:51,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:51,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303556407] [2024-10-24 15:31:51,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303556407] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:51,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:51,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:31:51,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596690590] [2024-10-24 15:31:51,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:51,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:31:51,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:51,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:31:51,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:31:51,652 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 266 [2024-10-24 15:31:51,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 215 transitions, 476 flow. Second operand has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 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-10-24 15:31:51,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:51,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 266 [2024-10-24 15:31:51,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:31:51,709 INFO L124 PetriNetUnfolderBase]: 72/875 cut-off events. [2024-10-24 15:31:51,709 INFO L125 PetriNetUnfolderBase]: For 8/12 co-relation queries the response was YES. [2024-10-24 15:31:51,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1134 conditions, 875 events. 72/875 cut-off events. For 8/12 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5238 event pairs, 16 based on Foata normal form. 0/792 useless extension candidates. Maximal degree in co-relation 740. Up to 70 conditions per place. [2024-10-24 15:31:51,713 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 10 selfloop transitions, 2 changer transitions 0/215 dead transitions. [2024-10-24 15:31:51,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 215 transitions, 501 flow [2024-10-24 15:31:51,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:31:51,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:31:51,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 751 transitions. [2024-10-24 15:31:51,730 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9411027568922306 [2024-10-24 15:31:51,730 INFO L175 Difference]: Start difference. First operand has 218 places, 215 transitions, 476 flow. Second operand 3 states and 751 transitions. [2024-10-24 15:31:51,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 215 transitions, 501 flow [2024-10-24 15:31:51,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 215 transitions, 501 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 15:31:51,734 INFO L231 Difference]: Finished difference. Result has 219 places, 214 transitions, 478 flow [2024-10-24 15:31:51,735 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=478, PETRI_PLACES=219, PETRI_TRANSITIONS=214} [2024-10-24 15:31:51,735 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -24 predicate places. [2024-10-24 15:31:51,735 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 214 transitions, 478 flow [2024-10-24 15:31:51,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 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-10-24 15:31:51,736 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:51,736 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] [2024-10-24 15:31:51,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 15:31:51,736 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-24 15:31:51,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:51,736 INFO L85 PathProgramCache]: Analyzing trace with hash 349565981, now seen corresponding path program 1 times [2024-10-24 15:31:51,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:51,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901804025] [2024-10-24 15:31:51,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:51,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:51,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:51,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:51,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901804025] [2024-10-24 15:31:51,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901804025] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:51,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:51,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:31:51,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506860573] [2024-10-24 15:31:51,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:51,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:31:51,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:51,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:31:51,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:31:51,772 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 266 [2024-10-24 15:31:51,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 214 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 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-10-24 15:31:51,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:51,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 266 [2024-10-24 15:31:51,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:31:51,836 INFO L124 PetriNetUnfolderBase]: 62/985 cut-off events. [2024-10-24 15:31:51,836 INFO L125 PetriNetUnfolderBase]: For 24/28 co-relation queries the response was YES. [2024-10-24 15:31:51,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1266 conditions, 985 events. 62/985 cut-off events. For 24/28 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 5805 event pairs, 10 based on Foata normal form. 0/900 useless extension candidates. Maximal degree in co-relation 744. Up to 44 conditions per place. [2024-10-24 15:31:51,840 INFO L140 encePairwiseOnDemand]: 261/266 looper letters, 10 selfloop transitions, 3 changer transitions 0/215 dead transitions. [2024-10-24 15:31:51,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 215 transitions, 510 flow [2024-10-24 15:31:51,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:31:51,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:31:51,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 753 transitions. [2024-10-24 15:31:51,842 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.943609022556391 [2024-10-24 15:31:51,842 INFO L175 Difference]: Start difference. First operand has 219 places, 214 transitions, 478 flow. Second operand 3 states and 753 transitions. [2024-10-24 15:31:51,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 215 transitions, 510 flow [2024-10-24 15:31:51,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 215 transitions, 504 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:31:51,845 INFO L231 Difference]: Finished difference. Result has 218 places, 213 transitions, 483 flow [2024-10-24 15:31:51,845 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=483, PETRI_PLACES=218, PETRI_TRANSITIONS=213} [2024-10-24 15:31:51,845 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -25 predicate places. [2024-10-24 15:31:51,845 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 213 transitions, 483 flow [2024-10-24 15:31:51,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 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-10-24 15:31:51,846 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:51,846 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] [2024-10-24 15:31:51,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 15:31:51,846 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-24 15:31:51,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:51,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1064476230, now seen corresponding path program 1 times [2024-10-24 15:31:51,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:51,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820230250] [2024-10-24 15:31:51,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:51,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:51,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:51,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:51,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820230250] [2024-10-24 15:31:51,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820230250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:51,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:51,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:31:51,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685190375] [2024-10-24 15:31:51,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:51,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:31:51,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:51,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:31:51,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:31:51,886 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 266 [2024-10-24 15:31:51,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 213 transitions, 483 flow. Second operand has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 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-10-24 15:31:51,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:51,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 266 [2024-10-24 15:31:51,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:31:51,941 INFO L124 PetriNetUnfolderBase]: 60/811 cut-off events. [2024-10-24 15:31:51,941 INFO L125 PetriNetUnfolderBase]: For 60/68 co-relation queries the response was YES. [2024-10-24 15:31:51,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1082 conditions, 811 events. 60/811 cut-off events. For 60/68 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4064 event pairs, 16 based on Foata normal form. 0/754 useless extension candidates. Maximal degree in co-relation 669. Up to 76 conditions per place. [2024-10-24 15:31:51,945 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 10 selfloop transitions, 2 changer transitions 0/213 dead transitions. [2024-10-24 15:31:51,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 213 transitions, 508 flow [2024-10-24 15:31:51,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:31:51,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:31:51,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 750 transitions. [2024-10-24 15:31:51,946 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9398496240601504 [2024-10-24 15:31:51,946 INFO L175 Difference]: Start difference. First operand has 218 places, 213 transitions, 483 flow. Second operand 3 states and 750 transitions. [2024-10-24 15:31:51,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 213 transitions, 508 flow [2024-10-24 15:31:51,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 213 transitions, 505 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 15:31:51,949 INFO L231 Difference]: Finished difference. Result has 218 places, 212 transitions, 482 flow [2024-10-24 15:31:51,949 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=482, PETRI_PLACES=218, PETRI_TRANSITIONS=212} [2024-10-24 15:31:51,950 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -25 predicate places. [2024-10-24 15:31:51,950 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 212 transitions, 482 flow [2024-10-24 15:31:51,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 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-10-24 15:31:51,950 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:51,950 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] [2024-10-24 15:31:51,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 15:31:51,950 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-24 15:31:51,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:51,951 INFO L85 PathProgramCache]: Analyzing trace with hash -702215671, now seen corresponding path program 1 times [2024-10-24 15:31:51,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:51,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719601613] [2024-10-24 15:31:51,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:51,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:51,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:51,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:51,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719601613] [2024-10-24 15:31:51,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719601613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:51,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:51,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:31:51,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038275959] [2024-10-24 15:31:51,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:51,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:31:51,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:51,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:31:51,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:31:51,998 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 266 [2024-10-24 15:31:51,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 212 transitions, 482 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-10-24 15:31:51,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:51,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 266 [2024-10-24 15:31:51,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:31:52,059 INFO L124 PetriNetUnfolderBase]: 58/877 cut-off events. [2024-10-24 15:31:52,059 INFO L125 PetriNetUnfolderBase]: For 31/39 co-relation queries the response was YES. [2024-10-24 15:31:52,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1135 conditions, 877 events. 58/877 cut-off events. For 31/39 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4636 event pairs, 10 based on Foata normal form. 0/810 useless extension candidates. Maximal degree in co-relation 956. Up to 45 conditions per place. [2024-10-24 15:31:52,063 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 10 selfloop transitions, 2 changer transitions 0/212 dead transitions. [2024-10-24 15:31:52,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 212 transitions, 507 flow [2024-10-24 15:31:52,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:31:52,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:31:52,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 750 transitions. [2024-10-24 15:31:52,064 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9398496240601504 [2024-10-24 15:31:52,065 INFO L175 Difference]: Start difference. First operand has 218 places, 212 transitions, 482 flow. Second operand 3 states and 750 transitions. [2024-10-24 15:31:52,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 212 transitions, 507 flow [2024-10-24 15:31:52,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 212 transitions, 503 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:31:52,067 INFO L231 Difference]: Finished difference. Result has 217 places, 211 transitions, 480 flow [2024-10-24 15:31:52,068 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=480, PETRI_PLACES=217, PETRI_TRANSITIONS=211} [2024-10-24 15:31:52,068 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -26 predicate places. [2024-10-24 15:31:52,068 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 211 transitions, 480 flow [2024-10-24 15:31:52,069 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-10-24 15:31:52,070 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:52,070 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] [2024-10-24 15:31:52,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 15:31:52,070 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-24 15:31:52,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:52,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1453595937, now seen corresponding path program 1 times [2024-10-24 15:31:52,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:52,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133334650] [2024-10-24 15:31:52,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:52,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:52,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:52,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:52,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133334650] [2024-10-24 15:31:52,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133334650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:52,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:52,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:31:52,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295351108] [2024-10-24 15:31:52,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:52,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:31:52,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:52,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:31:52,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:31:52,124 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 266 [2024-10-24 15:31:52,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 211 transitions, 480 flow. Second operand has 3 states, 3 states have (on average 245.66666666666666) internal successors, (737), 3 states have internal predecessors, (737), 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-10-24 15:31:52,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:52,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 266 [2024-10-24 15:31:52,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:31:52,186 INFO L124 PetriNetUnfolderBase]: 68/901 cut-off events. [2024-10-24 15:31:52,186 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-10-24 15:31:52,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1224 conditions, 901 events. 68/901 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 5048 event pairs, 24 based on Foata normal form. 0/840 useless extension candidates. Maximal degree in co-relation 1143. Up to 86 conditions per place. [2024-10-24 15:31:52,189 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 14 selfloop transitions, 2 changer transitions 0/211 dead transitions. [2024-10-24 15:31:52,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 211 transitions, 513 flow [2024-10-24 15:31:52,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:31:52,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:31:52,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 745 transitions. [2024-10-24 15:31:52,191 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9335839598997494 [2024-10-24 15:31:52,191 INFO L175 Difference]: Start difference. First operand has 217 places, 211 transitions, 480 flow. Second operand 3 states and 745 transitions. [2024-10-24 15:31:52,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 211 transitions, 513 flow [2024-10-24 15:31:52,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 211 transitions, 509 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:31:52,194 INFO L231 Difference]: Finished difference. Result has 216 places, 210 transitions, 478 flow [2024-10-24 15:31:52,194 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=478, PETRI_PLACES=216, PETRI_TRANSITIONS=210} [2024-10-24 15:31:52,195 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -27 predicate places. [2024-10-24 15:31:52,195 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 210 transitions, 478 flow [2024-10-24 15:31:52,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.66666666666666) internal successors, (737), 3 states have internal predecessors, (737), 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-10-24 15:31:52,196 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:52,196 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] [2024-10-24 15:31:52,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 15:31:52,196 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-24 15:31:52,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:52,196 INFO L85 PathProgramCache]: Analyzing trace with hash 432440363, now seen corresponding path program 1 times [2024-10-24 15:31:52,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:52,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824890658] [2024-10-24 15:31:52,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:52,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:52,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:52,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:52,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824890658] [2024-10-24 15:31:52,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824890658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:52,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:52,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:31:52,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844985387] [2024-10-24 15:31:52,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:52,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:31:52,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:52,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:31:52,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:31:52,237 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 266 [2024-10-24 15:31:52,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 210 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 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-10-24 15:31:52,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:52,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 266 [2024-10-24 15:31:52,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:31:52,296 INFO L124 PetriNetUnfolderBase]: 72/847 cut-off events. [2024-10-24 15:31:52,296 INFO L125 PetriNetUnfolderBase]: For 57/65 co-relation queries the response was YES. [2024-10-24 15:31:52,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1147 conditions, 847 events. 72/847 cut-off events. For 57/65 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4553 event pairs, 24 based on Foata normal form. 0/794 useless extension candidates. Maximal degree in co-relation 804. Up to 95 conditions per place. [2024-10-24 15:31:52,298 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 10 selfloop transitions, 2 changer transitions 1/210 dead transitions. [2024-10-24 15:31:52,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 210 transitions, 505 flow [2024-10-24 15:31:52,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:31:52,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:31:52,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 751 transitions. [2024-10-24 15:31:52,300 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9411027568922306 [2024-10-24 15:31:52,300 INFO L175 Difference]: Start difference. First operand has 216 places, 210 transitions, 478 flow. Second operand 3 states and 751 transitions. [2024-10-24 15:31:52,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 210 transitions, 505 flow [2024-10-24 15:31:52,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 210 transitions, 501 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:31:52,303 INFO L231 Difference]: Finished difference. Result has 215 places, 209 transitions, 476 flow [2024-10-24 15:31:52,303 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=476, PETRI_PLACES=215, PETRI_TRANSITIONS=209} [2024-10-24 15:31:52,303 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -28 predicate places. [2024-10-24 15:31:52,303 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 209 transitions, 476 flow [2024-10-24 15:31:52,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 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-10-24 15:31:52,303 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:31:52,304 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] [2024-10-24 15:31:52,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 15:31:52,304 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-24 15:31:52,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:31:52,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1556478479, now seen corresponding path program 1 times [2024-10-24 15:31:52,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:31:52,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433122775] [2024-10-24 15:31:52,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:31:52,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:31:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:31:52,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:31:52,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:31:52,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433122775] [2024-10-24 15:31:52,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433122775] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:31:52,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:31:52,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:31:52,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835261158] [2024-10-24 15:31:52,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:31:52,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:31:52,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:31:52,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:31:52,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:31:52,345 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 266 [2024-10-24 15:31:52,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 209 transitions, 476 flow. Second operand has 3 states, 3 states have (on average 248.66666666666666) internal successors, (746), 3 states have internal predecessors, (746), 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-10-24 15:31:52,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:31:52,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 266 [2024-10-24 15:31:52,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:31:52,404 INFO L124 PetriNetUnfolderBase]: 66/963 cut-off events. [2024-10-24 15:31:52,405 INFO L125 PetriNetUnfolderBase]: For 46/54 co-relation queries the response was YES. [2024-10-24 15:31:52,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1286 conditions, 963 events. 66/963 cut-off events. For 46/54 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 5652 event pairs, 16 based on Foata normal form. 0/906 useless extension candidates. Maximal degree in co-relation 1151. Up to 68 conditions per place. [2024-10-24 15:31:52,407 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 0 selfloop transitions, 0 changer transitions 209/209 dead transitions. [2024-10-24 15:31:52,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 209 transitions, 503 flow [2024-10-24 15:31:52,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:31:52,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:31:52,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 751 transitions. [2024-10-24 15:31:52,409 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9411027568922306 [2024-10-24 15:31:52,409 INFO L175 Difference]: Start difference. First operand has 215 places, 209 transitions, 476 flow. Second operand 3 states and 751 transitions. [2024-10-24 15:31:52,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 209 transitions, 503 flow [2024-10-24 15:31:52,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 209 transitions, 499 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:31:52,411 INFO L231 Difference]: Finished difference. Result has 214 places, 0 transitions, 0 flow [2024-10-24 15:31:52,411 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=214, PETRI_TRANSITIONS=0} [2024-10-24 15:31:52,412 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -29 predicate places. [2024-10-24 15:31:52,412 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 0 transitions, 0 flow [2024-10-24 15:31:52,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.66666666666666) internal successors, (746), 3 states have internal predecessors, (746), 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-10-24 15:31:52,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (54 of 55 remaining) [2024-10-24 15:31:52,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (53 of 55 remaining) [2024-10-24 15:31:52,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (52 of 55 remaining) [2024-10-24 15:31:52,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (51 of 55 remaining) [2024-10-24 15:31:52,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (50 of 55 remaining) [2024-10-24 15:31:52,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (49 of 55 remaining) [2024-10-24 15:31:52,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (48 of 55 remaining) [2024-10-24 15:31:52,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (47 of 55 remaining) [2024-10-24 15:31:52,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (46 of 55 remaining) [2024-10-24 15:31:52,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (45 of 55 remaining) [2024-10-24 15:31:52,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (44 of 55 remaining) [2024-10-24 15:31:52,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (43 of 55 remaining) [2024-10-24 15:31:52,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (42 of 55 remaining) [2024-10-24 15:31:52,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (41 of 55 remaining) [2024-10-24 15:31:52,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (40 of 55 remaining) [2024-10-24 15:31:52,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (39 of 55 remaining) [2024-10-24 15:31:52,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (38 of 55 remaining) [2024-10-24 15:31:52,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (37 of 55 remaining) [2024-10-24 15:31:52,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (36 of 55 remaining) [2024-10-24 15:31:52,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (35 of 55 remaining) [2024-10-24 15:31:52,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (34 of 55 remaining) [2024-10-24 15:31:52,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (33 of 55 remaining) [2024-10-24 15:31:52,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (32 of 55 remaining) [2024-10-24 15:31:52,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (31 of 55 remaining) [2024-10-24 15:31:52,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (30 of 55 remaining) [2024-10-24 15:31:52,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (29 of 55 remaining) [2024-10-24 15:31:52,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (28 of 55 remaining) [2024-10-24 15:31:52,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (27 of 55 remaining) [2024-10-24 15:31:52,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (26 of 55 remaining) [2024-10-24 15:31:52,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (25 of 55 remaining) [2024-10-24 15:31:52,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (24 of 55 remaining) [2024-10-24 15:31:52,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (23 of 55 remaining) [2024-10-24 15:31:52,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (22 of 55 remaining) [2024-10-24 15:31:52,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (21 of 55 remaining) [2024-10-24 15:31:52,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (20 of 55 remaining) [2024-10-24 15:31:52,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 55 remaining) [2024-10-24 15:31:52,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 55 remaining) [2024-10-24 15:31:52,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (17 of 55 remaining) [2024-10-24 15:31:52,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (16 of 55 remaining) [2024-10-24 15:31:52,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (15 of 55 remaining) [2024-10-24 15:31:52,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (14 of 55 remaining) [2024-10-24 15:31:52,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (13 of 55 remaining) [2024-10-24 15:31:52,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (12 of 55 remaining) [2024-10-24 15:31:52,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (11 of 55 remaining) [2024-10-24 15:31:52,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (10 of 55 remaining) [2024-10-24 15:31:52,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (9 of 55 remaining) [2024-10-24 15:31:52,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (8 of 55 remaining) [2024-10-24 15:31:52,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (7 of 55 remaining) [2024-10-24 15:31:52,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (6 of 55 remaining) [2024-10-24 15:31:52,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (5 of 55 remaining) [2024-10-24 15:31:52,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (4 of 55 remaining) [2024-10-24 15:31:52,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (3 of 55 remaining) [2024-10-24 15:31:52,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (2 of 55 remaining) [2024-10-24 15:31:52,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (1 of 55 remaining) [2024-10-24 15:31:52,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (0 of 55 remaining) [2024-10-24 15:31:52,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 15:31:52,418 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:31:52,423 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-24 15:31:52,423 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 15:31:52,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:31:52 BasicIcfg [2024-10-24 15:31:52,427 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 15:31:52,430 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 15:31:52,430 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 15:31:52,430 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 15:31:52,431 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:31:49" (3/4) ... [2024-10-24 15:31:52,432 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 15:31:52,434 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-24 15:31:52,435 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-24 15:31:52,442 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-24 15:31:52,442 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-24 15:31:52,442 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 15:31:52,442 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 15:31:52,518 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 15:31:52,520 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 15:31:52,520 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 15:31:52,521 INFO L158 Benchmark]: Toolchain (without parser) took 3792.18ms. Allocated memory was 172.0MB in the beginning and 222.3MB in the end (delta: 50.3MB). Free memory was 114.8MB in the beginning and 82.9MB in the end (delta: 32.0MB). Peak memory consumption was 82.5MB. Max. memory is 16.1GB. [2024-10-24 15:31:52,521 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory was 51.4MB in the beginning and 51.4MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 15:31:52,521 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.00ms. Allocated memory is still 172.0MB. Free memory was 114.8MB in the beginning and 143.9MB in the end (delta: -29.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 15:31:52,521 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.54ms. Allocated memory is still 172.0MB. Free memory was 143.6MB in the beginning and 141.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 15:31:52,521 INFO L158 Benchmark]: Boogie Preprocessor took 23.19ms. Allocated memory is still 172.0MB. Free memory was 141.8MB in the beginning and 139.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 15:31:52,521 INFO L158 Benchmark]: RCFGBuilder took 475.26ms. Allocated memory is still 172.0MB. Free memory was 139.7MB in the beginning and 118.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-24 15:31:52,522 INFO L158 Benchmark]: TraceAbstraction took 2893.31ms. Allocated memory was 172.0MB in the beginning and 222.3MB in the end (delta: 50.3MB). Free memory was 118.7MB in the beginning and 88.1MB in the end (delta: 30.6MB). Peak memory consumption was 82.7MB. Max. memory is 16.1GB. [2024-10-24 15:31:52,522 INFO L158 Benchmark]: Witness Printer took 89.98ms. Allocated memory is still 222.3MB. Free memory was 88.1MB in the beginning and 82.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 15:31:52,523 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.15ms. Allocated memory is still 96.5MB. Free memory was 51.4MB in the beginning and 51.4MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 272.00ms. Allocated memory is still 172.0MB. Free memory was 114.8MB in the beginning and 143.9MB in the end (delta: -29.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.54ms. Allocated memory is still 172.0MB. Free memory was 143.6MB in the beginning and 141.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.19ms. Allocated memory is still 172.0MB. Free memory was 141.8MB in the beginning and 139.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 475.26ms. Allocated memory is still 172.0MB. Free memory was 139.7MB in the beginning and 118.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 2893.31ms. Allocated memory was 172.0MB in the beginning and 222.3MB in the end (delta: 50.3MB). Free memory was 118.7MB in the beginning and 88.1MB in the end (delta: 30.6MB). Peak memory consumption was 82.7MB. Max. memory is 16.1GB. * Witness Printer took 89.98ms. Allocated memory is still 222.3MB. Free memory was 88.1MB in the beginning and 82.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 348 locations, 55 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: 2.8s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 640 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 197 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 610 IncrementalHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 82 mSDtfsCounter, 610 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=506occurred in iteration=0, InterpolantAutomatonStates: 60, 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.5s InterpolantComputationTime, 1700 NumberOfCodeBlocks, 1700 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1680 ConstructedInterpolants, 0 QuantifiedInterpolants, 1720 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 35 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-24 15:31:52,542 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 Result: TRUE