./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-2.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 69a3560a89bb35c8c81d2aea87ba8845d78238fa641b06d2b772cf5882c5c8f6 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:13:50,785 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:13:50,834 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-14 17:13:50,838 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:13:50,838 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:13:50,860 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:13:50,860 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:13:50,861 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:13:50,861 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:13:50,862 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:13:50,863 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:13:50,863 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:13:50,863 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:13:50,863 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:13:50,864 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:13:50,864 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:13:50,864 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:13:50,866 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:13:50,866 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:13:50,866 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:13:50,866 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:13:50,866 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:13:50,867 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-14 17:13:50,868 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:13:50,868 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:13:50,868 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:13:50,869 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:13:50,869 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:13:50,869 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:13:50,869 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:13:50,869 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:13:50,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:13:50,870 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:13:50,870 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:13:50,870 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 17:13:50,870 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:13:50,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:13:50,870 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:13:50,870 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:13:50,870 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:13:50,870 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:13:50,872 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 -> 69a3560a89bb35c8c81d2aea87ba8845d78238fa641b06d2b772cf5882c5c8f6 [2024-10-14 17:13:51,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:13:51,051 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:13:51,054 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:13:51,054 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:13:51,055 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:13:51,055 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-2.wvr.c [2024-10-14 17:13:52,279 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:13:52,418 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:13:52,419 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-2.wvr.c [2024-10-14 17:13:52,424 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a1a4eacf/cd912ef860d34906b8ad22dee1dd8d7a/FLAGd685f9f80 [2024-10-14 17:13:52,434 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a1a4eacf/cd912ef860d34906b8ad22dee1dd8d7a [2024-10-14 17:13:52,435 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:13:52,436 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:13:52,437 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:13:52,437 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:13:52,441 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:13:52,441 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:13:52" (1/1) ... [2024-10-14 17:13:52,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15286238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:52, skipping insertion in model container [2024-10-14 17:13:52,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:13:52" (1/1) ... [2024-10-14 17:13:52,457 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:13:52,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:13:52,600 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:13:52,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:13:52,629 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:13:52,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:52 WrapperNode [2024-10-14 17:13:52,630 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:13:52,631 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:13:52,631 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:13:52,631 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:13:52,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:52" (1/1) ... [2024-10-14 17:13:52,641 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:52" (1/1) ... [2024-10-14 17:13:52,658 INFO L138 Inliner]: procedures = 20, calls = 31, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 230 [2024-10-14 17:13:52,658 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:13:52,659 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:13:52,659 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:13:52,659 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:13:52,666 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:52" (1/1) ... [2024-10-14 17:13:52,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:52" (1/1) ... [2024-10-14 17:13:52,673 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:52" (1/1) ... [2024-10-14 17:13:52,674 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:52" (1/1) ... [2024-10-14 17:13:52,681 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:52" (1/1) ... [2024-10-14 17:13:52,683 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:52" (1/1) ... [2024-10-14 17:13:52,684 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:52" (1/1) ... [2024-10-14 17:13:52,684 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:52" (1/1) ... [2024-10-14 17:13:52,686 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:13:52,687 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:13:52,687 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:13:52,687 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:13:52,687 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:52" (1/1) ... [2024-10-14 17:13:52,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:13:52,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:13:52,722 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 17:13:52,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 17:13:52,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:13:52,756 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-14 17:13:52,756 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-14 17:13:52,756 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-14 17:13:52,756 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-14 17:13:52,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-14 17:13:52,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-14 17:13:52,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-14 17:13:52,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:13:52,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:13:52,758 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 17:13:52,831 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:13:52,833 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:13:53,074 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 17:13:53,074 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:13:53,250 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:13:53,251 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 17:13:53,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:13:53 BoogieIcfgContainer [2024-10-14 17:13:53,252 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:13:53,254 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:13:53,254 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:13:53,256 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:13:53,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:13:52" (1/3) ... [2024-10-14 17:13:53,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e57f34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:13:53, skipping insertion in model container [2024-10-14 17:13:53,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:13:52" (2/3) ... [2024-10-14 17:13:53,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e57f34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:13:53, skipping insertion in model container [2024-10-14 17:13:53,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:13:53" (3/3) ... [2024-10-14 17:13:53,260 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-ticket-2.wvr.c [2024-10-14 17:13:53,271 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:13:53,271 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2024-10-14 17:13:53,271 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 17:13:53,306 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-14 17:13:53,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 182 transitions, 378 flow [2024-10-14 17:13:53,380 INFO L124 PetriNetUnfolderBase]: 5/180 cut-off events. [2024-10-14 17:13:53,382 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-14 17:13:53,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 180 events. 5/180 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 172 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 140. Up to 2 conditions per place. [2024-10-14 17:13:53,386 INFO L82 GeneralOperation]: Start removeDead. Operand has 184 places, 182 transitions, 378 flow [2024-10-14 17:13:53,392 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 166 places, 163 transitions, 338 flow [2024-10-14 17:13:53,397 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:13:53,404 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;@3e2df03b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:13:53,405 INFO L334 AbstractCegarLoop]: Starting to check reachability of 57 error locations. [2024-10-14 17:13:53,411 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 17:13:53,412 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2024-10-14 17:13:53,412 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 17:13:53,412 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:53,412 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-10-14 17:13:53,413 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2024-10-14 17:13:53,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:53,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1025036068, now seen corresponding path program 1 times [2024-10-14 17:13:53,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:53,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365534308] [2024-10-14 17:13:53,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:53,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:53,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:53,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:53,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365534308] [2024-10-14 17:13:53,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365534308] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:53,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:53,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:53,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810891319] [2024-10-14 17:13:53,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:53,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:53,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:53,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:53,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:53,613 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 182 [2024-10-14 17:13:53,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 163 transitions, 338 flow. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:13:53,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:53,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 182 [2024-10-14 17:13:53,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:53,673 INFO L124 PetriNetUnfolderBase]: 32/214 cut-off events. [2024-10-14 17:13:53,673 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-10-14 17:13:53,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 214 events. 32/214 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 389 event pairs, 29 based on Foata normal form. 1/195 useless extension candidates. Maximal degree in co-relation 159. Up to 75 conditions per place. [2024-10-14 17:13:53,676 INFO L140 encePairwiseOnDemand]: 157/182 looper letters, 16 selfloop transitions, 2 changer transitions 1/140 dead transitions. [2024-10-14 17:13:53,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 140 transitions, 328 flow [2024-10-14 17:13:53,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:53,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:53,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 455 transitions. [2024-10-14 17:13:53,691 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2024-10-14 17:13:53,693 INFO L175 Difference]: Start difference. First operand has 166 places, 163 transitions, 338 flow. Second operand 3 states and 455 transitions. [2024-10-14 17:13:53,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 140 transitions, 328 flow [2024-10-14 17:13:53,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 140 transitions, 320 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-14 17:13:53,698 INFO L231 Difference]: Finished difference. Result has 142 places, 139 transitions, 286 flow [2024-10-14 17:13:53,699 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=286, PETRI_PLACES=142, PETRI_TRANSITIONS=139} [2024-10-14 17:13:53,702 INFO L277 CegarLoopForPetriNet]: 166 programPoint places, -24 predicate places. [2024-10-14 17:13:53,702 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 139 transitions, 286 flow [2024-10-14 17:13:53,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:13:53,703 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:53,703 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-10-14 17:13:53,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 17:13:53,703 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2024-10-14 17:13:53,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:53,704 INFO L85 PathProgramCache]: Analyzing trace with hash 2009767170, now seen corresponding path program 1 times [2024-10-14 17:13:53,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:53,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889634896] [2024-10-14 17:13:53,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:53,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:53,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:53,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:53,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889634896] [2024-10-14 17:13:53,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889634896] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:53,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:53,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:53,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164705449] [2024-10-14 17:13:53,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:53,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:53,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:53,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:53,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:53,768 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 182 [2024-10-14 17:13:53,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 139 transitions, 286 flow. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:13:53,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:53,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 182 [2024-10-14 17:13:53,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:53,835 INFO L124 PetriNetUnfolderBase]: 32/212 cut-off events. [2024-10-14 17:13:53,836 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-14 17:13:53,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 212 events. 32/212 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 391 event pairs, 29 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 270. Up to 75 conditions per place. [2024-10-14 17:13:53,838 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 16 selfloop transitions, 2 changer transitions 0/138 dead transitions. [2024-10-14 17:13:53,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 138 transitions, 320 flow [2024-10-14 17:13:53,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:53,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:53,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2024-10-14 17:13:53,844 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.793040293040293 [2024-10-14 17:13:53,844 INFO L175 Difference]: Start difference. First operand has 142 places, 139 transitions, 286 flow. Second operand 3 states and 433 transitions. [2024-10-14 17:13:53,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 138 transitions, 320 flow [2024-10-14 17:13:53,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 138 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:53,847 INFO L231 Difference]: Finished difference. Result has 140 places, 138 transitions, 284 flow [2024-10-14 17:13:53,848 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=284, PETRI_PLACES=140, PETRI_TRANSITIONS=138} [2024-10-14 17:13:53,848 INFO L277 CegarLoopForPetriNet]: 166 programPoint places, -26 predicate places. [2024-10-14 17:13:53,848 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 138 transitions, 284 flow [2024-10-14 17:13:53,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:13:53,849 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:53,849 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-10-14 17:13:53,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 17:13:53,850 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2024-10-14 17:13:53,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:53,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1828449939, now seen corresponding path program 1 times [2024-10-14 17:13:53,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:53,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891002165] [2024-10-14 17:13:53,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:53,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:53,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:53,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:53,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891002165] [2024-10-14 17:13:53,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891002165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:53,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:53,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:53,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760110398] [2024-10-14 17:13:53,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:53,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:53,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:53,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:53,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:53,938 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 182 [2024-10-14 17:13:53,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 138 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:13:53,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:53,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 182 [2024-10-14 17:13:53,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:53,985 INFO L124 PetriNetUnfolderBase]: 32/211 cut-off events. [2024-10-14 17:13:53,988 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-14 17:13:53,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 211 events. 32/211 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 388 event pairs, 29 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 264. Up to 78 conditions per place. [2024-10-14 17:13:53,989 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 19 selfloop transitions, 2 changer transitions 0/137 dead transitions. [2024-10-14 17:13:53,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 137 transitions, 324 flow [2024-10-14 17:13:53,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:53,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:53,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2024-10-14 17:13:53,992 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.782051282051282 [2024-10-14 17:13:53,992 INFO L175 Difference]: Start difference. First operand has 140 places, 138 transitions, 284 flow. Second operand 3 states and 427 transitions. [2024-10-14 17:13:53,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 137 transitions, 324 flow [2024-10-14 17:13:53,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 137 transitions, 320 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:53,995 INFO L231 Difference]: Finished difference. Result has 139 places, 137 transitions, 282 flow [2024-10-14 17:13:53,996 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=282, PETRI_PLACES=139, PETRI_TRANSITIONS=137} [2024-10-14 17:13:53,998 INFO L277 CegarLoopForPetriNet]: 166 programPoint places, -27 predicate places. [2024-10-14 17:13:53,998 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 137 transitions, 282 flow [2024-10-14 17:13:53,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:13:53,998 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:53,998 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-10-14 17:13:53,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 17:13:53,999 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2024-10-14 17:13:53,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:53,999 INFO L85 PathProgramCache]: Analyzing trace with hash 885224105, now seen corresponding path program 1 times [2024-10-14 17:13:53,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:53,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213402311] [2024-10-14 17:13:54,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:54,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:54,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:54,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:54,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213402311] [2024-10-14 17:13:54,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213402311] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:54,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:54,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:54,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879820128] [2024-10-14 17:13:54,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:54,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:54,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:54,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:54,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:54,065 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 182 [2024-10-14 17:13:54,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 137 transitions, 282 flow. Second operand has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:13:54,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:54,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 182 [2024-10-14 17:13:54,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:54,127 INFO L124 PetriNetUnfolderBase]: 32/210 cut-off events. [2024-10-14 17:13:54,127 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-14 17:13:54,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 210 events. 32/210 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 390 event pairs, 29 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 253. Up to 76 conditions per place. [2024-10-14 17:13:54,128 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 17 selfloop transitions, 2 changer transitions 0/136 dead transitions. [2024-10-14 17:13:54,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 136 transitions, 318 flow [2024-10-14 17:13:54,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:54,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:54,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2024-10-14 17:13:54,130 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7893772893772893 [2024-10-14 17:13:54,130 INFO L175 Difference]: Start difference. First operand has 139 places, 137 transitions, 282 flow. Second operand 3 states and 431 transitions. [2024-10-14 17:13:54,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 136 transitions, 318 flow [2024-10-14 17:13:54,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 136 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:54,133 INFO L231 Difference]: Finished difference. Result has 138 places, 136 transitions, 280 flow [2024-10-14 17:13:54,134 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=280, PETRI_PLACES=138, PETRI_TRANSITIONS=136} [2024-10-14 17:13:54,134 INFO L277 CegarLoopForPetriNet]: 166 programPoint places, -28 predicate places. [2024-10-14 17:13:54,135 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 136 transitions, 280 flow [2024-10-14 17:13:54,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:13:54,135 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:54,135 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] [2024-10-14 17:13:54,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 17:13:54,136 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2024-10-14 17:13:54,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:54,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1171497630, now seen corresponding path program 1 times [2024-10-14 17:13:54,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:54,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294639814] [2024-10-14 17:13:54,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:54,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:54,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:54,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:54,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294639814] [2024-10-14 17:13:54,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294639814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:54,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:54,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:54,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094006633] [2024-10-14 17:13:54,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:54,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:54,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:54,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:54,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:54,198 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 182 [2024-10-14 17:13:54,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 136 transitions, 280 flow. Second operand has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:13:54,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:54,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 182 [2024-10-14 17:13:54,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:54,238 INFO L124 PetriNetUnfolderBase]: 32/209 cut-off events. [2024-10-14 17:13:54,238 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-14 17:13:54,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 209 events. 32/209 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 393 event pairs, 29 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 244. Up to 76 conditions per place. [2024-10-14 17:13:54,239 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 17 selfloop transitions, 2 changer transitions 0/135 dead transitions. [2024-10-14 17:13:54,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 135 transitions, 316 flow [2024-10-14 17:13:54,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:54,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:54,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2024-10-14 17:13:54,241 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7893772893772893 [2024-10-14 17:13:54,241 INFO L175 Difference]: Start difference. First operand has 138 places, 136 transitions, 280 flow. Second operand 3 states and 431 transitions. [2024-10-14 17:13:54,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 135 transitions, 316 flow [2024-10-14 17:13:54,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 135 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:54,242 INFO L231 Difference]: Finished difference. Result has 137 places, 135 transitions, 278 flow [2024-10-14 17:13:54,243 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=137, PETRI_TRANSITIONS=135} [2024-10-14 17:13:54,244 INFO L277 CegarLoopForPetriNet]: 166 programPoint places, -29 predicate places. [2024-10-14 17:13:54,244 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 135 transitions, 278 flow [2024-10-14 17:13:54,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:13:54,245 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:54,245 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] [2024-10-14 17:13:54,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 17:13:54,245 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2024-10-14 17:13:54,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:54,245 INFO L85 PathProgramCache]: Analyzing trace with hash 745453769, now seen corresponding path program 1 times [2024-10-14 17:13:54,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:54,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028536213] [2024-10-14 17:13:54,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:54,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:54,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:54,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:54,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:54,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028536213] [2024-10-14 17:13:54,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028536213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:54,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:54,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:54,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442783922] [2024-10-14 17:13:54,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:54,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:54,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:54,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:54,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:54,318 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 182 [2024-10-14 17:13:54,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 135 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:13:54,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:54,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 182 [2024-10-14 17:13:54,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:54,351 INFO L124 PetriNetUnfolderBase]: 32/208 cut-off events. [2024-10-14 17:13:54,352 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-14 17:13:54,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 208 events. 32/208 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 391 event pairs, 29 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 236. Up to 77 conditions per place. [2024-10-14 17:13:54,353 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 18 selfloop transitions, 2 changer transitions 0/134 dead transitions. [2024-10-14 17:13:54,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 134 transitions, 316 flow [2024-10-14 17:13:54,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:54,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:54,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2024-10-14 17:13:54,354 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7857142857142857 [2024-10-14 17:13:54,354 INFO L175 Difference]: Start difference. First operand has 137 places, 135 transitions, 278 flow. Second operand 3 states and 429 transitions. [2024-10-14 17:13:54,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 134 transitions, 316 flow [2024-10-14 17:13:54,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 134 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:54,356 INFO L231 Difference]: Finished difference. Result has 136 places, 134 transitions, 276 flow [2024-10-14 17:13:54,356 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=136, PETRI_TRANSITIONS=134} [2024-10-14 17:13:54,357 INFO L277 CegarLoopForPetriNet]: 166 programPoint places, -30 predicate places. [2024-10-14 17:13:54,358 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 134 transitions, 276 flow [2024-10-14 17:13:54,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:13:54,358 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:54,359 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:54,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 17:13:54,359 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2024-10-14 17:13:54,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:54,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1921356801, now seen corresponding path program 1 times [2024-10-14 17:13:54,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:54,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401299720] [2024-10-14 17:13:54,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:54,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:54,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:54,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:54,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401299720] [2024-10-14 17:13:54,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401299720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:54,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:54,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:54,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242762027] [2024-10-14 17:13:54,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:54,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:54,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:54,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:54,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:54,416 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 182 [2024-10-14 17:13:54,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 134 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:13:54,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:54,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 182 [2024-10-14 17:13:54,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:54,459 INFO L124 PetriNetUnfolderBase]: 34/218 cut-off events. [2024-10-14 17:13:54,459 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-10-14 17:13:54,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 317 conditions, 218 events. 34/218 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 453 event pairs, 17 based on Foata normal form. 0/207 useless extension candidates. Maximal degree in co-relation 247. Up to 56 conditions per place. [2024-10-14 17:13:54,460 INFO L140 encePairwiseOnDemand]: 174/182 looper letters, 26 selfloop transitions, 5 changer transitions 0/142 dead transitions. [2024-10-14 17:13:54,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 142 transitions, 356 flow [2024-10-14 17:13:54,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:54,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:54,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 439 transitions. [2024-10-14 17:13:54,462 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8040293040293041 [2024-10-14 17:13:54,462 INFO L175 Difference]: Start difference. First operand has 136 places, 134 transitions, 276 flow. Second operand 3 states and 439 transitions. [2024-10-14 17:13:54,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 142 transitions, 356 flow [2024-10-14 17:13:54,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 142 transitions, 352 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:54,464 INFO L231 Difference]: Finished difference. Result has 135 places, 135 transitions, 302 flow [2024-10-14 17:13:54,465 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=302, PETRI_PLACES=135, PETRI_TRANSITIONS=135} [2024-10-14 17:13:54,465 INFO L277 CegarLoopForPetriNet]: 166 programPoint places, -31 predicate places. [2024-10-14 17:13:54,466 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 135 transitions, 302 flow [2024-10-14 17:13:54,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:13:54,466 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:54,466 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:54,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 17:13:54,467 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2024-10-14 17:13:54,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:54,467 INFO L85 PathProgramCache]: Analyzing trace with hash -412032600, now seen corresponding path program 1 times [2024-10-14 17:13:54,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:54,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408610078] [2024-10-14 17:13:54,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:54,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:54,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:54,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:54,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:54,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408610078] [2024-10-14 17:13:54,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408610078] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:54,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:54,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:54,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719457941] [2024-10-14 17:13:54,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:54,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:54,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:54,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:54,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:54,514 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 182 [2024-10-14 17:13:54,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 135 transitions, 302 flow. Second operand has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:13:54,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:54,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 182 [2024-10-14 17:13:54,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:54,547 INFO L124 PetriNetUnfolderBase]: 34/218 cut-off events. [2024-10-14 17:13:54,547 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-10-14 17:13:54,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 218 events. 34/218 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 458 event pairs, 22 based on Foata normal form. 0/207 useless extension candidates. Maximal degree in co-relation 149. Up to 80 conditions per place. [2024-10-14 17:13:54,550 INFO L140 encePairwiseOnDemand]: 178/182 looper letters, 20 selfloop transitions, 3 changer transitions 0/137 dead transitions. [2024-10-14 17:13:54,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 137 transitions, 353 flow [2024-10-14 17:13:54,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:54,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:54,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions. [2024-10-14 17:13:54,551 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8113553113553114 [2024-10-14 17:13:54,552 INFO L175 Difference]: Start difference. First operand has 135 places, 135 transitions, 302 flow. Second operand 3 states and 443 transitions. [2024-10-14 17:13:54,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 137 transitions, 353 flow [2024-10-14 17:13:54,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 137 transitions, 343 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:54,554 INFO L231 Difference]: Finished difference. Result has 135 places, 136 transitions, 307 flow [2024-10-14 17:13:54,554 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=307, PETRI_PLACES=135, PETRI_TRANSITIONS=136} [2024-10-14 17:13:54,554 INFO L277 CegarLoopForPetriNet]: 166 programPoint places, -31 predicate places. [2024-10-14 17:13:54,555 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 136 transitions, 307 flow [2024-10-14 17:13:54,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:13:54,555 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:54,555 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] [2024-10-14 17:13:54,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 17:13:54,555 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2024-10-14 17:13:54,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:54,556 INFO L85 PathProgramCache]: Analyzing trace with hash -334610102, now seen corresponding path program 1 times [2024-10-14 17:13:54,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:54,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866321004] [2024-10-14 17:13:54,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:54,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:54,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:54,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:54,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866321004] [2024-10-14 17:13:54,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866321004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:54,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:54,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:54,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350005941] [2024-10-14 17:13:54,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:54,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:54,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:54,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:54,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:54,627 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 182 [2024-10-14 17:13:54,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 136 transitions, 307 flow. Second operand has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:13:54,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:54,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 182 [2024-10-14 17:13:54,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:54,678 INFO L124 PetriNetUnfolderBase]: 51/287 cut-off events. [2024-10-14 17:13:54,678 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-10-14 17:13:54,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 287 events. 51/287 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 786 event pairs, 28 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 170. Up to 89 conditions per place. [2024-10-14 17:13:54,679 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 32 selfloop transitions, 2 changer transitions 0/147 dead transitions. [2024-10-14 17:13:54,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 147 transitions, 417 flow [2024-10-14 17:13:54,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:54,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:54,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2024-10-14 17:13:54,681 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8223443223443223 [2024-10-14 17:13:54,681 INFO L175 Difference]: Start difference. First operand has 135 places, 136 transitions, 307 flow. Second operand 3 states and 449 transitions. [2024-10-14 17:13:54,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 147 transitions, 417 flow [2024-10-14 17:13:54,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 147 transitions, 412 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:13:54,684 INFO L231 Difference]: Finished difference. Result has 136 places, 136 transitions, 312 flow [2024-10-14 17:13:54,684 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=312, PETRI_PLACES=136, PETRI_TRANSITIONS=136} [2024-10-14 17:13:54,685 INFO L277 CegarLoopForPetriNet]: 166 programPoint places, -30 predicate places. [2024-10-14 17:13:54,686 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 136 transitions, 312 flow [2024-10-14 17:13:54,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:13:54,686 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:54,686 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] [2024-10-14 17:13:54,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 17:13:54,687 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2024-10-14 17:13:54,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:54,687 INFO L85 PathProgramCache]: Analyzing trace with hash -798876221, now seen corresponding path program 1 times [2024-10-14 17:13:54,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:54,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382551059] [2024-10-14 17:13:54,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:54,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:54,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:54,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:54,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:54,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382551059] [2024-10-14 17:13:54,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382551059] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:54,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:54,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:54,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017291677] [2024-10-14 17:13:54,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:54,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:54,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:54,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:54,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:54,744 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 182 [2024-10-14 17:13:54,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 136 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:13:54,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:54,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 182 [2024-10-14 17:13:54,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:54,795 INFO L124 PetriNetUnfolderBase]: 87/411 cut-off events. [2024-10-14 17:13:54,796 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2024-10-14 17:13:54,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 778 conditions, 411 events. 87/411 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1594 event pairs, 46 based on Foata normal form. 1/394 useless extension candidates. Maximal degree in co-relation 521. Up to 129 conditions per place. [2024-10-14 17:13:54,797 INFO L140 encePairwiseOnDemand]: 177/182 looper letters, 0 selfloop transitions, 0 changer transitions 149/149 dead transitions. [2024-10-14 17:13:54,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 149 transitions, 440 flow [2024-10-14 17:13:54,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:54,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:54,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 444 transitions. [2024-10-14 17:13:54,798 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8131868131868132 [2024-10-14 17:13:54,798 INFO L175 Difference]: Start difference. First operand has 136 places, 136 transitions, 312 flow. Second operand 3 states and 444 transitions. [2024-10-14 17:13:54,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 149 transitions, 440 flow [2024-10-14 17:13:54,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 149 transitions, 437 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:13:54,801 INFO L231 Difference]: Finished difference. Result has 135 places, 0 transitions, 0 flow [2024-10-14 17:13:54,801 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=135, PETRI_TRANSITIONS=0} [2024-10-14 17:13:54,803 INFO L277 CegarLoopForPetriNet]: 166 programPoint places, -31 predicate places. [2024-10-14 17:13:54,803 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 0 transitions, 0 flow [2024-10-14 17:13:54,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:13:54,805 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (56 of 57 remaining) [2024-10-14 17:13:54,806 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (55 of 57 remaining) [2024-10-14 17:13:54,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (54 of 57 remaining) [2024-10-14 17:13:54,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (53 of 57 remaining) [2024-10-14 17:13:54,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (52 of 57 remaining) [2024-10-14 17:13:54,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (51 of 57 remaining) [2024-10-14 17:13:54,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (50 of 57 remaining) [2024-10-14 17:13:54,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (49 of 57 remaining) [2024-10-14 17:13:54,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (48 of 57 remaining) [2024-10-14 17:13:54,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (47 of 57 remaining) [2024-10-14 17:13:54,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (46 of 57 remaining) [2024-10-14 17:13:54,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (45 of 57 remaining) [2024-10-14 17:13:54,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (44 of 57 remaining) [2024-10-14 17:13:54,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (43 of 57 remaining) [2024-10-14 17:13:54,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (42 of 57 remaining) [2024-10-14 17:13:54,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (41 of 57 remaining) [2024-10-14 17:13:54,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (40 of 57 remaining) [2024-10-14 17:13:54,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (39 of 57 remaining) [2024-10-14 17:13:54,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (38 of 57 remaining) [2024-10-14 17:13:54,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (37 of 57 remaining) [2024-10-14 17:13:54,809 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (36 of 57 remaining) [2024-10-14 17:13:54,809 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (35 of 57 remaining) [2024-10-14 17:13:54,809 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (34 of 57 remaining) [2024-10-14 17:13:54,809 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (33 of 57 remaining) [2024-10-14 17:13:54,809 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (32 of 57 remaining) [2024-10-14 17:13:54,809 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (31 of 57 remaining) [2024-10-14 17:13:54,809 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (30 of 57 remaining) [2024-10-14 17:13:54,809 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (29 of 57 remaining) [2024-10-14 17:13:54,809 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (28 of 57 remaining) [2024-10-14 17:13:54,809 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (27 of 57 remaining) [2024-10-14 17:13:54,809 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (26 of 57 remaining) [2024-10-14 17:13:54,809 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (25 of 57 remaining) [2024-10-14 17:13:54,809 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (24 of 57 remaining) [2024-10-14 17:13:54,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (23 of 57 remaining) [2024-10-14 17:13:54,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 57 remaining) [2024-10-14 17:13:54,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 57 remaining) [2024-10-14 17:13:54,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (20 of 57 remaining) [2024-10-14 17:13:54,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (19 of 57 remaining) [2024-10-14 17:13:54,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (18 of 57 remaining) [2024-10-14 17:13:54,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (17 of 57 remaining) [2024-10-14 17:13:54,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (16 of 57 remaining) [2024-10-14 17:13:54,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (15 of 57 remaining) [2024-10-14 17:13:54,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (14 of 57 remaining) [2024-10-14 17:13:54,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (13 of 57 remaining) [2024-10-14 17:13:54,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (12 of 57 remaining) [2024-10-14 17:13:54,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (11 of 57 remaining) [2024-10-14 17:13:54,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (10 of 57 remaining) [2024-10-14 17:13:54,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (9 of 57 remaining) [2024-10-14 17:13:54,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (8 of 57 remaining) [2024-10-14 17:13:54,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (7 of 57 remaining) [2024-10-14 17:13:54,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (6 of 57 remaining) [2024-10-14 17:13:54,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (5 of 57 remaining) [2024-10-14 17:13:54,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (4 of 57 remaining) [2024-10-14 17:13:54,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (3 of 57 remaining) [2024-10-14 17:13:54,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (2 of 57 remaining) [2024-10-14 17:13:54,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (1 of 57 remaining) [2024-10-14 17:13:54,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (0 of 57 remaining) [2024-10-14 17:13:54,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 17:13:54,812 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:54,819 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-14 17:13:54,819 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 17:13:54,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 05:13:54 BasicIcfg [2024-10-14 17:13:54,826 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 17:13:54,827 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 17:13:54,827 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 17:13:54,827 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 17:13:54,827 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:13:53" (3/4) ... [2024-10-14 17:13:54,828 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 17:13:54,830 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-14 17:13:54,831 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-14 17:13:54,834 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-14 17:13:54,834 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-14 17:13:54,834 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 17:13:54,834 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 17:13:54,900 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 17:13:54,901 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 17:13:54,901 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 17:13:54,901 INFO L158 Benchmark]: Toolchain (without parser) took 2465.06ms. Allocated memory is still 188.7MB. Free memory was 119.9MB in the beginning and 96.2MB in the end (delta: 23.7MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2024-10-14 17:13:54,902 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 119.5MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:13:54,902 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.91ms. Allocated memory is still 188.7MB. Free memory was 119.6MB in the beginning and 107.3MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 17:13:54,902 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.73ms. Allocated memory is still 188.7MB. Free memory was 107.3MB in the beginning and 105.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 17:13:54,902 INFO L158 Benchmark]: Boogie Preprocessor took 27.27ms. Allocated memory is still 188.7MB. Free memory was 105.2MB in the beginning and 103.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 17:13:54,902 INFO L158 Benchmark]: RCFGBuilder took 565.36ms. Allocated memory is still 188.7MB. Free memory was 103.8MB in the beginning and 148.6MB in the end (delta: -44.8MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. [2024-10-14 17:13:54,903 INFO L158 Benchmark]: TraceAbstraction took 1572.70ms. Allocated memory is still 188.7MB. Free memory was 147.5MB in the beginning and 101.4MB in the end (delta: 46.1MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. [2024-10-14 17:13:54,903 INFO L158 Benchmark]: Witness Printer took 74.14ms. Allocated memory is still 188.7MB. Free memory was 101.4MB in the beginning and 96.2MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 17:13:54,904 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.13ms. Allocated memory is still 119.5MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 192.91ms. Allocated memory is still 188.7MB. Free memory was 119.6MB in the beginning and 107.3MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.73ms. Allocated memory is still 188.7MB. Free memory was 107.3MB in the beginning and 105.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.27ms. Allocated memory is still 188.7MB. Free memory was 105.2MB in the beginning and 103.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 565.36ms. Allocated memory is still 188.7MB. Free memory was 103.8MB in the beginning and 148.6MB in the end (delta: -44.8MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1572.70ms. Allocated memory is still 188.7MB. Free memory was 147.5MB in the beginning and 101.4MB in the end (delta: 46.1MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. * Witness Printer took 74.14ms. Allocated memory is still 188.7MB. Free memory was 101.4MB in the beginning and 96.2MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: 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: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: 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, 218 locations, 57 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: 1.5s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 147 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 35 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 403 IncrementalHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 35 mSDtfsCounter, 403 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=338occurred in iteration=0, InterpolantAutomatonStates: 30, 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.4s InterpolantComputationTime, 536 NumberOfCodeBlocks, 536 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 526 ConstructedInterpolants, 0 QuantifiedInterpolants, 546 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 34 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-14 17:13:54,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE