./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/array-eq-symm.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/array-eq-symm.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 6897befed0dbbae24492a1e82d50fcd0be6b3857b241d882a904d02a513d7a6d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 06:58:18,505 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:58:18,585 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-09 06:58:18,589 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:58:18,592 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:58:18,633 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:58:18,634 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:58:18,634 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:58:18,635 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:58:18,637 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:58:18,637 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:58:18,637 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:58:18,638 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 06:58:18,638 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:58:18,638 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:58:18,639 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:58:18,639 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:58:18,639 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:58:18,640 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:58:18,640 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:58:18,640 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:58:18,643 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:58:18,643 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 06:58:18,644 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:58:18,644 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:58:18,644 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:58:18,644 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:58:18,645 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:58:18,645 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:58:18,645 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:58:18,646 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:58:18,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:58:18,646 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:58:18,647 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:58:18,647 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:58:18,647 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 06:58:18,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:58:18,648 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:58:18,648 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 06:58:18,648 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 06:58:18,649 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:58:18,650 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 -> 6897befed0dbbae24492a1e82d50fcd0be6b3857b241d882a904d02a513d7a6d [2024-11-09 06:58:18,924 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:58:18,947 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:58:18,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:58:18,952 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:58:18,952 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:58:18,954 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/array-eq-symm.wvr.c [2024-11-09 06:58:20,427 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:58:20,617 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:58:20,617 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/array-eq-symm.wvr.c [2024-11-09 06:58:20,624 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bafef355/c431943384db4779ab06f73d1c765251/FLAG14efb03e2 [2024-11-09 06:58:20,997 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bafef355/c431943384db4779ab06f73d1c765251 [2024-11-09 06:58:21,000 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:58:21,001 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:58:21,005 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:58:21,005 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:58:21,010 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:58:21,011 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:58:20" (1/1) ... [2024-11-09 06:58:21,012 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1782b294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:21, skipping insertion in model container [2024-11-09 06:58:21,012 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:58:20" (1/1) ... [2024-11-09 06:58:21,035 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:58:21,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:58:21,294 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:58:21,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:58:21,353 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:58:21,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:21 WrapperNode [2024-11-09 06:58:21,354 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:58:21,355 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:58:21,356 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:58:21,356 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:58:21,362 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:58:21" (1/1) ... [2024-11-09 06:58:21,377 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:58:21" (1/1) ... [2024-11-09 06:58:21,411 INFO L138 Inliner]: procedures = 22, calls = 20, calls flagged for inlining = 8, calls inlined = 10, statements flattened = 145 [2024-11-09 06:58:21,412 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:58:21,412 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:58:21,413 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:58:21,413 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:58:21,424 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:21" (1/1) ... [2024-11-09 06:58:21,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:21" (1/1) ... [2024-11-09 06:58:21,429 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:21" (1/1) ... [2024-11-09 06:58:21,429 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:21" (1/1) ... [2024-11-09 06:58:21,439 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:21" (1/1) ... [2024-11-09 06:58:21,445 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:21" (1/1) ... [2024-11-09 06:58:21,449 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:21" (1/1) ... [2024-11-09 06:58:21,451 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:21" (1/1) ... [2024-11-09 06:58:21,454 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:58:21,456 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:58:21,456 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:58:21,456 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:58:21,457 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:21" (1/1) ... [2024-11-09 06:58:21,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:58:21,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:58:21,496 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:58:21,500 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:58:21,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:58:21,551 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-09 06:58:21,551 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-09 06:58:21,551 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-09 06:58:21,551 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-09 06:58:21,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:58:21,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 06:58:21,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 06:58:21,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:58:21,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:58:21,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 06:58:21,554 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:58:21,696 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:58:21,699 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:58:22,166 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 06:58:22,166 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:58:22,199 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:58:22,199 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-09 06:58:22,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:58:22 BoogieIcfgContainer [2024-11-09 06:58:22,200 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:58:22,203 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:58:22,204 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:58:22,207 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:58:22,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:58:20" (1/3) ... [2024-11-09 06:58:22,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d4697c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:58:22, skipping insertion in model container [2024-11-09 06:58:22,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:21" (2/3) ... [2024-11-09 06:58:22,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d4697c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:58:22, skipping insertion in model container [2024-11-09 06:58:22,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:58:22" (3/3) ... [2024-11-09 06:58:22,212 INFO L112 eAbstractionObserver]: Analyzing ICFG array-eq-symm.wvr.c [2024-11-09 06:58:22,228 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:58:22,229 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2024-11-09 06:58:22,229 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 06:58:22,330 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 06:58:22,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 310 places, 320 transitions, 654 flow [2024-11-09 06:58:22,516 INFO L124 PetriNetUnfolderBase]: 17/318 cut-off events. [2024-11-09 06:58:22,516 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 06:58:22,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 327 conditions, 318 events. 17/318 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 537 event pairs, 0 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 226. Up to 3 conditions per place. [2024-11-09 06:58:22,528 INFO L82 GeneralOperation]: Start removeDead. Operand has 310 places, 320 transitions, 654 flow [2024-11-09 06:58:22,569 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 292 places, 301 transitions, 614 flow [2024-11-09 06:58:22,585 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:58:22,594 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;@5c12fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:58:22,595 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2024-11-09 06:58:22,602 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 06:58:22,603 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2024-11-09 06:58:22,603 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:58:22,603 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:22,604 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] [2024-11-09 06:58:22,606 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-09 06:58:22,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:22,611 INFO L85 PathProgramCache]: Analyzing trace with hash -729778242, now seen corresponding path program 1 times [2024-11-09 06:58:22,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:22,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616551230] [2024-11-09 06:58:22,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:22,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:22,826 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:58:22,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:22,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616551230] [2024-11-09 06:58:22,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616551230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:22,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:22,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:22,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14735845] [2024-11-09 06:58:22,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:22,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:22,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:22,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:22,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:22,908 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 320 [2024-11-09 06:58:22,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 301 transitions, 614 flow. Second operand has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 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:58:22,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:22,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 320 [2024-11-09 06:58:22,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:23,028 INFO L124 PetriNetUnfolderBase]: 17/428 cut-off events. [2024-11-09 06:58:23,029 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-11-09 06:58:23,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 428 events. 17/428 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1193 event pairs, 3 based on Foata normal form. 14/366 useless extension candidates. Maximal degree in co-relation 287. Up to 19 conditions per place. [2024-11-09 06:58:23,035 INFO L140 encePairwiseOnDemand]: 309/320 looper letters, 10 selfloop transitions, 2 changer transitions 4/292 dead transitions. [2024-11-09 06:58:23,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 292 transitions, 620 flow [2024-11-09 06:58:23,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:23,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:23,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 909 transitions. [2024-11-09 06:58:23,057 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.946875 [2024-11-09 06:58:23,061 INFO L175 Difference]: Start difference. First operand has 292 places, 301 transitions, 614 flow. Second operand 3 states and 909 transitions. [2024-11-09 06:58:23,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 292 transitions, 620 flow [2024-11-09 06:58:23,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 292 transitions, 612 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 06:58:23,074 INFO L231 Difference]: Finished difference. Result has 289 places, 288 transitions, 584 flow [2024-11-09 06:58:23,077 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=584, PETRI_PLACES=289, PETRI_TRANSITIONS=288} [2024-11-09 06:58:23,080 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -3 predicate places. [2024-11-09 06:58:23,081 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 288 transitions, 584 flow [2024-11-09 06:58:23,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 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:58:23,082 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:23,082 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] [2024-11-09 06:58:23,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:58:23,084 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-09 06:58:23,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:23,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1256530651, now seen corresponding path program 1 times [2024-11-09 06:58:23,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:23,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337175772] [2024-11-09 06:58:23,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:23,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:23,150 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:58:23,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:23,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337175772] [2024-11-09 06:58:23,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337175772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:23,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:23,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:23,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318977910] [2024-11-09 06:58:23,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:23,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:23,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:23,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:23,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:23,188 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 320 [2024-11-09 06:58:23,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 288 transitions, 584 flow. Second operand has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 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:58:23,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:23,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 320 [2024-11-09 06:58:23,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:23,259 INFO L124 PetriNetUnfolderBase]: 17/425 cut-off events. [2024-11-09 06:58:23,260 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-09 06:58:23,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 425 events. 17/425 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1139 event pairs, 3 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 422. Up to 18 conditions per place. [2024-11-09 06:58:23,263 INFO L140 encePairwiseOnDemand]: 317/320 looper letters, 10 selfloop transitions, 2 changer transitions 0/287 dead transitions. [2024-11-09 06:58:23,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 287 transitions, 606 flow [2024-11-09 06:58:23,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:23,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:23,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 901 transitions. [2024-11-09 06:58:23,266 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9385416666666667 [2024-11-09 06:58:23,267 INFO L175 Difference]: Start difference. First operand has 289 places, 288 transitions, 584 flow. Second operand 3 states and 901 transitions. [2024-11-09 06:58:23,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 287 transitions, 606 flow [2024-11-09 06:58:23,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 287 transitions, 602 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:23,273 INFO L231 Difference]: Finished difference. Result has 284 places, 287 transitions, 582 flow [2024-11-09 06:58:23,274 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=582, PETRI_PLACES=284, PETRI_TRANSITIONS=287} [2024-11-09 06:58:23,274 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -8 predicate places. [2024-11-09 06:58:23,275 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 287 transitions, 582 flow [2024-11-09 06:58:23,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 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:58:23,276 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:23,276 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:23,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:58:23,276 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-09 06:58:23,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:23,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1013617658, now seen corresponding path program 1 times [2024-11-09 06:58:23,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:23,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364475918] [2024-11-09 06:58:23,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:23,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:23,321 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:58:23,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:23,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364475918] [2024-11-09 06:58:23,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364475918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:23,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:23,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:23,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752792947] [2024-11-09 06:58:23,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:23,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:23,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:23,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:23,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:23,340 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 320 [2024-11-09 06:58:23,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 287 transitions, 582 flow. Second operand has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 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:58:23,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:23,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 320 [2024-11-09 06:58:23,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:23,475 INFO L124 PetriNetUnfolderBase]: 33/617 cut-off events. [2024-11-09 06:58:23,476 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 06:58:23,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 660 conditions, 617 events. 33/617 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2319 event pairs, 8 based on Foata normal form. 0/505 useless extension candidates. Maximal degree in co-relation 622. Up to 33 conditions per place. [2024-11-09 06:58:23,484 INFO L140 encePairwiseOnDemand]: 316/320 looper letters, 10 selfloop transitions, 1 changer transitions 0/284 dead transitions. [2024-11-09 06:58:23,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 284 transitions, 598 flow [2024-11-09 06:58:23,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:23,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:23,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 902 transitions. [2024-11-09 06:58:23,489 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9395833333333333 [2024-11-09 06:58:23,489 INFO L175 Difference]: Start difference. First operand has 284 places, 287 transitions, 582 flow. Second operand 3 states and 902 transitions. [2024-11-09 06:58:23,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 284 transitions, 598 flow [2024-11-09 06:58:23,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 284 transitions, 594 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:23,495 INFO L231 Difference]: Finished difference. Result has 281 places, 284 transitions, 574 flow [2024-11-09 06:58:23,496 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=574, PETRI_PLACES=281, PETRI_TRANSITIONS=284} [2024-11-09 06:58:23,496 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -11 predicate places. [2024-11-09 06:58:23,497 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 284 transitions, 574 flow [2024-11-09 06:58:23,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 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:58:23,498 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:23,498 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] [2024-11-09 06:58:23,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:58:23,499 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-09 06:58:23,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:23,500 INFO L85 PathProgramCache]: Analyzing trace with hash 105830857, now seen corresponding path program 1 times [2024-11-09 06:58:23,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:23,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943311857] [2024-11-09 06:58:23,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:23,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:23,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:24,183 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:58:24,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:24,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943311857] [2024-11-09 06:58:24,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943311857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:24,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:24,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:58:24,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762584923] [2024-11-09 06:58:24,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:24,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:58:24,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:24,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:58:24,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:58:24,473 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 320 [2024-11-09 06:58:24,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 284 transitions, 574 flow. Second operand has 6 states, 6 states have (on average 263.5) internal successors, (1581), 6 states have internal predecessors, (1581), 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:58:24,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:24,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 320 [2024-11-09 06:58:24,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:24,691 INFO L124 PetriNetUnfolderBase]: 146/1249 cut-off events. [2024-11-09 06:58:24,692 INFO L125 PetriNetUnfolderBase]: For 19/20 co-relation queries the response was YES. [2024-11-09 06:58:24,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1496 conditions, 1249 events. 146/1249 cut-off events. For 19/20 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 7405 event pairs, 80 based on Foata normal form. 0/1005 useless extension candidates. Maximal degree in co-relation 1459. Up to 224 conditions per place. [2024-11-09 06:58:24,704 INFO L140 encePairwiseOnDemand]: 308/320 looper letters, 36 selfloop transitions, 10 changer transitions 0/282 dead transitions. [2024-11-09 06:58:24,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 282 transitions, 662 flow [2024-11-09 06:58:24,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:58:24,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:58:24,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1620 transitions. [2024-11-09 06:58:24,732 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.84375 [2024-11-09 06:58:24,732 INFO L175 Difference]: Start difference. First operand has 281 places, 284 transitions, 574 flow. Second operand 6 states and 1620 transitions. [2024-11-09 06:58:24,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 282 transitions, 662 flow [2024-11-09 06:58:24,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 282 transitions, 661 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:58:24,737 INFO L231 Difference]: Finished difference. Result has 283 places, 282 transitions, 589 flow [2024-11-09 06:58:24,738 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=589, PETRI_PLACES=283, PETRI_TRANSITIONS=282} [2024-11-09 06:58:24,739 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -9 predicate places. [2024-11-09 06:58:24,739 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 282 transitions, 589 flow [2024-11-09 06:58:24,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 263.5) internal successors, (1581), 6 states have internal predecessors, (1581), 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:58:24,741 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:24,741 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] [2024-11-09 06:58:24,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:58:24,741 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-09 06:58:24,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:24,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1814160356, now seen corresponding path program 1 times [2024-11-09 06:58:24,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:24,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846666185] [2024-11-09 06:58:24,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:24,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:24,775 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:58:24,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:24,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846666185] [2024-11-09 06:58:24,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846666185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:24,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:24,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:24,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749339537] [2024-11-09 06:58:24,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:24,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:24,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:24,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:24,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:24,798 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 320 [2024-11-09 06:58:24,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 282 transitions, 589 flow. Second operand has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 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:58:24,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:24,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 320 [2024-11-09 06:58:24,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:24,841 INFO L124 PetriNetUnfolderBase]: 14/353 cut-off events. [2024-11-09 06:58:24,841 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2024-11-09 06:58:24,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 353 events. 14/353 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 851 event pairs, 3 based on Foata normal form. 0/304 useless extension candidates. Maximal degree in co-relation 354. Up to 16 conditions per place. [2024-11-09 06:58:24,844 INFO L140 encePairwiseOnDemand]: 317/320 looper letters, 9 selfloop transitions, 2 changer transitions 0/281 dead transitions. [2024-11-09 06:58:24,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 281 transitions, 609 flow [2024-11-09 06:58:24,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:24,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:24,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 903 transitions. [2024-11-09 06:58:24,846 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.940625 [2024-11-09 06:58:24,846 INFO L175 Difference]: Start difference. First operand has 283 places, 282 transitions, 589 flow. Second operand 3 states and 903 transitions. [2024-11-09 06:58:24,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 281 transitions, 609 flow [2024-11-09 06:58:24,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 281 transitions, 589 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 06:58:24,851 INFO L231 Difference]: Finished difference. Result has 279 places, 281 transitions, 571 flow [2024-11-09 06:58:24,852 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=571, PETRI_PLACES=279, PETRI_TRANSITIONS=281} [2024-11-09 06:58:24,852 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -13 predicate places. [2024-11-09 06:58:24,853 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 281 transitions, 571 flow [2024-11-09 06:58:24,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 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:58:24,854 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:24,854 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] [2024-11-09 06:58:24,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:58:24,855 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-09 06:58:24,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:24,859 INFO L85 PathProgramCache]: Analyzing trace with hash 2916052, now seen corresponding path program 1 times [2024-11-09 06:58:24,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:24,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800550847] [2024-11-09 06:58:24,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:24,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:24,896 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:58:24,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:24,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800550847] [2024-11-09 06:58:24,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800550847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:24,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:24,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:24,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121401038] [2024-11-09 06:58:24,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:24,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:24,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:24,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:24,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:24,914 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 320 [2024-11-09 06:58:24,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 281 transitions, 571 flow. Second operand has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 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:58:24,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:24,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 320 [2024-11-09 06:58:24,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:24,984 INFO L124 PetriNetUnfolderBase]: 35/610 cut-off events. [2024-11-09 06:58:24,984 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2024-11-09 06:58:24,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 655 conditions, 610 events. 35/610 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2457 event pairs, 8 based on Foata normal form. 0/510 useless extension candidates. Maximal degree in co-relation 617. Up to 34 conditions per place. [2024-11-09 06:58:24,989 INFO L140 encePairwiseOnDemand]: 316/320 looper letters, 10 selfloop transitions, 1 changer transitions 0/278 dead transitions. [2024-11-09 06:58:24,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 278 transitions, 587 flow [2024-11-09 06:58:24,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:24,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:24,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 902 transitions. [2024-11-09 06:58:24,992 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9395833333333333 [2024-11-09 06:58:24,992 INFO L175 Difference]: Start difference. First operand has 279 places, 281 transitions, 571 flow. Second operand 3 states and 902 transitions. [2024-11-09 06:58:24,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 278 transitions, 587 flow [2024-11-09 06:58:24,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 278 transitions, 583 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:24,997 INFO L231 Difference]: Finished difference. Result has 276 places, 278 transitions, 563 flow [2024-11-09 06:58:24,997 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=563, PETRI_PLACES=276, PETRI_TRANSITIONS=278} [2024-11-09 06:58:24,998 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -16 predicate places. [2024-11-09 06:58:24,998 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 278 transitions, 563 flow [2024-11-09 06:58:24,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 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:58:24,999 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:24,999 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] [2024-11-09 06:58:24,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:58:25,000 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-09 06:58:25,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:25,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1117541342, now seen corresponding path program 1 times [2024-11-09 06:58:25,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:25,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320403338] [2024-11-09 06:58:25,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:25,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:25,041 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:58:25,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:25,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320403338] [2024-11-09 06:58:25,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320403338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:25,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:25,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:25,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433195708] [2024-11-09 06:58:25,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:25,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:25,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:25,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:25,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:25,059 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 320 [2024-11-09 06:58:25,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 278 transitions, 563 flow. Second operand has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 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:58:25,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:25,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 320 [2024-11-09 06:58:25,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:25,098 INFO L124 PetriNetUnfolderBase]: 14/348 cut-off events. [2024-11-09 06:58:25,099 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2024-11-09 06:58:25,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 348 events. 14/348 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 738 event pairs, 3 based on Foata normal form. 0/304 useless extension candidates. Maximal degree in co-relation 335. Up to 16 conditions per place. [2024-11-09 06:58:25,102 INFO L140 encePairwiseOnDemand]: 317/320 looper letters, 9 selfloop transitions, 2 changer transitions 0/277 dead transitions. [2024-11-09 06:58:25,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 277 transitions, 583 flow [2024-11-09 06:58:25,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:25,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:25,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 903 transitions. [2024-11-09 06:58:25,104 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.940625 [2024-11-09 06:58:25,105 INFO L175 Difference]: Start difference. First operand has 276 places, 278 transitions, 563 flow. Second operand 3 states and 903 transitions. [2024-11-09 06:58:25,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 277 transitions, 583 flow [2024-11-09 06:58:25,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 277 transitions, 582 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:58:25,110 INFO L231 Difference]: Finished difference. Result has 276 places, 277 transitions, 564 flow [2024-11-09 06:58:25,110 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=276, PETRI_TRANSITIONS=277} [2024-11-09 06:58:25,111 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -16 predicate places. [2024-11-09 06:58:25,111 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 277 transitions, 564 flow [2024-11-09 06:58:25,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 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:58:25,112 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:25,112 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:25,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 06:58:25,113 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-09 06:58:25,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:25,114 INFO L85 PathProgramCache]: Analyzing trace with hash 226025314, now seen corresponding path program 1 times [2024-11-09 06:58:25,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:25,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173011031] [2024-11-09 06:58:25,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:25,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:25,177 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:58:25,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:25,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173011031] [2024-11-09 06:58:25,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173011031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:25,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:25,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:25,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258193672] [2024-11-09 06:58:25,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:25,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:25,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:25,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:25,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:25,221 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 287 out of 320 [2024-11-09 06:58:25,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 277 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 288.0) internal successors, (864), 3 states have internal predecessors, (864), 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:58:25,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:25,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 287 of 320 [2024-11-09 06:58:25,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:25,273 INFO L124 PetriNetUnfolderBase]: 22/341 cut-off events. [2024-11-09 06:58:25,273 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 06:58:25,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 341 events. 22/341 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 867 event pairs, 1 based on Foata normal form. 0/309 useless extension candidates. Maximal degree in co-relation 364. Up to 35 conditions per place. [2024-11-09 06:58:25,276 INFO L140 encePairwiseOnDemand]: 312/320 looper letters, 16 selfloop transitions, 2 changer transitions 0/272 dead transitions. [2024-11-09 06:58:25,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 272 transitions, 591 flow [2024-11-09 06:58:25,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:25,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:25,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 885 transitions. [2024-11-09 06:58:25,279 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.921875 [2024-11-09 06:58:25,279 INFO L175 Difference]: Start difference. First operand has 276 places, 277 transitions, 564 flow. Second operand 3 states and 885 transitions. [2024-11-09 06:58:25,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 272 transitions, 591 flow [2024-11-09 06:58:25,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 272 transitions, 587 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:25,285 INFO L231 Difference]: Finished difference. Result has 270 places, 271 transitions, 552 flow [2024-11-09 06:58:25,285 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=552, PETRI_PLACES=270, PETRI_TRANSITIONS=271} [2024-11-09 06:58:25,286 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -22 predicate places. [2024-11-09 06:58:25,286 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 271 transitions, 552 flow [2024-11-09 06:58:25,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 288.0) internal successors, (864), 3 states have internal predecessors, (864), 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:58:25,287 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:25,287 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] [2024-11-09 06:58:25,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 06:58:25,288 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-09 06:58:25,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:25,288 INFO L85 PathProgramCache]: Analyzing trace with hash -242011099, now seen corresponding path program 1 times [2024-11-09 06:58:25,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:25,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003041315] [2024-11-09 06:58:25,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:25,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:25,329 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:58:25,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:25,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003041315] [2024-11-09 06:58:25,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003041315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:25,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:25,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:25,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160646001] [2024-11-09 06:58:25,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:25,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:25,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:25,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:25,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:25,355 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 287 out of 320 [2024-11-09 06:58:25,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 271 transitions, 552 flow. Second operand has 3 states, 3 states have (on average 288.3333333333333) internal successors, (865), 3 states have internal predecessors, (865), 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:58:25,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:25,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 287 of 320 [2024-11-09 06:58:25,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:25,402 INFO L124 PetriNetUnfolderBase]: 22/335 cut-off events. [2024-11-09 06:58:25,402 INFO L125 PetriNetUnfolderBase]: For 13/14 co-relation queries the response was YES. [2024-11-09 06:58:25,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 383 conditions, 335 events. 22/335 cut-off events. For 13/14 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 885 event pairs, 1 based on Foata normal form. 1/309 useless extension candidates. Maximal degree in co-relation 346. Up to 33 conditions per place. [2024-11-09 06:58:25,405 INFO L140 encePairwiseOnDemand]: 312/320 looper letters, 13 selfloop transitions, 2 changer transitions 4/266 dead transitions. [2024-11-09 06:58:25,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 266 transitions, 577 flow [2024-11-09 06:58:25,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:25,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:25,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 884 transitions. [2024-11-09 06:58:25,407 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9208333333333333 [2024-11-09 06:58:25,408 INFO L175 Difference]: Start difference. First operand has 270 places, 271 transitions, 552 flow. Second operand 3 states and 884 transitions. [2024-11-09 06:58:25,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 266 transitions, 577 flow [2024-11-09 06:58:25,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 266 transitions, 573 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:25,412 INFO L231 Difference]: Finished difference. Result has 264 places, 261 transitions, 531 flow [2024-11-09 06:58:25,413 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=531, PETRI_PLACES=264, PETRI_TRANSITIONS=261} [2024-11-09 06:58:25,413 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -28 predicate places. [2024-11-09 06:58:25,414 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 261 transitions, 531 flow [2024-11-09 06:58:25,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 288.3333333333333) internal successors, (865), 3 states have internal predecessors, (865), 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:58:25,415 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:25,415 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:25,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 06:58:25,415 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-09 06:58:25,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:25,415 INFO L85 PathProgramCache]: Analyzing trace with hash -161525969, now seen corresponding path program 1 times [2024-11-09 06:58:25,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:25,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968313299] [2024-11-09 06:58:25,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:25,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:25,460 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:58:25,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:25,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968313299] [2024-11-09 06:58:25,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968313299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:25,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:25,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:58:25,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862856762] [2024-11-09 06:58:25,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:25,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:25,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:25,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:25,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:25,474 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 320 [2024-11-09 06:58:25,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 261 transitions, 531 flow. Second operand has 3 states, 3 states have (on average 299.6666666666667) internal successors, (899), 3 states have internal predecessors, (899), 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:58:25,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:25,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 320 [2024-11-09 06:58:25,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:25,520 INFO L124 PetriNetUnfolderBase]: 22/391 cut-off events. [2024-11-09 06:58:25,520 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 06:58:25,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 391 events. 22/391 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1024 event pairs, 6 based on Foata normal form. 0/357 useless extension candidates. Maximal degree in co-relation 403. Up to 23 conditions per place. [2024-11-09 06:58:25,523 INFO L140 encePairwiseOnDemand]: 316/320 looper letters, 10 selfloop transitions, 3 changer transitions 0/263 dead transitions. [2024-11-09 06:58:25,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 263 transitions, 562 flow [2024-11-09 06:58:25,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:25,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:25,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 908 transitions. [2024-11-09 06:58:25,525 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9458333333333333 [2024-11-09 06:58:25,526 INFO L175 Difference]: Start difference. First operand has 264 places, 261 transitions, 531 flow. Second operand 3 states and 908 transitions. [2024-11-09 06:58:25,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 263 transitions, 562 flow [2024-11-09 06:58:25,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 263 transitions, 558 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:25,532 INFO L231 Difference]: Finished difference. Result has 262 places, 262 transitions, 545 flow [2024-11-09 06:58:25,534 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=545, PETRI_PLACES=262, PETRI_TRANSITIONS=262} [2024-11-09 06:58:25,536 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -30 predicate places. [2024-11-09 06:58:25,536 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 262 transitions, 545 flow [2024-11-09 06:58:25,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 299.6666666666667) internal successors, (899), 3 states have internal predecessors, (899), 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:58:25,537 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:25,537 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] [2024-11-09 06:58:25,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 06:58:25,537 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-09 06:58:25,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:25,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1390540956, now seen corresponding path program 1 times [2024-11-09 06:58:25,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:25,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798603113] [2024-11-09 06:58:25,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:25,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:25,581 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:58:25,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:25,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798603113] [2024-11-09 06:58:25,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798603113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:25,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:25,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:25,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186351732] [2024-11-09 06:58:25,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:25,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:25,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:25,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:25,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:25,594 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 320 [2024-11-09 06:58:25,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 262 transitions, 545 flow. Second operand has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 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:58:25,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:25,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 320 [2024-11-09 06:58:25,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:25,676 INFO L124 PetriNetUnfolderBase]: 37/614 cut-off events. [2024-11-09 06:58:25,676 INFO L125 PetriNetUnfolderBase]: For 14/15 co-relation queries the response was YES. [2024-11-09 06:58:25,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 614 events. 37/614 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2196 event pairs, 2 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 654. Up to 32 conditions per place. [2024-11-09 06:58:25,680 INFO L140 encePairwiseOnDemand]: 316/320 looper letters, 10 selfloop transitions, 2 changer transitions 0/264 dead transitions. [2024-11-09 06:58:25,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 264 transitions, 575 flow [2024-11-09 06:58:25,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:25,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:25,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 911 transitions. [2024-11-09 06:58:25,683 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9489583333333333 [2024-11-09 06:58:25,683 INFO L175 Difference]: Start difference. First operand has 262 places, 262 transitions, 545 flow. Second operand 3 states and 911 transitions. [2024-11-09 06:58:25,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 264 transitions, 575 flow [2024-11-09 06:58:25,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 264 transitions, 569 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:25,688 INFO L231 Difference]: Finished difference. Result has 261 places, 262 transitions, 549 flow [2024-11-09 06:58:25,689 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=549, PETRI_PLACES=261, PETRI_TRANSITIONS=262} [2024-11-09 06:58:25,689 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -31 predicate places. [2024-11-09 06:58:25,689 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 262 transitions, 549 flow [2024-11-09 06:58:25,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 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:58:25,691 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:25,691 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] [2024-11-09 06:58:25,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 06:58:25,691 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-09 06:58:25,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:25,692 INFO L85 PathProgramCache]: Analyzing trace with hash 56279666, now seen corresponding path program 1 times [2024-11-09 06:58:25,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:25,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593459315] [2024-11-09 06:58:25,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:25,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:25,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:25,734 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:58:25,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:25,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593459315] [2024-11-09 06:58:25,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593459315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:25,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:25,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:58:25,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354219149] [2024-11-09 06:58:25,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:25,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:25,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:25,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:25,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:25,744 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 320 [2024-11-09 06:58:25,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 262 transitions, 549 flow. Second operand has 3 states, 3 states have (on average 300.0) internal successors, (900), 3 states have internal predecessors, (900), 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:58:25,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:25,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 320 [2024-11-09 06:58:25,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:25,806 INFO L124 PetriNetUnfolderBase]: 50/492 cut-off events. [2024-11-09 06:58:25,807 INFO L125 PetriNetUnfolderBase]: For 32/34 co-relation queries the response was YES. [2024-11-09 06:58:25,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 492 events. 50/492 cut-off events. For 32/34 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1497 event pairs, 11 based on Foata normal form. 0/446 useless extension candidates. Maximal degree in co-relation 565. Up to 58 conditions per place. [2024-11-09 06:58:25,811 INFO L140 encePairwiseOnDemand]: 316/320 looper letters, 9 selfloop transitions, 3 changer transitions 1/264 dead transitions. [2024-11-09 06:58:25,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 264 transitions, 580 flow [2024-11-09 06:58:25,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:25,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:25,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 908 transitions. [2024-11-09 06:58:25,814 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9458333333333333 [2024-11-09 06:58:25,814 INFO L175 Difference]: Start difference. First operand has 261 places, 262 transitions, 549 flow. Second operand 3 states and 908 transitions. [2024-11-09 06:58:25,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 264 transitions, 580 flow [2024-11-09 06:58:25,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 264 transitions, 580 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:58:25,819 INFO L231 Difference]: Finished difference. Result has 265 places, 263 transitions, 567 flow [2024-11-09 06:58:25,820 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=567, PETRI_PLACES=265, PETRI_TRANSITIONS=263} [2024-11-09 06:58:25,822 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -27 predicate places. [2024-11-09 06:58:25,822 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 263 transitions, 567 flow [2024-11-09 06:58:25,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 300.0) internal successors, (900), 3 states have internal predecessors, (900), 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:58:25,823 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:25,823 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] [2024-11-09 06:58:25,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 06:58:25,824 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-09 06:58:25,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:25,824 INFO L85 PathProgramCache]: Analyzing trace with hash -566577476, now seen corresponding path program 1 times [2024-11-09 06:58:25,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:25,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752369389] [2024-11-09 06:58:25,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:25,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:25,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:25,874 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:58:25,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:25,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752369389] [2024-11-09 06:58:25,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752369389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:25,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:25,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:25,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055378748] [2024-11-09 06:58:25,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:25,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:25,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:25,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:25,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:25,897 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 320 [2024-11-09 06:58:25,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 263 transitions, 567 flow. Second operand has 3 states, 3 states have (on average 300.6666666666667) internal successors, (902), 3 states have internal predecessors, (902), 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:58:25,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:25,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 320 [2024-11-09 06:58:25,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:25,970 INFO L124 PetriNetUnfolderBase]: 45/676 cut-off events. [2024-11-09 06:58:25,970 INFO L125 PetriNetUnfolderBase]: For 18/19 co-relation queries the response was YES. [2024-11-09 06:58:25,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 811 conditions, 676 events. 45/676 cut-off events. For 18/19 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2660 event pairs, 3 based on Foata normal form. 0/630 useless extension candidates. Maximal degree in co-relation 771. Up to 38 conditions per place. [2024-11-09 06:58:25,975 INFO L140 encePairwiseOnDemand]: 316/320 looper letters, 10 selfloop transitions, 2 changer transitions 0/265 dead transitions. [2024-11-09 06:58:25,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 265 transitions, 597 flow [2024-11-09 06:58:25,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:25,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:25,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 911 transitions. [2024-11-09 06:58:25,978 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9489583333333333 [2024-11-09 06:58:25,978 INFO L175 Difference]: Start difference. First operand has 265 places, 263 transitions, 567 flow. Second operand 3 states and 911 transitions. [2024-11-09 06:58:25,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 265 transitions, 597 flow [2024-11-09 06:58:25,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 265 transitions, 591 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:25,984 INFO L231 Difference]: Finished difference. Result has 264 places, 263 transitions, 571 flow [2024-11-09 06:58:25,984 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=571, PETRI_PLACES=264, PETRI_TRANSITIONS=263} [2024-11-09 06:58:25,985 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -28 predicate places. [2024-11-09 06:58:25,985 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 263 transitions, 571 flow [2024-11-09 06:58:25,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 300.6666666666667) internal successors, (902), 3 states have internal predecessors, (902), 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:58:25,986 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:25,986 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] [2024-11-09 06:58:25,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 06:58:25,987 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-09 06:58:25,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:25,987 INFO L85 PathProgramCache]: Analyzing trace with hash -741705406, now seen corresponding path program 1 times [2024-11-09 06:58:25,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:25,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776150467] [2024-11-09 06:58:25,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:25,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:26,264 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:58:26,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:26,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776150467] [2024-11-09 06:58:26,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776150467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:26,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:26,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:58:26,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404745993] [2024-11-09 06:58:26,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:26,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:58:26,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:26,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:58:26,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:58:26,595 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 320 [2024-11-09 06:58:26,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 263 transitions, 571 flow. Second operand has 8 states, 8 states have (on average 279.125) internal successors, (2233), 8 states have internal predecessors, (2233), 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:58:26,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:26,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 320 [2024-11-09 06:58:26,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:26,838 INFO L124 PetriNetUnfolderBase]: 64/1040 cut-off events. [2024-11-09 06:58:26,839 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-09 06:58:26,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1331 conditions, 1040 events. 64/1040 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4300 event pairs, 8 based on Foata normal form. 2/977 useless extension candidates. Maximal degree in co-relation 1288. Up to 45 conditions per place. [2024-11-09 06:58:26,846 INFO L140 encePairwiseOnDemand]: 303/320 looper letters, 50 selfloop transitions, 19 changer transitions 0/298 dead transitions. [2024-11-09 06:58:26,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 298 transitions, 802 flow [2024-11-09 06:58:26,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 06:58:26,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-09 06:58:26,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3381 transitions. [2024-11-09 06:58:26,853 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.88046875 [2024-11-09 06:58:26,854 INFO L175 Difference]: Start difference. First operand has 264 places, 263 transitions, 571 flow. Second operand 12 states and 3381 transitions. [2024-11-09 06:58:26,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 298 transitions, 802 flow [2024-11-09 06:58:26,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 298 transitions, 802 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:58:26,862 INFO L231 Difference]: Finished difference. Result has 280 places, 274 transitions, 678 flow [2024-11-09 06:58:26,862 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=678, PETRI_PLACES=280, PETRI_TRANSITIONS=274} [2024-11-09 06:58:26,863 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -12 predicate places. [2024-11-09 06:58:26,863 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 274 transitions, 678 flow [2024-11-09 06:58:26,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 279.125) internal successors, (2233), 8 states have internal predecessors, (2233), 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:58:26,865 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:26,865 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:26,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 06:58:26,865 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-09 06:58:26,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:26,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1483188450, now seen corresponding path program 1 times [2024-11-09 06:58:26,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:26,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281819318] [2024-11-09 06:58:26,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:26,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:27,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:58:27,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:27,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281819318] [2024-11-09 06:58:27,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281819318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:27,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:27,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:58:27,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543646647] [2024-11-09 06:58:27,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:27,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:58:27,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:27,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:58:27,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:58:27,423 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 320 [2024-11-09 06:58:27,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 274 transitions, 678 flow. Second operand has 8 states, 8 states have (on average 279.25) internal successors, (2234), 8 states have internal predecessors, (2234), 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:58:27,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:27,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 320 [2024-11-09 06:58:27,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:27,700 INFO L124 PetriNetUnfolderBase]: 106/1071 cut-off events. [2024-11-09 06:58:27,701 INFO L125 PetriNetUnfolderBase]: For 91/95 co-relation queries the response was YES. [2024-11-09 06:58:27,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1476 conditions, 1071 events. 106/1071 cut-off events. For 91/95 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5202 event pairs, 25 based on Foata normal form. 0/988 useless extension candidates. Maximal degree in co-relation 1422. Up to 86 conditions per place. [2024-11-09 06:58:27,712 INFO L140 encePairwiseOnDemand]: 303/320 looper letters, 33 selfloop transitions, 13 changer transitions 27/306 dead transitions. [2024-11-09 06:58:27,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 306 transitions, 908 flow [2024-11-09 06:58:27,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 06:58:27,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-09 06:58:27,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3382 transitions. [2024-11-09 06:58:27,720 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8807291666666667 [2024-11-09 06:58:27,720 INFO L175 Difference]: Start difference. First operand has 280 places, 274 transitions, 678 flow. Second operand 12 states and 3382 transitions. [2024-11-09 06:58:27,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 306 transitions, 908 flow [2024-11-09 06:58:27,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 306 transitions, 908 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:58:27,728 INFO L231 Difference]: Finished difference. Result has 295 places, 272 transitions, 714 flow [2024-11-09 06:58:27,729 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=714, PETRI_PLACES=295, PETRI_TRANSITIONS=272} [2024-11-09 06:58:27,730 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, 3 predicate places. [2024-11-09 06:58:27,730 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 272 transitions, 714 flow [2024-11-09 06:58:27,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 279.25) internal successors, (2234), 8 states have internal predecessors, (2234), 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:58:27,733 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:27,733 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] [2024-11-09 06:58:27,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 06:58:27,737 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-09 06:58:27,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:27,738 INFO L85 PathProgramCache]: Analyzing trace with hash -399579792, now seen corresponding path program 1 times [2024-11-09 06:58:27,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:27,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384519748] [2024-11-09 06:58:27,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:27,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:27,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:27,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:58:27,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:27,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384519748] [2024-11-09 06:58:27,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384519748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:27,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:27,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:58:27,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144301121] [2024-11-09 06:58:27,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:27,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:58:27,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:27,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:58:27,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:58:28,303 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 320 [2024-11-09 06:58:28,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 272 transitions, 714 flow. Second operand has 8 states, 8 states have (on average 279.25) internal successors, (2234), 8 states have internal predecessors, (2234), 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:58:28,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:28,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 320 [2024-11-09 06:58:28,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:28,595 INFO L124 PetriNetUnfolderBase]: 72/1239 cut-off events. [2024-11-09 06:58:28,595 INFO L125 PetriNetUnfolderBase]: For 150/150 co-relation queries the response was YES. [2024-11-09 06:58:28,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1747 conditions, 1239 events. 72/1239 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 5481 event pairs, 14 based on Foata normal form. 2/1172 useless extension candidates. Maximal degree in co-relation 1683. Up to 57 conditions per place. [2024-11-09 06:58:28,607 INFO L140 encePairwiseOnDemand]: 303/320 looper letters, 44 selfloop transitions, 20 changer transitions 0/297 dead transitions. [2024-11-09 06:58:28,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 297 transitions, 928 flow [2024-11-09 06:58:28,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 06:58:28,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-09 06:58:28,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3374 transitions. [2024-11-09 06:58:28,614 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8786458333333333 [2024-11-09 06:58:28,614 INFO L175 Difference]: Start difference. First operand has 295 places, 272 transitions, 714 flow. Second operand 12 states and 3374 transitions. [2024-11-09 06:58:28,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 297 transitions, 928 flow [2024-11-09 06:58:28,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 297 transitions, 878 flow, removed 11 selfloop flow, removed 13 redundant places. [2024-11-09 06:58:28,623 INFO L231 Difference]: Finished difference. Result has 290 places, 281 transitions, 780 flow [2024-11-09 06:58:28,624 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=780, PETRI_PLACES=290, PETRI_TRANSITIONS=281} [2024-11-09 06:58:28,625 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -2 predicate places. [2024-11-09 06:58:28,625 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 281 transitions, 780 flow [2024-11-09 06:58:28,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 279.25) internal successors, (2234), 8 states have internal predecessors, (2234), 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:58:28,626 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:28,627 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] [2024-11-09 06:58:28,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 06:58:28,627 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-09 06:58:28,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:28,627 INFO L85 PathProgramCache]: Analyzing trace with hash 875149968, now seen corresponding path program 1 times [2024-11-09 06:58:28,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:28,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332163550] [2024-11-09 06:58:28,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:28,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:28,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:58:28,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:28,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332163550] [2024-11-09 06:58:28,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332163550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:28,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:28,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:58:28,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475085203] [2024-11-09 06:58:28,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:28,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:58:28,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:28,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:58:28,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:58:29,256 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 320 [2024-11-09 06:58:29,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 281 transitions, 780 flow. Second operand has 8 states, 8 states have (on average 279.375) internal successors, (2235), 8 states have internal predecessors, (2235), 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:58:29,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:29,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 320 [2024-11-09 06:58:29,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:29,514 INFO L124 PetriNetUnfolderBase]: 102/1027 cut-off events. [2024-11-09 06:58:29,514 INFO L125 PetriNetUnfolderBase]: For 192/196 co-relation queries the response was YES. [2024-11-09 06:58:29,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1509 conditions, 1027 events. 102/1027 cut-off events. For 192/196 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4945 event pairs, 24 based on Foata normal form. 2/955 useless extension candidates. Maximal degree in co-relation 1444. Up to 86 conditions per place. [2024-11-09 06:58:29,520 INFO L140 encePairwiseOnDemand]: 303/320 looper letters, 34 selfloop transitions, 13 changer transitions 17/297 dead transitions. [2024-11-09 06:58:29,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 297 transitions, 956 flow [2024-11-09 06:58:29,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 06:58:29,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-09 06:58:29,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3371 transitions. [2024-11-09 06:58:29,527 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8778645833333333 [2024-11-09 06:58:29,527 INFO L175 Difference]: Start difference. First operand has 290 places, 281 transitions, 780 flow. Second operand 12 states and 3371 transitions. [2024-11-09 06:58:29,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 297 transitions, 956 flow [2024-11-09 06:58:29,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 297 transitions, 954 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:58:29,533 INFO L231 Difference]: Finished difference. Result has 302 places, 273 transitions, 753 flow [2024-11-09 06:58:29,534 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=753, PETRI_PLACES=302, PETRI_TRANSITIONS=273} [2024-11-09 06:58:29,534 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, 10 predicate places. [2024-11-09 06:58:29,534 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 273 transitions, 753 flow [2024-11-09 06:58:29,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 279.375) internal successors, (2235), 8 states have internal predecessors, (2235), 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:58:29,535 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:29,536 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:29,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 06:58:29,536 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-09 06:58:29,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:29,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1529152956, now seen corresponding path program 1 times [2024-11-09 06:58:29,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:29,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343919350] [2024-11-09 06:58:29,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:29,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:30,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:58:30,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:30,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343919350] [2024-11-09 06:58:30,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343919350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:30,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:30,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:58:30,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684312270] [2024-11-09 06:58:30,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:30,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:58:30,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:30,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:58:30,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:58:30,267 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 320 [2024-11-09 06:58:30,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 273 transitions, 753 flow. Second operand has 6 states, 6 states have (on average 290.8333333333333) internal successors, (1745), 6 states have internal predecessors, (1745), 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:58:30,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:30,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 320 [2024-11-09 06:58:30,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:30,435 INFO L124 PetriNetUnfolderBase]: 42/812 cut-off events. [2024-11-09 06:58:30,435 INFO L125 PetriNetUnfolderBase]: For 113/115 co-relation queries the response was YES. [2024-11-09 06:58:30,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1136 conditions, 812 events. 42/812 cut-off events. For 113/115 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2604 event pairs, 6 based on Foata normal form. 0/769 useless extension candidates. Maximal degree in co-relation 1066. Up to 35 conditions per place. [2024-11-09 06:58:30,441 INFO L140 encePairwiseOnDemand]: 314/320 looper letters, 20 selfloop transitions, 6 changer transitions 0/277 dead transitions. [2024-11-09 06:58:30,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 277 transitions, 818 flow [2024-11-09 06:58:30,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:58:30,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:58:30,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1754 transitions. [2024-11-09 06:58:30,446 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9135416666666667 [2024-11-09 06:58:30,446 INFO L175 Difference]: Start difference. First operand has 302 places, 273 transitions, 753 flow. Second operand 6 states and 1754 transitions. [2024-11-09 06:58:30,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 277 transitions, 818 flow [2024-11-09 06:58:30,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 277 transitions, 765 flow, removed 5 selfloop flow, removed 16 redundant places. [2024-11-09 06:58:30,452 INFO L231 Difference]: Finished difference. Result has 282 places, 272 transitions, 710 flow [2024-11-09 06:58:30,453 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=710, PETRI_PLACES=282, PETRI_TRANSITIONS=272} [2024-11-09 06:58:30,453 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -10 predicate places. [2024-11-09 06:58:30,453 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 272 transitions, 710 flow [2024-11-09 06:58:30,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 290.8333333333333) internal successors, (1745), 6 states have internal predecessors, (1745), 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:58:30,454 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:30,455 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] [2024-11-09 06:58:30,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 06:58:30,455 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-09 06:58:30,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:30,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1960845212, now seen corresponding path program 1 times [2024-11-09 06:58:30,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:30,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682285114] [2024-11-09 06:58:30,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:30,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:30,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:58:30,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:30,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682285114] [2024-11-09 06:58:30,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682285114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:30,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:30,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:58:30,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510990062] [2024-11-09 06:58:30,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:30,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:58:30,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:30,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:58:30,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:58:31,200 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 320 [2024-11-09 06:58:31,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 272 transitions, 710 flow. Second operand has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 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:58:31,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:31,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 320 [2024-11-09 06:58:31,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:31,375 INFO L124 PetriNetUnfolderBase]: 79/1071 cut-off events. [2024-11-09 06:58:31,376 INFO L125 PetriNetUnfolderBase]: For 139/143 co-relation queries the response was YES. [2024-11-09 06:58:31,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1440 conditions, 1071 events. 79/1071 cut-off events. For 139/143 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4761 event pairs, 12 based on Foata normal form. 0/1009 useless extension candidates. Maximal degree in co-relation 1381. Up to 54 conditions per place. [2024-11-09 06:58:31,388 INFO L140 encePairwiseOnDemand]: 314/320 looper letters, 19 selfloop transitions, 6 changer transitions 0/275 dead transitions. [2024-11-09 06:58:31,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 275 transitions, 770 flow [2024-11-09 06:58:31,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:58:31,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:58:31,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1753 transitions. [2024-11-09 06:58:31,392 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9130208333333333 [2024-11-09 06:58:31,393 INFO L175 Difference]: Start difference. First operand has 282 places, 272 transitions, 710 flow. Second operand 6 states and 1753 transitions. [2024-11-09 06:58:31,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 275 transitions, 770 flow [2024-11-09 06:58:31,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 275 transitions, 758 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 06:58:31,399 INFO L231 Difference]: Finished difference. Result has 281 places, 271 transitions, 708 flow [2024-11-09 06:58:31,400 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=708, PETRI_PLACES=281, PETRI_TRANSITIONS=271} [2024-11-09 06:58:31,400 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -11 predicate places. [2024-11-09 06:58:31,400 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 271 transitions, 708 flow [2024-11-09 06:58:31,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 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:58:31,401 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:31,402 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] [2024-11-09 06:58:31,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 06:58:31,402 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-09 06:58:31,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:31,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1379084268, now seen corresponding path program 1 times [2024-11-09 06:58:31,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:31,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023935526] [2024-11-09 06:58:31,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:31,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:31,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:58:31,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:31,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023935526] [2024-11-09 06:58:31,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023935526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:31,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:31,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:58:31,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254485238] [2024-11-09 06:58:31,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:31,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:58:31,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:31,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:58:31,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:58:32,114 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 320 [2024-11-09 06:58:32,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 271 transitions, 708 flow. Second operand has 6 states, 6 states have (on average 290.8333333333333) internal successors, (1745), 6 states have internal predecessors, (1745), 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:58:32,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:32,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 320 [2024-11-09 06:58:32,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:32,242 INFO L124 PetriNetUnfolderBase]: 39/787 cut-off events. [2024-11-09 06:58:32,243 INFO L125 PetriNetUnfolderBase]: For 89/91 co-relation queries the response was YES. [2024-11-09 06:58:32,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1081 conditions, 787 events. 39/787 cut-off events. For 89/91 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2468 event pairs, 6 based on Foata normal form. 0/755 useless extension candidates. Maximal degree in co-relation 1022. Up to 35 conditions per place. [2024-11-09 06:58:32,251 INFO L140 encePairwiseOnDemand]: 314/320 looper letters, 20 selfloop transitions, 6 changer transitions 0/275 dead transitions. [2024-11-09 06:58:32,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 275 transitions, 773 flow [2024-11-09 06:58:32,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:58:32,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:58:32,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1754 transitions. [2024-11-09 06:58:32,255 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9135416666666667 [2024-11-09 06:58:32,255 INFO L175 Difference]: Start difference. First operand has 281 places, 271 transitions, 708 flow. Second operand 6 states and 1754 transitions. [2024-11-09 06:58:32,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 275 transitions, 773 flow [2024-11-09 06:58:32,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 275 transitions, 761 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 06:58:32,260 INFO L231 Difference]: Finished difference. Result has 280 places, 270 transitions, 706 flow [2024-11-09 06:58:32,261 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=706, PETRI_PLACES=280, PETRI_TRANSITIONS=270} [2024-11-09 06:58:32,261 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -12 predicate places. [2024-11-09 06:58:32,261 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 270 transitions, 706 flow [2024-11-09 06:58:32,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 290.8333333333333) internal successors, (1745), 6 states have internal predecessors, (1745), 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:58:32,262 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:32,263 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] [2024-11-09 06:58:32,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 06:58:32,263 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-09 06:58:32,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:32,263 INFO L85 PathProgramCache]: Analyzing trace with hash -2078466068, now seen corresponding path program 1 times [2024-11-09 06:58:32,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:32,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593980710] [2024-11-09 06:58:32,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:32,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:32,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:58:32,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:32,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593980710] [2024-11-09 06:58:32,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593980710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:32,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:32,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:58:32,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204311557] [2024-11-09 06:58:32,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:32,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:58:32,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:32,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:58:32,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:58:32,907 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 320 [2024-11-09 06:58:32,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 270 transitions, 706 flow. Second operand has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 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:58:32,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:32,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 320 [2024-11-09 06:58:32,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:33,069 INFO L124 PetriNetUnfolderBase]: 79/971 cut-off events. [2024-11-09 06:58:33,069 INFO L125 PetriNetUnfolderBase]: For 139/143 co-relation queries the response was YES. [2024-11-09 06:58:33,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1354 conditions, 971 events. 79/971 cut-off events. For 139/143 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4540 event pairs, 12 based on Foata normal form. 0/929 useless extension candidates. Maximal degree in co-relation 1295. Up to 54 conditions per place. [2024-11-09 06:58:33,076 INFO L140 encePairwiseOnDemand]: 314/320 looper letters, 19 selfloop transitions, 6 changer transitions 0/273 dead transitions. [2024-11-09 06:58:33,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 273 transitions, 766 flow [2024-11-09 06:58:33,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:58:33,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:58:33,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1753 transitions. [2024-11-09 06:58:33,079 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9130208333333333 [2024-11-09 06:58:33,079 INFO L175 Difference]: Start difference. First operand has 280 places, 270 transitions, 706 flow. Second operand 6 states and 1753 transitions. [2024-11-09 06:58:33,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 273 transitions, 766 flow [2024-11-09 06:58:33,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 273 transitions, 754 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 06:58:33,085 INFO L231 Difference]: Finished difference. Result has 279 places, 269 transitions, 704 flow [2024-11-09 06:58:33,085 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=704, PETRI_PLACES=279, PETRI_TRANSITIONS=269} [2024-11-09 06:58:33,086 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -13 predicate places. [2024-11-09 06:58:33,086 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 269 transitions, 704 flow [2024-11-09 06:58:33,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 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:58:33,087 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:33,087 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:33,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 06:58:33,087 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-09 06:58:33,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:33,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1214540652, now seen corresponding path program 1 times [2024-11-09 06:58:33,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:33,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319118333] [2024-11-09 06:58:33,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:33,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:33,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:58:33,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:33,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319118333] [2024-11-09 06:58:33,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319118333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:33,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:33,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:33,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199665712] [2024-11-09 06:58:33,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:33,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:33,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:33,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:33,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:33,163 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 320 [2024-11-09 06:58:33,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 269 transitions, 704 flow. Second operand has 3 states, 3 states have (on average 298.0) internal successors, (894), 3 states have internal predecessors, (894), 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:58:33,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:33,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 320 [2024-11-09 06:58:33,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:33,285 INFO L124 PetriNetUnfolderBase]: 46/820 cut-off events. [2024-11-09 06:58:33,285 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2024-11-09 06:58:33,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1124 conditions, 820 events. 46/820 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2622 event pairs, 17 based on Foata normal form. 0/798 useless extension candidates. Maximal degree in co-relation 1079. Up to 64 conditions per place. [2024-11-09 06:58:33,294 INFO L140 encePairwiseOnDemand]: 317/320 looper letters, 11 selfloop transitions, 2 changer transitions 0/269 dead transitions. [2024-11-09 06:58:33,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 269 transitions, 731 flow [2024-11-09 06:58:33,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:33,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:33,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 899 transitions. [2024-11-09 06:58:33,299 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9364583333333333 [2024-11-09 06:58:33,299 INFO L175 Difference]: Start difference. First operand has 279 places, 269 transitions, 704 flow. Second operand 3 states and 899 transitions. [2024-11-09 06:58:33,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 269 transitions, 731 flow [2024-11-09 06:58:33,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 269 transitions, 719 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 06:58:33,305 INFO L231 Difference]: Finished difference. Result has 275 places, 268 transitions, 694 flow [2024-11-09 06:58:33,306 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=694, PETRI_PLACES=275, PETRI_TRANSITIONS=268} [2024-11-09 06:58:33,306 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -17 predicate places. [2024-11-09 06:58:33,306 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 268 transitions, 694 flow [2024-11-09 06:58:33,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 298.0) internal successors, (894), 3 states have internal predecessors, (894), 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:58:33,307 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:33,307 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:33,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 06:58:33,308 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-09 06:58:33,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:33,308 INFO L85 PathProgramCache]: Analyzing trace with hash 585483892, now seen corresponding path program 1 times [2024-11-09 06:58:33,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:33,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655512213] [2024-11-09 06:58:33,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:33,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:33,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:58:33,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:33,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655512213] [2024-11-09 06:58:33,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655512213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:33,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:33,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:33,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238525491] [2024-11-09 06:58:33,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:33,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:33,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:33,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:33,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:33,393 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 320 [2024-11-09 06:58:33,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 268 transitions, 694 flow. Second operand has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 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:58:33,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:33,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 320 [2024-11-09 06:58:33,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:33,550 INFO L124 PetriNetUnfolderBase]: 89/968 cut-off events. [2024-11-09 06:58:33,551 INFO L125 PetriNetUnfolderBase]: For 138/141 co-relation queries the response was YES. [2024-11-09 06:58:33,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1318 conditions, 968 events. 89/968 cut-off events. For 138/141 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4260 event pairs, 33 based on Foata normal form. 0/926 useless extension candidates. Maximal degree in co-relation 1261. Up to 102 conditions per place. [2024-11-09 06:58:33,555 INFO L140 encePairwiseOnDemand]: 317/320 looper letters, 0 selfloop transitions, 0 changer transitions 268/268 dead transitions. [2024-11-09 06:58:33,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 268 transitions, 721 flow [2024-11-09 06:58:33,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:33,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:33,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 899 transitions. [2024-11-09 06:58:33,558 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9364583333333333 [2024-11-09 06:58:33,558 INFO L175 Difference]: Start difference. First operand has 275 places, 268 transitions, 694 flow. Second operand 3 states and 899 transitions. [2024-11-09 06:58:33,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 268 transitions, 721 flow [2024-11-09 06:58:33,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 268 transitions, 717 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:33,563 INFO L231 Difference]: Finished difference. Result has 274 places, 0 transitions, 0 flow [2024-11-09 06:58:33,563 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=274, PETRI_TRANSITIONS=0} [2024-11-09 06:58:33,564 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, -18 predicate places. [2024-11-09 06:58:33,564 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 0 transitions, 0 flow [2024-11-09 06:58:33,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 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:58:33,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (59 of 60 remaining) [2024-11-09 06:58:33,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (58 of 60 remaining) [2024-11-09 06:58:33,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (57 of 60 remaining) [2024-11-09 06:58:33,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (56 of 60 remaining) [2024-11-09 06:58:33,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (55 of 60 remaining) [2024-11-09 06:58:33,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (54 of 60 remaining) [2024-11-09 06:58:33,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (53 of 60 remaining) [2024-11-09 06:58:33,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (52 of 60 remaining) [2024-11-09 06:58:33,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (51 of 60 remaining) [2024-11-09 06:58:33,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (50 of 60 remaining) [2024-11-09 06:58:33,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (49 of 60 remaining) [2024-11-09 06:58:33,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (48 of 60 remaining) [2024-11-09 06:58:33,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (47 of 60 remaining) [2024-11-09 06:58:33,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (46 of 60 remaining) [2024-11-09 06:58:33,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (45 of 60 remaining) [2024-11-09 06:58:33,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (44 of 60 remaining) [2024-11-09 06:58:33,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (43 of 60 remaining) [2024-11-09 06:58:33,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (42 of 60 remaining) [2024-11-09 06:58:33,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (41 of 60 remaining) [2024-11-09 06:58:33,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (40 of 60 remaining) [2024-11-09 06:58:33,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (39 of 60 remaining) [2024-11-09 06:58:33,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (38 of 60 remaining) [2024-11-09 06:58:33,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (37 of 60 remaining) [2024-11-09 06:58:33,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (36 of 60 remaining) [2024-11-09 06:58:33,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (35 of 60 remaining) [2024-11-09 06:58:33,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (34 of 60 remaining) [2024-11-09 06:58:33,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (33 of 60 remaining) [2024-11-09 06:58:33,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (32 of 60 remaining) [2024-11-09 06:58:33,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (31 of 60 remaining) [2024-11-09 06:58:33,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (30 of 60 remaining) [2024-11-09 06:58:33,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (29 of 60 remaining) [2024-11-09 06:58:33,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (28 of 60 remaining) [2024-11-09 06:58:33,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (27 of 60 remaining) [2024-11-09 06:58:33,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (26 of 60 remaining) [2024-11-09 06:58:33,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 60 remaining) [2024-11-09 06:58:33,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 60 remaining) [2024-11-09 06:58:33,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (23 of 60 remaining) [2024-11-09 06:58:33,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (22 of 60 remaining) [2024-11-09 06:58:33,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (21 of 60 remaining) [2024-11-09 06:58:33,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (20 of 60 remaining) [2024-11-09 06:58:33,577 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (19 of 60 remaining) [2024-11-09 06:58:33,577 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (18 of 60 remaining) [2024-11-09 06:58:33,577 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (17 of 60 remaining) [2024-11-09 06:58:33,577 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (16 of 60 remaining) [2024-11-09 06:58:33,577 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (15 of 60 remaining) [2024-11-09 06:58:33,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (14 of 60 remaining) [2024-11-09 06:58:33,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (13 of 60 remaining) [2024-11-09 06:58:33,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (12 of 60 remaining) [2024-11-09 06:58:33,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (11 of 60 remaining) [2024-11-09 06:58:33,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (10 of 60 remaining) [2024-11-09 06:58:33,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (9 of 60 remaining) [2024-11-09 06:58:33,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (8 of 60 remaining) [2024-11-09 06:58:33,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (7 of 60 remaining) [2024-11-09 06:58:33,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (6 of 60 remaining) [2024-11-09 06:58:33,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (5 of 60 remaining) [2024-11-09 06:58:33,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (4 of 60 remaining) [2024-11-09 06:58:33,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (3 of 60 remaining) [2024-11-09 06:58:33,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (2 of 60 remaining) [2024-11-09 06:58:33,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (1 of 60 remaining) [2024-11-09 06:58:33,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (0 of 60 remaining) [2024-11-09 06:58:33,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 06:58:33,582 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:33,589 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 06:58:33,589 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 06:58:33,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:58:33 BasicIcfg [2024-11-09 06:58:33,595 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 06:58:33,596 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 06:58:33,596 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 06:58:33,596 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 06:58:33,596 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:58:22" (3/4) ... [2024-11-09 06:58:33,598 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 06:58:33,601 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-09 06:58:33,602 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-09 06:58:33,608 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-11-09 06:58:33,608 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 06:58:33,609 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 06:58:33,609 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 06:58:33,714 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 06:58:33,715 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 06:58:33,715 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 06:58:33,715 INFO L158 Benchmark]: Toolchain (without parser) took 12714.26ms. Allocated memory was 176.2MB in the beginning and 400.6MB in the end (delta: 224.4MB). Free memory was 123.6MB in the beginning and 325.3MB in the end (delta: -201.7MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2024-11-09 06:58:33,715 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 176.2MB. Free memory is still 142.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:58:33,716 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.64ms. Allocated memory is still 176.2MB. Free memory was 123.6MB in the beginning and 108.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 06:58:33,716 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.36ms. Allocated memory is still 176.2MB. Free memory was 108.9MB in the beginning and 106.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 06:58:33,716 INFO L158 Benchmark]: Boogie Preprocessor took 42.14ms. Allocated memory is still 176.2MB. Free memory was 106.9MB in the beginning and 104.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 06:58:33,716 INFO L158 Benchmark]: RCFGBuilder took 744.11ms. Allocated memory is still 176.2MB. Free memory was 104.1MB in the beginning and 76.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-09 06:58:33,717 INFO L158 Benchmark]: TraceAbstraction took 11392.27ms. Allocated memory was 176.2MB in the beginning and 400.6MB in the end (delta: 224.4MB). Free memory was 76.2MB in the beginning and 331.6MB in the end (delta: -255.4MB). Peak memory consumption was 135.8MB. Max. memory is 16.1GB. [2024-11-09 06:58:33,717 INFO L158 Benchmark]: Witness Printer took 119.18ms. Allocated memory is still 400.6MB. Free memory was 331.6MB in the beginning and 325.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 06:58:33,720 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.20ms. Allocated memory is still 176.2MB. Free memory is still 142.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.64ms. Allocated memory is still 176.2MB. Free memory was 123.6MB in the beginning and 108.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.36ms. Allocated memory is still 176.2MB. Free memory was 108.9MB in the beginning and 106.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.14ms. Allocated memory is still 176.2MB. Free memory was 106.9MB in the beginning and 104.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 744.11ms. Allocated memory is still 176.2MB. Free memory was 104.1MB in the beginning and 76.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 11392.27ms. Allocated memory was 176.2MB in the beginning and 400.6MB in the end (delta: 224.4MB). Free memory was 76.2MB in the beginning and 331.6MB in the end (delta: -255.4MB). Peak memory consumption was 135.8MB. Max. memory is 16.1GB. * Witness Printer took 119.18ms. Allocated memory is still 400.6MB. Free memory was 331.6MB in the beginning and 325.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 434 locations, 60 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.2s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2619 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1733 mSDsluCounter, 1830 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1655 mSDsCounter, 342 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4105 IncrementalHoareTripleChecker+Invalid, 4447 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 342 mSolverCounterUnsat, 175 mSDtfsCounter, 4105 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=780occurred in iteration=16, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 2662 NumberOfCodeBlocks, 2662 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2639 ConstructedInterpolants, 0 QuantifiedInterpolants, 5208 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 14/14 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 34 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-09 06:58:33,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