./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-exp-term-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-exp-term-subst.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 2a508120cc7913f10b79dda7ca65a8b88f829725798d520aee5d1c1d04a1fc13 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 06:59:12,333 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:59:12,398 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-09 06:59:12,403 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:59:12,403 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:59:12,424 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:59:12,427 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:59:12,428 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:59:12,428 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:59:12,430 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:59:12,430 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:59:12,431 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:59:12,431 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 06:59:12,433 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:59:12,433 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:59:12,434 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:59:12,434 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:59:12,434 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:59:12,434 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:59:12,434 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:59:12,434 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:59:12,435 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:59:12,435 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 06:59:12,435 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:59:12,435 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:59:12,435 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:59:12,436 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:59:12,436 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:59:12,436 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:59:12,436 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:59:12,436 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:59:12,436 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:59:12,436 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:59:12,437 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:59:12,437 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:59:12,437 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 06:59:12,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:59:12,438 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:59:12,439 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 06:59:12,439 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 06:59:12,439 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:59:12,439 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 -> 2a508120cc7913f10b79dda7ca65a8b88f829725798d520aee5d1c1d04a1fc13 [2024-11-09 06:59:12,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:59:12,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:59:12,726 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:59:12,727 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:59:12,727 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:59:12,728 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-exp-term-subst.wvr.c [2024-11-09 06:59:13,943 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:59:14,115 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:59:14,116 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-exp-term-subst.wvr.c [2024-11-09 06:59:14,122 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70e7fb14a/13065edfd7f4486a8fe9de4ab627d411/FLAGbb90b1359 [2024-11-09 06:59:14,135 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70e7fb14a/13065edfd7f4486a8fe9de4ab627d411 [2024-11-09 06:59:14,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:59:14,139 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:59:14,140 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:59:14,140 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:59:14,144 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:59:14,145 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:59:14" (1/1) ... [2024-11-09 06:59:14,145 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42861dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:14, skipping insertion in model container [2024-11-09 06:59:14,146 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:59:14" (1/1) ... [2024-11-09 06:59:14,162 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:59:14,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:59:14,333 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:59:14,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:59:14,369 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:59:14,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:14 WrapperNode [2024-11-09 06:59:14,369 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:59:14,370 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:59:14,370 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:59:14,370 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:59:14,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:14" (1/1) ... [2024-11-09 06:59:14,383 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:14" (1/1) ... [2024-11-09 06:59:14,406 INFO L138 Inliner]: procedures = 22, calls = 17, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 317 [2024-11-09 06:59:14,406 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:59:14,407 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:59:14,407 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:59:14,407 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:59:14,414 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:14" (1/1) ... [2024-11-09 06:59:14,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:14" (1/1) ... [2024-11-09 06:59:14,416 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:14" (1/1) ... [2024-11-09 06:59:14,416 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:14" (1/1) ... [2024-11-09 06:59:14,421 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:14" (1/1) ... [2024-11-09 06:59:14,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:14" (1/1) ... [2024-11-09 06:59:14,425 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:14" (1/1) ... [2024-11-09 06:59:14,426 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:14" (1/1) ... [2024-11-09 06:59:14,428 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:59:14,432 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:59:14,432 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:59:14,433 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:59:14,438 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:14" (1/1) ... [2024-11-09 06:59:14,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:59:14,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:59:14,470 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 06:59:14,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 06:59:14,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:59:14,554 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-09 06:59:14,554 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-09 06:59:14,554 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-09 06:59:14,555 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-09 06:59:14,555 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-09 06:59:14,555 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-09 06:59:14,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:59:14,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:59:14,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:59:14,556 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 06:59:14,663 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:59:14,665 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:59:15,046 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 06:59:15,046 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:59:15,074 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:59:15,074 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 06:59:15,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:59:15 BoogieIcfgContainer [2024-11-09 06:59:15,074 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:59:15,076 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:59:15,076 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:59:15,079 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:59:15,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:59:14" (1/3) ... [2024-11-09 06:59:15,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a25a863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:59:15, skipping insertion in model container [2024-11-09 06:59:15,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:14" (2/3) ... [2024-11-09 06:59:15,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a25a863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:59:15, skipping insertion in model container [2024-11-09 06:59:15,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:59:15" (3/3) ... [2024-11-09 06:59:15,082 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-exp-term-subst.wvr.c [2024-11-09 06:59:15,093 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:59:15,094 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2024-11-09 06:59:15,094 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 06:59:15,191 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-09 06:59:15,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 413 places, 430 transitions, 881 flow [2024-11-09 06:59:15,403 INFO L124 PetriNetUnfolderBase]: 27/427 cut-off events. [2024-11-09 06:59:15,406 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 06:59:15,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 427 events. 27/427 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1395 event pairs, 0 based on Foata normal form. 0/356 useless extension candidates. Maximal degree in co-relation 306. Up to 2 conditions per place. [2024-11-09 06:59:15,419 INFO L82 GeneralOperation]: Start removeDead. Operand has 413 places, 430 transitions, 881 flow [2024-11-09 06:59:15,428 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 392 places, 407 transitions, 832 flow [2024-11-09 06:59:15,439 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:59:15,449 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;@732af9b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:59:15,449 INFO L334 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2024-11-09 06:59:15,455 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 06:59:15,456 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-11-09 06:59:15,456 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:59:15,456 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:15,457 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] [2024-11-09 06:59:15,457 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-09 06:59:15,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:15,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1102699124, now seen corresponding path program 1 times [2024-11-09 06:59:15,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:15,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687544153] [2024-11-09 06:59:15,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:15,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:15,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:15,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:15,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687544153] [2024-11-09 06:59:15,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687544153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:15,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:15,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:15,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061909687] [2024-11-09 06:59:15,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:15,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:15,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:15,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:15,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:15,687 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 430 [2024-11-09 06:59:15,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 407 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:15,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:15,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 430 [2024-11-09 06:59:15,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:15,907 INFO L124 PetriNetUnfolderBase]: 98/1397 cut-off events. [2024-11-09 06:59:15,907 INFO L125 PetriNetUnfolderBase]: For 28/32 co-relation queries the response was YES. [2024-11-09 06:59:15,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1484 conditions, 1397 events. 98/1397 cut-off events. For 28/32 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 9754 event pairs, 20 based on Foata normal form. 39/1169 useless extension candidates. Maximal degree in co-relation 1352. Up to 50 conditions per place. [2024-11-09 06:59:15,924 INFO L140 encePairwiseOnDemand]: 420/430 looper letters, 13 selfloop transitions, 2 changer transitions 1/399 dead transitions. [2024-11-09 06:59:15,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 399 transitions, 846 flow [2024-11-09 06:59:15,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:15,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:15,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1235 transitions. [2024-11-09 06:59:15,942 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9573643410852714 [2024-11-09 06:59:15,945 INFO L175 Difference]: Start difference. First operand has 392 places, 407 transitions, 832 flow. Second operand 3 states and 1235 transitions. [2024-11-09 06:59:15,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 399 transitions, 846 flow [2024-11-09 06:59:15,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 399 transitions, 834 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-09 06:59:15,957 INFO L231 Difference]: Finished difference. Result has 387 places, 398 transitions, 806 flow [2024-11-09 06:59:15,960 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=806, PETRI_PLACES=387, PETRI_TRANSITIONS=398} [2024-11-09 06:59:15,963 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -5 predicate places. [2024-11-09 06:59:15,965 INFO L471 AbstractCegarLoop]: Abstraction has has 387 places, 398 transitions, 806 flow [2024-11-09 06:59:15,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:15,966 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:15,966 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] [2024-11-09 06:59:15,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:59:15,966 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-09 06:59:15,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:15,968 INFO L85 PathProgramCache]: Analyzing trace with hash 669304532, now seen corresponding path program 1 times [2024-11-09 06:59:15,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:15,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909190878] [2024-11-09 06:59:15,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:15,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:16,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:16,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:16,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909190878] [2024-11-09 06:59:16,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909190878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:16,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:16,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:16,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103831012] [2024-11-09 06:59:16,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:16,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:16,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:16,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:16,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:16,057 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 430 [2024-11-09 06:59:16,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 398 transitions, 806 flow. Second operand has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:16,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:16,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 430 [2024-11-09 06:59:16,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:16,185 INFO L124 PetriNetUnfolderBase]: 54/807 cut-off events. [2024-11-09 06:59:16,185 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-11-09 06:59:16,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 858 conditions, 807 events. 54/807 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4622 event pairs, 12 based on Foata normal form. 0/662 useless extension candidates. Maximal degree in co-relation 824. Up to 38 conditions per place. [2024-11-09 06:59:16,196 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 13 selfloop transitions, 2 changer transitions 0/397 dead transitions. [2024-11-09 06:59:16,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 397 transitions, 834 flow [2024-11-09 06:59:16,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:16,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:16,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1228 transitions. [2024-11-09 06:59:16,199 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.951937984496124 [2024-11-09 06:59:16,199 INFO L175 Difference]: Start difference. First operand has 387 places, 398 transitions, 806 flow. Second operand 3 states and 1228 transitions. [2024-11-09 06:59:16,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 397 transitions, 834 flow [2024-11-09 06:59:16,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 397 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:16,206 INFO L231 Difference]: Finished difference. Result has 385 places, 397 transitions, 804 flow [2024-11-09 06:59:16,206 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=804, PETRI_PLACES=385, PETRI_TRANSITIONS=397} [2024-11-09 06:59:16,207 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -7 predicate places. [2024-11-09 06:59:16,207 INFO L471 AbstractCegarLoop]: Abstraction has has 385 places, 397 transitions, 804 flow [2024-11-09 06:59:16,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:16,208 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:16,208 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] [2024-11-09 06:59:16,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:59:16,209 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-09 06:59:16,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:16,209 INFO L85 PathProgramCache]: Analyzing trace with hash -337939069, now seen corresponding path program 1 times [2024-11-09 06:59:16,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:16,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505015845] [2024-11-09 06:59:16,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:16,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:16,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-11-09 06:59:16,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:16,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505015845] [2024-11-09 06:59:16,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505015845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:16,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:16,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:16,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226026172] [2024-11-09 06:59:16,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:16,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:16,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:16,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:16,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:16,279 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 430 [2024-11-09 06:59:16,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 397 transitions, 804 flow. Second operand has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:16,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:16,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 430 [2024-11-09 06:59:16,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:16,380 INFO L124 PetriNetUnfolderBase]: 50/620 cut-off events. [2024-11-09 06:59:16,383 INFO L125 PetriNetUnfolderBase]: For 9/12 co-relation queries the response was YES. [2024-11-09 06:59:16,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 620 events. 50/620 cut-off events. For 9/12 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3102 event pairs, 20 based on Foata normal form. 0/516 useless extension candidates. Maximal degree in co-relation 639. Up to 50 conditions per place. [2024-11-09 06:59:16,393 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 13 selfloop transitions, 2 changer transitions 0/396 dead transitions. [2024-11-09 06:59:16,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 396 transitions, 832 flow [2024-11-09 06:59:16,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:16,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:16,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1228 transitions. [2024-11-09 06:59:16,396 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.951937984496124 [2024-11-09 06:59:16,397 INFO L175 Difference]: Start difference. First operand has 385 places, 397 transitions, 804 flow. Second operand 3 states and 1228 transitions. [2024-11-09 06:59:16,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 396 transitions, 832 flow [2024-11-09 06:59:16,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 396 transitions, 828 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:16,403 INFO L231 Difference]: Finished difference. Result has 384 places, 396 transitions, 802 flow [2024-11-09 06:59:16,403 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=802, PETRI_PLACES=384, PETRI_TRANSITIONS=396} [2024-11-09 06:59:16,404 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -8 predicate places. [2024-11-09 06:59:16,404 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 396 transitions, 802 flow [2024-11-09 06:59:16,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:16,406 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:16,406 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] [2024-11-09 06:59:16,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:59:16,406 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-09 06:59:16,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:16,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1034750040, now seen corresponding path program 1 times [2024-11-09 06:59:16,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:16,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554188413] [2024-11-09 06:59:16,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:16,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:16,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:16,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:16,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554188413] [2024-11-09 06:59:16,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554188413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:16,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:16,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:16,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765218139] [2024-11-09 06:59:16,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:16,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:16,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:16,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:16,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:16,512 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 430 [2024-11-09 06:59:16,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 396 transitions, 802 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:16,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:16,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 430 [2024-11-09 06:59:16,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:16,729 INFO L124 PetriNetUnfolderBase]: 117/1364 cut-off events. [2024-11-09 06:59:16,729 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-09 06:59:16,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1476 conditions, 1364 events. 117/1364 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 9907 event pairs, 39 based on Foata normal form. 0/1100 useless extension candidates. Maximal degree in co-relation 1426. Up to 85 conditions per place. [2024-11-09 06:59:16,755 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 15 selfloop transitions, 2 changer transitions 0/395 dead transitions. [2024-11-09 06:59:16,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 395 transitions, 834 flow [2024-11-09 06:59:16,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:16,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:16,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1224 transitions. [2024-11-09 06:59:16,760 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9488372093023256 [2024-11-09 06:59:16,760 INFO L175 Difference]: Start difference. First operand has 384 places, 396 transitions, 802 flow. Second operand 3 states and 1224 transitions. [2024-11-09 06:59:16,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 395 transitions, 834 flow [2024-11-09 06:59:16,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 395 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:16,766 INFO L231 Difference]: Finished difference. Result has 383 places, 395 transitions, 800 flow [2024-11-09 06:59:16,766 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=381, 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=800, PETRI_PLACES=383, PETRI_TRANSITIONS=395} [2024-11-09 06:59:16,767 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -9 predicate places. [2024-11-09 06:59:16,768 INFO L471 AbstractCegarLoop]: Abstraction has has 383 places, 395 transitions, 800 flow [2024-11-09 06:59:16,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:16,768 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:16,768 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] [2024-11-09 06:59:16,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:59:16,770 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-09 06:59:16,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:16,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1308583354, now seen corresponding path program 1 times [2024-11-09 06:59:16,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:16,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333888508] [2024-11-09 06:59:16,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:16,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:16,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:16,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:16,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333888508] [2024-11-09 06:59:16,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333888508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:16,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:16,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:16,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940954612] [2024-11-09 06:59:16,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:16,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:16,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:16,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:16,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:16,857 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 430 [2024-11-09 06:59:16,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 395 transitions, 800 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:16,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:16,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 430 [2024-11-09 06:59:16,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:17,005 INFO L124 PetriNetUnfolderBase]: 69/871 cut-off events. [2024-11-09 06:59:17,005 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 06:59:17,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 871 events. 69/871 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 5269 event pairs, 21 based on Foata normal form. 0/715 useless extension candidates. Maximal degree in co-relation 886. Up to 58 conditions per place. [2024-11-09 06:59:17,021 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 15 selfloop transitions, 2 changer transitions 0/394 dead transitions. [2024-11-09 06:59:17,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 394 transitions, 832 flow [2024-11-09 06:59:17,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:17,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:17,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1224 transitions. [2024-11-09 06:59:17,024 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9488372093023256 [2024-11-09 06:59:17,024 INFO L175 Difference]: Start difference. First operand has 383 places, 395 transitions, 800 flow. Second operand 3 states and 1224 transitions. [2024-11-09 06:59:17,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 394 transitions, 832 flow [2024-11-09 06:59:17,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 394 transitions, 828 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:17,029 INFO L231 Difference]: Finished difference. Result has 382 places, 394 transitions, 798 flow [2024-11-09 06:59:17,029 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=798, PETRI_PLACES=382, PETRI_TRANSITIONS=394} [2024-11-09 06:59:17,031 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -10 predicate places. [2024-11-09 06:59:17,031 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 394 transitions, 798 flow [2024-11-09 06:59:17,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:17,032 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:17,033 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] [2024-11-09 06:59:17,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:59:17,033 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-09 06:59:17,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:17,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1633748031, now seen corresponding path program 1 times [2024-11-09 06:59:17,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:17,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917390130] [2024-11-09 06:59:17,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:17,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:17,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:17,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:17,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:17,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917390130] [2024-11-09 06:59:17,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917390130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:17,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:17,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:17,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836860878] [2024-11-09 06:59:17,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:17,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:17,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:17,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:17,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:17,113 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 430 [2024-11-09 06:59:17,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 394 transitions, 798 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:17,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:17,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 430 [2024-11-09 06:59:17,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:17,261 INFO L124 PetriNetUnfolderBase]: 117/1332 cut-off events. [2024-11-09 06:59:17,261 INFO L125 PetriNetUnfolderBase]: For 21/26 co-relation queries the response was YES. [2024-11-09 06:59:17,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1429 conditions, 1332 events. 117/1332 cut-off events. For 21/26 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 8607 event pairs, 39 based on Foata normal form. 0/1080 useless extension candidates. Maximal degree in co-relation 1363. Up to 85 conditions per place. [2024-11-09 06:59:17,272 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 15 selfloop transitions, 2 changer transitions 0/393 dead transitions. [2024-11-09 06:59:17,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 393 transitions, 830 flow [2024-11-09 06:59:17,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:17,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:17,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1224 transitions. [2024-11-09 06:59:17,274 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9488372093023256 [2024-11-09 06:59:17,274 INFO L175 Difference]: Start difference. First operand has 382 places, 394 transitions, 798 flow. Second operand 3 states and 1224 transitions. [2024-11-09 06:59:17,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 393 transitions, 830 flow [2024-11-09 06:59:17,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 393 transitions, 826 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:17,279 INFO L231 Difference]: Finished difference. Result has 381 places, 393 transitions, 796 flow [2024-11-09 06:59:17,279 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=796, PETRI_PLACES=381, PETRI_TRANSITIONS=393} [2024-11-09 06:59:17,280 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -11 predicate places. [2024-11-09 06:59:17,281 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 393 transitions, 796 flow [2024-11-09 06:59:17,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:17,281 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:17,281 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:17,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:59:17,282 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-09 06:59:17,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:17,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1920223402, now seen corresponding path program 1 times [2024-11-09 06:59:17,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:17,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116096702] [2024-11-09 06:59:17,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:17,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:17,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:17,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:17,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116096702] [2024-11-09 06:59:17,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116096702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:17,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:17,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:17,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268450394] [2024-11-09 06:59:17,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:17,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:17,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:17,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:17,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:17,350 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 396 out of 430 [2024-11-09 06:59:17,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 393 transitions, 796 flow. Second operand has 3 states, 3 states have (on average 397.3333333333333) internal successors, (1192), 3 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:17,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:17,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 396 of 430 [2024-11-09 06:59:17,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:17,603 INFO L124 PetriNetUnfolderBase]: 284/2636 cut-off events. [2024-11-09 06:59:17,603 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-09 06:59:17,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2953 conditions, 2636 events. 284/2636 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 24560 event pairs, 117 based on Foata normal form. 0/2193 useless extension candidates. Maximal degree in co-relation 2879. Up to 251 conditions per place. [2024-11-09 06:59:17,632 INFO L140 encePairwiseOnDemand]: 422/430 looper letters, 21 selfloop transitions, 2 changer transitions 0/391 dead transitions. [2024-11-09 06:59:17,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 391 transitions, 840 flow [2024-11-09 06:59:17,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:17,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:17,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1217 transitions. [2024-11-09 06:59:17,634 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9434108527131783 [2024-11-09 06:59:17,635 INFO L175 Difference]: Start difference. First operand has 381 places, 393 transitions, 796 flow. Second operand 3 states and 1217 transitions. [2024-11-09 06:59:17,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 391 transitions, 840 flow [2024-11-09 06:59:17,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 391 transitions, 836 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:17,640 INFO L231 Difference]: Finished difference. Result has 376 places, 389 transitions, 794 flow [2024-11-09 06:59:17,641 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=794, PETRI_PLACES=376, PETRI_TRANSITIONS=389} [2024-11-09 06:59:17,642 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -16 predicate places. [2024-11-09 06:59:17,643 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 389 transitions, 794 flow [2024-11-09 06:59:17,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 397.3333333333333) internal successors, (1192), 3 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:17,644 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:17,644 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-11-09 06:59:17,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 06:59:17,645 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-09 06:59:17,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:17,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1501280024, now seen corresponding path program 1 times [2024-11-09 06:59:17,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:17,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30596294] [2024-11-09 06:59:17,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:17,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:17,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-11-09 06:59:17,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:17,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30596294] [2024-11-09 06:59:17,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30596294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:17,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:17,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:17,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359560544] [2024-11-09 06:59:17,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:17,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:17,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:17,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:17,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:17,723 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 396 out of 430 [2024-11-09 06:59:17,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 389 transitions, 794 flow. Second operand has 3 states, 3 states have (on average 397.3333333333333) internal successors, (1192), 3 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:17,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:17,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 396 of 430 [2024-11-09 06:59:17,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:17,891 INFO L124 PetriNetUnfolderBase]: 151/1516 cut-off events. [2024-11-09 06:59:17,891 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-09 06:59:17,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1680 conditions, 1516 events. 151/1516 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 11431 event pairs, 52 based on Foata normal form. 0/1274 useless extension candidates. Maximal degree in co-relation 1504. Up to 135 conditions per place. [2024-11-09 06:59:17,917 INFO L140 encePairwiseOnDemand]: 422/430 looper letters, 21 selfloop transitions, 2 changer transitions 0/387 dead transitions. [2024-11-09 06:59:17,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 387 transitions, 838 flow [2024-11-09 06:59:17,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:17,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:17,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1217 transitions. [2024-11-09 06:59:17,920 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9434108527131783 [2024-11-09 06:59:17,920 INFO L175 Difference]: Start difference. First operand has 376 places, 389 transitions, 794 flow. Second operand 3 states and 1217 transitions. [2024-11-09 06:59:17,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 387 transitions, 838 flow [2024-11-09 06:59:17,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 387 transitions, 838 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:59:17,925 INFO L231 Difference]: Finished difference. Result has 373 places, 385 transitions, 796 flow [2024-11-09 06:59:17,926 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=796, PETRI_PLACES=373, PETRI_TRANSITIONS=385} [2024-11-09 06:59:17,928 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -19 predicate places. [2024-11-09 06:59:17,928 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 385 transitions, 796 flow [2024-11-09 06:59:17,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 397.3333333333333) internal successors, (1192), 3 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:17,929 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:17,929 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:17,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 06:59:17,930 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-09 06:59:17,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:17,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1400118740, now seen corresponding path program 1 times [2024-11-09 06:59:17,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:17,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582721514] [2024-11-09 06:59:17,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:17,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:17,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:17,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:17,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582721514] [2024-11-09 06:59:17,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582721514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:17,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:17,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:17,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443640049] [2024-11-09 06:59:17,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:17,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:17,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:17,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:17,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:17,997 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 396 out of 430 [2024-11-09 06:59:17,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 385 transitions, 796 flow. Second operand has 3 states, 3 states have (on average 397.6666666666667) internal successors, (1193), 3 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:18,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:18,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 396 of 430 [2024-11-09 06:59:18,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:18,423 INFO L124 PetriNetUnfolderBase]: 505/4357 cut-off events. [2024-11-09 06:59:18,424 INFO L125 PetriNetUnfolderBase]: For 63/71 co-relation queries the response was YES. [2024-11-09 06:59:18,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4838 conditions, 4357 events. 505/4357 cut-off events. For 63/71 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 44552 event pairs, 126 based on Foata normal form. 0/3687 useless extension candidates. Maximal degree in co-relation 3641. Up to 445 conditions per place. [2024-11-09 06:59:18,456 INFO L140 encePairwiseOnDemand]: 422/430 looper letters, 21 selfloop transitions, 2 changer transitions 0/383 dead transitions. [2024-11-09 06:59:18,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 383 transitions, 840 flow [2024-11-09 06:59:18,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:18,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:18,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1217 transitions. [2024-11-09 06:59:18,458 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9434108527131783 [2024-11-09 06:59:18,458 INFO L175 Difference]: Start difference. First operand has 373 places, 385 transitions, 796 flow. Second operand 3 states and 1217 transitions. [2024-11-09 06:59:18,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 383 transitions, 840 flow [2024-11-09 06:59:18,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 383 transitions, 840 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:59:18,463 INFO L231 Difference]: Finished difference. Result has 370 places, 381 transitions, 798 flow [2024-11-09 06:59:18,463 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=798, PETRI_PLACES=370, PETRI_TRANSITIONS=381} [2024-11-09 06:59:18,464 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -22 predicate places. [2024-11-09 06:59:18,464 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 381 transitions, 798 flow [2024-11-09 06:59:18,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 397.6666666666667) internal successors, (1193), 3 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:18,464 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:18,465 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-11-09 06:59:18,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 06:59:18,465 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-09 06:59:18,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:18,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1481210219, now seen corresponding path program 1 times [2024-11-09 06:59:18,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:18,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300505142] [2024-11-09 06:59:18,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:18,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:18,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:18,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:18,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300505142] [2024-11-09 06:59:18,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300505142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:18,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:18,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:59:18,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645791600] [2024-11-09 06:59:18,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:18,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:18,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:18,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:18,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:18,500 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 430 [2024-11-09 06:59:18,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 381 transitions, 798 flow. Second operand has 3 states, 3 states have (on average 409.3333333333333) internal successors, (1228), 3 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:18,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:18,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 430 [2024-11-09 06:59:18,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:18,642 INFO L124 PetriNetUnfolderBase]: 98/1285 cut-off events. [2024-11-09 06:59:18,642 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 06:59:18,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1388 conditions, 1285 events. 98/1285 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 9496 event pairs, 10 based on Foata normal form. 0/1105 useless extension candidates. Maximal degree in co-relation 1124. Up to 35 conditions per place. [2024-11-09 06:59:18,656 INFO L140 encePairwiseOnDemand]: 426/430 looper letters, 14 selfloop transitions, 3 changer transitions 0/385 dead transitions. [2024-11-09 06:59:18,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 385 transitions, 842 flow [2024-11-09 06:59:18,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:18,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:18,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1242 transitions. [2024-11-09 06:59:18,658 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9627906976744186 [2024-11-09 06:59:18,658 INFO L175 Difference]: Start difference. First operand has 370 places, 381 transitions, 798 flow. Second operand 3 states and 1242 transitions. [2024-11-09 06:59:18,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 385 transitions, 842 flow [2024-11-09 06:59:18,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 385 transitions, 842 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:59:18,663 INFO L231 Difference]: Finished difference. Result has 374 places, 383 transitions, 820 flow [2024-11-09 06:59:18,664 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=820, PETRI_PLACES=374, PETRI_TRANSITIONS=383} [2024-11-09 06:59:18,664 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -18 predicate places. [2024-11-09 06:59:18,664 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 383 transitions, 820 flow [2024-11-09 06:59:18,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 409.3333333333333) internal successors, (1228), 3 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:18,665 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:18,665 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] [2024-11-09 06:59:18,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 06:59:18,665 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-09 06:59:18,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:18,666 INFO L85 PathProgramCache]: Analyzing trace with hash 955479565, now seen corresponding path program 1 times [2024-11-09 06:59:18,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:18,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313909851] [2024-11-09 06:59:18,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:18,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:18,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:18,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:18,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313909851] [2024-11-09 06:59:18,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313909851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:18,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:18,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:18,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146066683] [2024-11-09 06:59:18,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:18,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:18,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:18,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:18,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:18,714 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 430 [2024-11-09 06:59:18,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 383 transitions, 820 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:18,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:18,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 430 [2024-11-09 06:59:18,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:18,960 INFO L124 PetriNetUnfolderBase]: 206/2208 cut-off events. [2024-11-09 06:59:18,960 INFO L125 PetriNetUnfolderBase]: For 28/34 co-relation queries the response was YES. [2024-11-09 06:59:18,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2500 conditions, 2208 events. 206/2208 cut-off events. For 28/34 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 19276 event pairs, 16 based on Foata normal form. 1/1935 useless extension candidates. Maximal degree in co-relation 2113. Up to 166 conditions per place. [2024-11-09 06:59:18,985 INFO L140 encePairwiseOnDemand]: 422/430 looper letters, 20 selfloop transitions, 4 changer transitions 0/388 dead transitions. [2024-11-09 06:59:18,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 388 transitions, 883 flow [2024-11-09 06:59:18,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:18,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:18,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1234 transitions. [2024-11-09 06:59:18,988 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9565891472868217 [2024-11-09 06:59:18,988 INFO L175 Difference]: Start difference. First operand has 374 places, 383 transitions, 820 flow. Second operand 3 states and 1234 transitions. [2024-11-09 06:59:18,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 388 transitions, 883 flow [2024-11-09 06:59:18,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 388 transitions, 877 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:18,994 INFO L231 Difference]: Finished difference. Result has 371 places, 383 transitions, 834 flow [2024-11-09 06:59:18,994 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=834, PETRI_PLACES=371, PETRI_TRANSITIONS=383} [2024-11-09 06:59:18,995 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -21 predicate places. [2024-11-09 06:59:18,996 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 383 transitions, 834 flow [2024-11-09 06:59:18,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:18,996 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:18,996 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] [2024-11-09 06:59:18,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 06:59:18,997 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-09 06:59:18,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:18,997 INFO L85 PathProgramCache]: Analyzing trace with hash -907105805, now seen corresponding path program 1 times [2024-11-09 06:59:18,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:18,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050567318] [2024-11-09 06:59:18,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:18,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:19,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:19,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:19,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:19,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050567318] [2024-11-09 06:59:19,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050567318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:19,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:19,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:19,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288916479] [2024-11-09 06:59:19,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:19,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:19,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:19,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:19,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:19,053 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 430 [2024-11-09 06:59:19,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 383 transitions, 834 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:19,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:19,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 430 [2024-11-09 06:59:19,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:19,432 INFO L124 PetriNetUnfolderBase]: 262/2943 cut-off events. [2024-11-09 06:59:19,432 INFO L125 PetriNetUnfolderBase]: For 34/65 co-relation queries the response was YES. [2024-11-09 06:59:19,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3279 conditions, 2943 events. 262/2943 cut-off events. For 34/65 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 26403 event pairs, 36 based on Foata normal form. 2/2571 useless extension candidates. Maximal degree in co-relation 2942. Up to 198 conditions per place. [2024-11-09 06:59:19,460 INFO L140 encePairwiseOnDemand]: 422/430 looper letters, 20 selfloop transitions, 4 changer transitions 0/388 dead transitions. [2024-11-09 06:59:19,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 388 transitions, 897 flow [2024-11-09 06:59:19,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:19,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:19,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1234 transitions. [2024-11-09 06:59:19,463 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9565891472868217 [2024-11-09 06:59:19,463 INFO L175 Difference]: Start difference. First operand has 371 places, 383 transitions, 834 flow. Second operand 3 states and 1234 transitions. [2024-11-09 06:59:19,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 388 transitions, 897 flow [2024-11-09 06:59:19,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 388 transitions, 897 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:59:19,470 INFO L231 Difference]: Finished difference. Result has 370 places, 383 transitions, 854 flow [2024-11-09 06:59:19,471 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=854, PETRI_PLACES=370, PETRI_TRANSITIONS=383} [2024-11-09 06:59:19,471 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -22 predicate places. [2024-11-09 06:59:19,471 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 383 transitions, 854 flow [2024-11-09 06:59:19,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:19,472 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:19,472 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] [2024-11-09 06:59:19,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 06:59:19,473 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-09 06:59:19,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:19,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1268745015, now seen corresponding path program 1 times [2024-11-09 06:59:19,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:19,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570779846] [2024-11-09 06:59:19,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:19,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:19,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:19,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:19,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570779846] [2024-11-09 06:59:19,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570779846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:19,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:19,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:19,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852970909] [2024-11-09 06:59:19,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:19,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:19,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:19,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:19,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:19,530 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 430 [2024-11-09 06:59:19,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 383 transitions, 854 flow. Second operand has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:19,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:19,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 430 [2024-11-09 06:59:19,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:20,024 INFO L124 PetriNetUnfolderBase]: 236/2977 cut-off events. [2024-11-09 06:59:20,024 INFO L125 PetriNetUnfolderBase]: For 6/35 co-relation queries the response was YES. [2024-11-09 06:59:20,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3305 conditions, 2977 events. 236/2977 cut-off events. For 6/35 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 27839 event pairs, 14 based on Foata normal form. 4/2617 useless extension candidates. Maximal degree in co-relation 2968. Up to 62 conditions per place. [2024-11-09 06:59:20,049 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 11 selfloop transitions, 2 changer transitions 0/384 dead transitions. [2024-11-09 06:59:20,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 384 transitions, 884 flow [2024-11-09 06:59:20,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:20,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:20,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1241 transitions. [2024-11-09 06:59:20,052 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.962015503875969 [2024-11-09 06:59:20,052 INFO L175 Difference]: Start difference. First operand has 370 places, 383 transitions, 854 flow. Second operand 3 states and 1241 transitions. [2024-11-09 06:59:20,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 384 transitions, 884 flow [2024-11-09 06:59:20,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 384 transitions, 884 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:59:20,058 INFO L231 Difference]: Finished difference. Result has 371 places, 382 transitions, 856 flow [2024-11-09 06:59:20,058 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=856, PETRI_PLACES=371, PETRI_TRANSITIONS=382} [2024-11-09 06:59:20,059 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -21 predicate places. [2024-11-09 06:59:20,059 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 382 transitions, 856 flow [2024-11-09 06:59:20,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:20,060 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:20,060 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] [2024-11-09 06:59:20,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 06:59:20,060 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-09 06:59:20,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:20,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1959498791, now seen corresponding path program 1 times [2024-11-09 06:59:20,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:20,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063314167] [2024-11-09 06:59:20,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:20,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:20,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:20,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:20,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063314167] [2024-11-09 06:59:20,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063314167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:20,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:20,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:59:20,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784803245] [2024-11-09 06:59:20,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:20,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:20,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:20,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:20,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:20,109 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 430 [2024-11-09 06:59:20,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 382 transitions, 856 flow. Second operand has 3 states, 3 states have (on average 409.6666666666667) internal successors, (1229), 3 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:20,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:20,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 430 [2024-11-09 06:59:20,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:20,480 INFO L124 PetriNetUnfolderBase]: 260/2958 cut-off events. [2024-11-09 06:59:20,481 INFO L125 PetriNetUnfolderBase]: For 27/76 co-relation queries the response was YES. [2024-11-09 06:59:20,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3377 conditions, 2958 events. 260/2958 cut-off events. For 27/76 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 27904 event pairs, 42 based on Foata normal form. 0/2586 useless extension candidates. Maximal degree in co-relation 2920. Up to 136 conditions per place. [2024-11-09 06:59:20,510 INFO L140 encePairwiseOnDemand]: 426/430 looper letters, 14 selfloop transitions, 3 changer transitions 0/386 dead transitions. [2024-11-09 06:59:20,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 386 transitions, 900 flow [2024-11-09 06:59:20,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:20,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:20,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1242 transitions. [2024-11-09 06:59:20,513 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9627906976744186 [2024-11-09 06:59:20,513 INFO L175 Difference]: Start difference. First operand has 371 places, 382 transitions, 856 flow. Second operand 3 states and 1242 transitions. [2024-11-09 06:59:20,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 386 transitions, 900 flow [2024-11-09 06:59:20,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 386 transitions, 896 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:20,517 INFO L231 Difference]: Finished difference. Result has 373 places, 384 transitions, 874 flow [2024-11-09 06:59:20,517 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=874, PETRI_PLACES=373, PETRI_TRANSITIONS=384} [2024-11-09 06:59:20,518 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -19 predicate places. [2024-11-09 06:59:20,518 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 384 transitions, 874 flow [2024-11-09 06:59:20,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 409.6666666666667) internal successors, (1229), 3 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:20,519 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:20,519 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] [2024-11-09 06:59:20,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 06:59:20,519 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-09 06:59:20,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:20,519 INFO L85 PathProgramCache]: Analyzing trace with hash -804587533, now seen corresponding path program 1 times [2024-11-09 06:59:20,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:20,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329260881] [2024-11-09 06:59:20,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:20,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:20,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:20,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:20,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329260881] [2024-11-09 06:59:20,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329260881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:20,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:20,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:20,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019748651] [2024-11-09 06:59:20,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:20,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:20,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:20,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:20,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:20,556 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 430 [2024-11-09 06:59:20,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 384 transitions, 874 flow. Second operand has 3 states, 3 states have (on average 409.6666666666667) internal successors, (1229), 3 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:20,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:20,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 430 [2024-11-09 06:59:20,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:20,976 INFO L124 PetriNetUnfolderBase]: 390/4199 cut-off events. [2024-11-09 06:59:20,977 INFO L125 PetriNetUnfolderBase]: For 60/116 co-relation queries the response was YES. [2024-11-09 06:59:21,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4849 conditions, 4199 events. 390/4199 cut-off events. For 60/116 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 42591 event pairs, 32 based on Foata normal form. 2/3712 useless extension candidates. Maximal degree in co-relation 3856. Up to 132 conditions per place. [2024-11-09 06:59:21,017 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 12 selfloop transitions, 2 changer transitions 0/385 dead transitions. [2024-11-09 06:59:21,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 385 transitions, 906 flow [2024-11-09 06:59:21,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:21,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:21,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1239 transitions. [2024-11-09 06:59:21,020 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9604651162790697 [2024-11-09 06:59:21,020 INFO L175 Difference]: Start difference. First operand has 373 places, 384 transitions, 874 flow. Second operand 3 states and 1239 transitions. [2024-11-09 06:59:21,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 385 transitions, 906 flow [2024-11-09 06:59:21,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 385 transitions, 900 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:21,024 INFO L231 Difference]: Finished difference. Result has 372 places, 383 transitions, 870 flow [2024-11-09 06:59:21,025 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=866, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=870, PETRI_PLACES=372, PETRI_TRANSITIONS=383} [2024-11-09 06:59:21,025 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -20 predicate places. [2024-11-09 06:59:21,025 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 383 transitions, 870 flow [2024-11-09 06:59:21,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 409.6666666666667) internal successors, (1229), 3 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:21,026 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:21,026 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] [2024-11-09 06:59:21,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 06:59:21,026 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-09 06:59:21,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:21,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1314528943, now seen corresponding path program 1 times [2024-11-09 06:59:21,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:21,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167306640] [2024-11-09 06:59:21,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:21,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:21,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:21,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:21,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167306640] [2024-11-09 06:59:21,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167306640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:21,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:21,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:21,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572880298] [2024-11-09 06:59:21,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:21,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:21,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:21,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:21,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:21,065 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 430 [2024-11-09 06:59:21,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 383 transitions, 870 flow. Second operand has 3 states, 3 states have (on average 403.6666666666667) internal successors, (1211), 3 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:21,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:21,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 430 [2024-11-09 06:59:21,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:21,825 INFO L124 PetriNetUnfolderBase]: 648/5839 cut-off events. [2024-11-09 06:59:21,825 INFO L125 PetriNetUnfolderBase]: For 74/82 co-relation queries the response was YES. [2024-11-09 06:59:21,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6872 conditions, 5839 events. 648/5839 cut-off events. For 74/82 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 64362 event pairs, 68 based on Foata normal form. 1/5262 useless extension candidates. Maximal degree in co-relation 5944. Up to 585 conditions per place. [2024-11-09 06:59:21,892 INFO L140 encePairwiseOnDemand]: 422/430 looper letters, 19 selfloop transitions, 4 changer transitions 0/387 dead transitions. [2024-11-09 06:59:21,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 387 transitions, 928 flow [2024-11-09 06:59:21,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:21,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:21,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1233 transitions. [2024-11-09 06:59:21,895 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9558139534883721 [2024-11-09 06:59:21,895 INFO L175 Difference]: Start difference. First operand has 372 places, 383 transitions, 870 flow. Second operand 3 states and 1233 transitions. [2024-11-09 06:59:21,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 387 transitions, 928 flow [2024-11-09 06:59:21,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 387 transitions, 924 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:21,902 INFO L231 Difference]: Finished difference. Result has 369 places, 383 transitions, 886 flow [2024-11-09 06:59:21,902 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=886, PETRI_PLACES=369, PETRI_TRANSITIONS=383} [2024-11-09 06:59:21,903 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -23 predicate places. [2024-11-09 06:59:21,903 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 383 transitions, 886 flow [2024-11-09 06:59:21,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.6666666666667) internal successors, (1211), 3 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:21,903 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:21,904 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] [2024-11-09 06:59:21,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 06:59:21,904 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-09 06:59:21,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:21,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1473838492, now seen corresponding path program 1 times [2024-11-09 06:59:21,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:21,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101812722] [2024-11-09 06:59:21,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:21,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:21,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:21,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:21,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101812722] [2024-11-09 06:59:21,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101812722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:21,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:21,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:59:21,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806210289] [2024-11-09 06:59:21,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:21,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:21,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:21,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:21,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:21,944 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 430 [2024-11-09 06:59:21,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 383 transitions, 886 flow. Second operand has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:21,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:21,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 430 [2024-11-09 06:59:21,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:22,506 INFO L124 PetriNetUnfolderBase]: 413/3953 cut-off events. [2024-11-09 06:59:22,506 INFO L125 PetriNetUnfolderBase]: For 107/136 co-relation queries the response was YES. [2024-11-09 06:59:22,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4768 conditions, 3953 events. 413/3953 cut-off events. For 107/136 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 39234 event pairs, 64 based on Foata normal form. 2/3510 useless extension candidates. Maximal degree in co-relation 4191. Up to 287 conditions per place. [2024-11-09 06:59:22,533 INFO L140 encePairwiseOnDemand]: 426/430 looper letters, 14 selfloop transitions, 3 changer transitions 0/387 dead transitions. [2024-11-09 06:59:22,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 387 transitions, 930 flow [2024-11-09 06:59:22,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:22,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:22,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1242 transitions. [2024-11-09 06:59:22,535 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9627906976744186 [2024-11-09 06:59:22,535 INFO L175 Difference]: Start difference. First operand has 369 places, 383 transitions, 886 flow. Second operand 3 states and 1242 transitions. [2024-11-09 06:59:22,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 387 transitions, 930 flow [2024-11-09 06:59:22,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 387 transitions, 930 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:59:22,539 INFO L231 Difference]: Finished difference. Result has 373 places, 385 transitions, 908 flow [2024-11-09 06:59:22,540 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=908, PETRI_PLACES=373, PETRI_TRANSITIONS=385} [2024-11-09 06:59:22,540 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -19 predicate places. [2024-11-09 06:59:22,541 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 385 transitions, 908 flow [2024-11-09 06:59:22,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:22,542 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:22,542 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] [2024-11-09 06:59:22,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 06:59:22,542 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-09 06:59:22,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:22,542 INFO L85 PathProgramCache]: Analyzing trace with hash 853128936, now seen corresponding path program 1 times [2024-11-09 06:59:22,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:22,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850964790] [2024-11-09 06:59:22,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:22,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:22,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:22,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:22,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850964790] [2024-11-09 06:59:22,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850964790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:22,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:22,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:22,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390907775] [2024-11-09 06:59:22,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:22,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:22,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:22,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:22,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:22,589 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 430 [2024-11-09 06:59:22,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 385 transitions, 908 flow. Second operand has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:22,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:22,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 430 [2024-11-09 06:59:22,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:22,913 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1183] L56-51-->L56-52: Formula: true InVars {} OutVars{thread3Thread1of1ForFork2_#t~nondet24#1=|v_thread3Thread1of1ForFork2_#t~nondet24#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet24#1][257], [Black: 448#(not |thread1Thread1of1ForFork0_#t~short3#1|), 436#(= |#race~sort_label_is_null_1~0| 0), Black: 451#true, 457#(= |#race~sort_label_2~0| 0), 302#L56-52true, 479#true, Black: 455#true, 254#L76true, 440#(= |#race~sort_label_is_null_3~0| 0), Black: 464#(not |thread2Thread1of1ForFork1_#t~short11#1|), 474#true, Black: 434#true, 444#(= |#race~sort_label_is_null_5~0| 0), 472#(= |#race~sort_label_4~0| 0), Black: 470#true, Black: 438#true, Black: 442#true, Black: 476#(not |thread3Thread1of1ForFork2_#t~short19#1|), 453#(= |#race~sort_label_0~0| 0)]) [2024-11-09 06:59:22,913 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2024-11-09 06:59:22,913 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2024-11-09 06:59:22,913 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2024-11-09 06:59:22,914 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2024-11-09 06:59:22,929 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1183] L56-51-->L56-52: Formula: true InVars {} OutVars{thread3Thread1of1ForFork2_#t~nondet24#1=|v_thread3Thread1of1ForFork2_#t~nondet24#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet24#1][257], [Black: 448#(not |thread1Thread1of1ForFork0_#t~short3#1|), 436#(= |#race~sort_label_is_null_1~0| 0), Black: 451#true, 457#(= |#race~sort_label_2~0| 0), 302#L56-52true, 479#true, Black: 455#true, 254#L76true, 440#(= |#race~sort_label_is_null_3~0| 0), Black: 464#(not |thread2Thread1of1ForFork1_#t~short11#1|), Black: 434#true, 444#(= |#race~sort_label_is_null_5~0| 0), 472#(= |#race~sort_label_4~0| 0), Black: 470#true, Black: 438#true, Black: 442#true, Black: 474#true, 476#(not |thread3Thread1of1ForFork2_#t~short19#1|), 453#(= |#race~sort_label_0~0| 0)]) [2024-11-09 06:59:22,929 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is not cut-off event [2024-11-09 06:59:22,929 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is not cut-off event [2024-11-09 06:59:22,930 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is not cut-off event [2024-11-09 06:59:22,930 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is not cut-off event [2024-11-09 06:59:22,938 INFO L124 PetriNetUnfolderBase]: 392/3250 cut-off events. [2024-11-09 06:59:22,939 INFO L125 PetriNetUnfolderBase]: For 208/236 co-relation queries the response was YES. [2024-11-09 06:59:22,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4302 conditions, 3250 events. 392/3250 cut-off events. For 208/236 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 31507 event pairs, 48 based on Foata normal form. 2/2986 useless extension candidates. Maximal degree in co-relation 3700. Up to 248 conditions per place. [2024-11-09 06:59:22,981 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 12 selfloop transitions, 2 changer transitions 0/386 dead transitions. [2024-11-09 06:59:22,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 386 transitions, 940 flow [2024-11-09 06:59:22,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:22,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:22,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1239 transitions. [2024-11-09 06:59:22,984 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9604651162790697 [2024-11-09 06:59:22,984 INFO L175 Difference]: Start difference. First operand has 373 places, 385 transitions, 908 flow. Second operand 3 states and 1239 transitions. [2024-11-09 06:59:22,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 386 transitions, 940 flow [2024-11-09 06:59:22,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 386 transitions, 934 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:22,990 INFO L231 Difference]: Finished difference. Result has 372 places, 384 transitions, 904 flow [2024-11-09 06:59:22,990 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=900, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=904, PETRI_PLACES=372, PETRI_TRANSITIONS=384} [2024-11-09 06:59:22,991 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -20 predicate places. [2024-11-09 06:59:22,991 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 384 transitions, 904 flow [2024-11-09 06:59:22,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:22,992 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:22,992 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-11-09 06:59:22,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 06:59:22,992 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-09 06:59:22,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:22,992 INFO L85 PathProgramCache]: Analyzing trace with hash 2052204957, now seen corresponding path program 1 times [2024-11-09 06:59:22,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:22,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723674342] [2024-11-09 06:59:22,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:22,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:23,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:23,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:23,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723674342] [2024-11-09 06:59:23,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723674342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:23,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:23,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:23,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419682016] [2024-11-09 06:59:23,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:23,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:23,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:23,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:23,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:23,049 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 430 [2024-11-09 06:59:23,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 384 transitions, 904 flow. Second operand has 3 states, 3 states have (on average 414.0) internal successors, (1242), 3 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:23,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:23,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 430 [2024-11-09 06:59:23,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:23,519 INFO L124 PetriNetUnfolderBase]: 388/4741 cut-off events. [2024-11-09 06:59:23,520 INFO L125 PetriNetUnfolderBase]: For 7/17 co-relation queries the response was YES. [2024-11-09 06:59:23,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5737 conditions, 4741 events. 388/4741 cut-off events. For 7/17 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 50231 event pairs, 11 based on Foata normal form. 0/4355 useless extension candidates. Maximal degree in co-relation 5160. Up to 210 conditions per place. [2024-11-09 06:59:23,559 INFO L140 encePairwiseOnDemand]: 428/430 looper letters, 8 selfloop transitions, 1 changer transitions 0/383 dead transitions. [2024-11-09 06:59:23,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 383 transitions, 920 flow [2024-11-09 06:59:23,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:23,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:23,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1243 transitions. [2024-11-09 06:59:23,562 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9635658914728682 [2024-11-09 06:59:23,562 INFO L175 Difference]: Start difference. First operand has 372 places, 384 transitions, 904 flow. Second operand 3 states and 1243 transitions. [2024-11-09 06:59:23,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 383 transitions, 920 flow [2024-11-09 06:59:23,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 383 transitions, 916 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:23,569 INFO L231 Difference]: Finished difference. Result has 371 places, 383 transitions, 900 flow [2024-11-09 06:59:23,569 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=900, PETRI_PLACES=371, PETRI_TRANSITIONS=383} [2024-11-09 06:59:23,569 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -21 predicate places. [2024-11-09 06:59:23,569 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 383 transitions, 900 flow [2024-11-09 06:59:23,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 414.0) internal successors, (1242), 3 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:23,570 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:23,570 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] [2024-11-09 06:59:23,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 06:59:23,570 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-09 06:59:23,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:23,571 INFO L85 PathProgramCache]: Analyzing trace with hash -2069889432, now seen corresponding path program 1 times [2024-11-09 06:59:23,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:23,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95508493] [2024-11-09 06:59:23,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:23,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:23,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:23,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:23,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95508493] [2024-11-09 06:59:23,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95508493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:23,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:23,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:23,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287008312] [2024-11-09 06:59:23,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:23,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:23,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:23,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:23,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:23,612 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 430 [2024-11-09 06:59:23,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 383 transitions, 900 flow. Second operand has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:23,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:23,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 430 [2024-11-09 06:59:23,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:24,161 INFO L124 PetriNetUnfolderBase]: 447/5342 cut-off events. [2024-11-09 06:59:24,161 INFO L125 PetriNetUnfolderBase]: For 11/35 co-relation queries the response was YES. [2024-11-09 06:59:24,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6362 conditions, 5342 events. 447/5342 cut-off events. For 11/35 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 58440 event pairs, 25 based on Foata normal form. 0/4912 useless extension candidates. Maximal degree in co-relation 6230. Up to 193 conditions per place. [2024-11-09 06:59:24,195 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 10 selfloop transitions, 1 changer transitions 0/381 dead transitions. [2024-11-09 06:59:24,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 381 transitions, 918 flow [2024-11-09 06:59:24,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:24,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:24,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1237 transitions. [2024-11-09 06:59:24,198 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9589147286821705 [2024-11-09 06:59:24,198 INFO L175 Difference]: Start difference. First operand has 371 places, 383 transitions, 900 flow. Second operand 3 states and 1237 transitions. [2024-11-09 06:59:24,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 381 transitions, 918 flow [2024-11-09 06:59:24,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 381 transitions, 917 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:59:24,203 INFO L231 Difference]: Finished difference. Result has 370 places, 381 transitions, 897 flow [2024-11-09 06:59:24,204 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=895, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=897, PETRI_PLACES=370, PETRI_TRANSITIONS=381} [2024-11-09 06:59:24,204 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -22 predicate places. [2024-11-09 06:59:24,204 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 381 transitions, 897 flow [2024-11-09 06:59:24,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:24,205 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:24,205 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] [2024-11-09 06:59:24,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 06:59:24,205 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-09 06:59:24,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:24,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1388669785, now seen corresponding path program 1 times [2024-11-09 06:59:24,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:24,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225316562] [2024-11-09 06:59:24,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:24,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:24,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:24,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:24,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225316562] [2024-11-09 06:59:24,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225316562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:24,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:24,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:24,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71821327] [2024-11-09 06:59:24,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:24,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:24,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:24,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:24,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:24,253 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 430 [2024-11-09 06:59:24,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 381 transitions, 897 flow. Second operand has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:24,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:24,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 430 [2024-11-09 06:59:24,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:24,571 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1188] L56-52-->L56-53: Formula: (= |v_#race~result_8~0_1| |v_thread3Thread1of1ForFork2_#t~nondet24#1_3|) InVars {thread3Thread1of1ForFork2_#t~nondet24#1=|v_thread3Thread1of1ForFork2_#t~nondet24#1_3|} OutVars{thread3Thread1of1ForFork2_#t~nondet24#1=|v_thread3Thread1of1ForFork2_#t~nondet24#1_3|, #race~result_8~0=|v_#race~result_8~0_1|} AuxVars[] AssignedVars[#race~result_8~0][269], [Black: 448#(not |thread1Thread1of1ForFork0_#t~short3#1|), 436#(= |#race~sort_label_is_null_1~0| 0), 485#true, Black: 451#true, 457#(= |#race~sort_label_2~0| 0), Black: 455#true, 254#L76true, 440#(= |#race~sort_label_is_null_3~0| 0), Black: 464#(not |thread2Thread1of1ForFork1_#t~short11#1|), 488#true, Black: 434#true, 444#(= |#race~sort_label_is_null_5~0| 0), 472#(= |#race~sort_label_4~0| 0), Black: 470#true, Black: 438#true, Black: 442#true, 393#L56-53true, Black: 476#(not |thread3Thread1of1ForFork2_#t~short19#1|), 453#(= |#race~sort_label_0~0| 0)]) [2024-11-09 06:59:24,572 INFO L294 olderBase$Statistics]: this new event has 182 ancestors and is cut-off event [2024-11-09 06:59:24,572 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2024-11-09 06:59:24,572 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2024-11-09 06:59:24,572 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2024-11-09 06:59:24,576 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1188] L56-52-->L56-53: Formula: (= |v_#race~result_8~0_1| |v_thread3Thread1of1ForFork2_#t~nondet24#1_3|) InVars {thread3Thread1of1ForFork2_#t~nondet24#1=|v_thread3Thread1of1ForFork2_#t~nondet24#1_3|} OutVars{thread3Thread1of1ForFork2_#t~nondet24#1=|v_thread3Thread1of1ForFork2_#t~nondet24#1_3|, #race~result_8~0=|v_#race~result_8~0_1|} AuxVars[] AssignedVars[#race~result_8~0][269], [Black: 448#(not |thread1Thread1of1ForFork0_#t~short3#1|), 436#(= |#race~sort_label_is_null_1~0| 0), 485#true, Black: 451#true, 457#(= |#race~sort_label_2~0| 0), Black: 455#true, 254#L76true, 440#(= |#race~sort_label_is_null_3~0| 0), Black: 464#(not |thread2Thread1of1ForFork1_#t~short11#1|), 488#true, Black: 434#true, 444#(= |#race~sort_label_is_null_5~0| 0), 472#(= |#race~sort_label_4~0| 0), Black: 438#true, Black: 470#true, Black: 474#true, Black: 442#true, 393#L56-53true, 453#(= |#race~sort_label_0~0| 0)]) [2024-11-09 06:59:24,576 INFO L294 olderBase$Statistics]: this new event has 174 ancestors and is not cut-off event [2024-11-09 06:59:24,576 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event [2024-11-09 06:59:24,576 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2024-11-09 06:59:24,577 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event [2024-11-09 06:59:24,584 INFO L124 PetriNetUnfolderBase]: 285/2989 cut-off events. [2024-11-09 06:59:24,584 INFO L125 PetriNetUnfolderBase]: For 38/52 co-relation queries the response was YES. [2024-11-09 06:59:24,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3652 conditions, 2989 events. 285/2989 cut-off events. For 38/52 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 27973 event pairs, 33 based on Foata normal form. 5/2739 useless extension candidates. Maximal degree in co-relation 3575. Up to 150 conditions per place. [2024-11-09 06:59:24,619 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 0 selfloop transitions, 0 changer transitions 379/379 dead transitions. [2024-11-09 06:59:24,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 379 transitions, 913 flow [2024-11-09 06:59:24,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:24,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:24,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1236 transitions. [2024-11-09 06:59:24,621 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.958139534883721 [2024-11-09 06:59:24,621 INFO L175 Difference]: Start difference. First operand has 370 places, 381 transitions, 897 flow. Second operand 3 states and 1236 transitions. [2024-11-09 06:59:24,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 379 transitions, 913 flow [2024-11-09 06:59:24,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 379 transitions, 912 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:59:24,625 INFO L231 Difference]: Finished difference. Result has 369 places, 0 transitions, 0 flow [2024-11-09 06:59:24,625 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=369, PETRI_TRANSITIONS=0} [2024-11-09 06:59:24,625 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -23 predicate places. [2024-11-09 06:59:24,625 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 0 transitions, 0 flow [2024-11-09 06:59:24,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:24,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (79 of 80 remaining) [2024-11-09 06:59:24,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (78 of 80 remaining) [2024-11-09 06:59:24,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (77 of 80 remaining) [2024-11-09 06:59:24,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (76 of 80 remaining) [2024-11-09 06:59:24,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (75 of 80 remaining) [2024-11-09 06:59:24,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (74 of 80 remaining) [2024-11-09 06:59:24,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (73 of 80 remaining) [2024-11-09 06:59:24,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (72 of 80 remaining) [2024-11-09 06:59:24,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (71 of 80 remaining) [2024-11-09 06:59:24,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (70 of 80 remaining) [2024-11-09 06:59:24,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (69 of 80 remaining) [2024-11-09 06:59:24,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (68 of 80 remaining) [2024-11-09 06:59:24,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (67 of 80 remaining) [2024-11-09 06:59:24,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (66 of 80 remaining) [2024-11-09 06:59:24,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (65 of 80 remaining) [2024-11-09 06:59:24,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (64 of 80 remaining) [2024-11-09 06:59:24,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (63 of 80 remaining) [2024-11-09 06:59:24,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (62 of 80 remaining) [2024-11-09 06:59:24,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (61 of 80 remaining) [2024-11-09 06:59:24,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (60 of 80 remaining) [2024-11-09 06:59:24,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (59 of 80 remaining) [2024-11-09 06:59:24,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (58 of 80 remaining) [2024-11-09 06:59:24,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (57 of 80 remaining) [2024-11-09 06:59:24,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (56 of 80 remaining) [2024-11-09 06:59:24,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (55 of 80 remaining) [2024-11-09 06:59:24,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (54 of 80 remaining) [2024-11-09 06:59:24,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (53 of 80 remaining) [2024-11-09 06:59:24,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (52 of 80 remaining) [2024-11-09 06:59:24,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (51 of 80 remaining) [2024-11-09 06:59:24,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (50 of 80 remaining) [2024-11-09 06:59:24,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (49 of 80 remaining) [2024-11-09 06:59:24,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (48 of 80 remaining) [2024-11-09 06:59:24,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (47 of 80 remaining) [2024-11-09 06:59:24,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (46 of 80 remaining) [2024-11-09 06:59:24,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (45 of 80 remaining) [2024-11-09 06:59:24,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (44 of 80 remaining) [2024-11-09 06:59:24,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (43 of 80 remaining) [2024-11-09 06:59:24,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (42 of 80 remaining) [2024-11-09 06:59:24,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (41 of 80 remaining) [2024-11-09 06:59:24,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (40 of 80 remaining) [2024-11-09 06:59:24,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (39 of 80 remaining) [2024-11-09 06:59:24,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (38 of 80 remaining) [2024-11-09 06:59:24,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (37 of 80 remaining) [2024-11-09 06:59:24,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (36 of 80 remaining) [2024-11-09 06:59:24,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 80 remaining) [2024-11-09 06:59:24,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 80 remaining) [2024-11-09 06:59:24,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 80 remaining) [2024-11-09 06:59:24,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (32 of 80 remaining) [2024-11-09 06:59:24,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (31 of 80 remaining) [2024-11-09 06:59:24,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (30 of 80 remaining) [2024-11-09 06:59:24,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (29 of 80 remaining) [2024-11-09 06:59:24,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (28 of 80 remaining) [2024-11-09 06:59:24,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (27 of 80 remaining) [2024-11-09 06:59:24,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (26 of 80 remaining) [2024-11-09 06:59:24,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (25 of 80 remaining) [2024-11-09 06:59:24,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (24 of 80 remaining) [2024-11-09 06:59:24,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (23 of 80 remaining) [2024-11-09 06:59:24,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (22 of 80 remaining) [2024-11-09 06:59:24,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (21 of 80 remaining) [2024-11-09 06:59:24,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (20 of 80 remaining) [2024-11-09 06:59:24,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (19 of 80 remaining) [2024-11-09 06:59:24,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (18 of 80 remaining) [2024-11-09 06:59:24,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (17 of 80 remaining) [2024-11-09 06:59:24,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (16 of 80 remaining) [2024-11-09 06:59:24,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (15 of 80 remaining) [2024-11-09 06:59:24,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (14 of 80 remaining) [2024-11-09 06:59:24,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (13 of 80 remaining) [2024-11-09 06:59:24,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (12 of 80 remaining) [2024-11-09 06:59:24,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (11 of 80 remaining) [2024-11-09 06:59:24,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (10 of 80 remaining) [2024-11-09 06:59:24,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (9 of 80 remaining) [2024-11-09 06:59:24,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (8 of 80 remaining) [2024-11-09 06:59:24,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (7 of 80 remaining) [2024-11-09 06:59:24,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (6 of 80 remaining) [2024-11-09 06:59:24,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (5 of 80 remaining) [2024-11-09 06:59:24,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (4 of 80 remaining) [2024-11-09 06:59:24,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (3 of 80 remaining) [2024-11-09 06:59:24,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (2 of 80 remaining) [2024-11-09 06:59:24,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (1 of 80 remaining) [2024-11-09 06:59:24,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (0 of 80 remaining) [2024-11-09 06:59:24,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 06:59:24,636 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] [2024-11-09 06:59:24,642 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 06:59:24,642 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 06:59:24,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:59:24 BasicIcfg [2024-11-09 06:59:24,646 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 06:59:24,646 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 06:59:24,647 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 06:59:24,647 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 06:59:24,647 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:59:15" (3/4) ... [2024-11-09 06:59:24,648 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 06:59:24,651 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-09 06:59:24,651 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-09 06:59:24,651 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-09 06:59:24,654 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-09 06:59:24,654 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 06:59:24,654 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 06:59:24,655 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 06:59:24,725 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 06:59:24,725 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 06:59:24,725 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 06:59:24,725 INFO L158 Benchmark]: Toolchain (without parser) took 10586.73ms. Allocated memory was 161.5MB in the beginning and 979.4MB in the end (delta: 817.9MB). Free memory was 109.2MB in the beginning and 552.2MB in the end (delta: -442.9MB). Peak memory consumption was 375.2MB. Max. memory is 16.1GB. [2024-11-09 06:59:24,725 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 96.5MB. Free memory is still 59.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:59:24,726 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.30ms. Allocated memory is still 161.5MB. Free memory was 108.6MB in the beginning and 94.7MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 06:59:24,726 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.18ms. Allocated memory is still 161.5MB. Free memory was 94.7MB in the beginning and 92.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 06:59:24,726 INFO L158 Benchmark]: Boogie Preprocessor took 21.89ms. Allocated memory is still 161.5MB. Free memory was 92.0MB in the beginning and 90.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 06:59:24,726 INFO L158 Benchmark]: RCFGBuilder took 642.68ms. Allocated memory is still 161.5MB. Free memory was 90.5MB in the beginning and 105.4MB in the end (delta: -14.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 06:59:24,726 INFO L158 Benchmark]: TraceAbstraction took 9570.03ms. Allocated memory was 161.5MB in the beginning and 979.4MB in the end (delta: 817.9MB). Free memory was 104.3MB in the beginning and 557.4MB in the end (delta: -453.1MB). Peak memory consumption was 365.8MB. Max. memory is 16.1GB. [2024-11-09 06:59:24,726 INFO L158 Benchmark]: Witness Printer took 78.46ms. Allocated memory is still 979.4MB. Free memory was 557.4MB in the beginning and 552.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 06:59:24,727 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.46ms. Allocated memory is still 96.5MB. Free memory is still 59.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 229.30ms. Allocated memory is still 161.5MB. Free memory was 108.6MB in the beginning and 94.7MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.18ms. Allocated memory is still 161.5MB. Free memory was 94.7MB in the beginning and 92.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.89ms. Allocated memory is still 161.5MB. Free memory was 92.0MB in the beginning and 90.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 642.68ms. Allocated memory is still 161.5MB. Free memory was 90.5MB in the beginning and 105.4MB in the end (delta: -14.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 9570.03ms. Allocated memory was 161.5MB in the beginning and 979.4MB in the end (delta: 817.9MB). Free memory was 104.3MB in the beginning and 557.4MB in the end (delta: -453.1MB). Peak memory consumption was 365.8MB. Max. memory is 16.1GB. * Witness Printer took 78.46ms. Allocated memory is still 979.4MB. Free memory was 557.4MB in the beginning and 552.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 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: 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: 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: 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: 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: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 674 locations, 80 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: 9.4s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 550 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 176 mSDsluCounter, 131 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 112 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 648 IncrementalHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 112 mSolverCounterUnsat, 131 mSDtfsCounter, 648 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=908occurred in iteration=17, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1874 NumberOfCodeBlocks, 1874 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1853 ConstructedInterpolants, 0 QuantifiedInterpolants, 1892 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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 44 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-09 06:59:24,756 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