./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/chl-match-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version a046e57d 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/chl-match-trans.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 58a3707e98508adde0e15b9d8e43fa1e77573e5478a67cbc9ef6d2cbcb9307e7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 09:57:19,096 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 09:57:19,155 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-13 09:57:19,160 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 09:57:19,161 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 09:57:19,181 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 09:57:19,181 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 09:57:19,182 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 09:57:19,182 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 09:57:19,182 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 09:57:19,183 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 09:57:19,184 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 09:57:19,184 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 09:57:19,187 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 09:57:19,188 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 09:57:19,188 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 09:57:19,188 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 09:57:19,189 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 09:57:19,189 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 09:57:19,190 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 09:57:19,190 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 09:57:19,190 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 09:57:19,190 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-13 09:57:19,191 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 09:57:19,191 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 09:57:19,191 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 09:57:19,191 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 09:57:19,191 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 09:57:19,192 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 09:57:19,193 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 09:57:19,193 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 09:57:19,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:57:19,193 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 09:57:19,194 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 09:57:19,194 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 09:57:19,194 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 09:57:19,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 09:57:19,195 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 09:57:19,195 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 09:57:19,195 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 09:57:19,195 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 09:57:19,196 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 -> 58a3707e98508adde0e15b9d8e43fa1e77573e5478a67cbc9ef6d2cbcb9307e7 [2024-10-13 09:57:19,417 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 09:57:19,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 09:57:19,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 09:57:19,441 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 09:57:19,441 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 09:57:19,442 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-match-trans.wvr.c [2024-10-13 09:57:20,735 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 09:57:20,878 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 09:57:20,879 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-match-trans.wvr.c [2024-10-13 09:57:20,885 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07954ba0a/b41d99845e844093851dda398958f2eb/FLAG687fde524 [2024-10-13 09:57:21,288 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07954ba0a/b41d99845e844093851dda398958f2eb [2024-10-13 09:57:21,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 09:57:21,291 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 09:57:21,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 09:57:21,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 09:57:21,297 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 09:57:21,297 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:57:21" (1/1) ... [2024-10-13 09:57:21,298 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66fe441e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:21, skipping insertion in model container [2024-10-13 09:57:21,298 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:57:21" (1/1) ... [2024-10-13 09:57:21,321 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 09:57:21,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:57:21,510 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 09:57:21,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:57:21,559 INFO L204 MainTranslator]: Completed translation [2024-10-13 09:57:21,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:21 WrapperNode [2024-10-13 09:57:21,560 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 09:57:21,562 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 09:57:21,562 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 09:57:21,562 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 09:57:21,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:21" (1/1) ... [2024-10-13 09:57:21,576 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:21" (1/1) ... [2024-10-13 09:57:21,599 INFO L138 Inliner]: procedures = 22, calls = 19, calls flagged for inlining = 12, calls inlined = 22, statements flattened = 319 [2024-10-13 09:57:21,600 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 09:57:21,600 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 09:57:21,601 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 09:57:21,601 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 09:57:21,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:21" (1/1) ... [2024-10-13 09:57:21,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:21" (1/1) ... [2024-10-13 09:57:21,614 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:21" (1/1) ... [2024-10-13 09:57:21,615 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:21" (1/1) ... [2024-10-13 09:57:21,621 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:21" (1/1) ... [2024-10-13 09:57:21,627 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:21" (1/1) ... [2024-10-13 09:57:21,629 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:21" (1/1) ... [2024-10-13 09:57:21,630 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:21" (1/1) ... [2024-10-13 09:57:21,637 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 09:57:21,642 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 09:57:21,642 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 09:57:21,642 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 09:57:21,643 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:21" (1/1) ... [2024-10-13 09:57:21,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:57:21,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:57:21,691 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-13 09:57:21,696 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-13 09:57:21,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 09:57:21,735 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-13 09:57:21,735 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-13 09:57:21,735 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-13 09:57:21,736 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-13 09:57:21,736 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-13 09:57:21,736 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-13 09:57:21,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-13 09:57:21,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 09:57:21,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 09:57:21,738 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 09:57:21,830 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 09:57:21,832 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 09:57:22,247 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 09:57:22,247 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 09:57:22,273 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 09:57:22,273 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 09:57:22,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:57:22 BoogieIcfgContainer [2024-10-13 09:57:22,274 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 09:57:22,275 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 09:57:22,275 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 09:57:22,278 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 09:57:22,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:57:21" (1/3) ... [2024-10-13 09:57:22,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58a1afbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:57:22, skipping insertion in model container [2024-10-13 09:57:22,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:21" (2/3) ... [2024-10-13 09:57:22,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58a1afbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:57:22, skipping insertion in model container [2024-10-13 09:57:22,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:57:22" (3/3) ... [2024-10-13 09:57:22,280 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-match-trans.wvr.c [2024-10-13 09:57:22,293 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 09:57:22,293 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2024-10-13 09:57:22,293 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 09:57:22,404 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-13 09:57:22,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 437 places, 445 transitions, 911 flow [2024-10-13 09:57:22,592 INFO L124 PetriNetUnfolderBase]: 18/442 cut-off events. [2024-10-13 09:57:22,593 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-13 09:57:22,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 442 events. 18/442 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 775 event pairs, 0 based on Foata normal form. 0/385 useless extension candidates. Maximal degree in co-relation 311. Up to 2 conditions per place. [2024-10-13 09:57:22,604 INFO L82 GeneralOperation]: Start removeDead. Operand has 437 places, 445 transitions, 911 flow [2024-10-13 09:57:22,635 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 415 places, 421 transitions, 860 flow [2024-10-13 09:57:22,646 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:57:22,658 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;@7dd63f53, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:57:22,658 INFO L334 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2024-10-13 09:57:22,663 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 09:57:22,663 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-10-13 09:57:22,663 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 09:57:22,663 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:22,664 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] [2024-10-13 09:57:22,666 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-10-13 09:57:22,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:22,674 INFO L85 PathProgramCache]: Analyzing trace with hash 390371777, now seen corresponding path program 1 times [2024-10-13 09:57:22,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:22,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911456593] [2024-10-13 09:57:22,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:22,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:22,872 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-13 09:57:22,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:22,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911456593] [2024-10-13 09:57:22,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911456593] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:22,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:22,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:22,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480183381] [2024-10-13 09:57:22,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:22,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:22,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:22,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:22,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:22,951 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 445 [2024-10-13 09:57:22,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 421 transitions, 860 flow. Second operand has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 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-13 09:57:22,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:22,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 445 [2024-10-13 09:57:22,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:23,115 INFO L124 PetriNetUnfolderBase]: 20/802 cut-off events. [2024-10-13 09:57:23,115 INFO L125 PetriNetUnfolderBase]: For 22/26 co-relation queries the response was YES. [2024-10-13 09:57:23,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 867 conditions, 802 events. 20/802 cut-off events. For 22/26 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2858 event pairs, 12 based on Foata normal form. 75/765 useless extension candidates. Maximal degree in co-relation 704. Up to 38 conditions per place. [2024-10-13 09:57:23,132 INFO L140 encePairwiseOnDemand]: 430/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/408 dead transitions. [2024-10-13 09:57:23,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 408 transitions, 864 flow [2024-10-13 09:57:23,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:23,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:23,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1270 transitions. [2024-10-13 09:57:23,150 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.951310861423221 [2024-10-13 09:57:23,153 INFO L175 Difference]: Start difference. First operand has 415 places, 421 transitions, 860 flow. Second operand 3 states and 1270 transitions. [2024-10-13 09:57:23,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 408 transitions, 864 flow [2024-10-13 09:57:23,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 408 transitions, 852 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-13 09:57:23,166 INFO L231 Difference]: Finished difference. Result has 410 places, 408 transitions, 826 flow [2024-10-13 09:57:23,169 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=826, PETRI_PLACES=410, PETRI_TRANSITIONS=408} [2024-10-13 09:57:23,173 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -5 predicate places. [2024-10-13 09:57:23,173 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 408 transitions, 826 flow [2024-10-13 09:57:23,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 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-13 09:57:23,175 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:23,175 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] [2024-10-13 09:57:23,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 09:57:23,176 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-10-13 09:57:23,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:23,177 INFO L85 PathProgramCache]: Analyzing trace with hash -547964183, now seen corresponding path program 1 times [2024-10-13 09:57:23,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:23,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296675422] [2024-10-13 09:57:23,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:23,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:23,248 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-13 09:57:23,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:23,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296675422] [2024-10-13 09:57:23,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296675422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:23,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:23,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:23,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8786955] [2024-10-13 09:57:23,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:23,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:23,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:23,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:23,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:23,273 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 445 [2024-10-13 09:57:23,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 408 transitions, 826 flow. Second operand has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 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-13 09:57:23,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:23,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 445 [2024-10-13 09:57:23,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:23,406 INFO L124 PetriNetUnfolderBase]: 12/681 cut-off events. [2024-10-13 09:57:23,406 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 09:57:23,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 714 conditions, 681 events. 12/681 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2562 event pairs, 5 based on Foata normal form. 0/585 useless extension candidates. Maximal degree in co-relation 677. Up to 22 conditions per place. [2024-10-13 09:57:23,417 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/407 dead transitions. [2024-10-13 09:57:23,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 407 transitions, 850 flow [2024-10-13 09:57:23,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:23,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:23,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2024-10-13 09:57:23,422 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9453183520599251 [2024-10-13 09:57:23,422 INFO L175 Difference]: Start difference. First operand has 410 places, 408 transitions, 826 flow. Second operand 3 states and 1262 transitions. [2024-10-13 09:57:23,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 407 transitions, 850 flow [2024-10-13 09:57:23,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 407 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:23,428 INFO L231 Difference]: Finished difference. Result has 409 places, 407 transitions, 824 flow [2024-10-13 09:57:23,429 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=820, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=824, PETRI_PLACES=409, PETRI_TRANSITIONS=407} [2024-10-13 09:57:23,429 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -6 predicate places. [2024-10-13 09:57:23,430 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 407 transitions, 824 flow [2024-10-13 09:57:23,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 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-13 09:57:23,431 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:23,431 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] [2024-10-13 09:57:23,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 09:57:23,431 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-10-13 09:57:23,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:23,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1519254541, now seen corresponding path program 1 times [2024-10-13 09:57:23,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:23,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570900268] [2024-10-13 09:57:23,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:23,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:23,485 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-13 09:57:23,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:23,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570900268] [2024-10-13 09:57:23,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570900268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:23,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:23,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:23,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972752699] [2024-10-13 09:57:23,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:23,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:23,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:23,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:23,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:23,506 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 445 [2024-10-13 09:57:23,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 407 transitions, 824 flow. Second operand has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 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-13 09:57:23,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:23,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 445 [2024-10-13 09:57:23,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:23,620 INFO L124 PetriNetUnfolderBase]: 12/671 cut-off events. [2024-10-13 09:57:23,622 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 09:57:23,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 704 conditions, 671 events. 12/671 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2500 event pairs, 5 based on Foata normal form. 0/579 useless extension candidates. Maximal degree in co-relation 659. Up to 22 conditions per place. [2024-10-13 09:57:23,629 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/406 dead transitions. [2024-10-13 09:57:23,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 406 transitions, 848 flow [2024-10-13 09:57:23,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:23,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:23,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2024-10-13 09:57:23,632 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9453183520599251 [2024-10-13 09:57:23,632 INFO L175 Difference]: Start difference. First operand has 409 places, 407 transitions, 824 flow. Second operand 3 states and 1262 transitions. [2024-10-13 09:57:23,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 406 transitions, 848 flow [2024-10-13 09:57:23,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 406 transitions, 844 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:23,638 INFO L231 Difference]: Finished difference. Result has 408 places, 406 transitions, 822 flow [2024-10-13 09:57:23,639 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=822, PETRI_PLACES=408, PETRI_TRANSITIONS=406} [2024-10-13 09:57:23,640 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -7 predicate places. [2024-10-13 09:57:23,640 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 406 transitions, 822 flow [2024-10-13 09:57:23,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 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-13 09:57:23,641 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:23,642 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] [2024-10-13 09:57:23,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 09:57:23,642 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-10-13 09:57:23,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:23,643 INFO L85 PathProgramCache]: Analyzing trace with hash 633941745, now seen corresponding path program 1 times [2024-10-13 09:57:23,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:23,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351627669] [2024-10-13 09:57:23,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:23,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:23,698 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-13 09:57:23,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:23,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351627669] [2024-10-13 09:57:23,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351627669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:23,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:23,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:23,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525303063] [2024-10-13 09:57:23,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:23,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:23,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:23,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:23,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:23,725 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 445 [2024-10-13 09:57:23,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 406 transitions, 822 flow. Second operand has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 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-13 09:57:23,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:23,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 445 [2024-10-13 09:57:23,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:23,947 INFO L124 PetriNetUnfolderBase]: 34/1363 cut-off events. [2024-10-13 09:57:23,947 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2024-10-13 09:57:23,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1432 conditions, 1363 events. 34/1363 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 6095 event pairs, 20 based on Foata normal form. 0/1167 useless extension candidates. Maximal degree in co-relation 1379. Up to 50 conditions per place. [2024-10-13 09:57:23,961 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/405 dead transitions. [2024-10-13 09:57:23,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 405 transitions, 850 flow [2024-10-13 09:57:23,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:23,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:23,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1258 transitions. [2024-10-13 09:57:23,965 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9423220973782771 [2024-10-13 09:57:23,965 INFO L175 Difference]: Start difference. First operand has 408 places, 406 transitions, 822 flow. Second operand 3 states and 1258 transitions. [2024-10-13 09:57:23,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 405 transitions, 850 flow [2024-10-13 09:57:23,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 405 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:23,971 INFO L231 Difference]: Finished difference. Result has 407 places, 405 transitions, 820 flow [2024-10-13 09:57:23,971 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=816, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=820, PETRI_PLACES=407, PETRI_TRANSITIONS=405} [2024-10-13 09:57:23,972 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -8 predicate places. [2024-10-13 09:57:23,973 INFO L471 AbstractCegarLoop]: Abstraction has has 407 places, 405 transitions, 820 flow [2024-10-13 09:57:23,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 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-13 09:57:23,974 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:23,974 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] [2024-10-13 09:57:23,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 09:57:23,975 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-10-13 09:57:23,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:23,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1120803467, now seen corresponding path program 1 times [2024-10-13 09:57:23,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:23,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106980803] [2024-10-13 09:57:23,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:23,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:24,044 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-13 09:57:24,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:24,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106980803] [2024-10-13 09:57:24,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106980803] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:24,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:24,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:24,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405351816] [2024-10-13 09:57:24,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:24,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:24,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:24,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:24,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:24,068 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 445 [2024-10-13 09:57:24,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 405 transitions, 820 flow. Second operand has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 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-13 09:57:24,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:24,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 445 [2024-10-13 09:57:24,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:24,191 INFO L124 PetriNetUnfolderBase]: 16/867 cut-off events. [2024-10-13 09:57:24,192 INFO L125 PetriNetUnfolderBase]: For 3/6 co-relation queries the response was YES. [2024-10-13 09:57:24,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 905 conditions, 867 events. 16/867 cut-off events. For 3/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3219 event pairs, 7 based on Foata normal form. 0/741 useless extension candidates. Maximal degree in co-relation 844. Up to 25 conditions per place. [2024-10-13 09:57:24,204 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/404 dead transitions. [2024-10-13 09:57:24,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 404 transitions, 844 flow [2024-10-13 09:57:24,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:24,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:24,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2024-10-13 09:57:24,207 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9453183520599251 [2024-10-13 09:57:24,207 INFO L175 Difference]: Start difference. First operand has 407 places, 405 transitions, 820 flow. Second operand 3 states and 1262 transitions. [2024-10-13 09:57:24,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 404 transitions, 844 flow [2024-10-13 09:57:24,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 404 transitions, 840 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:24,212 INFO L231 Difference]: Finished difference. Result has 406 places, 404 transitions, 818 flow [2024-10-13 09:57:24,212 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=404, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=818, PETRI_PLACES=406, PETRI_TRANSITIONS=404} [2024-10-13 09:57:24,213 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -9 predicate places. [2024-10-13 09:57:24,213 INFO L471 AbstractCegarLoop]: Abstraction has has 406 places, 404 transitions, 818 flow [2024-10-13 09:57:24,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 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-13 09:57:24,214 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:24,214 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-13 09:57:24,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 09:57:24,215 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-10-13 09:57:24,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:24,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1040645728, now seen corresponding path program 1 times [2024-10-13 09:57:24,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:24,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825917589] [2024-10-13 09:57:24,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:24,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:24,255 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-13 09:57:24,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:24,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825917589] [2024-10-13 09:57:24,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825917589] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:24,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:24,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:24,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879599215] [2024-10-13 09:57:24,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:24,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:24,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:24,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:24,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:24,273 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 445 [2024-10-13 09:57:24,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 404 transitions, 818 flow. Second operand has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 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-13 09:57:24,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:24,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 445 [2024-10-13 09:57:24,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:24,377 INFO L124 PetriNetUnfolderBase]: 16/857 cut-off events. [2024-10-13 09:57:24,378 INFO L125 PetriNetUnfolderBase]: For 3/6 co-relation queries the response was YES. [2024-10-13 09:57:24,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 895 conditions, 857 events. 16/857 cut-off events. For 3/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3182 event pairs, 7 based on Foata normal form. 0/735 useless extension candidates. Maximal degree in co-relation 826. Up to 25 conditions per place. [2024-10-13 09:57:24,388 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/403 dead transitions. [2024-10-13 09:57:24,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 403 transitions, 842 flow [2024-10-13 09:57:24,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:24,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:24,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2024-10-13 09:57:24,390 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9453183520599251 [2024-10-13 09:57:24,391 INFO L175 Difference]: Start difference. First operand has 406 places, 404 transitions, 818 flow. Second operand 3 states and 1262 transitions. [2024-10-13 09:57:24,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 403 transitions, 842 flow [2024-10-13 09:57:24,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 403 transitions, 838 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:24,395 INFO L231 Difference]: Finished difference. Result has 405 places, 403 transitions, 816 flow [2024-10-13 09:57:24,396 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=816, PETRI_PLACES=405, PETRI_TRANSITIONS=403} [2024-10-13 09:57:24,396 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -10 predicate places. [2024-10-13 09:57:24,396 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 403 transitions, 816 flow [2024-10-13 09:57:24,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 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-13 09:57:24,397 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:24,397 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] [2024-10-13 09:57:24,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 09:57:24,398 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-10-13 09:57:24,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:24,398 INFO L85 PathProgramCache]: Analyzing trace with hash 681543619, now seen corresponding path program 1 times [2024-10-13 09:57:24,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:24,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419382601] [2024-10-13 09:57:24,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:24,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:24,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:24,424 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-13 09:57:24,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:24,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419382601] [2024-10-13 09:57:24,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419382601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:24,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:24,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:24,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258397952] [2024-10-13 09:57:24,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:24,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:24,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:24,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:24,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:24,444 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 445 [2024-10-13 09:57:24,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 403 transitions, 816 flow. Second operand has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 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-13 09:57:24,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:24,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 445 [2024-10-13 09:57:24,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:24,526 INFO L124 PetriNetUnfolderBase]: 27/638 cut-off events. [2024-10-13 09:57:24,526 INFO L125 PetriNetUnfolderBase]: For 9/12 co-relation queries the response was YES. [2024-10-13 09:57:24,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 699 conditions, 638 events. 27/638 cut-off events. For 9/12 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2309 event pairs, 20 based on Foata normal form. 0/557 useless extension candidates. Maximal degree in co-relation 622. Up to 50 conditions per place. [2024-10-13 09:57:24,537 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2024-10-13 09:57:24,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 402 transitions, 844 flow [2024-10-13 09:57:24,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:24,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:24,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1258 transitions. [2024-10-13 09:57:24,539 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9423220973782771 [2024-10-13 09:57:24,539 INFO L175 Difference]: Start difference. First operand has 405 places, 403 transitions, 816 flow. Second operand 3 states and 1258 transitions. [2024-10-13 09:57:24,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 402 transitions, 844 flow [2024-10-13 09:57:24,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 402 transitions, 840 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:24,544 INFO L231 Difference]: Finished difference. Result has 404 places, 402 transitions, 814 flow [2024-10-13 09:57:24,545 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=814, PETRI_PLACES=404, PETRI_TRANSITIONS=402} [2024-10-13 09:57:24,545 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -11 predicate places. [2024-10-13 09:57:24,545 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 402 transitions, 814 flow [2024-10-13 09:57:24,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 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-13 09:57:24,546 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:24,547 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] [2024-10-13 09:57:24,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 09:57:24,547 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-10-13 09:57:24,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:24,547 INFO L85 PathProgramCache]: Analyzing trace with hash -475369336, now seen corresponding path program 1 times [2024-10-13 09:57:24,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:24,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356777166] [2024-10-13 09:57:24,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:24,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:24,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:24,597 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-13 09:57:24,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:24,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356777166] [2024-10-13 09:57:24,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356777166] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:24,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:24,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:24,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989796993] [2024-10-13 09:57:24,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:24,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:24,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:24,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:24,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:24,619 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 445 [2024-10-13 09:57:24,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 402 transitions, 814 flow. Second operand has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 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-13 09:57:24,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:24,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 445 [2024-10-13 09:57:24,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:24,710 INFO L124 PetriNetUnfolderBase]: 15/673 cut-off events. [2024-10-13 09:57:24,711 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2024-10-13 09:57:24,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 673 events. 15/673 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1777 event pairs, 7 based on Foata normal form. 0/580 useless extension candidates. Maximal degree in co-relation 623. Up to 25 conditions per place. [2024-10-13 09:57:24,718 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/401 dead transitions. [2024-10-13 09:57:24,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 401 transitions, 838 flow [2024-10-13 09:57:24,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:24,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:24,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2024-10-13 09:57:24,721 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9453183520599251 [2024-10-13 09:57:24,721 INFO L175 Difference]: Start difference. First operand has 404 places, 402 transitions, 814 flow. Second operand 3 states and 1262 transitions. [2024-10-13 09:57:24,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 401 transitions, 838 flow [2024-10-13 09:57:24,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 401 transitions, 834 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:24,725 INFO L231 Difference]: Finished difference. Result has 403 places, 401 transitions, 812 flow [2024-10-13 09:57:24,726 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=812, PETRI_PLACES=403, PETRI_TRANSITIONS=401} [2024-10-13 09:57:24,728 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -12 predicate places. [2024-10-13 09:57:24,728 INFO L471 AbstractCegarLoop]: Abstraction has has 403 places, 401 transitions, 812 flow [2024-10-13 09:57:24,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 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-13 09:57:24,729 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:24,729 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] [2024-10-13 09:57:24,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 09:57:24,730 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-10-13 09:57:24,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:24,730 INFO L85 PathProgramCache]: Analyzing trace with hash -968794602, now seen corresponding path program 1 times [2024-10-13 09:57:24,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:24,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347926486] [2024-10-13 09:57:24,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:24,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:24,782 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-13 09:57:24,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:24,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347926486] [2024-10-13 09:57:24,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347926486] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:24,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:24,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:24,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379651424] [2024-10-13 09:57:24,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:24,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:24,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:24,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:24,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:24,802 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 445 [2024-10-13 09:57:24,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 401 transitions, 812 flow. Second operand has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 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-13 09:57:24,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:24,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 445 [2024-10-13 09:57:24,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:24,875 INFO L124 PetriNetUnfolderBase]: 15/663 cut-off events. [2024-10-13 09:57:24,876 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2024-10-13 09:57:24,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 698 conditions, 663 events. 15/663 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1740 event pairs, 7 based on Foata normal form. 0/574 useless extension candidates. Maximal degree in co-relation 605. Up to 25 conditions per place. [2024-10-13 09:57:24,885 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/400 dead transitions. [2024-10-13 09:57:24,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 400 transitions, 836 flow [2024-10-13 09:57:24,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:24,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:24,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2024-10-13 09:57:24,888 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9453183520599251 [2024-10-13 09:57:24,888 INFO L175 Difference]: Start difference. First operand has 403 places, 401 transitions, 812 flow. Second operand 3 states and 1262 transitions. [2024-10-13 09:57:24,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 400 transitions, 836 flow [2024-10-13 09:57:24,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 400 transitions, 832 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:24,893 INFO L231 Difference]: Finished difference. Result has 402 places, 400 transitions, 810 flow [2024-10-13 09:57:24,894 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=810, PETRI_PLACES=402, PETRI_TRANSITIONS=400} [2024-10-13 09:57:24,894 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -13 predicate places. [2024-10-13 09:57:24,894 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 400 transitions, 810 flow [2024-10-13 09:57:24,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 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-13 09:57:24,895 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:24,895 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] [2024-10-13 09:57:24,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 09:57:24,895 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-10-13 09:57:24,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:24,896 INFO L85 PathProgramCache]: Analyzing trace with hash 479133799, now seen corresponding path program 1 times [2024-10-13 09:57:24,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:24,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381311108] [2024-10-13 09:57:24,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:24,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:24,923 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-13 09:57:24,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:24,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381311108] [2024-10-13 09:57:24,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381311108] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:24,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:24,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:24,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304209321] [2024-10-13 09:57:24,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:24,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:24,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:24,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:24,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:24,938 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 445 [2024-10-13 09:57:24,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 400 transitions, 810 flow. Second operand has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 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-13 09:57:24,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:24,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 445 [2024-10-13 09:57:24,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:25,053 INFO L124 PetriNetUnfolderBase]: 21/852 cut-off events. [2024-10-13 09:57:25,053 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-10-13 09:57:25,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 899 conditions, 852 events. 21/852 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3574 event pairs, 6 based on Foata normal form. 0/740 useless extension candidates. Maximal degree in co-relation 798. Up to 31 conditions per place. [2024-10-13 09:57:25,065 INFO L140 encePairwiseOnDemand]: 441/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2024-10-13 09:57:25,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 402 transitions, 846 flow [2024-10-13 09:57:25,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:25,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:25,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2024-10-13 09:57:25,067 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2024-10-13 09:57:25,067 INFO L175 Difference]: Start difference. First operand has 402 places, 400 transitions, 810 flow. Second operand 3 states and 1271 transitions. [2024-10-13 09:57:25,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 402 transitions, 846 flow [2024-10-13 09:57:25,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 402 transitions, 842 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:25,072 INFO L231 Difference]: Finished difference. Result has 401 places, 400 transitions, 816 flow [2024-10-13 09:57:25,073 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=816, PETRI_PLACES=401, PETRI_TRANSITIONS=400} [2024-10-13 09:57:25,074 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -14 predicate places. [2024-10-13 09:57:25,074 INFO L471 AbstractCegarLoop]: Abstraction has has 401 places, 400 transitions, 816 flow [2024-10-13 09:57:25,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 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-13 09:57:25,075 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:25,075 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] [2024-10-13 09:57:25,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 09:57:25,076 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-10-13 09:57:25,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:25,076 INFO L85 PathProgramCache]: Analyzing trace with hash 886112137, now seen corresponding path program 1 times [2024-10-13 09:57:25,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:25,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671650402] [2024-10-13 09:57:25,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:25,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:25,111 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-13 09:57:25,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:25,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671650402] [2024-10-13 09:57:25,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671650402] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:25,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:25,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:25,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274144689] [2024-10-13 09:57:25,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:25,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:25,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:25,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:25,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:25,120 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 445 [2024-10-13 09:57:25,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 400 transitions, 816 flow. Second operand has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 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-13 09:57:25,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:25,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 445 [2024-10-13 09:57:25,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:25,248 INFO L124 PetriNetUnfolderBase]: 24/1006 cut-off events. [2024-10-13 09:57:25,249 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-13 09:57:25,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1059 conditions, 1006 events. 24/1006 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4949 event pairs, 6 based on Foata normal form. 0/877 useless extension candidates. Maximal degree in co-relation 857. Up to 33 conditions per place. [2024-10-13 09:57:25,258 INFO L140 encePairwiseOnDemand]: 441/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2024-10-13 09:57:25,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 402 transitions, 852 flow [2024-10-13 09:57:25,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:25,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:25,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2024-10-13 09:57:25,261 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2024-10-13 09:57:25,262 INFO L175 Difference]: Start difference. First operand has 401 places, 400 transitions, 816 flow. Second operand 3 states and 1271 transitions. [2024-10-13 09:57:25,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 402 transitions, 852 flow [2024-10-13 09:57:25,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 402 transitions, 852 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:57:25,267 INFO L231 Difference]: Finished difference. Result has 402 places, 400 transitions, 826 flow [2024-10-13 09:57:25,268 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=826, PETRI_PLACES=402, PETRI_TRANSITIONS=400} [2024-10-13 09:57:25,268 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -13 predicate places. [2024-10-13 09:57:25,268 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 400 transitions, 826 flow [2024-10-13 09:57:25,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 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-13 09:57:25,269 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:25,269 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] [2024-10-13 09:57:25,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 09:57:25,270 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-10-13 09:57:25,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:25,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1509085817, now seen corresponding path program 1 times [2024-10-13 09:57:25,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:25,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259501400] [2024-10-13 09:57:25,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:25,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:25,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:25,308 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-13 09:57:25,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:25,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259501400] [2024-10-13 09:57:25,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259501400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:25,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:25,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:25,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067682694] [2024-10-13 09:57:25,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:25,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:25,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:25,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:25,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:25,319 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 445 [2024-10-13 09:57:25,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 400 transitions, 826 flow. Second operand has 3 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 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-13 09:57:25,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:25,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 445 [2024-10-13 09:57:25,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:25,495 INFO L124 PetriNetUnfolderBase]: 44/1634 cut-off events. [2024-10-13 09:57:25,495 INFO L125 PetriNetUnfolderBase]: For 4/8 co-relation queries the response was YES. [2024-10-13 09:57:25,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1728 conditions, 1634 events. 44/1634 cut-off events. For 4/8 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 10892 event pairs, 11 based on Foata normal form. 0/1413 useless extension candidates. Maximal degree in co-relation 1432. Up to 43 conditions per place. [2024-10-13 09:57:25,516 INFO L140 encePairwiseOnDemand]: 441/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2024-10-13 09:57:25,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 402 transitions, 862 flow [2024-10-13 09:57:25,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:25,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:25,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2024-10-13 09:57:25,518 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2024-10-13 09:57:25,518 INFO L175 Difference]: Start difference. First operand has 402 places, 400 transitions, 826 flow. Second operand 3 states and 1271 transitions. [2024-10-13 09:57:25,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 402 transitions, 862 flow [2024-10-13 09:57:25,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 402 transitions, 862 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:57:25,523 INFO L231 Difference]: Finished difference. Result has 403 places, 400 transitions, 836 flow [2024-10-13 09:57:25,524 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=836, PETRI_PLACES=403, PETRI_TRANSITIONS=400} [2024-10-13 09:57:25,524 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -12 predicate places. [2024-10-13 09:57:25,524 INFO L471 AbstractCegarLoop]: Abstraction has has 403 places, 400 transitions, 836 flow [2024-10-13 09:57:25,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 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-13 09:57:25,525 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:25,526 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] [2024-10-13 09:57:25,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 09:57:25,526 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-10-13 09:57:25,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:25,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1467440933, now seen corresponding path program 1 times [2024-10-13 09:57:25,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:25,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629757888] [2024-10-13 09:57:25,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:25,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:25,548 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-13 09:57:25,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:25,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629757888] [2024-10-13 09:57:25,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629757888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:25,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:25,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:25,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586584315] [2024-10-13 09:57:25,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:25,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:25,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:25,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:25,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:25,559 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 445 [2024-10-13 09:57:25,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 400 transitions, 836 flow. Second operand has 3 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 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-13 09:57:25,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:25,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 445 [2024-10-13 09:57:25,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:25,706 INFO L124 PetriNetUnfolderBase]: 42/1269 cut-off events. [2024-10-13 09:57:25,706 INFO L125 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2024-10-13 09:57:25,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1363 conditions, 1269 events. 42/1269 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 7597 event pairs, 5 based on Foata normal form. 0/1101 useless extension candidates. Maximal degree in co-relation 1159. Up to 50 conditions per place. [2024-10-13 09:57:25,727 INFO L140 encePairwiseOnDemand]: 441/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2024-10-13 09:57:25,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 402 transitions, 872 flow [2024-10-13 09:57:25,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:25,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:25,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2024-10-13 09:57:25,730 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2024-10-13 09:57:25,730 INFO L175 Difference]: Start difference. First operand has 403 places, 400 transitions, 836 flow. Second operand 3 states and 1271 transitions. [2024-10-13 09:57:25,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 402 transitions, 872 flow [2024-10-13 09:57:25,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 402 transitions, 872 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:57:25,735 INFO L231 Difference]: Finished difference. Result has 404 places, 400 transitions, 846 flow [2024-10-13 09:57:25,736 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=846, PETRI_PLACES=404, PETRI_TRANSITIONS=400} [2024-10-13 09:57:25,737 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -11 predicate places. [2024-10-13 09:57:25,737 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 400 transitions, 846 flow [2024-10-13 09:57:25,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 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-13 09:57:25,739 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:25,739 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:25,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 09:57:25,739 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-10-13 09:57:25,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:25,740 INFO L85 PathProgramCache]: Analyzing trace with hash 651751019, now seen corresponding path program 1 times [2024-10-13 09:57:25,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:25,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727598751] [2024-10-13 09:57:25,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:25,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:25,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:25,776 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-13 09:57:25,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:25,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727598751] [2024-10-13 09:57:25,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727598751] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:25,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:25,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:25,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002811293] [2024-10-13 09:57:25,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:25,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:25,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:25,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:25,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:25,789 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 445 [2024-10-13 09:57:25,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 400 transitions, 846 flow. Second operand has 3 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 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-13 09:57:25,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:25,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 445 [2024-10-13 09:57:25,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:25,980 INFO L124 PetriNetUnfolderBase]: 61/1652 cut-off events. [2024-10-13 09:57:25,980 INFO L125 PetriNetUnfolderBase]: For 19/25 co-relation queries the response was YES. [2024-10-13 09:57:25,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1768 conditions, 1652 events. 61/1652 cut-off events. For 19/25 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9967 event pairs, 18 based on Foata normal form. 0/1412 useless extension candidates. Maximal degree in co-relation 1523. Up to 70 conditions per place. [2024-10-13 09:57:25,997 INFO L140 encePairwiseOnDemand]: 441/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2024-10-13 09:57:25,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 402 transitions, 882 flow [2024-10-13 09:57:25,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:25,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:25,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2024-10-13 09:57:25,999 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2024-10-13 09:57:26,000 INFO L175 Difference]: Start difference. First operand has 404 places, 400 transitions, 846 flow. Second operand 3 states and 1271 transitions. [2024-10-13 09:57:26,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 402 transitions, 882 flow [2024-10-13 09:57:26,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 402 transitions, 882 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:57:26,006 INFO L231 Difference]: Finished difference. Result has 405 places, 400 transitions, 856 flow [2024-10-13 09:57:26,006 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=856, PETRI_PLACES=405, PETRI_TRANSITIONS=400} [2024-10-13 09:57:26,007 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -10 predicate places. [2024-10-13 09:57:26,007 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 400 transitions, 856 flow [2024-10-13 09:57:26,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 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-13 09:57:26,008 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:26,008 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:26,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 09:57:26,008 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-10-13 09:57:26,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:26,009 INFO L85 PathProgramCache]: Analyzing trace with hash -732459891, now seen corresponding path program 1 times [2024-10-13 09:57:26,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:26,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875685460] [2024-10-13 09:57:26,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:26,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:26,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:26,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:26,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875685460] [2024-10-13 09:57:26,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875685460] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:26,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:26,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:26,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900489100] [2024-10-13 09:57:26,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:26,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:26,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:26,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:26,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:26,050 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 445 [2024-10-13 09:57:26,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 400 transitions, 856 flow. Second operand has 3 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 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-13 09:57:26,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:26,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 445 [2024-10-13 09:57:26,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:26,272 INFO L124 PetriNetUnfolderBase]: 70/1820 cut-off events. [2024-10-13 09:57:26,272 INFO L125 PetriNetUnfolderBase]: For 21/27 co-relation queries the response was YES. [2024-10-13 09:57:26,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1961 conditions, 1820 events. 70/1820 cut-off events. For 21/27 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 11195 event pairs, 10 based on Foata normal form. 0/1568 useless extension candidates. Maximal degree in co-relation 1718. Up to 80 conditions per place. [2024-10-13 09:57:26,289 INFO L140 encePairwiseOnDemand]: 441/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2024-10-13 09:57:26,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 402 transitions, 892 flow [2024-10-13 09:57:26,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:26,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:26,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2024-10-13 09:57:26,293 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2024-10-13 09:57:26,293 INFO L175 Difference]: Start difference. First operand has 405 places, 400 transitions, 856 flow. Second operand 3 states and 1271 transitions. [2024-10-13 09:57:26,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 402 transitions, 892 flow [2024-10-13 09:57:26,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 402 transitions, 892 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:57:26,299 INFO L231 Difference]: Finished difference. Result has 406 places, 400 transitions, 866 flow [2024-10-13 09:57:26,300 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=866, PETRI_PLACES=406, PETRI_TRANSITIONS=400} [2024-10-13 09:57:26,301 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -9 predicate places. [2024-10-13 09:57:26,301 INFO L471 AbstractCegarLoop]: Abstraction has has 406 places, 400 transitions, 866 flow [2024-10-13 09:57:26,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 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-13 09:57:26,302 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:26,302 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:26,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 09:57:26,302 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-10-13 09:57:26,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:26,303 INFO L85 PathProgramCache]: Analyzing trace with hash 212449739, now seen corresponding path program 1 times [2024-10-13 09:57:26,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:26,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984869655] [2024-10-13 09:57:26,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:26,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:26,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:26,335 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-13 09:57:26,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:26,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984869655] [2024-10-13 09:57:26,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984869655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:26,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:26,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:26,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872376237] [2024-10-13 09:57:26,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:26,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:26,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:26,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:26,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:26,353 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 445 [2024-10-13 09:57:26,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 400 transitions, 866 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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-13 09:57:26,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:26,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 445 [2024-10-13 09:57:26,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:26,589 INFO L124 PetriNetUnfolderBase]: 178/1862 cut-off events. [2024-10-13 09:57:26,589 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-10-13 09:57:26,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2248 conditions, 1862 events. 178/1862 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 13026 event pairs, 84 based on Foata normal form. 0/1590 useless extension candidates. Maximal degree in co-relation 1917. Up to 293 conditions per place. [2024-10-13 09:57:26,606 INFO L140 encePairwiseOnDemand]: 439/445 looper letters, 17 selfloop transitions, 2 changer transitions 0/400 dead transitions. [2024-10-13 09:57:26,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 400 transitions, 906 flow [2024-10-13 09:57:26,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:26,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:26,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1259 transitions. [2024-10-13 09:57:26,609 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9430711610486892 [2024-10-13 09:57:26,610 INFO L175 Difference]: Start difference. First operand has 406 places, 400 transitions, 866 flow. Second operand 3 states and 1259 transitions. [2024-10-13 09:57:26,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 400 transitions, 906 flow [2024-10-13 09:57:26,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 400 transitions, 906 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:57:26,618 INFO L231 Difference]: Finished difference. Result has 405 places, 398 transitions, 872 flow [2024-10-13 09:57:26,618 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=872, PETRI_PLACES=405, PETRI_TRANSITIONS=398} [2024-10-13 09:57:26,619 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -10 predicate places. [2024-10-13 09:57:26,619 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 398 transitions, 872 flow [2024-10-13 09:57:26,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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-13 09:57:26,620 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:26,620 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:26,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 09:57:26,621 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-10-13 09:57:26,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:26,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1994196883, now seen corresponding path program 1 times [2024-10-13 09:57:26,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:26,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074076312] [2024-10-13 09:57:26,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:26,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:26,666 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-13 09:57:26,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:26,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074076312] [2024-10-13 09:57:26,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074076312] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:26,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:26,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:26,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812345814] [2024-10-13 09:57:26,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:26,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:26,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:26,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:26,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:26,683 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 445 [2024-10-13 09:57:26,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 398 transitions, 872 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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-13 09:57:26,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:26,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 445 [2024-10-13 09:57:26,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:26,901 INFO L124 PetriNetUnfolderBase]: 123/1527 cut-off events. [2024-10-13 09:57:26,901 INFO L125 PetriNetUnfolderBase]: For 12/42 co-relation queries the response was YES. [2024-10-13 09:57:26,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1827 conditions, 1527 events. 123/1527 cut-off events. For 12/42 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 9568 event pairs, 28 based on Foata normal form. 1/1353 useless extension candidates. Maximal degree in co-relation 1543. Up to 152 conditions per place. [2024-10-13 09:57:26,923 INFO L140 encePairwiseOnDemand]: 439/445 looper letters, 17 selfloop transitions, 2 changer transitions 0/398 dead transitions. [2024-10-13 09:57:26,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 398 transitions, 912 flow [2024-10-13 09:57:26,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:26,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:26,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1259 transitions. [2024-10-13 09:57:26,925 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9430711610486892 [2024-10-13 09:57:26,926 INFO L175 Difference]: Start difference. First operand has 405 places, 398 transitions, 872 flow. Second operand 3 states and 1259 transitions. [2024-10-13 09:57:26,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 398 transitions, 912 flow [2024-10-13 09:57:26,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 398 transitions, 912 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:57:26,931 INFO L231 Difference]: Finished difference. Result has 404 places, 396 transitions, 878 flow [2024-10-13 09:57:26,931 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=878, PETRI_PLACES=404, PETRI_TRANSITIONS=396} [2024-10-13 09:57:26,931 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -11 predicate places. [2024-10-13 09:57:26,932 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 396 transitions, 878 flow [2024-10-13 09:57:26,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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-13 09:57:26,933 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:26,934 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:26,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 09:57:26,934 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-10-13 09:57:26,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:26,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1779658794, now seen corresponding path program 1 times [2024-10-13 09:57:26,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:26,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935979924] [2024-10-13 09:57:26,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:26,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:26,965 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-13 09:57:26,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:26,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935979924] [2024-10-13 09:57:26,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935979924] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:26,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:26,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:26,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601611299] [2024-10-13 09:57:26,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:26,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:26,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:26,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:26,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:26,975 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 419 out of 445 [2024-10-13 09:57:26,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 396 transitions, 878 flow. Second operand has 3 states, 3 states have (on average 420.3333333333333) internal successors, (1261), 3 states have internal predecessors, (1261), 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-13 09:57:26,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:26,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 419 of 445 [2024-10-13 09:57:26,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:27,148 INFO L124 PetriNetUnfolderBase]: 60/1524 cut-off events. [2024-10-13 09:57:27,148 INFO L125 PetriNetUnfolderBase]: For 5/20 co-relation queries the response was YES. [2024-10-13 09:57:27,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1742 conditions, 1524 events. 60/1524 cut-off events. For 5/20 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 8498 event pairs, 8 based on Foata normal form. 2/1374 useless extension candidates. Maximal degree in co-relation 1416. Up to 38 conditions per place. [2024-10-13 09:57:27,166 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/397 dead transitions. [2024-10-13 09:57:27,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 397 transitions, 908 flow [2024-10-13 09:57:27,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:27,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:27,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2024-10-13 09:57:27,168 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2024-10-13 09:57:27,168 INFO L175 Difference]: Start difference. First operand has 404 places, 396 transitions, 878 flow. Second operand 3 states and 1271 transitions. [2024-10-13 09:57:27,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 397 transitions, 908 flow [2024-10-13 09:57:27,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 397 transitions, 908 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:57:27,173 INFO L231 Difference]: Finished difference. Result has 405 places, 395 transitions, 880 flow [2024-10-13 09:57:27,173 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=880, PETRI_PLACES=405, PETRI_TRANSITIONS=395} [2024-10-13 09:57:27,174 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -10 predicate places. [2024-10-13 09:57:27,174 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 395 transitions, 880 flow [2024-10-13 09:57:27,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 420.3333333333333) internal successors, (1261), 3 states have internal predecessors, (1261), 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-13 09:57:27,175 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:27,175 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:27,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 09:57:27,175 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-10-13 09:57:27,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:27,175 INFO L85 PathProgramCache]: Analyzing trace with hash 651125951, now seen corresponding path program 1 times [2024-10-13 09:57:27,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:27,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123603816] [2024-10-13 09:57:27,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:27,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:27,212 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-13 09:57:27,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:27,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123603816] [2024-10-13 09:57:27,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123603816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:27,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:27,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:27,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860187363] [2024-10-13 09:57:27,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:27,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:27,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:27,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:27,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:27,231 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 445 [2024-10-13 09:57:27,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 395 transitions, 880 flow. Second operand has 3 states, 3 states have (on average 413.6666666666667) internal successors, (1241), 3 states have internal predecessors, (1241), 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-13 09:57:27,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:27,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 445 [2024-10-13 09:57:27,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:27,480 INFO L124 PetriNetUnfolderBase]: 222/1927 cut-off events. [2024-10-13 09:57:27,481 INFO L125 PetriNetUnfolderBase]: For 49/53 co-relation queries the response was YES. [2024-10-13 09:57:27,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2414 conditions, 1927 events. 222/1927 cut-off events. For 49/53 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 12369 event pairs, 76 based on Foata normal form. 0/1735 useless extension candidates. Maximal degree in co-relation 2166. Up to 346 conditions per place. [2024-10-13 09:57:27,494 INFO L140 encePairwiseOnDemand]: 439/445 looper letters, 17 selfloop transitions, 2 changer transitions 0/395 dead transitions. [2024-10-13 09:57:27,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 395 transitions, 920 flow [2024-10-13 09:57:27,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:27,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:27,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1259 transitions. [2024-10-13 09:57:27,497 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9430711610486892 [2024-10-13 09:57:27,497 INFO L175 Difference]: Start difference. First operand has 405 places, 395 transitions, 880 flow. Second operand 3 states and 1259 transitions. [2024-10-13 09:57:27,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 395 transitions, 920 flow [2024-10-13 09:57:27,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 395 transitions, 916 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:27,503 INFO L231 Difference]: Finished difference. Result has 402 places, 393 transitions, 882 flow [2024-10-13 09:57:27,504 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=882, PETRI_PLACES=402, PETRI_TRANSITIONS=393} [2024-10-13 09:57:27,504 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -13 predicate places. [2024-10-13 09:57:27,504 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 393 transitions, 882 flow [2024-10-13 09:57:27,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.6666666666667) internal successors, (1241), 3 states have internal predecessors, (1241), 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-13 09:57:27,505 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:27,505 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:27,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 09:57:27,505 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-10-13 09:57:27,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:27,506 INFO L85 PathProgramCache]: Analyzing trace with hash -82359832, now seen corresponding path program 1 times [2024-10-13 09:57:27,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:27,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061266035] [2024-10-13 09:57:27,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:27,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:27,536 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-13 09:57:27,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:27,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061266035] [2024-10-13 09:57:27,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061266035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:27,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:27,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:27,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690655490] [2024-10-13 09:57:27,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:27,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:27,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:27,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:27,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:27,549 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 419 out of 445 [2024-10-13 09:57:27,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 393 transitions, 882 flow. Second operand has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 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-13 09:57:27,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:27,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 419 of 445 [2024-10-13 09:57:27,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:27,725 INFO L124 PetriNetUnfolderBase]: 66/1560 cut-off events. [2024-10-13 09:57:27,725 INFO L125 PetriNetUnfolderBase]: For 9/21 co-relation queries the response was YES. [2024-10-13 09:57:27,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1805 conditions, 1560 events. 66/1560 cut-off events. For 9/21 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 8750 event pairs, 6 based on Foata normal form. 1/1444 useless extension candidates. Maximal degree in co-relation 1593. Up to 48 conditions per place. [2024-10-13 09:57:27,746 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/394 dead transitions. [2024-10-13 09:57:27,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 394 transitions, 912 flow [2024-10-13 09:57:27,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:27,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:27,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2024-10-13 09:57:27,749 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2024-10-13 09:57:27,749 INFO L175 Difference]: Start difference. First operand has 402 places, 393 transitions, 882 flow. Second operand 3 states and 1271 transitions. [2024-10-13 09:57:27,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 394 transitions, 912 flow [2024-10-13 09:57:27,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 394 transitions, 912 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:57:27,754 INFO L231 Difference]: Finished difference. Result has 403 places, 392 transitions, 884 flow [2024-10-13 09:57:27,755 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=403, PETRI_TRANSITIONS=392} [2024-10-13 09:57:27,755 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -12 predicate places. [2024-10-13 09:57:27,755 INFO L471 AbstractCegarLoop]: Abstraction has has 403 places, 392 transitions, 884 flow [2024-10-13 09:57:27,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 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-13 09:57:27,756 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:27,756 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:27,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 09:57:27,756 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-10-13 09:57:27,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:27,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1144087775, now seen corresponding path program 1 times [2024-10-13 09:57:27,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:27,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236073838] [2024-10-13 09:57:27,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:27,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:27,789 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-13 09:57:27,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:27,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236073838] [2024-10-13 09:57:27,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236073838] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:27,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:27,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:27,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435304089] [2024-10-13 09:57:27,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:27,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:27,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:27,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:27,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:27,797 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 419 out of 445 [2024-10-13 09:57:27,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 392 transitions, 884 flow. Second operand has 3 states, 3 states have (on average 421.0) internal successors, (1263), 3 states have internal predecessors, (1263), 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-13 09:57:27,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:27,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 419 of 445 [2024-10-13 09:57:27,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:27,951 INFO L124 PetriNetUnfolderBase]: 74/1231 cut-off events. [2024-10-13 09:57:27,951 INFO L125 PetriNetUnfolderBase]: For 31/37 co-relation queries the response was YES. [2024-10-13 09:57:27,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1539 conditions, 1231 events. 74/1231 cut-off events. For 31/37 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 6257 event pairs, 14 based on Foata normal form. 0/1155 useless extension candidates. Maximal degree in co-relation 1475. Up to 76 conditions per place. [2024-10-13 09:57:27,963 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/393 dead transitions. [2024-10-13 09:57:27,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 393 transitions, 914 flow [2024-10-13 09:57:27,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:27,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:27,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2024-10-13 09:57:27,966 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2024-10-13 09:57:27,966 INFO L175 Difference]: Start difference. First operand has 403 places, 392 transitions, 884 flow. Second operand 3 states and 1271 transitions. [2024-10-13 09:57:27,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 393 transitions, 914 flow [2024-10-13 09:57:27,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 393 transitions, 910 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:27,971 INFO L231 Difference]: Finished difference. Result has 402 places, 391 transitions, 882 flow [2024-10-13 09:57:27,971 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=878, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=882, PETRI_PLACES=402, PETRI_TRANSITIONS=391} [2024-10-13 09:57:27,971 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -13 predicate places. [2024-10-13 09:57:27,972 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 391 transitions, 882 flow [2024-10-13 09:57:27,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.0) internal successors, (1263), 3 states have internal predecessors, (1263), 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-13 09:57:27,972 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:27,972 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 09:57:27,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 09:57:27,972 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-10-13 09:57:27,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:27,973 INFO L85 PathProgramCache]: Analyzing trace with hash -551136353, now seen corresponding path program 1 times [2024-10-13 09:57:27,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:27,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454961644] [2024-10-13 09:57:27,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:27,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:27,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:28,044 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-13 09:57:28,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:28,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454961644] [2024-10-13 09:57:28,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454961644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:28,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:28,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:28,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698985969] [2024-10-13 09:57:28,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:28,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:28,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:28,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:28,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:28,052 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 421 out of 445 [2024-10-13 09:57:28,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 391 transitions, 882 flow. Second operand has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 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-13 09:57:28,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:28,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 421 of 445 [2024-10-13 09:57:28,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:28,221 INFO L124 PetriNetUnfolderBase]: 60/1538 cut-off events. [2024-10-13 09:57:28,222 INFO L125 PetriNetUnfolderBase]: For 5/11 co-relation queries the response was YES. [2024-10-13 09:57:28,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1818 conditions, 1538 events. 60/1538 cut-off events. For 5/11 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 8400 event pairs, 4 based on Foata normal form. 0/1444 useless extension candidates. Maximal degree in co-relation 1589. Up to 50 conditions per place. [2024-10-13 09:57:28,241 INFO L140 encePairwiseOnDemand]: 443/445 looper letters, 8 selfloop transitions, 1 changer transitions 0/390 dead transitions. [2024-10-13 09:57:28,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 390 transitions, 898 flow [2024-10-13 09:57:28,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:28,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:28,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1273 transitions. [2024-10-13 09:57:28,244 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9535580524344569 [2024-10-13 09:57:28,244 INFO L175 Difference]: Start difference. First operand has 402 places, 391 transitions, 882 flow. Second operand 3 states and 1273 transitions. [2024-10-13 09:57:28,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 390 transitions, 898 flow [2024-10-13 09:57:28,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 390 transitions, 894 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:28,249 INFO L231 Difference]: Finished difference. Result has 401 places, 390 transitions, 878 flow [2024-10-13 09:57:28,249 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=878, PETRI_PLACES=401, PETRI_TRANSITIONS=390} [2024-10-13 09:57:28,250 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -14 predicate places. [2024-10-13 09:57:28,250 INFO L471 AbstractCegarLoop]: Abstraction has has 401 places, 390 transitions, 878 flow [2024-10-13 09:57:28,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 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-13 09:57:28,251 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:28,251 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 09:57:28,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 09:57:28,251 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-10-13 09:57:28,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:28,251 INFO L85 PathProgramCache]: Analyzing trace with hash -592800542, now seen corresponding path program 1 times [2024-10-13 09:57:28,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:28,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068142249] [2024-10-13 09:57:28,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:28,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:28,322 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-13 09:57:28,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:28,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068142249] [2024-10-13 09:57:28,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068142249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:28,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:28,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:28,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395310327] [2024-10-13 09:57:28,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:28,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:28,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:28,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:28,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:28,331 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 421 out of 445 [2024-10-13 09:57:28,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 390 transitions, 878 flow. Second operand has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 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-13 09:57:28,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:28,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 421 of 445 [2024-10-13 09:57:28,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:28,570 INFO L124 PetriNetUnfolderBase]: 56/1511 cut-off events. [2024-10-13 09:57:28,570 INFO L125 PetriNetUnfolderBase]: For 5/11 co-relation queries the response was YES. [2024-10-13 09:57:28,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1729 conditions, 1511 events. 56/1511 cut-off events. For 5/11 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 8189 event pairs, 3 based on Foata normal form. 0/1420 useless extension candidates. Maximal degree in co-relation 1698. Up to 48 conditions per place. [2024-10-13 09:57:28,591 INFO L140 encePairwiseOnDemand]: 443/445 looper letters, 8 selfloop transitions, 1 changer transitions 0/389 dead transitions. [2024-10-13 09:57:28,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 389 transitions, 894 flow [2024-10-13 09:57:28,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:28,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:28,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1273 transitions. [2024-10-13 09:57:28,595 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9535580524344569 [2024-10-13 09:57:28,595 INFO L175 Difference]: Start difference. First operand has 401 places, 390 transitions, 878 flow. Second operand 3 states and 1273 transitions. [2024-10-13 09:57:28,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 389 transitions, 894 flow [2024-10-13 09:57:28,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 389 transitions, 893 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:57:28,601 INFO L231 Difference]: Finished difference. Result has 401 places, 389 transitions, 877 flow [2024-10-13 09:57:28,601 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=877, PETRI_PLACES=401, PETRI_TRANSITIONS=389} [2024-10-13 09:57:28,602 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -14 predicate places. [2024-10-13 09:57:28,602 INFO L471 AbstractCegarLoop]: Abstraction has has 401 places, 389 transitions, 877 flow [2024-10-13 09:57:28,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 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-13 09:57:28,603 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:28,603 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 09:57:28,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-13 09:57:28,603 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-10-13 09:57:28,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:28,604 INFO L85 PathProgramCache]: Analyzing trace with hash -933491653, now seen corresponding path program 1 times [2024-10-13 09:57:28,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:28,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278130380] [2024-10-13 09:57:28,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:28,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:28,680 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-13 09:57:28,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:28,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278130380] [2024-10-13 09:57:28,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278130380] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:28,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:28,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:28,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134296855] [2024-10-13 09:57:28,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:28,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:28,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:28,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:28,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:28,689 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 421 out of 445 [2024-10-13 09:57:28,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 389 transitions, 877 flow. Second operand has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 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-13 09:57:28,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:28,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 421 of 445 [2024-10-13 09:57:28,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:28,830 INFO L124 PetriNetUnfolderBase]: 52/1170 cut-off events. [2024-10-13 09:57:28,831 INFO L125 PetriNetUnfolderBase]: For 10/16 co-relation queries the response was YES. [2024-10-13 09:57:28,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1378 conditions, 1170 events. 52/1170 cut-off events. For 10/16 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5778 event pairs, 7 based on Foata normal form. 2/1098 useless extension candidates. Maximal degree in co-relation 1358. Up to 42 conditions per place. [2024-10-13 09:57:28,844 INFO L140 encePairwiseOnDemand]: 443/445 looper letters, 0 selfloop transitions, 0 changer transitions 388/388 dead transitions. [2024-10-13 09:57:28,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 388 transitions, 891 flow [2024-10-13 09:57:28,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:28,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:28,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1272 transitions. [2024-10-13 09:57:28,847 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.952808988764045 [2024-10-13 09:57:28,847 INFO L175 Difference]: Start difference. First operand has 401 places, 389 transitions, 877 flow. Second operand 3 states and 1272 transitions. [2024-10-13 09:57:28,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 388 transitions, 891 flow [2024-10-13 09:57:28,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 388 transitions, 890 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:57:28,850 INFO L231 Difference]: Finished difference. Result has 401 places, 0 transitions, 0 flow [2024-10-13 09:57:28,851 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=401, PETRI_TRANSITIONS=0} [2024-10-13 09:57:28,851 INFO L277 CegarLoopForPetriNet]: 415 programPoint places, -14 predicate places. [2024-10-13 09:57:28,851 INFO L471 AbstractCegarLoop]: Abstraction has has 401 places, 0 transitions, 0 flow [2024-10-13 09:57:28,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 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-13 09:57:28,854 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (68 of 69 remaining) [2024-10-13 09:57:28,854 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (67 of 69 remaining) [2024-10-13 09:57:28,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (66 of 69 remaining) [2024-10-13 09:57:28,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (65 of 69 remaining) [2024-10-13 09:57:28,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (64 of 69 remaining) [2024-10-13 09:57:28,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (63 of 69 remaining) [2024-10-13 09:57:28,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (62 of 69 remaining) [2024-10-13 09:57:28,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (61 of 69 remaining) [2024-10-13 09:57:28,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (60 of 69 remaining) [2024-10-13 09:57:28,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (59 of 69 remaining) [2024-10-13 09:57:28,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (58 of 69 remaining) [2024-10-13 09:57:28,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (57 of 69 remaining) [2024-10-13 09:57:28,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (56 of 69 remaining) [2024-10-13 09:57:28,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (55 of 69 remaining) [2024-10-13 09:57:28,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (54 of 69 remaining) [2024-10-13 09:57:28,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (53 of 69 remaining) [2024-10-13 09:57:28,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (52 of 69 remaining) [2024-10-13 09:57:28,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (51 of 69 remaining) [2024-10-13 09:57:28,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (50 of 69 remaining) [2024-10-13 09:57:28,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (49 of 69 remaining) [2024-10-13 09:57:28,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (48 of 69 remaining) [2024-10-13 09:57:28,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (47 of 69 remaining) [2024-10-13 09:57:28,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (46 of 69 remaining) [2024-10-13 09:57:28,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (45 of 69 remaining) [2024-10-13 09:57:28,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (44 of 69 remaining) [2024-10-13 09:57:28,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (43 of 69 remaining) [2024-10-13 09:57:28,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (42 of 69 remaining) [2024-10-13 09:57:28,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (41 of 69 remaining) [2024-10-13 09:57:28,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (40 of 69 remaining) [2024-10-13 09:57:28,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (39 of 69 remaining) [2024-10-13 09:57:28,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (38 of 69 remaining) [2024-10-13 09:57:28,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (37 of 69 remaining) [2024-10-13 09:57:28,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (36 of 69 remaining) [2024-10-13 09:57:28,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (35 of 69 remaining) [2024-10-13 09:57:28,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (34 of 69 remaining) [2024-10-13 09:57:28,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (33 of 69 remaining) [2024-10-13 09:57:28,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (32 of 69 remaining) [2024-10-13 09:57:28,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (31 of 69 remaining) [2024-10-13 09:57:28,859 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (30 of 69 remaining) [2024-10-13 09:57:28,859 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 69 remaining) [2024-10-13 09:57:28,859 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 69 remaining) [2024-10-13 09:57:28,859 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 69 remaining) [2024-10-13 09:57:28,859 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (26 of 69 remaining) [2024-10-13 09:57:28,859 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (25 of 69 remaining) [2024-10-13 09:57:28,859 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (24 of 69 remaining) [2024-10-13 09:57:28,859 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (23 of 69 remaining) [2024-10-13 09:57:28,859 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (22 of 69 remaining) [2024-10-13 09:57:28,859 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (21 of 69 remaining) [2024-10-13 09:57:28,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (20 of 69 remaining) [2024-10-13 09:57:28,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (19 of 69 remaining) [2024-10-13 09:57:28,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (18 of 69 remaining) [2024-10-13 09:57:28,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (17 of 69 remaining) [2024-10-13 09:57:28,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (16 of 69 remaining) [2024-10-13 09:57:28,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (15 of 69 remaining) [2024-10-13 09:57:28,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (14 of 69 remaining) [2024-10-13 09:57:28,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (13 of 69 remaining) [2024-10-13 09:57:28,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (12 of 69 remaining) [2024-10-13 09:57:28,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (11 of 69 remaining) [2024-10-13 09:57:28,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (10 of 69 remaining) [2024-10-13 09:57:28,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (9 of 69 remaining) [2024-10-13 09:57:28,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (8 of 69 remaining) [2024-10-13 09:57:28,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (7 of 69 remaining) [2024-10-13 09:57:28,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (6 of 69 remaining) [2024-10-13 09:57:28,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (5 of 69 remaining) [2024-10-13 09:57:28,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 69 remaining) [2024-10-13 09:57:28,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (3 of 69 remaining) [2024-10-13 09:57:28,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (2 of 69 remaining) [2024-10-13 09:57:28,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (1 of 69 remaining) [2024-10-13 09:57:28,862 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (0 of 69 remaining) [2024-10-13 09:57:28,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-13 09:57:28,862 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, 1, 1, 1, 1] [2024-10-13 09:57:28,867 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 09:57:28,867 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 09:57:28,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:57:28 BasicIcfg [2024-10-13 09:57:28,871 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 09:57:28,872 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 09:57:28,872 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 09:57:28,872 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 09:57:28,872 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:57:22" (3/4) ... [2024-10-13 09:57:28,873 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 09:57:28,876 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-13 09:57:28,876 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-13 09:57:28,876 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-10-13 09:57:28,880 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-13 09:57:28,880 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-13 09:57:28,880 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 09:57:28,880 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 09:57:28,953 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 09:57:28,953 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 09:57:28,954 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 09:57:28,954 INFO L158 Benchmark]: Toolchain (without parser) took 7662.98ms. Allocated memory was 146.8MB in the beginning and 664.8MB in the end (delta: 518.0MB). Free memory was 75.0MB in the beginning and 322.7MB in the end (delta: -247.8MB). Peak memory consumption was 272.6MB. Max. memory is 16.1GB. [2024-10-13 09:57:28,954 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 146.8MB. Free memory is still 99.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 09:57:28,954 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.55ms. Allocated memory was 146.8MB in the beginning and 203.4MB in the end (delta: 56.6MB). Free memory was 74.8MB in the beginning and 174.9MB in the end (delta: -100.1MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2024-10-13 09:57:28,955 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.19ms. Allocated memory is still 203.4MB. Free memory was 174.9MB in the beginning and 171.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 09:57:28,955 INFO L158 Benchmark]: Boogie Preprocessor took 40.74ms. Allocated memory is still 203.4MB. Free memory was 171.8MB in the beginning and 169.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 09:57:28,955 INFO L158 Benchmark]: RCFGBuilder took 631.79ms. Allocated memory is still 203.4MB. Free memory was 169.7MB in the beginning and 139.3MB in the end (delta: 30.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-13 09:57:28,955 INFO L158 Benchmark]: TraceAbstraction took 6595.95ms. Allocated memory was 203.4MB in the beginning and 664.8MB in the end (delta: 461.4MB). Free memory was 138.2MB in the beginning and 328.0MB in the end (delta: -189.7MB). Peak memory consumption was 271.6MB. Max. memory is 16.1GB. [2024-10-13 09:57:28,955 INFO L158 Benchmark]: Witness Printer took 81.93ms. Allocated memory is still 664.8MB. Free memory was 328.0MB in the beginning and 322.7MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 09:57:28,956 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 146.8MB. Free memory is still 99.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.55ms. Allocated memory was 146.8MB in the beginning and 203.4MB in the end (delta: 56.6MB). Free memory was 74.8MB in the beginning and 174.9MB in the end (delta: -100.1MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.19ms. Allocated memory is still 203.4MB. Free memory was 174.9MB in the beginning and 171.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.74ms. Allocated memory is still 203.4MB. Free memory was 171.8MB in the beginning and 169.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 631.79ms. Allocated memory is still 203.4MB. Free memory was 169.7MB in the beginning and 139.3MB in the end (delta: 30.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6595.95ms. Allocated memory was 203.4MB in the beginning and 664.8MB in the end (delta: 461.4MB). Free memory was 138.2MB in the beginning and 328.0MB in the end (delta: -189.7MB). Peak memory consumption was 271.6MB. Max. memory is 16.1GB. * Witness Printer took 81.93ms. Allocated memory is still 664.8MB. Free memory was 328.0MB in the beginning and 322.7MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: 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: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: 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: 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: 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: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: 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: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: 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: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: 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 7 procedures, 701 locations, 69 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: 6.4s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 462 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 164 mSDsluCounter, 102 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 620 IncrementalHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 102 mSDtfsCounter, 620 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=884occurred in iteration=20, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 3250 NumberOfCodeBlocks, 3250 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 3226 ConstructedInterpolants, 0 QuantifiedInterpolants, 3274 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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 39 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-13 09:57:28,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE