./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-match-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-match-subst.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2c931aeff3bd4feb775048ea000220a43a3b08d8a3667f51cb57a0babc9201aa --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 06:59:19,645 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:59:19,750 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-09 06:59:19,754 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:59:19,755 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:59:19,783 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:59:19,785 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:59:19,786 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:59:19,787 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:59:19,788 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:59:19,789 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:59:19,790 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:59:19,790 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 06:59:19,790 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:59:19,792 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:59:19,792 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:59:19,793 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:59:19,793 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:59:19,793 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:59:19,794 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:59:19,794 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:59:19,797 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:59:19,797 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 06:59:19,797 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:59:19,797 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:59:19,798 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:59:19,798 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:59:19,798 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:59:19,798 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:59:19,799 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:59:19,799 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:59:19,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:59:19,799 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:59:19,799 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:59:19,800 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:59:19,800 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 06:59:19,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:59:19,800 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:59:19,802 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 06:59:19,802 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 06:59:19,802 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:59:19,803 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 -> 2c931aeff3bd4feb775048ea000220a43a3b08d8a3667f51cb57a0babc9201aa [2024-11-09 06:59:20,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:59:20,095 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:59:20,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:59:20,100 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:59:20,100 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:59:20,102 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-match-subst.wvr.c [2024-11-09 06:59:21,532 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:59:21,759 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:59:21,760 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-match-subst.wvr.c [2024-11-09 06:59:21,769 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/327055ee7/1bedf11d659b4abfbcd3771928e21680/FLAG7ecfaa5cd [2024-11-09 06:59:22,109 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/327055ee7/1bedf11d659b4abfbcd3771928e21680 [2024-11-09 06:59:22,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:59:22,113 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:59:22,114 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:59:22,114 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:59:22,120 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:59:22,121 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:59:22" (1/1) ... [2024-11-09 06:59:22,121 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dfb5335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:22, skipping insertion in model container [2024-11-09 06:59:22,122 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:59:22" (1/1) ... [2024-11-09 06:59:22,143 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:59:22,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:59:22,346 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:59:22,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:59:22,388 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:59:22,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:22 WrapperNode [2024-11-09 06:59:22,389 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:59:22,390 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:59:22,390 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:59:22,390 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:59:22,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:22" (1/1) ... [2024-11-09 06:59:22,406 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:22" (1/1) ... [2024-11-09 06:59:22,463 INFO L138 Inliner]: procedures = 22, calls = 20, calls flagged for inlining = 13, calls inlined = 23, statements flattened = 323 [2024-11-09 06:59:22,463 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:59:22,464 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:59:22,464 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:59:22,464 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:59:22,499 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:22" (1/1) ... [2024-11-09 06:59:22,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:22" (1/1) ... [2024-11-09 06:59:22,507 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:22" (1/1) ... [2024-11-09 06:59:22,507 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:22" (1/1) ... [2024-11-09 06:59:22,516 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:22" (1/1) ... [2024-11-09 06:59:22,519 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:22" (1/1) ... [2024-11-09 06:59:22,521 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:22" (1/1) ... [2024-11-09 06:59:22,526 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:22" (1/1) ... [2024-11-09 06:59:22,530 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:59:22,531 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:59:22,531 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:59:22,532 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:59:22,532 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:22" (1/1) ... [2024-11-09 06:59:22,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:59:22,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:59:22,566 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 06:59:22,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 06:59:22,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:59:22,611 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-09 06:59:22,611 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-09 06:59:22,611 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-09 06:59:22,611 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-09 06:59:22,611 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-09 06:59:22,611 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-09 06:59:22,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:59:22,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:59:22,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:59:22,613 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 06:59:22,717 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:59:22,719 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:59:23,283 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 06:59:23,284 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:59:23,318 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:59:23,319 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 06:59:23,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:59:23 BoogieIcfgContainer [2024-11-09 06:59:23,320 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:59:23,321 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:59:23,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:59:23,326 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:59:23,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:59:22" (1/3) ... [2024-11-09 06:59:23,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4190b85b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:59:23, skipping insertion in model container [2024-11-09 06:59:23,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:22" (2/3) ... [2024-11-09 06:59:23,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4190b85b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:59:23, skipping insertion in model container [2024-11-09 06:59:23,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:59:23" (3/3) ... [2024-11-09 06:59:23,329 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-match-subst.wvr.c [2024-11-09 06:59:23,346 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:59:23,346 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2024-11-09 06:59:23,347 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 06:59:23,496 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-09 06:59:23,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 446 places, 454 transitions, 929 flow [2024-11-09 06:59:23,759 INFO L124 PetriNetUnfolderBase]: 18/451 cut-off events. [2024-11-09 06:59:23,759 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 06:59:23,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464 conditions, 451 events. 18/451 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 777 event pairs, 0 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 311. Up to 2 conditions per place. [2024-11-09 06:59:23,780 INFO L82 GeneralOperation]: Start removeDead. Operand has 446 places, 454 transitions, 929 flow [2024-11-09 06:59:23,793 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 425 places, 431 transitions, 880 flow [2024-11-09 06:59:23,806 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:59:23,814 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;@58a48467, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:59:23,815 INFO L334 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2024-11-09 06:59:23,821 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 06:59:23,822 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-11-09 06:59:23,822 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:59:23,822 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:23,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] [2024-11-09 06:59:23,824 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-09 06:59:23,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:23,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1481465963, now seen corresponding path program 1 times [2024-11-09 06:59:23,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:23,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033117666] [2024-11-09 06:59:23,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:23,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:24,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:24,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:24,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033117666] [2024-11-09 06:59:24,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033117666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:24,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:24,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:24,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402633537] [2024-11-09 06:59:24,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:24,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:24,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:24,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:24,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:24,130 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 454 [2024-11-09 06:59:24,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 431 transitions, 880 flow. Second operand has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:24,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:24,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 454 [2024-11-09 06:59:24,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:24,558 INFO L124 PetriNetUnfolderBase]: 33/1375 cut-off events. [2024-11-09 06:59:24,558 INFO L125 PetriNetUnfolderBase]: For 28/30 co-relation queries the response was YES. [2024-11-09 06:59:24,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1462 conditions, 1375 events. 33/1375 cut-off events. For 28/30 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 6213 event pairs, 20 based on Foata normal form. 76/1250 useless extension candidates. Maximal degree in co-relation 1300. Up to 50 conditions per place. [2024-11-09 06:59:24,582 INFO L140 encePairwiseOnDemand]: 438/454 looper letters, 13 selfloop transitions, 2 changer transitions 1/417 dead transitions. [2024-11-09 06:59:24,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 417 transitions, 882 flow [2024-11-09 06:59:24,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:24,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:24,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2024-11-09 06:59:24,609 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9508076358296622 [2024-11-09 06:59:24,611 INFO L175 Difference]: Start difference. First operand has 425 places, 431 transitions, 880 flow. Second operand 3 states and 1295 transitions. [2024-11-09 06:59:24,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 417 transitions, 882 flow [2024-11-09 06:59:24,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 420 places, 417 transitions, 870 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-09 06:59:24,630 INFO L231 Difference]: Finished difference. Result has 420 places, 416 transitions, 842 flow [2024-11-09 06:59:24,633 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=418, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=842, PETRI_PLACES=420, PETRI_TRANSITIONS=416} [2024-11-09 06:59:24,639 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -5 predicate places. [2024-11-09 06:59:24,640 INFO L471 AbstractCegarLoop]: Abstraction has has 420 places, 416 transitions, 842 flow [2024-11-09 06:59:24,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:24,641 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:24,641 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:24,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:59:24,641 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-09 06:59:24,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:24,642 INFO L85 PathProgramCache]: Analyzing trace with hash -666654298, now seen corresponding path program 1 times [2024-11-09 06:59:24,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:24,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071033067] [2024-11-09 06:59:24,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:24,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:24,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:24,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:24,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071033067] [2024-11-09 06:59:24,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071033067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:24,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:24,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:24,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490254556] [2024-11-09 06:59:24,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:24,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:24,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:24,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:24,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:24,758 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 454 [2024-11-09 06:59:24,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 416 transitions, 842 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:24,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:24,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 454 [2024-11-09 06:59:24,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:25,012 INFO L124 PetriNetUnfolderBase]: 16/956 cut-off events. [2024-11-09 06:59:25,014 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 06:59:25,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 994 conditions, 956 events. 16/956 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4028 event pairs, 7 based on Foata normal form. 0/814 useless extension candidates. Maximal degree in co-relation 957. Up to 25 conditions per place. [2024-11-09 06:59:25,033 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 11 selfloop transitions, 2 changer transitions 0/415 dead transitions. [2024-11-09 06:59:25,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 415 transitions, 866 flow [2024-11-09 06:59:25,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:25,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:25,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1286 transitions. [2024-11-09 06:59:25,038 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9441997063142438 [2024-11-09 06:59:25,038 INFO L175 Difference]: Start difference. First operand has 420 places, 416 transitions, 842 flow. Second operand 3 states and 1286 transitions. [2024-11-09 06:59:25,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 415 transitions, 866 flow [2024-11-09 06:59:25,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 418 places, 415 transitions, 862 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:25,049 INFO L231 Difference]: Finished difference. Result has 418 places, 415 transitions, 840 flow [2024-11-09 06:59:25,050 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=416, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=840, PETRI_PLACES=418, PETRI_TRANSITIONS=415} [2024-11-09 06:59:25,051 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -7 predicate places. [2024-11-09 06:59:25,051 INFO L471 AbstractCegarLoop]: Abstraction has has 418 places, 415 transitions, 840 flow [2024-11-09 06:59:25,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:25,052 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:25,053 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:25,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:59:25,053 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-09 06:59:25,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:25,054 INFO L85 PathProgramCache]: Analyzing trace with hash -2102967575, now seen corresponding path program 1 times [2024-11-09 06:59:25,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:25,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81784930] [2024-11-09 06:59:25,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:25,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:25,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:25,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:25,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81784930] [2024-11-09 06:59:25,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81784930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:25,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:25,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:25,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606293685] [2024-11-09 06:59:25,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:25,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:25,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:25,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:25,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:25,163 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 454 [2024-11-09 06:59:25,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 415 transitions, 840 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:25,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:25,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 454 [2024-11-09 06:59:25,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:25,345 INFO L124 PetriNetUnfolderBase]: 16/937 cut-off events. [2024-11-09 06:59:25,348 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 06:59:25,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 975 conditions, 937 events. 16/937 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3931 event pairs, 7 based on Foata normal form. 0/803 useless extension candidates. Maximal degree in co-relation 930. Up to 25 conditions per place. [2024-11-09 06:59:25,361 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 11 selfloop transitions, 2 changer transitions 0/414 dead transitions. [2024-11-09 06:59:25,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 414 transitions, 864 flow [2024-11-09 06:59:25,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:25,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:25,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1286 transitions. [2024-11-09 06:59:25,365 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9441997063142438 [2024-11-09 06:59:25,365 INFO L175 Difference]: Start difference. First operand has 418 places, 415 transitions, 840 flow. Second operand 3 states and 1286 transitions. [2024-11-09 06:59:25,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 419 places, 414 transitions, 864 flow [2024-11-09 06:59:25,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 414 transitions, 860 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:25,372 INFO L231 Difference]: Finished difference. Result has 417 places, 414 transitions, 838 flow [2024-11-09 06:59:25,373 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=838, PETRI_PLACES=417, PETRI_TRANSITIONS=414} [2024-11-09 06:59:25,374 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -8 predicate places. [2024-11-09 06:59:25,374 INFO L471 AbstractCegarLoop]: Abstraction has has 417 places, 414 transitions, 838 flow [2024-11-09 06:59:25,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:25,375 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:25,375 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:25,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:59:25,375 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-09 06:59:25,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:25,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1511710481, now seen corresponding path program 1 times [2024-11-09 06:59:25,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:25,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960722674] [2024-11-09 06:59:25,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:25,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:25,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:25,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:25,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960722674] [2024-11-09 06:59:25,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960722674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:25,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:25,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:25,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715816395] [2024-11-09 06:59:25,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:25,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:25,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:25,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:25,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:25,474 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 454 [2024-11-09 06:59:25,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 414 transitions, 838 flow. Second operand has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:25,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:25,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 454 [2024-11-09 06:59:25,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:25,625 INFO L124 PetriNetUnfolderBase]: 19/807 cut-off events. [2024-11-09 06:59:25,626 INFO L125 PetriNetUnfolderBase]: For 4/8 co-relation queries the response was YES. [2024-11-09 06:59:25,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 858 conditions, 807 events. 19/807 cut-off events. For 4/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2820 event pairs, 12 based on Foata normal form. 0/697 useless extension candidates. Maximal degree in co-relation 805. Up to 38 conditions per place. [2024-11-09 06:59:25,639 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 13 selfloop transitions, 2 changer transitions 0/413 dead transitions. [2024-11-09 06:59:25,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 413 transitions, 866 flow [2024-11-09 06:59:25,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:25,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:25,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1282 transitions. [2024-11-09 06:59:25,643 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9412628487518355 [2024-11-09 06:59:25,643 INFO L175 Difference]: Start difference. First operand has 417 places, 414 transitions, 838 flow. Second operand 3 states and 1282 transitions. [2024-11-09 06:59:25,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 413 transitions, 866 flow [2024-11-09 06:59:25,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 416 places, 413 transitions, 862 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:25,651 INFO L231 Difference]: Finished difference. Result has 416 places, 413 transitions, 836 flow [2024-11-09 06:59:25,651 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=836, PETRI_PLACES=416, PETRI_TRANSITIONS=413} [2024-11-09 06:59:25,653 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -9 predicate places. [2024-11-09 06:59:25,653 INFO L471 AbstractCegarLoop]: Abstraction has has 416 places, 413 transitions, 836 flow [2024-11-09 06:59:25,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:25,655 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:25,655 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:25,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:59:25,656 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-09 06:59:25,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:25,657 INFO L85 PathProgramCache]: Analyzing trace with hash 805669637, now seen corresponding path program 1 times [2024-11-09 06:59:25,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:25,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046471844] [2024-11-09 06:59:25,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:25,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:25,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:25,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:25,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046471844] [2024-11-09 06:59:25,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046471844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:25,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:25,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:25,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871833383] [2024-11-09 06:59:25,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:25,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:25,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:25,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:25,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:25,745 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 454 [2024-11-09 06:59:25,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 413 transitions, 836 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:25,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:25,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 454 [2024-11-09 06:59:25,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:25,892 INFO L124 PetriNetUnfolderBase]: 12/784 cut-off events. [2024-11-09 06:59:25,892 INFO L125 PetriNetUnfolderBase]: For 5/10 co-relation queries the response was YES. [2024-11-09 06:59:25,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 817 conditions, 784 events. 12/784 cut-off events. For 5/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2122 event pairs, 5 based on Foata normal form. 0/673 useless extension candidates. Maximal degree in co-relation 756. Up to 22 conditions per place. [2024-11-09 06:59:25,905 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 11 selfloop transitions, 2 changer transitions 0/412 dead transitions. [2024-11-09 06:59:25,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 412 transitions, 860 flow [2024-11-09 06:59:25,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:25,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:25,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1286 transitions. [2024-11-09 06:59:25,908 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9441997063142438 [2024-11-09 06:59:25,908 INFO L175 Difference]: Start difference. First operand has 416 places, 413 transitions, 836 flow. Second operand 3 states and 1286 transitions. [2024-11-09 06:59:25,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 412 transitions, 860 flow [2024-11-09 06:59:25,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 412 transitions, 856 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:25,923 INFO L231 Difference]: Finished difference. Result has 415 places, 412 transitions, 834 flow [2024-11-09 06:59:25,924 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=834, PETRI_PLACES=415, PETRI_TRANSITIONS=412} [2024-11-09 06:59:25,926 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -10 predicate places. [2024-11-09 06:59:25,926 INFO L471 AbstractCegarLoop]: Abstraction has has 415 places, 412 transitions, 834 flow [2024-11-09 06:59:25,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:25,928 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:25,928 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:25,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:59:25,929 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-09 06:59:25,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:25,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1067874234, now seen corresponding path program 1 times [2024-11-09 06:59:25,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:25,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028155696] [2024-11-09 06:59:25,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:25,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:26,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:26,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:26,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028155696] [2024-11-09 06:59:26,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028155696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:26,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:26,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:26,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067864932] [2024-11-09 06:59:26,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:26,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:26,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:26,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:26,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:26,029 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 454 [2024-11-09 06:59:26,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 412 transitions, 834 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:26,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:26,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 454 [2024-11-09 06:59:26,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:26,150 INFO L124 PetriNetUnfolderBase]: 12/777 cut-off events. [2024-11-09 06:59:26,150 INFO L125 PetriNetUnfolderBase]: For 5/10 co-relation queries the response was YES. [2024-11-09 06:59:26,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 810 conditions, 777 events. 12/777 cut-off events. For 5/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2081 event pairs, 5 based on Foata normal form. 0/669 useless extension candidates. Maximal degree in co-relation 741. Up to 22 conditions per place. [2024-11-09 06:59:26,163 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 11 selfloop transitions, 2 changer transitions 0/411 dead transitions. [2024-11-09 06:59:26,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 411 transitions, 858 flow [2024-11-09 06:59:26,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:26,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:26,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1286 transitions. [2024-11-09 06:59:26,167 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9441997063142438 [2024-11-09 06:59:26,167 INFO L175 Difference]: Start difference. First operand has 415 places, 412 transitions, 834 flow. Second operand 3 states and 1286 transitions. [2024-11-09 06:59:26,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 411 transitions, 858 flow [2024-11-09 06:59:26,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 411 transitions, 854 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:26,176 INFO L231 Difference]: Finished difference. Result has 414 places, 411 transitions, 832 flow [2024-11-09 06:59:26,177 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=832, PETRI_PLACES=414, PETRI_TRANSITIONS=411} [2024-11-09 06:59:26,177 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -11 predicate places. [2024-11-09 06:59:26,178 INFO L471 AbstractCegarLoop]: Abstraction has has 414 places, 411 transitions, 832 flow [2024-11-09 06:59:26,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:26,179 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:26,180 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:26,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:59:26,180 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-09 06:59:26,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:26,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1914240621, now seen corresponding path program 1 times [2024-11-09 06:59:26,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:26,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515922591] [2024-11-09 06:59:26,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:26,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:26,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:26,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:26,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515922591] [2024-11-09 06:59:26,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515922591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:26,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:26,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:26,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088661425] [2024-11-09 06:59:26,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:26,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:26,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:26,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:26,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:26,281 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 454 [2024-11-09 06:59:26,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 411 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:26,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:26,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 454 [2024-11-09 06:59:26,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:26,430 INFO L124 PetriNetUnfolderBase]: 25/626 cut-off events. [2024-11-09 06:59:26,430 INFO L125 PetriNetUnfolderBase]: For 9/13 co-relation queries the response was YES. [2024-11-09 06:59:26,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 687 conditions, 626 events. 25/626 cut-off events. For 9/13 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2198 event pairs, 20 based on Foata normal form. 0/549 useless extension candidates. Maximal degree in co-relation 610. Up to 50 conditions per place. [2024-11-09 06:59:26,440 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 13 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2024-11-09 06:59:26,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 410 transitions, 860 flow [2024-11-09 06:59:26,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:26,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:26,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1282 transitions. [2024-11-09 06:59:26,444 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9412628487518355 [2024-11-09 06:59:26,444 INFO L175 Difference]: Start difference. First operand has 414 places, 411 transitions, 832 flow. Second operand 3 states and 1282 transitions. [2024-11-09 06:59:26,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 410 transitions, 860 flow [2024-11-09 06:59:26,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 410 transitions, 856 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:26,452 INFO L231 Difference]: Finished difference. Result has 413 places, 410 transitions, 830 flow [2024-11-09 06:59:26,453 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=830, PETRI_PLACES=413, PETRI_TRANSITIONS=410} [2024-11-09 06:59:26,453 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -12 predicate places. [2024-11-09 06:59:26,454 INFO L471 AbstractCegarLoop]: Abstraction has has 413 places, 410 transitions, 830 flow [2024-11-09 06:59:26,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:26,456 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:26,456 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:26,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 06:59:26,456 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-09 06:59:26,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:26,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1935635487, now seen corresponding path program 1 times [2024-11-09 06:59:26,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:26,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541889822] [2024-11-09 06:59:26,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:26,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:26,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:26,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:26,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541889822] [2024-11-09 06:59:26,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541889822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:26,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:26,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:26,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930654343] [2024-11-09 06:59:26,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:26,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:26,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:26,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:26,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:26,556 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 454 [2024-11-09 06:59:26,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 410 transitions, 830 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:26,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:26,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 454 [2024-11-09 06:59:26,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:26,666 INFO L124 PetriNetUnfolderBase]: 14/681 cut-off events. [2024-11-09 06:59:26,667 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2024-11-09 06:59:26,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 716 conditions, 681 events. 14/681 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1754 event pairs, 7 based on Foata normal form. 0/587 useless extension candidates. Maximal degree in co-relation 631. Up to 25 conditions per place. [2024-11-09 06:59:26,677 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 11 selfloop transitions, 2 changer transitions 0/409 dead transitions. [2024-11-09 06:59:26,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 409 transitions, 854 flow [2024-11-09 06:59:26,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:26,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:26,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1286 transitions. [2024-11-09 06:59:26,681 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9441997063142438 [2024-11-09 06:59:26,681 INFO L175 Difference]: Start difference. First operand has 413 places, 410 transitions, 830 flow. Second operand 3 states and 1286 transitions. [2024-11-09 06:59:26,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 409 transitions, 854 flow [2024-11-09 06:59:26,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 409 transitions, 850 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:26,688 INFO L231 Difference]: Finished difference. Result has 412 places, 409 transitions, 828 flow [2024-11-09 06:59:26,689 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=828, PETRI_PLACES=412, PETRI_TRANSITIONS=409} [2024-11-09 06:59:26,692 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -13 predicate places. [2024-11-09 06:59:26,692 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 409 transitions, 828 flow [2024-11-09 06:59:26,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:26,693 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:26,693 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:26,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 06:59:26,694 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-09 06:59:26,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:26,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1967425806, now seen corresponding path program 1 times [2024-11-09 06:59:26,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:26,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25830569] [2024-11-09 06:59:26,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:26,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:26,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:26,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:26,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25830569] [2024-11-09 06:59:26,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25830569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:26,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:26,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:26,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601938457] [2024-11-09 06:59:26,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:26,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:26,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:26,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:26,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:26,782 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 454 [2024-11-09 06:59:26,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 409 transitions, 828 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:26,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:26,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 454 [2024-11-09 06:59:26,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:26,917 INFO L124 PetriNetUnfolderBase]: 14/671 cut-off events. [2024-11-09 06:59:26,917 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2024-11-09 06:59:26,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 706 conditions, 671 events. 14/671 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1727 event pairs, 7 based on Foata normal form. 0/581 useless extension candidates. Maximal degree in co-relation 613. Up to 25 conditions per place. [2024-11-09 06:59:26,926 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 11 selfloop transitions, 2 changer transitions 0/408 dead transitions. [2024-11-09 06:59:26,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 408 transitions, 852 flow [2024-11-09 06:59:26,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:26,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:26,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1286 transitions. [2024-11-09 06:59:26,930 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9441997063142438 [2024-11-09 06:59:26,930 INFO L175 Difference]: Start difference. First operand has 412 places, 409 transitions, 828 flow. Second operand 3 states and 1286 transitions. [2024-11-09 06:59:26,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 408 transitions, 852 flow [2024-11-09 06:59:26,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 408 transitions, 848 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:26,938 INFO L231 Difference]: Finished difference. Result has 411 places, 408 transitions, 826 flow [2024-11-09 06:59:26,939 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=826, PETRI_PLACES=411, PETRI_TRANSITIONS=408} [2024-11-09 06:59:26,940 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -14 predicate places. [2024-11-09 06:59:26,940 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 408 transitions, 826 flow [2024-11-09 06:59:26,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:26,942 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:26,942 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:26,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 06:59:26,942 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-09 06:59:26,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:26,943 INFO L85 PathProgramCache]: Analyzing trace with hash -224796327, now seen corresponding path program 1 times [2024-11-09 06:59:26,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:26,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919333340] [2024-11-09 06:59:26,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:26,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:26,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:26,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:26,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:26,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919333340] [2024-11-09 06:59:26,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919333340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:26,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:26,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:26,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539633781] [2024-11-09 06:59:26,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:26,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:26,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:26,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:26,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:27,001 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2024-11-09 06:59:27,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 408 transitions, 826 flow. Second operand has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:27,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:27,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2024-11-09 06:59:27,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:27,201 INFO L124 PetriNetUnfolderBase]: 34/1406 cut-off events. [2024-11-09 06:59:27,201 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 06:59:27,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1471 conditions, 1406 events. 34/1406 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 8143 event pairs, 13 based on Foata normal form. 0/1207 useless extension candidates. Maximal degree in co-relation 1370. Up to 43 conditions per place. [2024-11-09 06:59:27,223 INFO L140 encePairwiseOnDemand]: 450/454 looper letters, 13 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2024-11-09 06:59:27,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 410 transitions, 862 flow [2024-11-09 06:59:27,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:27,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:27,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2024-11-09 06:59:27,227 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9508076358296622 [2024-11-09 06:59:27,227 INFO L175 Difference]: Start difference. First operand has 411 places, 408 transitions, 826 flow. Second operand 3 states and 1295 transitions. [2024-11-09 06:59:27,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 410 transitions, 862 flow [2024-11-09 06:59:27,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 410 transitions, 858 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:27,235 INFO L231 Difference]: Finished difference. Result has 410 places, 408 transitions, 832 flow [2024-11-09 06:59:27,236 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=832, PETRI_PLACES=410, PETRI_TRANSITIONS=408} [2024-11-09 06:59:27,237 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -15 predicate places. [2024-11-09 06:59:27,237 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 408 transitions, 832 flow [2024-11-09 06:59:27,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:27,239 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:27,239 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:27,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 06:59:27,239 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-09 06:59:27,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:27,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1280872901, now seen corresponding path program 1 times [2024-11-09 06:59:27,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:27,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004301538] [2024-11-09 06:59:27,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:27,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:27,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:27,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:27,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004301538] [2024-11-09 06:59:27,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004301538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:27,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:27,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:27,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940443207] [2024-11-09 06:59:27,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:27,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:27,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:27,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:27,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:27,306 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2024-11-09 06:59:27,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 408 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:27,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:27,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2024-11-09 06:59:27,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:27,531 INFO L124 PetriNetUnfolderBase]: 40/1646 cut-off events. [2024-11-09 06:59:27,531 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 06:59:27,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1724 conditions, 1646 events. 40/1646 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10640 event pairs, 14 based on Foata normal form. 0/1421 useless extension candidates. Maximal degree in co-relation 1337. Up to 49 conditions per place. [2024-11-09 06:59:27,556 INFO L140 encePairwiseOnDemand]: 450/454 looper letters, 13 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2024-11-09 06:59:27,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 410 transitions, 868 flow [2024-11-09 06:59:27,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:27,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:27,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2024-11-09 06:59:27,560 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9508076358296622 [2024-11-09 06:59:27,561 INFO L175 Difference]: Start difference. First operand has 410 places, 408 transitions, 832 flow. Second operand 3 states and 1295 transitions. [2024-11-09 06:59:27,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 410 transitions, 868 flow [2024-11-09 06:59:27,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 410 transitions, 868 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:59:27,567 INFO L231 Difference]: Finished difference. Result has 411 places, 408 transitions, 842 flow [2024-11-09 06:59:27,568 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=842, PETRI_PLACES=411, PETRI_TRANSITIONS=408} [2024-11-09 06:59:27,569 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -14 predicate places. [2024-11-09 06:59:27,569 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 408 transitions, 842 flow [2024-11-09 06:59:27,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:27,570 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:27,570 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:27,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 06:59:27,571 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-09 06:59:27,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:27,572 INFO L85 PathProgramCache]: Analyzing trace with hash -137455449, now seen corresponding path program 1 times [2024-11-09 06:59:27,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:27,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564646470] [2024-11-09 06:59:27,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:27,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:27,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:27,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:27,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564646470] [2024-11-09 06:59:27,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564646470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:27,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:27,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:27,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918614564] [2024-11-09 06:59:27,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:27,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:27,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:27,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:27,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:27,635 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2024-11-09 06:59:27,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 408 transitions, 842 flow. Second operand has 3 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:27,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:27,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2024-11-09 06:59:27,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:27,800 INFO L124 PetriNetUnfolderBase]: 24/902 cut-off events. [2024-11-09 06:59:27,800 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 06:59:27,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 962 conditions, 902 events. 24/902 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4377 event pairs, 4 based on Foata normal form. 0/786 useless extension candidates. Maximal degree in co-relation 759. Up to 31 conditions per place. [2024-11-09 06:59:27,817 INFO L140 encePairwiseOnDemand]: 450/454 looper letters, 13 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2024-11-09 06:59:27,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 410 transitions, 878 flow [2024-11-09 06:59:27,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:27,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:27,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2024-11-09 06:59:27,820 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9508076358296622 [2024-11-09 06:59:27,821 INFO L175 Difference]: Start difference. First operand has 411 places, 408 transitions, 842 flow. Second operand 3 states and 1295 transitions. [2024-11-09 06:59:27,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 410 transitions, 878 flow [2024-11-09 06:59:27,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 410 transitions, 878 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:59:27,847 INFO L231 Difference]: Finished difference. Result has 412 places, 408 transitions, 852 flow [2024-11-09 06:59:27,848 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=852, PETRI_PLACES=412, PETRI_TRANSITIONS=408} [2024-11-09 06:59:27,850 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -13 predicate places. [2024-11-09 06:59:27,850 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 408 transitions, 852 flow [2024-11-09 06:59:27,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:27,851 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:27,851 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] [2024-11-09 06:59:27,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 06:59:27,852 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-09 06:59:27,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:27,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1049338249, now seen corresponding path program 1 times [2024-11-09 06:59:27,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:27,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763167931] [2024-11-09 06:59:27,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:27,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:27,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:27,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:27,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763167931] [2024-11-09 06:59:27,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763167931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:27,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:27,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:27,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39121342] [2024-11-09 06:59:27,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:27,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:27,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:27,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:27,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:27,910 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2024-11-09 06:59:27,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 408 transitions, 852 flow. Second operand has 3 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:27,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:27,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2024-11-09 06:59:27,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:28,083 INFO L124 PetriNetUnfolderBase]: 26/943 cut-off events. [2024-11-09 06:59:28,083 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 06:59:28,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1014 conditions, 943 events. 26/943 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4688 event pairs, 4 based on Foata normal form. 0/826 useless extension candidates. Maximal degree in co-relation 810. Up to 35 conditions per place. [2024-11-09 06:59:28,102 INFO L140 encePairwiseOnDemand]: 450/454 looper letters, 13 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2024-11-09 06:59:28,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 410 transitions, 888 flow [2024-11-09 06:59:28,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:28,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:28,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2024-11-09 06:59:28,107 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9508076358296622 [2024-11-09 06:59:28,107 INFO L175 Difference]: Start difference. First operand has 412 places, 408 transitions, 852 flow. Second operand 3 states and 1295 transitions. [2024-11-09 06:59:28,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 410 transitions, 888 flow [2024-11-09 06:59:28,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 410 transitions, 888 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:59:28,114 INFO L231 Difference]: Finished difference. Result has 413 places, 408 transitions, 862 flow [2024-11-09 06:59:28,115 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=862, PETRI_PLACES=413, PETRI_TRANSITIONS=408} [2024-11-09 06:59:28,116 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -12 predicate places. [2024-11-09 06:59:28,116 INFO L471 AbstractCegarLoop]: Abstraction has has 413 places, 408 transitions, 862 flow [2024-11-09 06:59:28,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:28,117 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:28,117 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:28,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 06:59:28,118 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-09 06:59:28,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:28,118 INFO L85 PathProgramCache]: Analyzing trace with hash -200193379, now seen corresponding path program 1 times [2024-11-09 06:59:28,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:28,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499649708] [2024-11-09 06:59:28,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:28,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:28,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:28,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:28,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:28,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499649708] [2024-11-09 06:59:28,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499649708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:28,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:28,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:28,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417454644] [2024-11-09 06:59:28,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:28,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:28,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:28,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:28,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:28,183 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2024-11-09 06:59:28,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 408 transitions, 862 flow. Second operand has 3 states, 3 states have (on average 427.6666666666667) internal successors, (1283), 3 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:28,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:28,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2024-11-09 06:59:28,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:28,450 INFO L124 PetriNetUnfolderBase]: 66/1778 cut-off events. [2024-11-09 06:59:28,450 INFO L125 PetriNetUnfolderBase]: For 21/25 co-relation queries the response was YES. [2024-11-09 06:59:28,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1908 conditions, 1778 events. 66/1778 cut-off events. For 21/25 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 10935 event pairs, 10 based on Foata normal form. 0/1515 useless extension candidates. Maximal degree in co-relation 1461. Up to 80 conditions per place. [2024-11-09 06:59:28,469 INFO L140 encePairwiseOnDemand]: 450/454 looper letters, 13 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2024-11-09 06:59:28,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 410 transitions, 898 flow [2024-11-09 06:59:28,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:28,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:28,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2024-11-09 06:59:28,473 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9508076358296622 [2024-11-09 06:59:28,473 INFO L175 Difference]: Start difference. First operand has 413 places, 408 transitions, 862 flow. Second operand 3 states and 1295 transitions. [2024-11-09 06:59:28,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 410 transitions, 898 flow [2024-11-09 06:59:28,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 410 transitions, 898 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:59:28,479 INFO L231 Difference]: Finished difference. Result has 414 places, 408 transitions, 872 flow [2024-11-09 06:59:28,480 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=872, PETRI_PLACES=414, PETRI_TRANSITIONS=408} [2024-11-09 06:59:28,480 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -11 predicate places. [2024-11-09 06:59:28,481 INFO L471 AbstractCegarLoop]: Abstraction has has 414 places, 408 transitions, 872 flow [2024-11-09 06:59:28,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.6666666666667) internal successors, (1283), 3 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:28,482 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:28,482 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:28,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 06:59:28,482 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-09 06:59:28,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:28,482 INFO L85 PathProgramCache]: Analyzing trace with hash 887727743, now seen corresponding path program 1 times [2024-11-09 06:59:28,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:28,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255229739] [2024-11-09 06:59:28,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:28,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:28,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:28,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:28,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255229739] [2024-11-09 06:59:28,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255229739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:28,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:28,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:28,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46319582] [2024-11-09 06:59:28,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:28,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:28,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:28,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:28,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:28,540 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2024-11-09 06:59:28,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 408 transitions, 872 flow. Second operand has 3 states, 3 states have (on average 427.6666666666667) internal successors, (1283), 3 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:28,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:28,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2024-11-09 06:59:28,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:28,831 INFO L124 PetriNetUnfolderBase]: 75/1940 cut-off events. [2024-11-09 06:59:28,832 INFO L125 PetriNetUnfolderBase]: For 23/27 co-relation queries the response was YES. [2024-11-09 06:59:28,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2095 conditions, 1940 events. 75/1940 cut-off events. For 23/27 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 12063 event pairs, 19 based on Foata normal form. 0/1662 useless extension candidates. Maximal degree in co-relation 1659. Up to 90 conditions per place. [2024-11-09 06:59:28,851 INFO L140 encePairwiseOnDemand]: 450/454 looper letters, 13 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2024-11-09 06:59:28,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 410 transitions, 908 flow [2024-11-09 06:59:28,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:28,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:28,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2024-11-09 06:59:28,854 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9508076358296622 [2024-11-09 06:59:28,855 INFO L175 Difference]: Start difference. First operand has 414 places, 408 transitions, 872 flow. Second operand 3 states and 1295 transitions. [2024-11-09 06:59:28,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 410 transitions, 908 flow [2024-11-09 06:59:28,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 410 transitions, 908 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:59:28,861 INFO L231 Difference]: Finished difference. Result has 415 places, 408 transitions, 882 flow [2024-11-09 06:59:28,862 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=882, PETRI_PLACES=415, PETRI_TRANSITIONS=408} [2024-11-09 06:59:28,862 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -10 predicate places. [2024-11-09 06:59:28,863 INFO L471 AbstractCegarLoop]: Abstraction has has 415 places, 408 transitions, 882 flow [2024-11-09 06:59:28,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.6666666666667) internal successors, (1283), 3 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:28,864 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:28,864 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:59:28,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 06:59:28,864 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-09 06:59:28,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:28,865 INFO L85 PathProgramCache]: Analyzing trace with hash -89474115, now seen corresponding path program 1 times [2024-11-09 06:59:28,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:28,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887102156] [2024-11-09 06:59:28,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:28,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:28,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:28,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:28,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:28,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887102156] [2024-11-09 06:59:28,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887102156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:28,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:28,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:28,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219631288] [2024-11-09 06:59:28,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:28,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:28,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:28,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:28,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:28,929 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 454 [2024-11-09 06:59:28,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 408 transitions, 882 flow. Second operand has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:28,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:28,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 454 [2024-11-09 06:59:28,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:29,230 INFO L124 PetriNetUnfolderBase]: 163/1738 cut-off events. [2024-11-09 06:59:29,231 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-11-09 06:59:29,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2090 conditions, 1738 events. 163/1738 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 12345 event pairs, 60 based on Foata normal form. 0/1489 useless extension candidates. Maximal degree in co-relation 1724. Up to 239 conditions per place. [2024-11-09 06:59:29,250 INFO L140 encePairwiseOnDemand]: 448/454 looper letters, 17 selfloop transitions, 2 changer transitions 0/408 dead transitions. [2024-11-09 06:59:29,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 408 transitions, 922 flow [2024-11-09 06:59:29,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:29,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:29,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1283 transitions. [2024-11-09 06:59:29,254 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9419970631424376 [2024-11-09 06:59:29,255 INFO L175 Difference]: Start difference. First operand has 415 places, 408 transitions, 882 flow. Second operand 3 states and 1283 transitions. [2024-11-09 06:59:29,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 408 transitions, 922 flow [2024-11-09 06:59:29,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 408 transitions, 922 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:59:29,262 INFO L231 Difference]: Finished difference. Result has 414 places, 406 transitions, 888 flow [2024-11-09 06:59:29,262 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=888, PETRI_PLACES=414, PETRI_TRANSITIONS=406} [2024-11-09 06:59:29,263 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -11 predicate places. [2024-11-09 06:59:29,263 INFO L471 AbstractCegarLoop]: Abstraction has has 414 places, 406 transitions, 888 flow [2024-11-09 06:59:29,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:29,264 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:29,264 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:29,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 06:59:29,265 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-09 06:59:29,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:29,265 INFO L85 PathProgramCache]: Analyzing trace with hash -85243873, now seen corresponding path program 1 times [2024-11-09 06:59:29,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:29,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504694018] [2024-11-09 06:59:29,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:29,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:29,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:29,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:29,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:29,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504694018] [2024-11-09 06:59:29,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504694018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:29,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:29,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:29,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068214621] [2024-11-09 06:59:29,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:29,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:29,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:29,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:29,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:29,331 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 454 [2024-11-09 06:59:29,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 406 transitions, 888 flow. Second operand has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:29,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:29,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 454 [2024-11-09 06:59:29,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:29,583 INFO L124 PetriNetUnfolderBase]: 121/1554 cut-off events. [2024-11-09 06:59:29,583 INFO L125 PetriNetUnfolderBase]: For 21/45 co-relation queries the response was YES. [2024-11-09 06:59:29,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1849 conditions, 1554 events. 121/1554 cut-off events. For 21/45 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 9833 event pairs, 52 based on Foata normal form. 3/1362 useless extension candidates. Maximal degree in co-relation 1555. Up to 191 conditions per place. [2024-11-09 06:59:29,608 INFO L140 encePairwiseOnDemand]: 448/454 looper letters, 17 selfloop transitions, 2 changer transitions 0/406 dead transitions. [2024-11-09 06:59:29,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 406 transitions, 928 flow [2024-11-09 06:59:29,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:29,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:29,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1283 transitions. [2024-11-09 06:59:29,612 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9419970631424376 [2024-11-09 06:59:29,612 INFO L175 Difference]: Start difference. First operand has 414 places, 406 transitions, 888 flow. Second operand 3 states and 1283 transitions. [2024-11-09 06:59:29,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 406 transitions, 928 flow [2024-11-09 06:59:29,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 406 transitions, 928 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:59:29,620 INFO L231 Difference]: Finished difference. Result has 413 places, 404 transitions, 894 flow [2024-11-09 06:59:29,621 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=413, PETRI_TRANSITIONS=404} [2024-11-09 06:59:29,621 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -12 predicate places. [2024-11-09 06:59:29,621 INFO L471 AbstractCegarLoop]: Abstraction has has 413 places, 404 transitions, 894 flow [2024-11-09 06:59:29,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:29,622 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:29,623 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:29,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 06:59:29,623 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-09 06:59:29,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:29,624 INFO L85 PathProgramCache]: Analyzing trace with hash 845672241, now seen corresponding path program 1 times [2024-11-09 06:59:29,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:29,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454193112] [2024-11-09 06:59:29,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:29,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:29,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:29,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:29,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454193112] [2024-11-09 06:59:29,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454193112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:29,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:29,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:29,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869469659] [2024-11-09 06:59:29,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:29,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:29,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:29,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:29,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:29,692 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 454 [2024-11-09 06:59:29,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 404 transitions, 894 flow. Second operand has 3 states, 3 states have (on average 421.6666666666667) internal successors, (1265), 3 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:29,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:29,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 454 [2024-11-09 06:59:29,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:29,992 INFO L124 PetriNetUnfolderBase]: 231/1986 cut-off events. [2024-11-09 06:59:29,993 INFO L125 PetriNetUnfolderBase]: For 51/53 co-relation queries the response was YES. [2024-11-09 06:59:30,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2492 conditions, 1986 events. 231/1986 cut-off events. For 51/53 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 13110 event pairs, 76 based on Foata normal form. 0/1789 useless extension candidates. Maximal degree in co-relation 2096. Up to 364 conditions per place. [2024-11-09 06:59:30,024 INFO L140 encePairwiseOnDemand]: 448/454 looper letters, 17 selfloop transitions, 2 changer transitions 0/404 dead transitions. [2024-11-09 06:59:30,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 404 transitions, 934 flow [2024-11-09 06:59:30,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:30,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:30,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1283 transitions. [2024-11-09 06:59:30,028 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9419970631424376 [2024-11-09 06:59:30,028 INFO L175 Difference]: Start difference. First operand has 413 places, 404 transitions, 894 flow. Second operand 3 states and 1283 transitions. [2024-11-09 06:59:30,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 404 transitions, 934 flow [2024-11-09 06:59:30,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 404 transitions, 934 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:59:30,036 INFO L231 Difference]: Finished difference. Result has 412 places, 402 transitions, 900 flow [2024-11-09 06:59:30,036 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=900, PETRI_PLACES=412, PETRI_TRANSITIONS=402} [2024-11-09 06:59:30,037 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -13 predicate places. [2024-11-09 06:59:30,037 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 402 transitions, 900 flow [2024-11-09 06:59:30,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.6666666666667) internal successors, (1265), 3 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:30,038 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:30,038 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:30,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 06:59:30,038 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-09 06:59:30,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:30,039 INFO L85 PathProgramCache]: Analyzing trace with hash -2049955640, now seen corresponding path program 1 times [2024-11-09 06:59:30,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:30,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329363628] [2024-11-09 06:59:30,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:30,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:30,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:30,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:30,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:30,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329363628] [2024-11-09 06:59:30,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329363628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:30,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:30,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:30,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445880438] [2024-11-09 06:59:30,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:30,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:30,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:30,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:30,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:30,104 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 454 [2024-11-09 06:59:30,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 402 transitions, 900 flow. Second operand has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:30,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:30,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 454 [2024-11-09 06:59:30,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:30,311 INFO L124 PetriNetUnfolderBase]: 55/1300 cut-off events. [2024-11-09 06:59:30,311 INFO L125 PetriNetUnfolderBase]: For 7/31 co-relation queries the response was YES. [2024-11-09 06:59:30,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1519 conditions, 1300 events. 55/1300 cut-off events. For 7/31 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6941 event pairs, 4 based on Foata normal form. 4/1205 useless extension candidates. Maximal degree in co-relation 1196. Up to 30 conditions per place. [2024-11-09 06:59:30,328 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 11 selfloop transitions, 2 changer transitions 0/403 dead transitions. [2024-11-09 06:59:30,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 403 transitions, 930 flow [2024-11-09 06:59:30,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:30,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:30,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2024-11-09 06:59:30,331 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9508076358296622 [2024-11-09 06:59:30,331 INFO L175 Difference]: Start difference. First operand has 412 places, 402 transitions, 900 flow. Second operand 3 states and 1295 transitions. [2024-11-09 06:59:30,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 403 transitions, 930 flow [2024-11-09 06:59:30,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 403 transitions, 930 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:59:30,337 INFO L231 Difference]: Finished difference. Result has 413 places, 401 transitions, 902 flow [2024-11-09 06:59:30,338 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=902, PETRI_PLACES=413, PETRI_TRANSITIONS=401} [2024-11-09 06:59:30,338 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -12 predicate places. [2024-11-09 06:59:30,339 INFO L471 AbstractCegarLoop]: Abstraction has has 413 places, 401 transitions, 902 flow [2024-11-09 06:59:30,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:30,339 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:30,339 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:30,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 06:59:30,340 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-09 06:59:30,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:30,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1092350566, now seen corresponding path program 1 times [2024-11-09 06:59:30,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:30,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231312644] [2024-11-09 06:59:30,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:30,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:30,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:30,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:30,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231312644] [2024-11-09 06:59:30,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231312644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:30,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:30,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:30,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624830110] [2024-11-09 06:59:30,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:30,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:30,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:30,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:30,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:30,409 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2024-11-09 06:59:30,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 401 transitions, 902 flow. Second operand has 3 states, 3 states have (on average 427.6666666666667) internal successors, (1283), 3 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:30,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:30,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2024-11-09 06:59:30,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:30,675 INFO L124 PetriNetUnfolderBase]: 81/1576 cut-off events. [2024-11-09 06:59:30,675 INFO L125 PetriNetUnfolderBase]: For 19/31 co-relation queries the response was YES. [2024-11-09 06:59:30,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1889 conditions, 1576 events. 81/1576 cut-off events. For 19/31 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 9341 event pairs, 14 based on Foata normal form. 1/1465 useless extension candidates. Maximal degree in co-relation 1758. Up to 53 conditions per place. [2024-11-09 06:59:30,686 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 12 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2024-11-09 06:59:30,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 402 transitions, 934 flow [2024-11-09 06:59:30,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:30,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:30,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1293 transitions. [2024-11-09 06:59:30,690 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9493392070484582 [2024-11-09 06:59:30,690 INFO L175 Difference]: Start difference. First operand has 413 places, 401 transitions, 902 flow. Second operand 3 states and 1293 transitions. [2024-11-09 06:59:30,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 402 transitions, 934 flow [2024-11-09 06:59:30,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 402 transitions, 930 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:30,698 INFO L231 Difference]: Finished difference. Result has 412 places, 400 transitions, 900 flow [2024-11-09 06:59:30,698 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=900, PETRI_PLACES=412, PETRI_TRANSITIONS=400} [2024-11-09 06:59:30,699 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -13 predicate places. [2024-11-09 06:59:30,699 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 400 transitions, 900 flow [2024-11-09 06:59:30,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.6666666666667) internal successors, (1283), 3 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:30,700 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:30,700 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:59:30,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 06:59:30,700 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-09 06:59:30,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:30,701 INFO L85 PathProgramCache]: Analyzing trace with hash -370909162, now seen corresponding path program 1 times [2024-11-09 06:59:30,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:30,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326122747] [2024-11-09 06:59:30,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:30,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:30,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:30,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:30,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326122747] [2024-11-09 06:59:30,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326122747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:30,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:30,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:30,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792701722] [2024-11-09 06:59:30,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:30,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:30,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:30,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:30,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:30,765 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2024-11-09 06:59:30,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 400 transitions, 900 flow. Second operand has 3 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:30,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:30,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2024-11-09 06:59:30,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:30,960 INFO L124 PetriNetUnfolderBase]: 65/1219 cut-off events. [2024-11-09 06:59:30,960 INFO L125 PetriNetUnfolderBase]: For 25/31 co-relation queries the response was YES. [2024-11-09 06:59:30,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1506 conditions, 1219 events. 65/1219 cut-off events. For 25/31 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 6137 event pairs, 10 based on Foata normal form. 0/1146 useless extension candidates. Maximal degree in co-relation 1397. Up to 63 conditions per place. [2024-11-09 06:59:30,978 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 12 selfloop transitions, 2 changer transitions 0/401 dead transitions. [2024-11-09 06:59:30,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 401 transitions, 932 flow [2024-11-09 06:59:30,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:30,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:30,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1293 transitions. [2024-11-09 06:59:30,981 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9493392070484582 [2024-11-09 06:59:30,981 INFO L175 Difference]: Start difference. First operand has 412 places, 400 transitions, 900 flow. Second operand 3 states and 1293 transitions. [2024-11-09 06:59:30,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 401 transitions, 932 flow [2024-11-09 06:59:30,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 401 transitions, 928 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:30,988 INFO L231 Difference]: Finished difference. Result has 411 places, 399 transitions, 898 flow [2024-11-09 06:59:30,989 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=898, PETRI_PLACES=411, PETRI_TRANSITIONS=399} [2024-11-09 06:59:30,990 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -14 predicate places. [2024-11-09 06:59:30,990 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 399 transitions, 898 flow [2024-11-09 06:59:30,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:30,991 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:30,991 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:30,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 06:59:30,991 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-09 06:59:30,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:30,992 INFO L85 PathProgramCache]: Analyzing trace with hash -433715592, now seen corresponding path program 1 times [2024-11-09 06:59:30,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:30,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857063124] [2024-11-09 06:59:30,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:30,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:31,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:31,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:31,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857063124] [2024-11-09 06:59:31,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857063124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:31,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:31,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:31,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158010874] [2024-11-09 06:59:31,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:31,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:31,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:31,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:31,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:31,092 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 454 [2024-11-09 06:59:31,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 399 transitions, 898 flow. Second operand has 3 states, 3 states have (on average 432.0) internal successors, (1296), 3 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:31,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:31,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 454 [2024-11-09 06:59:31,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:31,291 INFO L124 PetriNetUnfolderBase]: 49/1259 cut-off events. [2024-11-09 06:59:31,292 INFO L125 PetriNetUnfolderBase]: For 7/16 co-relation queries the response was YES. [2024-11-09 06:59:31,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1483 conditions, 1259 events. 49/1259 cut-off events. For 7/16 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 6503 event pairs, 2 based on Foata normal form. 0/1185 useless extension candidates. Maximal degree in co-relation 1326. Up to 30 conditions per place. [2024-11-09 06:59:31,309 INFO L140 encePairwiseOnDemand]: 452/454 looper letters, 8 selfloop transitions, 1 changer transitions 0/398 dead transitions. [2024-11-09 06:59:31,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 398 transitions, 914 flow [2024-11-09 06:59:31,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:31,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:31,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1297 transitions. [2024-11-09 06:59:31,312 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9522760646108663 [2024-11-09 06:59:31,312 INFO L175 Difference]: Start difference. First operand has 411 places, 399 transitions, 898 flow. Second operand 3 states and 1297 transitions. [2024-11-09 06:59:31,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 398 transitions, 914 flow [2024-11-09 06:59:31,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 398 transitions, 910 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:31,319 INFO L231 Difference]: Finished difference. Result has 410 places, 398 transitions, 894 flow [2024-11-09 06:59:31,319 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=410, PETRI_TRANSITIONS=398} [2024-11-09 06:59:31,320 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -15 predicate places. [2024-11-09 06:59:31,320 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 398 transitions, 894 flow [2024-11-09 06:59:31,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 432.0) internal successors, (1296), 3 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:31,321 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:31,321 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:31,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 06:59:31,321 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-09 06:59:31,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:31,322 INFO L85 PathProgramCache]: Analyzing trace with hash 41553439, now seen corresponding path program 1 times [2024-11-09 06:59:31,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:31,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114135433] [2024-11-09 06:59:31,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:31,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:31,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:31,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:31,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:31,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114135433] [2024-11-09 06:59:31,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114135433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:31,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:31,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:31,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008458810] [2024-11-09 06:59:31,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:31,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:31,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:31,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:31,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:31,412 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2024-11-09 06:59:31,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 398 transitions, 894 flow. Second operand has 3 states, 3 states have (on average 429.0) internal successors, (1287), 3 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:31,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:31,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2024-11-09 06:59:31,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:31,693 INFO L124 PetriNetUnfolderBase]: 60/1492 cut-off events. [2024-11-09 06:59:31,693 INFO L125 PetriNetUnfolderBase]: For 7/13 co-relation queries the response was YES. [2024-11-09 06:59:31,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1730 conditions, 1492 events. 60/1492 cut-off events. For 7/13 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 8525 event pairs, 7 based on Foata normal form. 0/1401 useless extension candidates. Maximal degree in co-relation 1694. Up to 36 conditions per place. [2024-11-09 06:59:31,706 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 10 selfloop transitions, 1 changer transitions 0/396 dead transitions. [2024-11-09 06:59:31,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 396 transitions, 912 flow [2024-11-09 06:59:31,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:31,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:31,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1291 transitions. [2024-11-09 06:59:31,709 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9478707782672541 [2024-11-09 06:59:31,710 INFO L175 Difference]: Start difference. First operand has 410 places, 398 transitions, 894 flow. Second operand 3 states and 1291 transitions. [2024-11-09 06:59:31,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 396 transitions, 912 flow [2024-11-09 06:59:31,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 396 transitions, 911 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:59:31,717 INFO L231 Difference]: Finished difference. Result has 409 places, 396 transitions, 891 flow [2024-11-09 06:59:31,717 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=891, PETRI_PLACES=409, PETRI_TRANSITIONS=396} [2024-11-09 06:59:31,718 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -16 predicate places. [2024-11-09 06:59:31,718 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 396 transitions, 891 flow [2024-11-09 06:59:31,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 429.0) internal successors, (1287), 3 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:31,719 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:31,719 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:31,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 06:59:31,720 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-11-09 06:59:31,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:31,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1033353884, now seen corresponding path program 1 times [2024-11-09 06:59:31,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:31,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667102278] [2024-11-09 06:59:31,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:31,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:31,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:31,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:31,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667102278] [2024-11-09 06:59:31,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667102278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:31,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:31,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:31,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780334960] [2024-11-09 06:59:31,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:31,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:31,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:31,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:31,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:31,845 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 454 [2024-11-09 06:59:31,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 396 transitions, 891 flow. Second operand has 3 states, 3 states have (on average 429.0) internal successors, (1287), 3 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:31,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:31,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 454 [2024-11-09 06:59:31,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:32,080 INFO L124 PetriNetUnfolderBase]: 50/1171 cut-off events. [2024-11-09 06:59:32,081 INFO L125 PetriNetUnfolderBase]: For 10/16 co-relation queries the response was YES. [2024-11-09 06:59:32,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1374 conditions, 1171 events. 50/1171 cut-off events. For 10/16 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5851 event pairs, 5 based on Foata normal form. 1/1103 useless extension candidates. Maximal degree in co-relation 1349. Up to 36 conditions per place. [2024-11-09 06:59:32,096 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 0 selfloop transitions, 0 changer transitions 394/394 dead transitions. [2024-11-09 06:59:32,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 394 transitions, 907 flow [2024-11-09 06:59:32,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:32,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:32,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1290 transitions. [2024-11-09 06:59:32,100 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.947136563876652 [2024-11-09 06:59:32,100 INFO L175 Difference]: Start difference. First operand has 409 places, 396 transitions, 891 flow. Second operand 3 states and 1290 transitions. [2024-11-09 06:59:32,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 394 transitions, 907 flow [2024-11-09 06:59:32,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 394 transitions, 906 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:59:32,105 INFO L231 Difference]: Finished difference. Result has 408 places, 0 transitions, 0 flow [2024-11-09 06:59:32,106 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=408, PETRI_TRANSITIONS=0} [2024-11-09 06:59:32,106 INFO L277 CegarLoopForPetriNet]: 425 programPoint places, -17 predicate places. [2024-11-09 06:59:32,106 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 0 transitions, 0 flow [2024-11-09 06:59:32,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 429.0) internal successors, (1287), 3 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:32,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (70 of 71 remaining) [2024-11-09 06:59:32,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (69 of 71 remaining) [2024-11-09 06:59:32,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (68 of 71 remaining) [2024-11-09 06:59:32,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (67 of 71 remaining) [2024-11-09 06:59:32,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (66 of 71 remaining) [2024-11-09 06:59:32,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (65 of 71 remaining) [2024-11-09 06:59:32,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (64 of 71 remaining) [2024-11-09 06:59:32,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (63 of 71 remaining) [2024-11-09 06:59:32,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (62 of 71 remaining) [2024-11-09 06:59:32,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (61 of 71 remaining) [2024-11-09 06:59:32,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (60 of 71 remaining) [2024-11-09 06:59:32,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (59 of 71 remaining) [2024-11-09 06:59:32,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (58 of 71 remaining) [2024-11-09 06:59:32,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (57 of 71 remaining) [2024-11-09 06:59:32,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (56 of 71 remaining) [2024-11-09 06:59:32,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (55 of 71 remaining) [2024-11-09 06:59:32,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (54 of 71 remaining) [2024-11-09 06:59:32,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (53 of 71 remaining) [2024-11-09 06:59:32,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (52 of 71 remaining) [2024-11-09 06:59:32,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (51 of 71 remaining) [2024-11-09 06:59:32,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (50 of 71 remaining) [2024-11-09 06:59:32,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (49 of 71 remaining) [2024-11-09 06:59:32,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (48 of 71 remaining) [2024-11-09 06:59:32,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (47 of 71 remaining) [2024-11-09 06:59:32,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (46 of 71 remaining) [2024-11-09 06:59:32,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (45 of 71 remaining) [2024-11-09 06:59:32,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (44 of 71 remaining) [2024-11-09 06:59:32,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (43 of 71 remaining) [2024-11-09 06:59:32,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (42 of 71 remaining) [2024-11-09 06:59:32,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (41 of 71 remaining) [2024-11-09 06:59:32,125 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (40 of 71 remaining) [2024-11-09 06:59:32,125 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (39 of 71 remaining) [2024-11-09 06:59:32,125 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (38 of 71 remaining) [2024-11-09 06:59:32,126 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (37 of 71 remaining) [2024-11-09 06:59:32,126 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (36 of 71 remaining) [2024-11-09 06:59:32,126 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (35 of 71 remaining) [2024-11-09 06:59:32,126 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (34 of 71 remaining) [2024-11-09 06:59:32,126 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (33 of 71 remaining) [2024-11-09 06:59:32,126 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (32 of 71 remaining) [2024-11-09 06:59:32,126 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (31 of 71 remaining) [2024-11-09 06:59:32,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (30 of 71 remaining) [2024-11-09 06:59:32,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 71 remaining) [2024-11-09 06:59:32,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 71 remaining) [2024-11-09 06:59:32,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 71 remaining) [2024-11-09 06:59:32,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (26 of 71 remaining) [2024-11-09 06:59:32,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (25 of 71 remaining) [2024-11-09 06:59:32,128 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (24 of 71 remaining) [2024-11-09 06:59:32,128 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (23 of 71 remaining) [2024-11-09 06:59:32,128 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (22 of 71 remaining) [2024-11-09 06:59:32,128 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (21 of 71 remaining) [2024-11-09 06:59:32,128 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (20 of 71 remaining) [2024-11-09 06:59:32,128 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (19 of 71 remaining) [2024-11-09 06:59:32,128 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (18 of 71 remaining) [2024-11-09 06:59:32,128 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (17 of 71 remaining) [2024-11-09 06:59:32,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (16 of 71 remaining) [2024-11-09 06:59:32,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (15 of 71 remaining) [2024-11-09 06:59:32,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (14 of 71 remaining) [2024-11-09 06:59:32,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (13 of 71 remaining) [2024-11-09 06:59:32,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (12 of 71 remaining) [2024-11-09 06:59:32,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (11 of 71 remaining) [2024-11-09 06:59:32,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (10 of 71 remaining) [2024-11-09 06:59:32,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (9 of 71 remaining) [2024-11-09 06:59:32,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (8 of 71 remaining) [2024-11-09 06:59:32,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (7 of 71 remaining) [2024-11-09 06:59:32,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (6 of 71 remaining) [2024-11-09 06:59:32,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (5 of 71 remaining) [2024-11-09 06:59:32,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 71 remaining) [2024-11-09 06:59:32,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (3 of 71 remaining) [2024-11-09 06:59:32,135 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (2 of 71 remaining) [2024-11-09 06:59:32,135 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (1 of 71 remaining) [2024-11-09 06:59:32,135 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (0 of 71 remaining) [2024-11-09 06:59:32,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 06:59:32,135 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:32,149 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 06:59:32,149 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 06:59:32,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:59:32 BasicIcfg [2024-11-09 06:59:32,154 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 06:59:32,156 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 06:59:32,156 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 06:59:32,156 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 06:59:32,156 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:59:23" (3/4) ... [2024-11-09 06:59:32,158 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 06:59:32,161 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-09 06:59:32,161 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-09 06:59:32,161 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-09 06:59:32,169 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-09 06:59:32,170 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 06:59:32,170 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 06:59:32,171 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 06:59:32,273 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 06:59:32,273 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 06:59:32,273 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 06:59:32,274 INFO L158 Benchmark]: Toolchain (without parser) took 10161.15ms. Allocated memory was 188.7MB in the beginning and 574.6MB in the end (delta: 385.9MB). Free memory was 122.7MB in the beginning and 338.3MB in the end (delta: -215.6MB). Peak memory consumption was 172.5MB. Max. memory is 16.1GB. [2024-11-09 06:59:32,274 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 109.1MB. Free memory is still 73.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:59:32,274 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.27ms. Allocated memory is still 188.7MB. Free memory was 122.4MB in the beginning and 108.3MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 06:59:32,274 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.54ms. Allocated memory is still 188.7MB. Free memory was 108.3MB in the beginning and 160.8MB in the end (delta: -52.5MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2024-11-09 06:59:32,275 INFO L158 Benchmark]: Boogie Preprocessor took 66.11ms. Allocated memory is still 188.7MB. Free memory was 160.8MB in the beginning and 158.9MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 06:59:32,275 INFO L158 Benchmark]: RCFGBuilder took 788.41ms. Allocated memory is still 188.7MB. Free memory was 158.4MB in the beginning and 127.6MB in the end (delta: 30.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-09 06:59:32,275 INFO L158 Benchmark]: TraceAbstraction took 8833.11ms. Allocated memory was 188.7MB in the beginning and 574.6MB in the end (delta: 385.9MB). Free memory was 127.0MB in the beginning and 343.6MB in the end (delta: -216.6MB). Peak memory consumption was 171.4MB. Max. memory is 16.1GB. [2024-11-09 06:59:32,276 INFO L158 Benchmark]: Witness Printer took 117.46ms. Allocated memory is still 574.6MB. Free memory was 343.6MB in the beginning and 338.3MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 06:59:32,277 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 109.1MB. Free memory is still 73.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.27ms. Allocated memory is still 188.7MB. Free memory was 122.4MB in the beginning and 108.3MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.54ms. Allocated memory is still 188.7MB. Free memory was 108.3MB in the beginning and 160.8MB in the end (delta: -52.5MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.11ms. Allocated memory is still 188.7MB. Free memory was 160.8MB in the beginning and 158.9MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 788.41ms. Allocated memory is still 188.7MB. Free memory was 158.4MB in the beginning and 127.6MB in the end (delta: 30.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8833.11ms. Allocated memory was 188.7MB in the beginning and 574.6MB in the end (delta: 385.9MB). Free memory was 127.0MB in the beginning and 343.6MB in the end (delta: -216.6MB). Peak memory consumption was 171.4MB. Max. memory is 16.1GB. * Witness Printer took 117.46ms. Allocated memory is still 574.6MB. Free memory was 343.6MB in the beginning and 338.3MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 710 locations, 71 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: 8.6s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 527 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 168 mSDsluCounter, 129 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 642 IncrementalHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 129 mSDtfsCounter, 642 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=902occurred in iteration=19, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 3270 NumberOfCodeBlocks, 3270 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 3246 ConstructedInterpolants, 0 QuantifiedInterpolants, 3294 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 41 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-09 06:59:32,307 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