./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-exp-term-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-exp-term-symm.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a6cef8f51d4b8dff634e07872101a48e47fb1f63ea17b45a5f4511bf6a262ddb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:56:56,750 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:56:56,848 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-19 05:56:56,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:56:56,852 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:56:56,877 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:56:56,880 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:56:56,881 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:56:56,881 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:56:56,882 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:56:56,884 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:56:56,884 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:56:56,884 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:56:56,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:56:56,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:56:56,887 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:56:56,887 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:56:56,887 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:56:56,887 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:56:56,888 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:56:56,888 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:56:56,891 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:56:56,891 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 05:56:56,891 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:56:56,891 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 05:56:56,892 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:56:56,892 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:56:56,892 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:56:56,892 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:56:56,892 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:56:56,893 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:56:56,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:56:56,893 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:56:56,893 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:56:56,893 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:56:56,894 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:56:56,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:56:56,894 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:56:56,896 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:56:56,896 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:56:56,896 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:56:56,897 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 -> a6cef8f51d4b8dff634e07872101a48e47fb1f63ea17b45a5f4511bf6a262ddb [2024-11-19 05:56:57,129 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:56:57,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:56:57,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:56:57,160 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:56:57,161 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:56:57,162 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-exp-term-symm.wvr.c [2024-11-19 05:56:58,569 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:56:58,772 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:56:58,773 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-exp-term-symm.wvr.c [2024-11-19 05:56:58,788 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30d7cfe76/128660ec91dc46a7a804b6c2fa6c73ab/FLAG664f865b2 [2024-11-19 05:56:59,147 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30d7cfe76/128660ec91dc46a7a804b6c2fa6c73ab [2024-11-19 05:56:59,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:56:59,150 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:56:59,153 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:56:59,153 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:56:59,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:56:59,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:56:59" (1/1) ... [2024-11-19 05:56:59,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3884102c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:59, skipping insertion in model container [2024-11-19 05:56:59,160 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:56:59" (1/1) ... [2024-11-19 05:56:59,186 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:56:59,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:56:59,516 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:56:59,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:56:59,570 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:56:59,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:59 WrapperNode [2024-11-19 05:56:59,571 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:56:59,572 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:56:59,572 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:56:59,572 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:56:59,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:59" (1/1) ... [2024-11-19 05:56:59,586 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:59" (1/1) ... [2024-11-19 05:56:59,618 INFO L138 Inliner]: procedures = 21, calls = 16, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 237 [2024-11-19 05:56:59,619 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:56:59,620 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:56:59,620 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:56:59,620 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:56:59,629 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:59" (1/1) ... [2024-11-19 05:56:59,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:59" (1/1) ... [2024-11-19 05:56:59,632 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:59" (1/1) ... [2024-11-19 05:56:59,632 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:59" (1/1) ... [2024-11-19 05:56:59,639 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:59" (1/1) ... [2024-11-19 05:56:59,646 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:59" (1/1) ... [2024-11-19 05:56:59,649 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:59" (1/1) ... [2024-11-19 05:56:59,650 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:59" (1/1) ... [2024-11-19 05:56:59,653 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:56:59,654 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:56:59,654 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:56:59,654 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:56:59,655 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:59" (1/1) ... [2024-11-19 05:56:59,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:56:59,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:56:59,696 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-19 05:56:59,702 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-19 05:56:59,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:56:59,751 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 05:56:59,751 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 05:56:59,751 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 05:56:59,751 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 05:56:59,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 05:56:59,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:56:59,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:56:59,753 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 05:56:59,867 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:56:59,871 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:57:00,329 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 05:57:00,329 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:57:00,352 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:57:00,352 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 05:57:00,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:57:00 BoogieIcfgContainer [2024-11-19 05:57:00,353 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:57:00,355 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:57:00,355 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:57:00,357 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:57:00,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:56:59" (1/3) ... [2024-11-19 05:57:00,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f399d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:57:00, skipping insertion in model container [2024-11-19 05:57:00,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:59" (2/3) ... [2024-11-19 05:57:00,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f399d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:57:00, skipping insertion in model container [2024-11-19 05:57:00,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:57:00" (3/3) ... [2024-11-19 05:57:00,359 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-exp-term-symm.wvr.c [2024-11-19 05:57:00,376 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:57:00,376 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2024-11-19 05:57:00,376 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 05:57:00,489 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-19 05:57:00,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 310 places, 325 transitions, 664 flow [2024-11-19 05:57:00,680 INFO L124 PetriNetUnfolderBase]: 22/323 cut-off events. [2024-11-19 05:57:00,680 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 05:57:00,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 332 conditions, 323 events. 22/323 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 770 event pairs, 0 based on Foata normal form. 0/269 useless extension candidates. Maximal degree in co-relation 202. Up to 2 conditions per place. [2024-11-19 05:57:00,693 INFO L82 GeneralOperation]: Start removeDead. Operand has 310 places, 325 transitions, 664 flow [2024-11-19 05:57:00,705 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 290 places, 303 transitions, 618 flow [2024-11-19 05:57:00,717 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:57:00,726 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;@70266acc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:57:00,726 INFO L334 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2024-11-19 05:57:00,733 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:57:00,733 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2024-11-19 05:57:00,733 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:57:00,733 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:00,734 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:57:00,735 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2024-11-19 05:57:00,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:00,740 INFO L85 PathProgramCache]: Analyzing trace with hash 673294805, now seen corresponding path program 1 times [2024-11-19 05:57:00,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:00,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581245454] [2024-11-19 05:57:00,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:00,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:00,929 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-19 05:57:00,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:00,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581245454] [2024-11-19 05:57:00,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581245454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:00,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:00,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:00,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257414088] [2024-11-19 05:57:00,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:00,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:00,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:00,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:00,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:01,005 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 325 [2024-11-19 05:57:01,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 303 transitions, 618 flow. Second operand has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 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-19 05:57:01,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:01,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 325 [2024-11-19 05:57:01,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:01,133 INFO L124 PetriNetUnfolderBase]: 39/568 cut-off events. [2024-11-19 05:57:01,134 INFO L125 PetriNetUnfolderBase]: For 17/18 co-relation queries the response was YES. [2024-11-19 05:57:01,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 616 conditions, 568 events. 39/568 cut-off events. For 17/18 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2575 event pairs, 8 based on Foata normal form. 16/481 useless extension candidates. Maximal degree in co-relation 419. Up to 30 conditions per place. [2024-11-19 05:57:01,146 INFO L140 encePairwiseOnDemand]: 316/325 looper letters, 11 selfloop transitions, 2 changer transitions 2/296 dead transitions. [2024-11-19 05:57:01,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 296 transitions, 630 flow [2024-11-19 05:57:01,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:01,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:01,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 926 transitions. [2024-11-19 05:57:01,167 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9497435897435897 [2024-11-19 05:57:01,169 INFO L175 Difference]: Start difference. First operand has 290 places, 303 transitions, 618 flow. Second operand 3 states and 926 transitions. [2024-11-19 05:57:01,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 296 transitions, 630 flow [2024-11-19 05:57:01,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 296 transitions, 622 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 05:57:01,181 INFO L231 Difference]: Finished difference. Result has 287 places, 294 transitions, 596 flow [2024-11-19 05:57:01,184 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=596, PETRI_PLACES=287, PETRI_TRANSITIONS=294} [2024-11-19 05:57:01,190 INFO L277 CegarLoopForPetriNet]: 290 programPoint places, -3 predicate places. [2024-11-19 05:57:01,191 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 294 transitions, 596 flow [2024-11-19 05:57:01,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 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-19 05:57:01,192 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:01,192 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:57:01,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:57:01,193 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2024-11-19 05:57:01,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:01,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1390746223, now seen corresponding path program 1 times [2024-11-19 05:57:01,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:01,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973655596] [2024-11-19 05:57:01,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:01,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:01,265 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-19 05:57:01,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:01,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973655596] [2024-11-19 05:57:01,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973655596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:01,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:01,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:01,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146255576] [2024-11-19 05:57:01,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:01,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:01,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:01,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:01,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:01,316 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 325 [2024-11-19 05:57:01,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 294 transitions, 596 flow. Second operand has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 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-19 05:57:01,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:01,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 325 [2024-11-19 05:57:01,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:01,428 INFO L124 PetriNetUnfolderBase]: 39/568 cut-off events. [2024-11-19 05:57:01,429 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2024-11-19 05:57:01,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 568 events. 39/568 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2569 event pairs, 8 based on Foata normal form. 0/467 useless extension candidates. Maximal degree in co-relation 578. Up to 30 conditions per place. [2024-11-19 05:57:01,434 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 11 selfloop transitions, 2 changer transitions 0/293 dead transitions. [2024-11-19 05:57:01,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 293 transitions, 620 flow [2024-11-19 05:57:01,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:01,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:01,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 920 transitions. [2024-11-19 05:57:01,438 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9435897435897436 [2024-11-19 05:57:01,438 INFO L175 Difference]: Start difference. First operand has 287 places, 294 transitions, 596 flow. Second operand 3 states and 920 transitions. [2024-11-19 05:57:01,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 293 transitions, 620 flow [2024-11-19 05:57:01,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 293 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:01,447 INFO L231 Difference]: Finished difference. Result has 284 places, 293 transitions, 594 flow [2024-11-19 05:57:01,450 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=594, PETRI_PLACES=284, PETRI_TRANSITIONS=293} [2024-11-19 05:57:01,450 INFO L277 CegarLoopForPetriNet]: 290 programPoint places, -6 predicate places. [2024-11-19 05:57:01,451 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 293 transitions, 594 flow [2024-11-19 05:57:01,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 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-19 05:57:01,451 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:01,452 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] [2024-11-19 05:57:01,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:57:01,452 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2024-11-19 05:57:01,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:01,454 INFO L85 PathProgramCache]: Analyzing trace with hash -233594283, now seen corresponding path program 1 times [2024-11-19 05:57:01,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:01,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059012395] [2024-11-19 05:57:01,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:01,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:01,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:57:01,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:01,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059012395] [2024-11-19 05:57:01,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059012395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:01,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:01,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:01,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102732233] [2024-11-19 05:57:01,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:01,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:01,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:01,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:01,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:01,595 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 325 [2024-11-19 05:57:01,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 293 transitions, 594 flow. Second operand has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 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-19 05:57:01,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:01,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 325 [2024-11-19 05:57:01,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:01,686 INFO L124 PetriNetUnfolderBase]: 53/682 cut-off events. [2024-11-19 05:57:01,687 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 05:57:01,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 737 conditions, 682 events. 53/682 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3653 event pairs, 15 based on Foata normal form. 0/556 useless extension candidates. Maximal degree in co-relation 699. Up to 44 conditions per place. [2024-11-19 05:57:01,696 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 13 selfloop transitions, 2 changer transitions 0/292 dead transitions. [2024-11-19 05:57:01,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 292 transitions, 622 flow [2024-11-19 05:57:01,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:01,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:01,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 916 transitions. [2024-11-19 05:57:01,699 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9394871794871795 [2024-11-19 05:57:01,699 INFO L175 Difference]: Start difference. First operand has 284 places, 293 transitions, 594 flow. Second operand 3 states and 916 transitions. [2024-11-19 05:57:01,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 292 transitions, 622 flow [2024-11-19 05:57:01,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 292 transitions, 618 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:01,705 INFO L231 Difference]: Finished difference. Result has 283 places, 292 transitions, 592 flow [2024-11-19 05:57:01,706 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=592, PETRI_PLACES=283, PETRI_TRANSITIONS=292} [2024-11-19 05:57:01,706 INFO L277 CegarLoopForPetriNet]: 290 programPoint places, -7 predicate places. [2024-11-19 05:57:01,706 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 292 transitions, 592 flow [2024-11-19 05:57:01,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 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-19 05:57:01,708 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:01,708 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] [2024-11-19 05:57:01,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:57:01,708 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2024-11-19 05:57:01,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:01,709 INFO L85 PathProgramCache]: Analyzing trace with hash 2064059098, now seen corresponding path program 1 times [2024-11-19 05:57:01,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:01,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043051801] [2024-11-19 05:57:01,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:01,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:01,786 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-19 05:57:01,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:01,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043051801] [2024-11-19 05:57:01,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043051801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:01,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:01,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:01,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718528973] [2024-11-19 05:57:01,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:01,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:01,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:01,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:01,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:01,836 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 325 [2024-11-19 05:57:01,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 292 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 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-19 05:57:01,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:01,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 325 [2024-11-19 05:57:01,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:01,938 INFO L124 PetriNetUnfolderBase]: 53/669 cut-off events. [2024-11-19 05:57:01,939 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 05:57:01,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 724 conditions, 669 events. 53/669 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3632 event pairs, 15 based on Foata normal form. 0/549 useless extension candidates. Maximal degree in co-relation 678. Up to 44 conditions per place. [2024-11-19 05:57:01,945 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 13 selfloop transitions, 2 changer transitions 0/291 dead transitions. [2024-11-19 05:57:01,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 291 transitions, 620 flow [2024-11-19 05:57:01,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:01,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:01,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 916 transitions. [2024-11-19 05:57:01,949 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9394871794871795 [2024-11-19 05:57:01,950 INFO L175 Difference]: Start difference. First operand has 283 places, 292 transitions, 592 flow. Second operand 3 states and 916 transitions. [2024-11-19 05:57:01,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 291 transitions, 620 flow [2024-11-19 05:57:01,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 291 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:01,955 INFO L231 Difference]: Finished difference. Result has 282 places, 291 transitions, 590 flow [2024-11-19 05:57:01,955 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=590, PETRI_PLACES=282, PETRI_TRANSITIONS=291} [2024-11-19 05:57:01,957 INFO L277 CegarLoopForPetriNet]: 290 programPoint places, -8 predicate places. [2024-11-19 05:57:01,957 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 291 transitions, 590 flow [2024-11-19 05:57:01,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 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-19 05:57:01,958 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:01,958 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:57:01,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:57:01,959 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2024-11-19 05:57:01,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:01,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1269218742, now seen corresponding path program 1 times [2024-11-19 05:57:01,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:01,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386788270] [2024-11-19 05:57:01,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:01,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:01,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:02,022 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-19 05:57:02,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:02,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386788270] [2024-11-19 05:57:02,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386788270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:02,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:02,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:02,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317818787] [2024-11-19 05:57:02,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:02,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:02,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:02,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:02,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:02,056 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 325 [2024-11-19 05:57:02,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 291 transitions, 590 flow. Second operand has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 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-19 05:57:02,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:02,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 325 [2024-11-19 05:57:02,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:02,177 INFO L124 PetriNetUnfolderBase]: 116/1116 cut-off events. [2024-11-19 05:57:02,177 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-19 05:57:02,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1242 conditions, 1116 events. 116/1116 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 7568 event pairs, 36 based on Foata normal form. 0/931 useless extension candidates. Maximal degree in co-relation 1188. Up to 110 conditions per place. [2024-11-19 05:57:02,186 INFO L140 encePairwiseOnDemand]: 317/325 looper letters, 18 selfloop transitions, 2 changer transitions 0/288 dead transitions. [2024-11-19 05:57:02,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 288 transitions, 625 flow [2024-11-19 05:57:02,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:02,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:02,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 908 transitions. [2024-11-19 05:57:02,188 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9312820512820513 [2024-11-19 05:57:02,188 INFO L175 Difference]: Start difference. First operand has 282 places, 291 transitions, 590 flow. Second operand 3 states and 908 transitions. [2024-11-19 05:57:02,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 288 transitions, 625 flow [2024-11-19 05:57:02,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 288 transitions, 621 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:02,193 INFO L231 Difference]: Finished difference. Result has 277 places, 287 transitions, 588 flow [2024-11-19 05:57:02,194 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=588, PETRI_PLACES=277, PETRI_TRANSITIONS=287} [2024-11-19 05:57:02,195 INFO L277 CegarLoopForPetriNet]: 290 programPoint places, -13 predicate places. [2024-11-19 05:57:02,195 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 287 transitions, 588 flow [2024-11-19 05:57:02,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 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-19 05:57:02,196 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:02,196 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:57:02,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:57:02,196 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2024-11-19 05:57:02,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:02,197 INFO L85 PathProgramCache]: Analyzing trace with hash -51476264, now seen corresponding path program 1 times [2024-11-19 05:57:02,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:02,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732336205] [2024-11-19 05:57:02,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:02,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:02,253 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-19 05:57:02,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:02,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732336205] [2024-11-19 05:57:02,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732336205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:02,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:02,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:02,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967256769] [2024-11-19 05:57:02,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:02,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:02,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:02,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:02,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:02,280 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 325 [2024-11-19 05:57:02,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 287 transitions, 588 flow. Second operand has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 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-19 05:57:02,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:02,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 325 [2024-11-19 05:57:02,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:02,410 INFO L124 PetriNetUnfolderBase]: 145/1395 cut-off events. [2024-11-19 05:57:02,411 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-19 05:57:02,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1548 conditions, 1395 events. 145/1395 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 10386 event pairs, 36 based on Foata normal form. 0/1185 useless extension candidates. Maximal degree in co-relation 1393. Up to 128 conditions per place. [2024-11-19 05:57:02,420 INFO L140 encePairwiseOnDemand]: 317/325 looper letters, 18 selfloop transitions, 2 changer transitions 0/284 dead transitions. [2024-11-19 05:57:02,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 284 transitions, 623 flow [2024-11-19 05:57:02,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:02,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:02,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 908 transitions. [2024-11-19 05:57:02,423 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9312820512820513 [2024-11-19 05:57:02,423 INFO L175 Difference]: Start difference. First operand has 277 places, 287 transitions, 588 flow. Second operand 3 states and 908 transitions. [2024-11-19 05:57:02,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 284 transitions, 623 flow [2024-11-19 05:57:02,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 284 transitions, 623 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:57:02,427 INFO L231 Difference]: Finished difference. Result has 274 places, 283 transitions, 590 flow [2024-11-19 05:57:02,428 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=590, PETRI_PLACES=274, PETRI_TRANSITIONS=283} [2024-11-19 05:57:02,428 INFO L277 CegarLoopForPetriNet]: 290 programPoint places, -16 predicate places. [2024-11-19 05:57:02,429 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 283 transitions, 590 flow [2024-11-19 05:57:02,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 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-19 05:57:02,430 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:02,430 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] [2024-11-19 05:57:02,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:57:02,430 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2024-11-19 05:57:02,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:02,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1451095893, now seen corresponding path program 1 times [2024-11-19 05:57:02,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:02,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568592838] [2024-11-19 05:57:02,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:02,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:02,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:02,479 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-19 05:57:02,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:02,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568592838] [2024-11-19 05:57:02,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568592838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:02,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:02,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:57:02,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780008439] [2024-11-19 05:57:02,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:02,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:02,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:02,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:02,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:02,492 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 325 [2024-11-19 05:57:02,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 283 transitions, 590 flow. Second operand has 3 states, 3 states have (on average 307.3333333333333) internal successors, (922), 3 states have internal predecessors, (922), 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-19 05:57:02,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:02,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 325 [2024-11-19 05:57:02,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:02,553 INFO L124 PetriNetUnfolderBase]: 41/561 cut-off events. [2024-11-19 05:57:02,553 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 05:57:02,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 616 conditions, 561 events. 41/561 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2846 event pairs, 5 based on Foata normal form. 0/487 useless extension candidates. Maximal degree in co-relation 465. Up to 22 conditions per place. [2024-11-19 05:57:02,559 INFO L140 encePairwiseOnDemand]: 321/325 looper letters, 11 selfloop transitions, 3 changer transitions 0/286 dead transitions. [2024-11-19 05:57:02,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 286 transitions, 625 flow [2024-11-19 05:57:02,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:02,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:02,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 933 transitions. [2024-11-19 05:57:02,562 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9569230769230769 [2024-11-19 05:57:02,562 INFO L175 Difference]: Start difference. First operand has 274 places, 283 transitions, 590 flow. Second operand 3 states and 933 transitions. [2024-11-19 05:57:02,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 286 transitions, 625 flow [2024-11-19 05:57:02,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 286 transitions, 625 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:57:02,568 INFO L231 Difference]: Finished difference. Result has 278 places, 285 transitions, 612 flow [2024-11-19 05:57:02,568 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=612, PETRI_PLACES=278, PETRI_TRANSITIONS=285} [2024-11-19 05:57:02,569 INFO L277 CegarLoopForPetriNet]: 290 programPoint places, -12 predicate places. [2024-11-19 05:57:02,569 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 285 transitions, 612 flow [2024-11-19 05:57:02,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 307.3333333333333) internal successors, (922), 3 states have internal predecessors, (922), 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-19 05:57:02,571 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:02,572 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] [2024-11-19 05:57:02,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:57:02,572 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2024-11-19 05:57:02,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:02,573 INFO L85 PathProgramCache]: Analyzing trace with hash 507844781, now seen corresponding path program 1 times [2024-11-19 05:57:02,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:02,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427656892] [2024-11-19 05:57:02,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:02,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:02,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:02,639 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-19 05:57:02,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:02,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427656892] [2024-11-19 05:57:02,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427656892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:02,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:02,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:02,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428583754] [2024-11-19 05:57:02,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:02,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:02,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:02,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:02,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:02,658 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 325 [2024-11-19 05:57:02,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 285 transitions, 612 flow. Second operand has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 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-19 05:57:02,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:02,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 325 [2024-11-19 05:57:02,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:02,794 INFO L124 PetriNetUnfolderBase]: 103/1220 cut-off events. [2024-11-19 05:57:02,795 INFO L125 PetriNetUnfolderBase]: For 22/23 co-relation queries the response was YES. [2024-11-19 05:57:02,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1370 conditions, 1220 events. 103/1220 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 8360 event pairs, 8 based on Foata normal form. 0/1071 useless extension candidates. Maximal degree in co-relation 1178. Up to 87 conditions per place. [2024-11-19 05:57:02,805 INFO L140 encePairwiseOnDemand]: 317/325 looper letters, 16 selfloop transitions, 4 changer transitions 0/288 dead transitions. [2024-11-19 05:57:02,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 288 transitions, 661 flow [2024-11-19 05:57:02,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:02,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:02,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 924 transitions. [2024-11-19 05:57:02,808 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9476923076923077 [2024-11-19 05:57:02,808 INFO L175 Difference]: Start difference. First operand has 278 places, 285 transitions, 612 flow. Second operand 3 states and 924 transitions. [2024-11-19 05:57:02,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 288 transitions, 661 flow [2024-11-19 05:57:02,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 288 transitions, 655 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:02,814 INFO L231 Difference]: Finished difference. Result has 275 places, 285 transitions, 626 flow [2024-11-19 05:57:02,815 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=275, PETRI_TRANSITIONS=285} [2024-11-19 05:57:02,818 INFO L277 CegarLoopForPetriNet]: 290 programPoint places, -15 predicate places. [2024-11-19 05:57:02,819 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 285 transitions, 626 flow [2024-11-19 05:57:02,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 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-19 05:57:02,820 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:02,820 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-19 05:57:02,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 05:57:02,820 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2024-11-19 05:57:02,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:02,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1587410957, now seen corresponding path program 1 times [2024-11-19 05:57:02,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:02,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746664322] [2024-11-19 05:57:02,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:02,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:02,890 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-19 05:57:02,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:02,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746664322] [2024-11-19 05:57:02,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746664322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:02,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:02,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:02,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915938117] [2024-11-19 05:57:02,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:02,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:02,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:02,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:02,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:02,919 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 325 [2024-11-19 05:57:02,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 285 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 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-19 05:57:02,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:02,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 325 [2024-11-19 05:57:02,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:03,054 INFO L124 PetriNetUnfolderBase]: 123/1346 cut-off events. [2024-11-19 05:57:03,054 INFO L125 PetriNetUnfolderBase]: For 13/14 co-relation queries the response was YES. [2024-11-19 05:57:03,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1547 conditions, 1346 events. 123/1346 cut-off events. For 13/14 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 9792 event pairs, 14 based on Foata normal form. 0/1198 useless extension candidates. Maximal degree in co-relation 1352. Up to 99 conditions per place. [2024-11-19 05:57:03,067 INFO L140 encePairwiseOnDemand]: 317/325 looper letters, 16 selfloop transitions, 4 changer transitions 0/288 dead transitions. [2024-11-19 05:57:03,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 288 transitions, 675 flow [2024-11-19 05:57:03,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:03,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:03,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 924 transitions. [2024-11-19 05:57:03,070 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9476923076923077 [2024-11-19 05:57:03,070 INFO L175 Difference]: Start difference. First operand has 275 places, 285 transitions, 626 flow. Second operand 3 states and 924 transitions. [2024-11-19 05:57:03,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 288 transitions, 675 flow [2024-11-19 05:57:03,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 288 transitions, 675 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:57:03,076 INFO L231 Difference]: Finished difference. Result has 274 places, 285 transitions, 646 flow [2024-11-19 05:57:03,076 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=646, PETRI_PLACES=274, PETRI_TRANSITIONS=285} [2024-11-19 05:57:03,077 INFO L277 CegarLoopForPetriNet]: 290 programPoint places, -16 predicate places. [2024-11-19 05:57:03,077 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 285 transitions, 646 flow [2024-11-19 05:57:03,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 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-19 05:57:03,078 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:03,078 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-19 05:57:03,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 05:57:03,078 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2024-11-19 05:57:03,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:03,079 INFO L85 PathProgramCache]: Analyzing trace with hash 588439863, now seen corresponding path program 1 times [2024-11-19 05:57:03,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:03,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817481210] [2024-11-19 05:57:03,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:03,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:03,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:03,144 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-19 05:57:03,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:03,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817481210] [2024-11-19 05:57:03,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817481210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:03,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:03,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:03,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640666502] [2024-11-19 05:57:03,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:03,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:03,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:03,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:03,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:03,174 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 325 [2024-11-19 05:57:03,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 285 transitions, 646 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 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-19 05:57:03,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:03,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 325 [2024-11-19 05:57:03,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:03,299 INFO L124 PetriNetUnfolderBase]: 110/1245 cut-off events. [2024-11-19 05:57:03,299 INFO L125 PetriNetUnfolderBase]: For 4/12 co-relation queries the response was YES. [2024-11-19 05:57:03,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1455 conditions, 1245 events. 110/1245 cut-off events. For 4/12 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 8545 event pairs, 6 based on Foata normal form. 2/1118 useless extension candidates. Maximal degree in co-relation 1261. Up to 38 conditions per place. [2024-11-19 05:57:03,310 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 10 selfloop transitions, 2 changer transitions 0/285 dead transitions. [2024-11-19 05:57:03,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 285 transitions, 671 flow [2024-11-19 05:57:03,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:03,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:03,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 928 transitions. [2024-11-19 05:57:03,312 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9517948717948718 [2024-11-19 05:57:03,312 INFO L175 Difference]: Start difference. First operand has 274 places, 285 transitions, 646 flow. Second operand 3 states and 928 transitions. [2024-11-19 05:57:03,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 285 transitions, 671 flow [2024-11-19 05:57:03,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 285 transitions, 671 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:57:03,319 INFO L231 Difference]: Finished difference. Result has 275 places, 284 transitions, 648 flow [2024-11-19 05:57:03,320 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=648, PETRI_PLACES=275, PETRI_TRANSITIONS=284} [2024-11-19 05:57:03,321 INFO L277 CegarLoopForPetriNet]: 290 programPoint places, -15 predicate places. [2024-11-19 05:57:03,321 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 284 transitions, 648 flow [2024-11-19 05:57:03,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 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-19 05:57:03,322 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:03,322 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] [2024-11-19 05:57:03,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 05:57:03,323 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2024-11-19 05:57:03,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:03,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1865929805, now seen corresponding path program 1 times [2024-11-19 05:57:03,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:03,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016655094] [2024-11-19 05:57:03,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:03,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:03,361 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-19 05:57:03,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:03,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016655094] [2024-11-19 05:57:03,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016655094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:03,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:03,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:57:03,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511672744] [2024-11-19 05:57:03,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:03,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:03,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:03,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:03,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:03,379 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 325 [2024-11-19 05:57:03,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 284 transitions, 648 flow. Second operand has 3 states, 3 states have (on average 307.6666666666667) internal successors, (923), 3 states have internal predecessors, (923), 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-19 05:57:03,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:03,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 325 [2024-11-19 05:57:03,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:03,514 INFO L124 PetriNetUnfolderBase]: 104/1158 cut-off events. [2024-11-19 05:57:03,514 INFO L125 PetriNetUnfolderBase]: For 26/28 co-relation queries the response was YES. [2024-11-19 05:57:03,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1391 conditions, 1158 events. 104/1158 cut-off events. For 26/28 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 7743 event pairs, 10 based on Foata normal form. 0/1026 useless extension candidates. Maximal degree in co-relation 1165. Up to 81 conditions per place. [2024-11-19 05:57:03,522 INFO L140 encePairwiseOnDemand]: 321/325 looper letters, 11 selfloop transitions, 3 changer transitions 0/287 dead transitions. [2024-11-19 05:57:03,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 287 transitions, 683 flow [2024-11-19 05:57:03,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:03,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:03,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 933 transitions. [2024-11-19 05:57:03,525 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9569230769230769 [2024-11-19 05:57:03,525 INFO L175 Difference]: Start difference. First operand has 275 places, 284 transitions, 648 flow. Second operand 3 states and 933 transitions. [2024-11-19 05:57:03,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 287 transitions, 683 flow [2024-11-19 05:57:03,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 287 transitions, 679 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:03,532 INFO L231 Difference]: Finished difference. Result has 277 places, 286 transitions, 666 flow [2024-11-19 05:57:03,533 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=666, PETRI_PLACES=277, PETRI_TRANSITIONS=286} [2024-11-19 05:57:03,533 INFO L277 CegarLoopForPetriNet]: 290 programPoint places, -13 predicate places. [2024-11-19 05:57:03,533 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 286 transitions, 666 flow [2024-11-19 05:57:03,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 307.6666666666667) internal successors, (923), 3 states have internal predecessors, (923), 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-19 05:57:03,534 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:03,535 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:57:03,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 05:57:03,536 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2024-11-19 05:57:03,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:03,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1006838745, now seen corresponding path program 1 times [2024-11-19 05:57:03,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:03,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309416438] [2024-11-19 05:57:03,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:03,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:03,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:03,596 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-19 05:57:03,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:03,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309416438] [2024-11-19 05:57:03,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309416438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:03,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:03,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:03,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319485481] [2024-11-19 05:57:03,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:03,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:03,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:03,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:03,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:03,619 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 325 [2024-11-19 05:57:03,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 286 transitions, 666 flow. Second operand has 3 states, 3 states have (on average 306.6666666666667) internal successors, (920), 3 states have internal predecessors, (920), 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-19 05:57:03,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:03,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 325 [2024-11-19 05:57:03,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:03,743 INFO L124 PetriNetUnfolderBase]: 104/1038 cut-off events. [2024-11-19 05:57:03,743 INFO L125 PetriNetUnfolderBase]: For 57/59 co-relation queries the response was YES. [2024-11-19 05:57:03,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1349 conditions, 1038 events. 104/1038 cut-off events. For 57/59 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 6720 event pairs, 6 based on Foata normal form. 0/954 useless extension candidates. Maximal degree in co-relation 1111. Up to 65 conditions per place. [2024-11-19 05:57:03,754 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 10 selfloop transitions, 2 changer transitions 0/286 dead transitions. [2024-11-19 05:57:03,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 286 transitions, 691 flow [2024-11-19 05:57:03,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:03,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:03,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 928 transitions. [2024-11-19 05:57:03,756 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9517948717948718 [2024-11-19 05:57:03,757 INFO L175 Difference]: Start difference. First operand has 277 places, 286 transitions, 666 flow. Second operand 3 states and 928 transitions. [2024-11-19 05:57:03,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 286 transitions, 691 flow [2024-11-19 05:57:03,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 286 transitions, 685 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:03,762 INFO L231 Difference]: Finished difference. Result has 276 places, 285 transitions, 662 flow [2024-11-19 05:57:03,762 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=662, PETRI_PLACES=276, PETRI_TRANSITIONS=285} [2024-11-19 05:57:03,763 INFO L277 CegarLoopForPetriNet]: 290 programPoint places, -14 predicate places. [2024-11-19 05:57:03,763 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 285 transitions, 662 flow [2024-11-19 05:57:03,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.6666666666667) internal successors, (920), 3 states have internal predecessors, (920), 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-19 05:57:03,764 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:03,764 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] [2024-11-19 05:57:03,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 05:57:03,765 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2024-11-19 05:57:03,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:03,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1478838205, now seen corresponding path program 1 times [2024-11-19 05:57:03,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:03,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71589679] [2024-11-19 05:57:03,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:03,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:03,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:03,839 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-19 05:57:03,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:03,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71589679] [2024-11-19 05:57:03,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71589679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:03,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:03,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:03,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792384142] [2024-11-19 05:57:03,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:03,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:03,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:03,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:03,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:03,858 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2024-11-19 05:57:03,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 285 transitions, 662 flow. Second operand has 3 states, 3 states have (on average 305.3333333333333) internal successors, (916), 3 states have internal predecessors, (916), 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-19 05:57:03,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:03,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2024-11-19 05:57:03,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:04,010 INFO L124 PetriNetUnfolderBase]: 99/1287 cut-off events. [2024-11-19 05:57:04,010 INFO L125 PetriNetUnfolderBase]: For 5/10 co-relation queries the response was YES. [2024-11-19 05:57:04,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1574 conditions, 1287 events. 99/1287 cut-off events. For 5/10 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 8980 event pairs, 4 based on Foata normal form. 0/1185 useless extension candidates. Maximal degree in co-relation 1349. Up to 43 conditions per place. [2024-11-19 05:57:04,022 INFO L140 encePairwiseOnDemand]: 321/325 looper letters, 10 selfloop transitions, 1 changer transitions 0/282 dead transitions. [2024-11-19 05:57:04,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 282 transitions, 678 flow [2024-11-19 05:57:04,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:04,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:04,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 923 transitions. [2024-11-19 05:57:04,025 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9466666666666667 [2024-11-19 05:57:04,025 INFO L175 Difference]: Start difference. First operand has 276 places, 285 transitions, 662 flow. Second operand 3 states and 923 transitions. [2024-11-19 05:57:04,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 282 transitions, 678 flow [2024-11-19 05:57:04,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 282 transitions, 674 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:04,030 INFO L231 Difference]: Finished difference. Result has 273 places, 282 transitions, 654 flow [2024-11-19 05:57:04,031 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=654, PETRI_PLACES=273, PETRI_TRANSITIONS=282} [2024-11-19 05:57:04,031 INFO L277 CegarLoopForPetriNet]: 290 programPoint places, -17 predicate places. [2024-11-19 05:57:04,032 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 282 transitions, 654 flow [2024-11-19 05:57:04,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 305.3333333333333) internal successors, (916), 3 states have internal predecessors, (916), 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-19 05:57:04,033 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:04,033 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:57:04,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 05:57:04,033 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2024-11-19 05:57:04,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:04,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1804625381, now seen corresponding path program 1 times [2024-11-19 05:57:04,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:04,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073201827] [2024-11-19 05:57:04,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:04,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:04,073 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-19 05:57:04,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:04,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073201827] [2024-11-19 05:57:04,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073201827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:04,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:04,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:04,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479941035] [2024-11-19 05:57:04,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:04,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:04,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:04,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:04,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:04,092 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2024-11-19 05:57:04,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 282 transitions, 654 flow. Second operand has 3 states, 3 states have (on average 305.3333333333333) internal successors, (916), 3 states have internal predecessors, (916), 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-19 05:57:04,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:04,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2024-11-19 05:57:04,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:04,192 INFO L124 PetriNetUnfolderBase]: 86/1049 cut-off events. [2024-11-19 05:57:04,192 INFO L125 PetriNetUnfolderBase]: For 12/14 co-relation queries the response was YES. [2024-11-19 05:57:04,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1265 conditions, 1049 events. 86/1049 cut-off events. For 12/14 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 6311 event pairs, 4 based on Foata normal form. 2/970 useless extension candidates. Maximal degree in co-relation 1120. Up to 44 conditions per place. [2024-11-19 05:57:04,201 INFO L140 encePairwiseOnDemand]: 319/325 looper letters, 0 selfloop transitions, 0 changer transitions 281/281 dead transitions. [2024-11-19 05:57:04,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 281 transitions, 676 flow [2024-11-19 05:57:04,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:04,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:04,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 924 transitions. [2024-11-19 05:57:04,203 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9476923076923077 [2024-11-19 05:57:04,203 INFO L175 Difference]: Start difference. First operand has 273 places, 282 transitions, 654 flow. Second operand 3 states and 924 transitions. [2024-11-19 05:57:04,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 281 transitions, 676 flow [2024-11-19 05:57:04,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 281 transitions, 675 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:57:04,207 INFO L231 Difference]: Finished difference. Result has 271 places, 0 transitions, 0 flow [2024-11-19 05:57:04,208 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=271, PETRI_TRANSITIONS=0} [2024-11-19 05:57:04,208 INFO L277 CegarLoopForPetriNet]: 290 programPoint places, -19 predicate places. [2024-11-19 05:57:04,209 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 0 transitions, 0 flow [2024-11-19 05:57:04,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 305.3333333333333) internal successors, (916), 3 states have internal predecessors, (916), 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-19 05:57:04,212 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (55 of 56 remaining) [2024-11-19 05:57:04,212 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (54 of 56 remaining) [2024-11-19 05:57:04,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (53 of 56 remaining) [2024-11-19 05:57:04,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (52 of 56 remaining) [2024-11-19 05:57:04,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (51 of 56 remaining) [2024-11-19 05:57:04,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (50 of 56 remaining) [2024-11-19 05:57:04,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (49 of 56 remaining) [2024-11-19 05:57:04,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (48 of 56 remaining) [2024-11-19 05:57:04,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (47 of 56 remaining) [2024-11-19 05:57:04,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (46 of 56 remaining) [2024-11-19 05:57:04,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (45 of 56 remaining) [2024-11-19 05:57:04,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (44 of 56 remaining) [2024-11-19 05:57:04,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (43 of 56 remaining) [2024-11-19 05:57:04,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (42 of 56 remaining) [2024-11-19 05:57:04,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (41 of 56 remaining) [2024-11-19 05:57:04,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (40 of 56 remaining) [2024-11-19 05:57:04,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (39 of 56 remaining) [2024-11-19 05:57:04,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (38 of 56 remaining) [2024-11-19 05:57:04,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (37 of 56 remaining) [2024-11-19 05:57:04,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (36 of 56 remaining) [2024-11-19 05:57:04,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (35 of 56 remaining) [2024-11-19 05:57:04,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (34 of 56 remaining) [2024-11-19 05:57:04,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (33 of 56 remaining) [2024-11-19 05:57:04,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (32 of 56 remaining) [2024-11-19 05:57:04,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (31 of 56 remaining) [2024-11-19 05:57:04,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (30 of 56 remaining) [2024-11-19 05:57:04,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (29 of 56 remaining) [2024-11-19 05:57:04,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (28 of 56 remaining) [2024-11-19 05:57:04,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (27 of 56 remaining) [2024-11-19 05:57:04,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (26 of 56 remaining) [2024-11-19 05:57:04,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (25 of 56 remaining) [2024-11-19 05:57:04,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (24 of 56 remaining) [2024-11-19 05:57:04,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 56 remaining) [2024-11-19 05:57:04,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 56 remaining) [2024-11-19 05:57:04,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (21 of 56 remaining) [2024-11-19 05:57:04,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (20 of 56 remaining) [2024-11-19 05:57:04,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (19 of 56 remaining) [2024-11-19 05:57:04,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (18 of 56 remaining) [2024-11-19 05:57:04,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (17 of 56 remaining) [2024-11-19 05:57:04,217 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (16 of 56 remaining) [2024-11-19 05:57:04,217 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (15 of 56 remaining) [2024-11-19 05:57:04,217 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (14 of 56 remaining) [2024-11-19 05:57:04,217 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (13 of 56 remaining) [2024-11-19 05:57:04,217 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (12 of 56 remaining) [2024-11-19 05:57:04,217 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (11 of 56 remaining) [2024-11-19 05:57:04,217 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (10 of 56 remaining) [2024-11-19 05:57:04,217 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (9 of 56 remaining) [2024-11-19 05:57:04,217 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (8 of 56 remaining) [2024-11-19 05:57:04,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (7 of 56 remaining) [2024-11-19 05:57:04,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (6 of 56 remaining) [2024-11-19 05:57:04,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (5 of 56 remaining) [2024-11-19 05:57:04,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (4 of 56 remaining) [2024-11-19 05:57:04,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (3 of 56 remaining) [2024-11-19 05:57:04,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (2 of 56 remaining) [2024-11-19 05:57:04,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (1 of 56 remaining) [2024-11-19 05:57:04,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (0 of 56 remaining) [2024-11-19 05:57:04,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 05:57:04,220 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:57:04,226 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 05:57:04,226 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 05:57:04,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 05:57:04 BasicIcfg [2024-11-19 05:57:04,232 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 05:57:04,232 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 05:57:04,232 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 05:57:04,236 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 05:57:04,237 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:57:00" (3/4) ... [2024-11-19 05:57:04,239 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 05:57:04,242 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-19 05:57:04,243 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-19 05:57:04,249 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-19 05:57:04,249 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-19 05:57:04,249 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 05:57:04,249 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 05:57:04,339 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 05:57:04,339 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 05:57:04,340 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 05:57:04,340 INFO L158 Benchmark]: Toolchain (without parser) took 5190.40ms. Allocated memory was 159.4MB in the beginning and 249.6MB in the end (delta: 90.2MB). Free memory was 102.3MB in the beginning and 92.4MB in the end (delta: 9.9MB). Peak memory consumption was 99.9MB. Max. memory is 16.1GB. [2024-11-19 05:57:04,340 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory is still 51.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 05:57:04,341 INFO L158 Benchmark]: CACSL2BoogieTranslator took 418.48ms. Allocated memory is still 159.4MB. Free memory was 102.3MB in the beginning and 131.3MB in the end (delta: -29.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 05:57:04,341 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.21ms. Allocated memory is still 159.4MB. Free memory was 131.3MB in the beginning and 129.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 05:57:04,341 INFO L158 Benchmark]: Boogie Preprocessor took 33.50ms. Allocated memory is still 159.4MB. Free memory was 129.2MB in the beginning and 127.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 05:57:04,342 INFO L158 Benchmark]: RCFGBuilder took 698.92ms. Allocated memory is still 159.4MB. Free memory was 127.6MB in the beginning and 103.2MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-19 05:57:04,342 INFO L158 Benchmark]: TraceAbstraction took 3877.12ms. Allocated memory was 159.4MB in the beginning and 249.6MB in the end (delta: 90.2MB). Free memory was 102.4MB in the beginning and 97.7MB in the end (delta: 4.8MB). Peak memory consumption was 97.6MB. Max. memory is 16.1GB. [2024-11-19 05:57:04,343 INFO L158 Benchmark]: Witness Printer took 107.58ms. Allocated memory is still 249.6MB. Free memory was 97.7MB in the beginning and 92.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 05:57:04,345 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.18ms. Allocated memory is still 96.5MB. Free memory is still 51.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 418.48ms. Allocated memory is still 159.4MB. Free memory was 102.3MB in the beginning and 131.3MB in the end (delta: -29.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.21ms. Allocated memory is still 159.4MB. Free memory was 131.3MB in the beginning and 129.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.50ms. Allocated memory is still 159.4MB. Free memory was 129.2MB in the beginning and 127.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 698.92ms. Allocated memory is still 159.4MB. Free memory was 127.6MB in the beginning and 103.2MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3877.12ms. Allocated memory was 159.4MB in the beginning and 249.6MB in the end (delta: 90.2MB). Free memory was 102.4MB in the beginning and 97.7MB in the end (delta: 4.8MB). Peak memory consumption was 97.6MB. Max. memory is 16.1GB. * Witness Printer took 107.58ms. Allocated memory is still 249.6MB. Free memory was 97.7MB in the beginning and 92.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 69]: 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: 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: 71]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 484 locations, 56 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: 3.7s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 431 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 114 mSDsluCounter, 133 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 410 IncrementalHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 133 mSDtfsCounter, 410 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=666occurred in iteration=11, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 904 NumberOfCodeBlocks, 904 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 890 ConstructedInterpolants, 0 QuantifiedInterpolants, 916 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 32 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-19 05:57:04,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE