./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/unroll-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version a046e57d 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/unroll-4.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 bb07434636f33664cc09ed992a41516efeea5f96121c916fb8904844e76d9fcd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:01:12,495 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:01:12,562 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-13 10:01:12,570 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:01:12,571 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:01:12,605 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:01:12,609 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:01:12,610 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:01:12,610 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:01:12,611 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:01:12,611 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:01:12,611 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:01:12,612 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:01:12,612 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:01:12,613 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 10:01:12,613 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:01:12,613 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:01:12,614 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:01:12,614 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:01:12,614 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 10:01:12,615 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:01:12,615 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 10:01:12,616 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-13 10:01:12,616 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:01:12,616 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:01:12,617 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:01:12,617 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 10:01:12,617 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:01:12,618 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:01:12,618 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:01:12,618 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:01:12,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:01:12,619 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:01:12,632 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:01:12,632 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 10:01:12,632 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:01:12,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:01:12,632 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:01:12,633 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:01:12,633 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:01:12,633 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:01:12,635 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 -> bb07434636f33664cc09ed992a41516efeea5f96121c916fb8904844e76d9fcd [2024-10-13 10:01:12,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:01:12,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:01:12,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:01:12,910 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:01:12,911 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:01:12,912 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-4.wvr.c [2024-10-13 10:01:14,441 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:01:14,630 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:01:14,631 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-4.wvr.c [2024-10-13 10:01:14,639 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f059adff9/1f4c6b5ab1754877af711d7f2f7de271/FLAG31e5c9cc2 [2024-10-13 10:01:14,652 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f059adff9/1f4c6b5ab1754877af711d7f2f7de271 [2024-10-13 10:01:14,655 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:01:14,656 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:01:14,657 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:01:14,658 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:01:14,663 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:01:14,664 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:01:14" (1/1) ... [2024-10-13 10:01:14,667 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2da685e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:14, skipping insertion in model container [2024-10-13 10:01:14,667 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:01:14" (1/1) ... [2024-10-13 10:01:14,688 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:01:14,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:01:14,947 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:01:14,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:01:14,994 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:01:14,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:14 WrapperNode [2024-10-13 10:01:14,995 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:01:14,996 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:01:14,996 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:01:14,996 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:01:15,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:14" (1/1) ... [2024-10-13 10:01:15,013 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:14" (1/1) ... [2024-10-13 10:01:15,046 INFO L138 Inliner]: procedures = 23, calls = 27, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 297 [2024-10-13 10:01:15,047 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:01:15,047 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:01:15,047 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:01:15,048 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:01:15,056 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:14" (1/1) ... [2024-10-13 10:01:15,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:14" (1/1) ... [2024-10-13 10:01:15,060 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:14" (1/1) ... [2024-10-13 10:01:15,061 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:14" (1/1) ... [2024-10-13 10:01:15,075 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:14" (1/1) ... [2024-10-13 10:01:15,080 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:14" (1/1) ... [2024-10-13 10:01:15,087 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:14" (1/1) ... [2024-10-13 10:01:15,089 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:14" (1/1) ... [2024-10-13 10:01:15,096 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:01:15,097 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:01:15,097 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:01:15,098 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:01:15,098 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:14" (1/1) ... [2024-10-13 10:01:15,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:01:15,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:01:15,141 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-13 10:01:15,146 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-13 10:01:15,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:01:15,196 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-13 10:01:15,196 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-13 10:01:15,196 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-13 10:01:15,196 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-13 10:01:15,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-13 10:01:15,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-13 10:01:15,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:01:15,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:01:15,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:01:15,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-13 10:01:15,199 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 10:01:15,322 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:01:15,325 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:01:15,908 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 10:01:15,909 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:01:15,930 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:01:15,931 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-13 10:01:15,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:01:15 BoogieIcfgContainer [2024-10-13 10:01:15,931 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:01:15,933 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:01:15,934 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:01:15,937 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:01:15,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:01:14" (1/3) ... [2024-10-13 10:01:15,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f20fe33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:01:15, skipping insertion in model container [2024-10-13 10:01:15,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:14" (2/3) ... [2024-10-13 10:01:15,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f20fe33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:01:15, skipping insertion in model container [2024-10-13 10:01:15,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:01:15" (3/3) ... [2024-10-13 10:01:15,940 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-4.wvr.c [2024-10-13 10:01:15,954 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:01:15,954 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2024-10-13 10:01:15,954 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 10:01:16,101 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-13 10:01:16,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 380 places, 394 transitions, 802 flow [2024-10-13 10:01:16,307 INFO L124 PetriNetUnfolderBase]: 21/392 cut-off events. [2024-10-13 10:01:16,308 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 10:01:16,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 392 events. 21/392 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 502 event pairs, 0 based on Foata normal form. 0/325 useless extension candidates. Maximal degree in co-relation 255. Up to 2 conditions per place. [2024-10-13 10:01:16,319 INFO L82 GeneralOperation]: Start removeDead. Operand has 380 places, 394 transitions, 802 flow [2024-10-13 10:01:16,328 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 362 places, 375 transitions, 762 flow [2024-10-13 10:01:16,337 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:01:16,346 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;@44636788, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:01:16,346 INFO L334 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2024-10-13 10:01:16,351 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 10:01:16,353 INFO L124 PetriNetUnfolderBase]: 0/19 cut-off events. [2024-10-13 10:01:16,353 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 10:01:16,354 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:16,355 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] [2024-10-13 10:01:16,355 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2024-10-13 10:01:16,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:16,360 INFO L85 PathProgramCache]: Analyzing trace with hash 2113386772, now seen corresponding path program 1 times [2024-10-13 10:01:16,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:16,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720991436] [2024-10-13 10:01:16,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:16,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:16,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:16,529 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-13 10:01:16,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:16,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720991436] [2024-10-13 10:01:16,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720991436] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:16,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:16,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:16,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844507769] [2024-10-13 10:01:16,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:16,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:16,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:16,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:16,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:16,615 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 394 [2024-10-13 10:01:16,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 375 transitions, 762 flow. Second operand has 3 states, 3 states have (on average 367.3333333333333) internal successors, (1102), 3 states have internal predecessors, (1102), 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-13 10:01:16,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:16,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 394 [2024-10-13 10:01:16,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:16,749 INFO L124 PetriNetUnfolderBase]: 15/470 cut-off events. [2024-10-13 10:01:16,750 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-13 10:01:16,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 503 conditions, 470 events. 15/470 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1043 event pairs, 3 based on Foata normal form. 12/398 useless extension candidates. Maximal degree in co-relation 365. Up to 19 conditions per place. [2024-10-13 10:01:16,761 INFO L140 encePairwiseOnDemand]: 379/394 looper letters, 10 selfloop transitions, 2 changer transitions 4/362 dead transitions. [2024-10-13 10:01:16,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 362 transitions, 760 flow [2024-10-13 10:01:16,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:16,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:16,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1123 transitions. [2024-10-13 10:01:16,788 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9500846023688664 [2024-10-13 10:01:16,790 INFO L175 Difference]: Start difference. First operand has 362 places, 375 transitions, 762 flow. Second operand 3 states and 1123 transitions. [2024-10-13 10:01:16,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 362 transitions, 760 flow [2024-10-13 10:01:16,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 362 transitions, 752 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-13 10:01:16,805 INFO L231 Difference]: Finished difference. Result has 359 places, 358 transitions, 724 flow [2024-10-13 10:01:16,809 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=394, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=724, PETRI_PLACES=359, PETRI_TRANSITIONS=358} [2024-10-13 10:01:16,813 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, -3 predicate places. [2024-10-13 10:01:16,814 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 358 transitions, 724 flow [2024-10-13 10:01:16,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 367.3333333333333) internal successors, (1102), 3 states have internal predecessors, (1102), 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-13 10:01:16,815 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:16,815 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] [2024-10-13 10:01:16,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 10:01:16,816 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2024-10-13 10:01:16,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:16,819 INFO L85 PathProgramCache]: Analyzing trace with hash 285541915, now seen corresponding path program 1 times [2024-10-13 10:01:16,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:16,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869799709] [2024-10-13 10:01:16,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:16,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:16,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:16,914 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-13 10:01:16,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:16,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869799709] [2024-10-13 10:01:16,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869799709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:16,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:16,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:16,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029849157] [2024-10-13 10:01:16,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:16,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:16,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:16,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:16,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:16,983 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 362 out of 394 [2024-10-13 10:01:16,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 358 transitions, 724 flow. Second operand has 3 states, 3 states have (on average 363.3333333333333) internal successors, (1090), 3 states have internal predecessors, (1090), 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-13 10:01:16,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:16,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 362 of 394 [2024-10-13 10:01:16,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:17,083 INFO L124 PetriNetUnfolderBase]: 22/558 cut-off events. [2024-10-13 10:01:17,083 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-10-13 10:01:17,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 600 conditions, 558 events. 22/558 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1379 event pairs, 9 based on Foata normal form. 0/459 useless extension candidates. Maximal degree in co-relation 572. Up to 33 conditions per place. [2024-10-13 10:01:17,089 INFO L140 encePairwiseOnDemand]: 391/394 looper letters, 14 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2024-10-13 10:01:17,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 357 transitions, 754 flow [2024-10-13 10:01:17,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:17,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:17,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1103 transitions. [2024-10-13 10:01:17,093 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9331641285956007 [2024-10-13 10:01:17,093 INFO L175 Difference]: Start difference. First operand has 359 places, 358 transitions, 724 flow. Second operand 3 states and 1103 transitions. [2024-10-13 10:01:17,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 357 transitions, 754 flow [2024-10-13 10:01:17,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 357 transitions, 750 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:01:17,104 INFO L231 Difference]: Finished difference. Result has 354 places, 357 transitions, 722 flow [2024-10-13 10:01:17,105 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=394, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=722, PETRI_PLACES=354, PETRI_TRANSITIONS=357} [2024-10-13 10:01:17,106 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, -8 predicate places. [2024-10-13 10:01:17,106 INFO L471 AbstractCegarLoop]: Abstraction has has 354 places, 357 transitions, 722 flow [2024-10-13 10:01:17,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 363.3333333333333) internal successors, (1090), 3 states have internal predecessors, (1090), 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-13 10:01:17,107 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:17,108 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] [2024-10-13 10:01:17,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 10:01:17,108 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2024-10-13 10:01:17,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:17,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1575332167, now seen corresponding path program 1 times [2024-10-13 10:01:17,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:17,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049187848] [2024-10-13 10:01:17,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:17,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:17,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:17,170 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-13 10:01:17,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:17,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049187848] [2024-10-13 10:01:17,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049187848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:17,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:17,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:17,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237735616] [2024-10-13 10:01:17,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:17,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:17,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:17,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:17,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:17,219 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 394 [2024-10-13 10:01:17,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 357 transitions, 722 flow. Second operand has 3 states, 3 states have (on average 355.0) internal successors, (1065), 3 states have internal predecessors, (1065), 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-13 10:01:17,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:17,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 394 [2024-10-13 10:01:17,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:17,472 INFO L124 PetriNetUnfolderBase]: 79/1186 cut-off events. [2024-10-13 10:01:17,472 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-10-13 10:01:17,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1293 conditions, 1186 events. 79/1186 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 5155 event pairs, 26 based on Foata normal form. 0/968 useless extension candidates. Maximal degree in co-relation 1257. Up to 97 conditions per place. [2024-10-13 10:01:17,485 INFO L140 encePairwiseOnDemand]: 386/394 looper letters, 18 selfloop transitions, 1 changer transitions 0/350 dead transitions. [2024-10-13 10:01:17,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 350 transitions, 746 flow [2024-10-13 10:01:17,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:17,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:17,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1088 transitions. [2024-10-13 10:01:17,490 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9204737732656514 [2024-10-13 10:01:17,491 INFO L175 Difference]: Start difference. First operand has 354 places, 357 transitions, 722 flow. Second operand 3 states and 1088 transitions. [2024-10-13 10:01:17,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 350 transitions, 746 flow [2024-10-13 10:01:17,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 350 transitions, 742 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:01:17,497 INFO L231 Difference]: Finished difference. Result has 347 places, 350 transitions, 706 flow [2024-10-13 10:01:17,498 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=394, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=706, PETRI_PLACES=347, PETRI_TRANSITIONS=350} [2024-10-13 10:01:17,499 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, -15 predicate places. [2024-10-13 10:01:17,499 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 350 transitions, 706 flow [2024-10-13 10:01:17,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 355.0) internal successors, (1065), 3 states have internal predecessors, (1065), 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-13 10:01:17,500 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:17,501 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] [2024-10-13 10:01:17,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 10:01:17,501 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2024-10-13 10:01:17,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:17,502 INFO L85 PathProgramCache]: Analyzing trace with hash -254542847, now seen corresponding path program 1 times [2024-10-13 10:01:17,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:17,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131345421] [2024-10-13 10:01:17,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:17,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:17,616 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-13 10:01:17,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:17,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131345421] [2024-10-13 10:01:17,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131345421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:17,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:17,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:17,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404952493] [2024-10-13 10:01:17,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:17,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:17,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:17,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:17,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:17,653 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 394 [2024-10-13 10:01:17,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 350 transitions, 706 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 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-13 10:01:17,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:17,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 394 [2024-10-13 10:01:17,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:17,747 INFO L124 PetriNetUnfolderBase]: 22/546 cut-off events. [2024-10-13 10:01:17,747 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-10-13 10:01:17,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 585 conditions, 546 events. 22/546 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1351 event pairs, 9 based on Foata normal form. 0/459 useless extension candidates. Maximal degree in co-relation 549. Up to 31 conditions per place. [2024-10-13 10:01:17,752 INFO L140 encePairwiseOnDemand]: 391/394 looper letters, 12 selfloop transitions, 2 changer transitions 0/349 dead transitions. [2024-10-13 10:01:17,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 349 transitions, 732 flow [2024-10-13 10:01:17,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:17,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:17,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1107 transitions. [2024-10-13 10:01:17,757 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9365482233502538 [2024-10-13 10:01:17,757 INFO L175 Difference]: Start difference. First operand has 347 places, 350 transitions, 706 flow. Second operand 3 states and 1107 transitions. [2024-10-13 10:01:17,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 349 transitions, 732 flow [2024-10-13 10:01:17,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 349 transitions, 731 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 10:01:17,762 INFO L231 Difference]: Finished difference. Result has 347 places, 349 transitions, 707 flow [2024-10-13 10:01:17,763 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=394, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=707, PETRI_PLACES=347, PETRI_TRANSITIONS=349} [2024-10-13 10:01:17,765 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, -15 predicate places. [2024-10-13 10:01:17,765 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 349 transitions, 707 flow [2024-10-13 10:01:17,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 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-13 10:01:17,766 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:17,766 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] [2024-10-13 10:01:17,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 10:01:17,766 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2024-10-13 10:01:17,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:17,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1167785419, now seen corresponding path program 1 times [2024-10-13 10:01:17,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:17,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377685971] [2024-10-13 10:01:17,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:17,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:18,372 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-13 10:01:18,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:18,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377685971] [2024-10-13 10:01:18,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377685971] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:18,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:18,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:01:18,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620106763] [2024-10-13 10:01:18,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:18,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:01:18,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:18,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:01:18,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:01:18,572 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 394 [2024-10-13 10:01:18,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 349 transitions, 707 flow. Second operand has 6 states, 6 states have (on average 343.5) internal successors, (2061), 6 states have internal predecessors, (2061), 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-13 10:01:18,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:18,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 394 [2024-10-13 10:01:18,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:18,776 INFO L124 PetriNetUnfolderBase]: 154/1466 cut-off events. [2024-10-13 10:01:18,776 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-10-13 10:01:18,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1722 conditions, 1466 events. 154/1466 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 7322 event pairs, 84 based on Foata normal form. 0/1218 useless extension candidates. Maximal degree in co-relation 1687. Up to 240 conditions per place. [2024-10-13 10:01:18,788 INFO L140 encePairwiseOnDemand]: 388/394 looper letters, 32 selfloop transitions, 5 changer transitions 0/348 dead transitions. [2024-10-13 10:01:18,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 348 transitions, 779 flow [2024-10-13 10:01:18,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:01:18,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 10:01:18,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2090 transitions. [2024-10-13 10:01:18,793 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8840947546531303 [2024-10-13 10:01:18,793 INFO L175 Difference]: Start difference. First operand has 347 places, 349 transitions, 707 flow. Second operand 6 states and 2090 transitions. [2024-10-13 10:01:18,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 348 transitions, 779 flow [2024-10-13 10:01:18,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 348 transitions, 775 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:01:18,799 INFO L231 Difference]: Finished difference. Result has 349 places, 348 transitions, 711 flow [2024-10-13 10:01:18,800 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=394, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=711, PETRI_PLACES=349, PETRI_TRANSITIONS=348} [2024-10-13 10:01:18,800 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, -13 predicate places. [2024-10-13 10:01:18,800 INFO L471 AbstractCegarLoop]: Abstraction has has 349 places, 348 transitions, 711 flow [2024-10-13 10:01:18,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 343.5) internal successors, (2061), 6 states have internal predecessors, (2061), 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-13 10:01:18,802 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:18,802 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-13 10:01:18,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 10:01:18,803 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2024-10-13 10:01:18,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:18,803 INFO L85 PathProgramCache]: Analyzing trace with hash 799416866, now seen corresponding path program 1 times [2024-10-13 10:01:18,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:18,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35557641] [2024-10-13 10:01:18,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:18,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:18,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:18,855 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-13 10:01:18,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:18,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35557641] [2024-10-13 10:01:18,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35557641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:18,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:18,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:18,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529869489] [2024-10-13 10:01:18,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:18,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:18,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:18,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:18,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:18,875 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 394 [2024-10-13 10:01:18,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 348 transitions, 711 flow. Second operand has 3 states, 3 states have (on average 367.0) internal successors, (1101), 3 states have internal predecessors, (1101), 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-13 10:01:18,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:18,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 394 [2024-10-13 10:01:18,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:18,983 INFO L124 PetriNetUnfolderBase]: 36/989 cut-off events. [2024-10-13 10:01:18,983 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-13 10:01:18,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1035 conditions, 989 events. 36/989 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3984 event pairs, 8 based on Foata normal form. 0/824 useless extension candidates. Maximal degree in co-relation 1017. Up to 32 conditions per place. [2024-10-13 10:01:18,991 INFO L140 encePairwiseOnDemand]: 390/394 looper letters, 10 selfloop transitions, 1 changer transitions 0/345 dead transitions. [2024-10-13 10:01:18,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 345 transitions, 727 flow [2024-10-13 10:01:18,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:18,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:18,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1112 transitions. [2024-10-13 10:01:18,994 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9407783417935702 [2024-10-13 10:01:18,994 INFO L175 Difference]: Start difference. First operand has 349 places, 348 transitions, 711 flow. Second operand 3 states and 1112 transitions. [2024-10-13 10:01:18,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 345 transitions, 727 flow [2024-10-13 10:01:18,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 345 transitions, 717 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 10:01:19,000 INFO L231 Difference]: Finished difference. Result has 343 places, 345 transitions, 697 flow [2024-10-13 10:01:19,000 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=394, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=697, PETRI_PLACES=343, PETRI_TRANSITIONS=345} [2024-10-13 10:01:19,001 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, -19 predicate places. [2024-10-13 10:01:19,001 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 345 transitions, 697 flow [2024-10-13 10:01:19,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 367.0) internal successors, (1101), 3 states have internal predecessors, (1101), 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-13 10:01:19,002 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:19,002 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:01:19,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 10:01:19,003 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2024-10-13 10:01:19,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:19,003 INFO L85 PathProgramCache]: Analyzing trace with hash -113942645, now seen corresponding path program 1 times [2024-10-13 10:01:19,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:19,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704977722] [2024-10-13 10:01:19,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:19,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:19,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:19,055 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-13 10:01:19,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:19,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704977722] [2024-10-13 10:01:19,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704977722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:19,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:19,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:19,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201915290] [2024-10-13 10:01:19,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:19,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:19,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:19,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:19,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:19,079 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 363 out of 394 [2024-10-13 10:01:19,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 345 transitions, 697 flow. Second operand has 3 states, 3 states have (on average 364.0) internal successors, (1092), 3 states have internal predecessors, (1092), 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-13 10:01:19,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:19,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 363 of 394 [2024-10-13 10:01:19,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:19,131 INFO L124 PetriNetUnfolderBase]: 18/396 cut-off events. [2024-10-13 10:01:19,132 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 10:01:19,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439 conditions, 396 events. 18/396 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 683 event pairs, 1 based on Foata normal form. 0/350 useless extension candidates. Maximal degree in co-relation 404. Up to 21 conditions per place. [2024-10-13 10:01:19,136 INFO L140 encePairwiseOnDemand]: 387/394 looper letters, 11 selfloop transitions, 3 changer transitions 0/342 dead transitions. [2024-10-13 10:01:19,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 342 transitions, 720 flow [2024-10-13 10:01:19,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:19,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:19,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1107 transitions. [2024-10-13 10:01:19,140 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9365482233502538 [2024-10-13 10:01:19,140 INFO L175 Difference]: Start difference. First operand has 343 places, 345 transitions, 697 flow. Second operand 3 states and 1107 transitions. [2024-10-13 10:01:19,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 342 transitions, 720 flow [2024-10-13 10:01:19,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 342 transitions, 719 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 10:01:19,146 INFO L231 Difference]: Finished difference. Result has 340 places, 341 transitions, 694 flow [2024-10-13 10:01:19,146 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=394, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=694, PETRI_PLACES=340, PETRI_TRANSITIONS=341} [2024-10-13 10:01:19,147 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, -22 predicate places. [2024-10-13 10:01:19,147 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 341 transitions, 694 flow [2024-10-13 10:01:19,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 364.0) internal successors, (1092), 3 states have internal predecessors, (1092), 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-13 10:01:19,149 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:19,149 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:01:19,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 10:01:19,149 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2024-10-13 10:01:19,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:19,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1157917648, now seen corresponding path program 1 times [2024-10-13 10:01:19,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:19,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372334548] [2024-10-13 10:01:19,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:19,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:19,202 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-13 10:01:19,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:19,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372334548] [2024-10-13 10:01:19,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372334548] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:19,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:19,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:19,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045046903] [2024-10-13 10:01:19,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:19,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:19,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:19,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:19,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:19,268 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 394 [2024-10-13 10:01:19,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 341 transitions, 694 flow. Second operand has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 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-13 10:01:19,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:19,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 394 [2024-10-13 10:01:19,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:19,360 INFO L124 PetriNetUnfolderBase]: 40/488 cut-off events. [2024-10-13 10:01:19,360 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-10-13 10:01:19,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 587 conditions, 488 events. 40/488 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1384 event pairs, 4 based on Foata normal form. 1/445 useless extension candidates. Maximal degree in co-relation 552. Up to 73 conditions per place. [2024-10-13 10:01:19,365 INFO L140 encePairwiseOnDemand]: 372/394 looper letters, 24 selfloop transitions, 8 changer transitions 4/329 dead transitions. [2024-10-13 10:01:19,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 329 transitions, 739 flow [2024-10-13 10:01:19,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:19,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:19,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1046 transitions. [2024-10-13 10:01:19,368 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8849407783417935 [2024-10-13 10:01:19,368 INFO L175 Difference]: Start difference. First operand has 340 places, 341 transitions, 694 flow. Second operand 3 states and 1046 transitions. [2024-10-13 10:01:19,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 329 transitions, 739 flow [2024-10-13 10:01:19,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 329 transitions, 733 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:01:19,375 INFO L231 Difference]: Finished difference. Result has 327 places, 324 transitions, 669 flow [2024-10-13 10:01:19,376 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=394, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=669, PETRI_PLACES=327, PETRI_TRANSITIONS=324} [2024-10-13 10:01:19,377 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, -35 predicate places. [2024-10-13 10:01:19,377 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 324 transitions, 669 flow [2024-10-13 10:01:19,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 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-13 10:01:19,378 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:19,378 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:01:19,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 10:01:19,379 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2024-10-13 10:01:19,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:19,379 INFO L85 PathProgramCache]: Analyzing trace with hash -534917259, now seen corresponding path program 1 times [2024-10-13 10:01:19,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:19,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636402368] [2024-10-13 10:01:19,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:19,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:19,437 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-13 10:01:19,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:19,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636402368] [2024-10-13 10:01:19,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636402368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:19,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:19,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:19,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18203665] [2024-10-13 10:01:19,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:19,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:19,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:19,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:19,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:19,473 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 394 [2024-10-13 10:01:19,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 324 transitions, 669 flow. Second operand has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 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-13 10:01:19,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:19,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 394 [2024-10-13 10:01:19,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:19,633 INFO L124 PetriNetUnfolderBase]: 71/991 cut-off events. [2024-10-13 10:01:19,633 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-10-13 10:01:19,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 991 events. 71/991 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3929 event pairs, 8 based on Foata normal form. 0/896 useless extension candidates. Maximal degree in co-relation 1088. Up to 86 conditions per place. [2024-10-13 10:01:19,641 INFO L140 encePairwiseOnDemand]: 387/394 looper letters, 16 selfloop transitions, 2 changer transitions 0/323 dead transitions. [2024-10-13 10:01:19,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 323 transitions, 705 flow [2024-10-13 10:01:19,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:19,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:19,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1103 transitions. [2024-10-13 10:01:19,646 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9331641285956007 [2024-10-13 10:01:19,646 INFO L175 Difference]: Start difference. First operand has 327 places, 324 transitions, 669 flow. Second operand 3 states and 1103 transitions. [2024-10-13 10:01:19,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 323 transitions, 705 flow [2024-10-13 10:01:19,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 323 transitions, 689 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:01:19,655 INFO L231 Difference]: Finished difference. Result has 319 places, 321 transitions, 657 flow [2024-10-13 10:01:19,656 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=394, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=657, PETRI_PLACES=319, PETRI_TRANSITIONS=321} [2024-10-13 10:01:19,657 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, -43 predicate places. [2024-10-13 10:01:19,658 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 321 transitions, 657 flow [2024-10-13 10:01:19,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 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-13 10:01:19,659 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:19,659 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:01:19,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 10:01:19,659 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2024-10-13 10:01:19,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:19,660 INFO L85 PathProgramCache]: Analyzing trace with hash 553704475, now seen corresponding path program 1 times [2024-10-13 10:01:19,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:19,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340960201] [2024-10-13 10:01:19,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:19,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:19,776 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-13 10:01:19,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:19,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340960201] [2024-10-13 10:01:19,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340960201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:19,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:19,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:01:19,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573805112] [2024-10-13 10:01:19,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:19,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:01:19,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:19,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:01:19,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:01:19,802 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 394 [2024-10-13 10:01:19,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 321 transitions, 657 flow. Second operand has 4 states, 4 states have (on average 370.25) internal successors, (1481), 4 states have internal predecessors, (1481), 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-13 10:01:19,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:19,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 394 [2024-10-13 10:01:19,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:19,971 INFO L124 PetriNetUnfolderBase]: 44/1153 cut-off events. [2024-10-13 10:01:19,971 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 10:01:19,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1224 conditions, 1153 events. 44/1153 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 4404 event pairs, 3 based on Foata normal form. 0/1041 useless extension candidates. Maximal degree in co-relation 1188. Up to 18 conditions per place. [2024-10-13 10:01:19,981 INFO L140 encePairwiseOnDemand]: 388/394 looper letters, 13 selfloop transitions, 6 changer transitions 0/330 dead transitions. [2024-10-13 10:01:19,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 330 transitions, 717 flow [2024-10-13 10:01:19,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:01:19,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 10:01:19,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1865 transitions. [2024-10-13 10:01:19,986 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9467005076142132 [2024-10-13 10:01:19,986 INFO L175 Difference]: Start difference. First operand has 319 places, 321 transitions, 657 flow. Second operand 5 states and 1865 transitions. [2024-10-13 10:01:19,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 330 transitions, 717 flow [2024-10-13 10:01:19,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 330 transitions, 717 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 10:01:19,992 INFO L231 Difference]: Finished difference. Result has 326 places, 325 transitions, 695 flow [2024-10-13 10:01:19,993 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=394, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=695, PETRI_PLACES=326, PETRI_TRANSITIONS=325} [2024-10-13 10:01:19,993 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, -36 predicate places. [2024-10-13 10:01:19,995 INFO L471 AbstractCegarLoop]: Abstraction has has 326 places, 325 transitions, 695 flow [2024-10-13 10:01:19,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 370.25) internal successors, (1481), 4 states have internal predecessors, (1481), 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-13 10:01:19,996 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:19,996 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 10:01:19,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 10:01:19,996 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2024-10-13 10:01:19,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:19,997 INFO L85 PathProgramCache]: Analyzing trace with hash 2135923734, now seen corresponding path program 1 times [2024-10-13 10:01:19,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:19,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094639037] [2024-10-13 10:01:20,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:20,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:20,544 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-13 10:01:20,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:20,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094639037] [2024-10-13 10:01:20,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094639037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:20,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:20,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:01:20,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077040685] [2024-10-13 10:01:20,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:20,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:01:20,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:20,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:01:20,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:01:20,860 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 362 out of 394 [2024-10-13 10:01:20,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 325 transitions, 695 flow. Second operand has 6 states, 6 states have (on average 363.5) internal successors, (2181), 6 states have internal predecessors, (2181), 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-13 10:01:20,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:20,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 362 of 394 [2024-10-13 10:01:20,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:21,004 INFO L124 PetriNetUnfolderBase]: 38/895 cut-off events. [2024-10-13 10:01:21,004 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-10-13 10:01:21,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 993 conditions, 895 events. 38/895 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2805 event pairs, 2 based on Foata normal form. 0/816 useless extension candidates. Maximal degree in co-relation 951. Up to 17 conditions per place. [2024-10-13 10:01:21,011 INFO L140 encePairwiseOnDemand]: 388/394 looper letters, 15 selfloop transitions, 6 changer transitions 0/328 dead transitions. [2024-10-13 10:01:21,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 328 transitions, 747 flow [2024-10-13 10:01:21,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:01:21,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 10:01:21,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2193 transitions. [2024-10-13 10:01:21,016 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9276649746192893 [2024-10-13 10:01:21,016 INFO L175 Difference]: Start difference. First operand has 326 places, 325 transitions, 695 flow. Second operand 6 states and 2193 transitions. [2024-10-13 10:01:21,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 328 transitions, 747 flow [2024-10-13 10:01:21,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 328 transitions, 747 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 10:01:21,021 INFO L231 Difference]: Finished difference. Result has 330 places, 324 transitions, 705 flow [2024-10-13 10:01:21,022 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=394, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=705, PETRI_PLACES=330, PETRI_TRANSITIONS=324} [2024-10-13 10:01:21,022 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, -32 predicate places. [2024-10-13 10:01:21,023 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 324 transitions, 705 flow [2024-10-13 10:01:21,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 363.5) internal successors, (2181), 6 states have internal predecessors, (2181), 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-13 10:01:21,024 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:21,024 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:01:21,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 10:01:21,025 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2024-10-13 10:01:21,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:21,025 INFO L85 PathProgramCache]: Analyzing trace with hash 195604909, now seen corresponding path program 1 times [2024-10-13 10:01:21,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:21,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212889491] [2024-10-13 10:01:21,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:21,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:21,126 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-13 10:01:21,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:21,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212889491] [2024-10-13 10:01:21,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212889491] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:21,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:21,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:01:21,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478861450] [2024-10-13 10:01:21,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:21,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:01:21,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:21,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:01:21,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:01:21,211 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 394 [2024-10-13 10:01:21,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 324 transitions, 705 flow. Second operand has 4 states, 4 states have (on average 367.5) internal successors, (1470), 4 states have internal predecessors, (1470), 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-13 10:01:21,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:21,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 394 [2024-10-13 10:01:21,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:21,378 INFO L124 PetriNetUnfolderBase]: 56/1124 cut-off events. [2024-10-13 10:01:21,379 INFO L125 PetriNetUnfolderBase]: For 34/35 co-relation queries the response was YES. [2024-10-13 10:01:21,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1268 conditions, 1124 events. 56/1124 cut-off events. For 34/35 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 4923 event pairs, 6 based on Foata normal form. 0/1021 useless extension candidates. Maximal degree in co-relation 1226. Up to 60 conditions per place. [2024-10-13 10:01:21,388 INFO L140 encePairwiseOnDemand]: 388/394 looper letters, 15 selfloop transitions, 6 changer transitions 0/332 dead transitions. [2024-10-13 10:01:21,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 332 transitions, 766 flow [2024-10-13 10:01:21,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:01:21,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 10:01:21,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1852 transitions. [2024-10-13 10:01:21,393 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9401015228426396 [2024-10-13 10:01:21,393 INFO L175 Difference]: Start difference. First operand has 330 places, 324 transitions, 705 flow. Second operand 5 states and 1852 transitions. [2024-10-13 10:01:21,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 332 transitions, 766 flow [2024-10-13 10:01:21,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 332 transitions, 754 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 10:01:21,399 INFO L231 Difference]: Finished difference. Result has 332 places, 328 transitions, 731 flow [2024-10-13 10:01:21,400 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=394, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=731, PETRI_PLACES=332, PETRI_TRANSITIONS=328} [2024-10-13 10:01:21,401 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, -30 predicate places. [2024-10-13 10:01:21,402 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 328 transitions, 731 flow [2024-10-13 10:01:21,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 367.5) internal successors, (1470), 4 states have internal predecessors, (1470), 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-13 10:01:21,403 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:21,403 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:01:21,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 10:01:21,404 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2024-10-13 10:01:21,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:21,404 INFO L85 PathProgramCache]: Analyzing trace with hash -652877159, now seen corresponding path program 1 times [2024-10-13 10:01:21,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:21,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057165477] [2024-10-13 10:01:21,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:21,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:21,444 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-13 10:01:21,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:21,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057165477] [2024-10-13 10:01:21,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057165477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:21,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:21,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:21,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607674486] [2024-10-13 10:01:21,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:21,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:21,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:21,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:21,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:21,470 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 394 [2024-10-13 10:01:21,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 328 transitions, 731 flow. Second operand has 3 states, 3 states have (on average 369.3333333333333) internal successors, (1108), 3 states have internal predecessors, (1108), 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-13 10:01:21,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:21,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 394 [2024-10-13 10:01:21,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:21,581 INFO L124 PetriNetUnfolderBase]: 34/820 cut-off events. [2024-10-13 10:01:21,581 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-10-13 10:01:21,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 953 conditions, 820 events. 34/820 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2214 event pairs, 10 based on Foata normal form. 0/758 useless extension candidates. Maximal degree in co-relation 908. Up to 29 conditions per place. [2024-10-13 10:01:21,587 INFO L140 encePairwiseOnDemand]: 391/394 looper letters, 9 selfloop transitions, 2 changer transitions 0/328 dead transitions. [2024-10-13 10:01:21,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 328 transitions, 754 flow [2024-10-13 10:01:21,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:21,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:21,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1113 transitions. [2024-10-13 10:01:21,590 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9416243654822335 [2024-10-13 10:01:21,590 INFO L175 Difference]: Start difference. First operand has 332 places, 328 transitions, 731 flow. Second operand 3 states and 1113 transitions. [2024-10-13 10:01:21,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 328 transitions, 754 flow [2024-10-13 10:01:21,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 328 transitions, 754 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 10:01:21,596 INFO L231 Difference]: Finished difference. Result has 333 places, 327 transitions, 733 flow [2024-10-13 10:01:21,596 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=394, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=733, PETRI_PLACES=333, PETRI_TRANSITIONS=327} [2024-10-13 10:01:21,597 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, -29 predicate places. [2024-10-13 10:01:21,597 INFO L471 AbstractCegarLoop]: Abstraction has has 333 places, 327 transitions, 733 flow [2024-10-13 10:01:21,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 369.3333333333333) internal successors, (1108), 3 states have internal predecessors, (1108), 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-13 10:01:21,598 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:21,598 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:01:21,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 10:01:21,598 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2024-10-13 10:01:21,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:21,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1719053253, now seen corresponding path program 1 times [2024-10-13 10:01:21,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:21,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641902174] [2024-10-13 10:01:21,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:21,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:21,982 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-13 10:01:21,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:21,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641902174] [2024-10-13 10:01:21,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641902174] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:21,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:21,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:01:21,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103555893] [2024-10-13 10:01:21,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:21,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:01:21,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:21,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:01:21,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:01:22,245 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 394 [2024-10-13 10:01:22,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 327 transitions, 733 flow. Second operand has 6 states, 6 states have (on average 342.6666666666667) internal successors, (2056), 6 states have internal predecessors, (2056), 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-13 10:01:22,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:22,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 394 [2024-10-13 10:01:22,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:22,439 INFO L124 PetriNetUnfolderBase]: 86/976 cut-off events. [2024-10-13 10:01:22,439 INFO L125 PetriNetUnfolderBase]: For 79/80 co-relation queries the response was YES. [2024-10-13 10:01:22,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1283 conditions, 976 events. 86/976 cut-off events. For 79/80 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4721 event pairs, 10 based on Foata normal form. 0/914 useless extension candidates. Maximal degree in co-relation 1235. Up to 70 conditions per place. [2024-10-13 10:01:22,448 INFO L140 encePairwiseOnDemand]: 370/394 looper letters, 18 selfloop transitions, 21 changer transitions 0/327 dead transitions. [2024-10-13 10:01:22,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 327 transitions, 815 flow [2024-10-13 10:01:22,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:01:22,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 10:01:22,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2088 transitions. [2024-10-13 10:01:22,454 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.883248730964467 [2024-10-13 10:01:22,454 INFO L175 Difference]: Start difference. First operand has 333 places, 327 transitions, 733 flow. Second operand 6 states and 2088 transitions. [2024-10-13 10:01:22,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 327 transitions, 815 flow [2024-10-13 10:01:22,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 327 transitions, 811 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:01:22,461 INFO L231 Difference]: Finished difference. Result has 332 places, 323 transitions, 763 flow [2024-10-13 10:01:22,462 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=394, PETRI_DIFFERENCE_MINUEND_FLOW=721, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=763, PETRI_PLACES=332, PETRI_TRANSITIONS=323} [2024-10-13 10:01:22,462 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, -30 predicate places. [2024-10-13 10:01:22,462 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 323 transitions, 763 flow [2024-10-13 10:01:22,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 342.6666666666667) internal successors, (2056), 6 states have internal predecessors, (2056), 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-13 10:01:22,464 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:22,464 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:01:22,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 10:01:22,464 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2024-10-13 10:01:22,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:22,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1373033982, now seen corresponding path program 1 times [2024-10-13 10:01:22,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:22,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901090546] [2024-10-13 10:01:22,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:22,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:22,504 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-13 10:01:22,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:22,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901090546] [2024-10-13 10:01:22,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901090546] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:22,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:22,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:22,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176808754] [2024-10-13 10:01:22,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:22,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:22,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:22,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:22,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:22,573 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 394 [2024-10-13 10:01:22,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 323 transitions, 763 flow. Second operand has 3 states, 3 states have (on average 357.6666666666667) internal successors, (1073), 3 states have internal predecessors, (1073), 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-13 10:01:22,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:22,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 394 [2024-10-13 10:01:22,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:22,736 INFO L124 PetriNetUnfolderBase]: 76/1111 cut-off events. [2024-10-13 10:01:22,736 INFO L125 PetriNetUnfolderBase]: For 78/79 co-relation queries the response was YES. [2024-10-13 10:01:22,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1482 conditions, 1111 events. 76/1111 cut-off events. For 78/79 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 5249 event pairs, 42 based on Foata normal form. 0/1044 useless extension candidates. Maximal degree in co-relation 1436. Up to 142 conditions per place. [2024-10-13 10:01:22,745 INFO L140 encePairwiseOnDemand]: 391/394 looper letters, 21 selfloop transitions, 2 changer transitions 0/323 dead transitions. [2024-10-13 10:01:22,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 323 transitions, 810 flow [2024-10-13 10:01:22,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:22,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:22,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1089 transitions. [2024-10-13 10:01:22,748 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9213197969543148 [2024-10-13 10:01:22,748 INFO L175 Difference]: Start difference. First operand has 332 places, 323 transitions, 763 flow. Second operand 3 states and 1089 transitions. [2024-10-13 10:01:22,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 323 transitions, 810 flow [2024-10-13 10:01:22,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 323 transitions, 768 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 10:01:22,757 INFO L231 Difference]: Finished difference. Result has 328 places, 322 transitions, 723 flow [2024-10-13 10:01:22,758 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=394, PETRI_DIFFERENCE_MINUEND_FLOW=719, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=723, PETRI_PLACES=328, PETRI_TRANSITIONS=322} [2024-10-13 10:01:22,759 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, -34 predicate places. [2024-10-13 10:01:22,759 INFO L471 AbstractCegarLoop]: Abstraction has has 328 places, 322 transitions, 723 flow [2024-10-13 10:01:22,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 357.6666666666667) internal successors, (1073), 3 states have internal predecessors, (1073), 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-13 10:01:22,760 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:22,760 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:01:22,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 10:01:22,760 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2024-10-13 10:01:22,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:22,761 INFO L85 PathProgramCache]: Analyzing trace with hash 117744149, now seen corresponding path program 1 times [2024-10-13 10:01:22,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:22,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143383139] [2024-10-13 10:01:22,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:22,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:22,842 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-13 10:01:22,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:22,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143383139] [2024-10-13 10:01:22,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143383139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:22,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:22,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:22,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903687783] [2024-10-13 10:01:22,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:22,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:22,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:22,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:22,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:22,920 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 394 [2024-10-13 10:01:22,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 322 transitions, 723 flow. Second operand has 3 states, 3 states have (on average 358.6666666666667) internal successors, (1076), 3 states have internal predecessors, (1076), 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-13 10:01:22,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:22,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 394 [2024-10-13 10:01:22,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:23,062 INFO L124 PetriNetUnfolderBase]: 75/1074 cut-off events. [2024-10-13 10:01:23,062 INFO L125 PetriNetUnfolderBase]: For 71/72 co-relation queries the response was YES. [2024-10-13 10:01:23,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1335 conditions, 1074 events. 75/1074 cut-off events. For 71/72 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 5004 event pairs, 42 based on Foata normal form. 0/1013 useless extension candidates. Maximal degree in co-relation 1289. Up to 142 conditions per place. [2024-10-13 10:01:23,071 INFO L140 encePairwiseOnDemand]: 391/394 looper letters, 21 selfloop transitions, 2 changer transitions 0/322 dead transitions. [2024-10-13 10:01:23,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 322 transitions, 770 flow [2024-10-13 10:01:23,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:23,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:23,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1089 transitions. [2024-10-13 10:01:23,074 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9213197969543148 [2024-10-13 10:01:23,075 INFO L175 Difference]: Start difference. First operand has 328 places, 322 transitions, 723 flow. Second operand 3 states and 1089 transitions. [2024-10-13 10:01:23,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 322 transitions, 770 flow [2024-10-13 10:01:23,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 322 transitions, 766 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:01:23,082 INFO L231 Difference]: Finished difference. Result has 327 places, 321 transitions, 721 flow [2024-10-13 10:01:23,082 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=394, PETRI_DIFFERENCE_MINUEND_FLOW=717, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=721, PETRI_PLACES=327, PETRI_TRANSITIONS=321} [2024-10-13 10:01:23,083 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, -35 predicate places. [2024-10-13 10:01:23,083 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 321 transitions, 721 flow [2024-10-13 10:01:23,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.6666666666667) internal successors, (1076), 3 states have internal predecessors, (1076), 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-13 10:01:23,084 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:23,084 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:01:23,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 10:01:23,084 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2024-10-13 10:01:23,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:23,085 INFO L85 PathProgramCache]: Analyzing trace with hash 793548876, now seen corresponding path program 1 times [2024-10-13 10:01:23,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:23,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271527524] [2024-10-13 10:01:23,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:23,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:23,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:23,153 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-13 10:01:23,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:23,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271527524] [2024-10-13 10:01:23,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271527524] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:23,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:23,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:23,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75241508] [2024-10-13 10:01:23,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:23,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:23,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:23,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:23,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:23,230 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 394 [2024-10-13 10:01:23,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 321 transitions, 721 flow. Second operand has 3 states, 3 states have (on average 359.6666666666667) internal successors, (1079), 3 states have internal predecessors, (1079), 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-13 10:01:23,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:23,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 394 [2024-10-13 10:01:23,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:23,433 INFO L124 PetriNetUnfolderBase]: 74/1036 cut-off events. [2024-10-13 10:01:23,434 INFO L125 PetriNetUnfolderBase]: For 70/71 co-relation queries the response was YES. [2024-10-13 10:01:23,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1296 conditions, 1036 events. 74/1036 cut-off events. For 70/71 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4724 event pairs, 42 based on Foata normal form. 0/981 useless extension candidates. Maximal degree in co-relation 1250. Up to 142 conditions per place. [2024-10-13 10:01:23,442 INFO L140 encePairwiseOnDemand]: 391/394 looper letters, 21 selfloop transitions, 2 changer transitions 0/321 dead transitions. [2024-10-13 10:01:23,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 321 transitions, 768 flow [2024-10-13 10:01:23,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:23,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:23,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1089 transitions. [2024-10-13 10:01:23,445 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9213197969543148 [2024-10-13 10:01:23,445 INFO L175 Difference]: Start difference. First operand has 327 places, 321 transitions, 721 flow. Second operand 3 states and 1089 transitions. [2024-10-13 10:01:23,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 321 transitions, 768 flow [2024-10-13 10:01:23,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 321 transitions, 764 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:01:23,450 INFO L231 Difference]: Finished difference. Result has 326 places, 320 transitions, 719 flow [2024-10-13 10:01:23,451 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=394, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=719, PETRI_PLACES=326, PETRI_TRANSITIONS=320} [2024-10-13 10:01:23,452 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, -36 predicate places. [2024-10-13 10:01:23,452 INFO L471 AbstractCegarLoop]: Abstraction has has 326 places, 320 transitions, 719 flow [2024-10-13 10:01:23,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 359.6666666666667) internal successors, (1079), 3 states have internal predecessors, (1079), 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-13 10:01:23,452 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:23,453 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:01:23,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 10:01:23,453 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2024-10-13 10:01:23,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:23,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1356709725, now seen corresponding path program 1 times [2024-10-13 10:01:23,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:23,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704421295] [2024-10-13 10:01:23,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:23,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:23,517 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-13 10:01:23,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:23,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704421295] [2024-10-13 10:01:23,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704421295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:23,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:23,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:23,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836180702] [2024-10-13 10:01:23,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:23,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:23,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:23,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:23,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:23,586 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 394 [2024-10-13 10:01:23,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 320 transitions, 719 flow. Second operand has 3 states, 3 states have (on average 360.6666666666667) internal successors, (1082), 3 states have internal predecessors, (1082), 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-13 10:01:23,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:23,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 394 [2024-10-13 10:01:23,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:23,724 INFO L124 PetriNetUnfolderBase]: 73/998 cut-off events. [2024-10-13 10:01:23,724 INFO L125 PetriNetUnfolderBase]: For 70/71 co-relation queries the response was YES. [2024-10-13 10:01:23,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1258 conditions, 998 events. 73/998 cut-off events. For 70/71 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4512 event pairs, 42 based on Foata normal form. 0/949 useless extension candidates. Maximal degree in co-relation 1212. Up to 142 conditions per place. [2024-10-13 10:01:23,730 INFO L140 encePairwiseOnDemand]: 391/394 looper letters, 0 selfloop transitions, 0 changer transitions 320/320 dead transitions. [2024-10-13 10:01:23,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 320 transitions, 766 flow [2024-10-13 10:01:23,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:23,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:23,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1089 transitions. [2024-10-13 10:01:23,734 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9213197969543148 [2024-10-13 10:01:23,734 INFO L175 Difference]: Start difference. First operand has 326 places, 320 transitions, 719 flow. Second operand 3 states and 1089 transitions. [2024-10-13 10:01:23,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 320 transitions, 766 flow [2024-10-13 10:01:23,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 320 transitions, 762 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:01:23,738 INFO L231 Difference]: Finished difference. Result has 325 places, 0 transitions, 0 flow [2024-10-13 10:01:23,738 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=394, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=325, PETRI_TRANSITIONS=0} [2024-10-13 10:01:23,739 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, -37 predicate places. [2024-10-13 10:01:23,740 INFO L471 AbstractCegarLoop]: Abstraction has has 325 places, 0 transitions, 0 flow [2024-10-13 10:01:23,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 360.6666666666667) internal successors, (1082), 3 states have internal predecessors, (1082), 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-13 10:01:23,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (84 of 85 remaining) [2024-10-13 10:01:23,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (83 of 85 remaining) [2024-10-13 10:01:23,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (82 of 85 remaining) [2024-10-13 10:01:23,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (81 of 85 remaining) [2024-10-13 10:01:23,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (80 of 85 remaining) [2024-10-13 10:01:23,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (79 of 85 remaining) [2024-10-13 10:01:23,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (78 of 85 remaining) [2024-10-13 10:01:23,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (77 of 85 remaining) [2024-10-13 10:01:23,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (76 of 85 remaining) [2024-10-13 10:01:23,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (75 of 85 remaining) [2024-10-13 10:01:23,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (74 of 85 remaining) [2024-10-13 10:01:23,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (73 of 85 remaining) [2024-10-13 10:01:23,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (72 of 85 remaining) [2024-10-13 10:01:23,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (71 of 85 remaining) [2024-10-13 10:01:23,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (70 of 85 remaining) [2024-10-13 10:01:23,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (69 of 85 remaining) [2024-10-13 10:01:23,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (68 of 85 remaining) [2024-10-13 10:01:23,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (67 of 85 remaining) [2024-10-13 10:01:23,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (66 of 85 remaining) [2024-10-13 10:01:23,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (65 of 85 remaining) [2024-10-13 10:01:23,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (64 of 85 remaining) [2024-10-13 10:01:23,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (63 of 85 remaining) [2024-10-13 10:01:23,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (62 of 85 remaining) [2024-10-13 10:01:23,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (61 of 85 remaining) [2024-10-13 10:01:23,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (60 of 85 remaining) [2024-10-13 10:01:23,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (59 of 85 remaining) [2024-10-13 10:01:23,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (58 of 85 remaining) [2024-10-13 10:01:23,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (57 of 85 remaining) [2024-10-13 10:01:23,747 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (56 of 85 remaining) [2024-10-13 10:01:23,747 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (55 of 85 remaining) [2024-10-13 10:01:23,747 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (54 of 85 remaining) [2024-10-13 10:01:23,747 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (53 of 85 remaining) [2024-10-13 10:01:23,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (52 of 85 remaining) [2024-10-13 10:01:23,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (51 of 85 remaining) [2024-10-13 10:01:23,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (50 of 85 remaining) [2024-10-13 10:01:23,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (49 of 85 remaining) [2024-10-13 10:01:23,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (48 of 85 remaining) [2024-10-13 10:01:23,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (47 of 85 remaining) [2024-10-13 10:01:23,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (46 of 85 remaining) [2024-10-13 10:01:23,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (45 of 85 remaining) [2024-10-13 10:01:23,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (44 of 85 remaining) [2024-10-13 10:01:23,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (43 of 85 remaining) [2024-10-13 10:01:23,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (42 of 85 remaining) [2024-10-13 10:01:23,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (41 of 85 remaining) [2024-10-13 10:01:23,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (40 of 85 remaining) [2024-10-13 10:01:23,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (39 of 85 remaining) [2024-10-13 10:01:23,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 85 remaining) [2024-10-13 10:01:23,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 85 remaining) [2024-10-13 10:01:23,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (36 of 85 remaining) [2024-10-13 10:01:23,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (35 of 85 remaining) [2024-10-13 10:01:23,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (34 of 85 remaining) [2024-10-13 10:01:23,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (33 of 85 remaining) [2024-10-13 10:01:23,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (32 of 85 remaining) [2024-10-13 10:01:23,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (31 of 85 remaining) [2024-10-13 10:01:23,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (30 of 85 remaining) [2024-10-13 10:01:23,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (29 of 85 remaining) [2024-10-13 10:01:23,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (28 of 85 remaining) [2024-10-13 10:01:23,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (27 of 85 remaining) [2024-10-13 10:01:23,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (26 of 85 remaining) [2024-10-13 10:01:23,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (25 of 85 remaining) [2024-10-13 10:01:23,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (24 of 85 remaining) [2024-10-13 10:01:23,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (23 of 85 remaining) [2024-10-13 10:01:23,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (22 of 85 remaining) [2024-10-13 10:01:23,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (21 of 85 remaining) [2024-10-13 10:01:23,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (20 of 85 remaining) [2024-10-13 10:01:23,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (19 of 85 remaining) [2024-10-13 10:01:23,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (18 of 85 remaining) [2024-10-13 10:01:23,753 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (17 of 85 remaining) [2024-10-13 10:01:23,753 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (16 of 85 remaining) [2024-10-13 10:01:23,753 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (15 of 85 remaining) [2024-10-13 10:01:23,753 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (14 of 85 remaining) [2024-10-13 10:01:23,753 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (13 of 85 remaining) [2024-10-13 10:01:23,753 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (12 of 85 remaining) [2024-10-13 10:01:23,753 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (11 of 85 remaining) [2024-10-13 10:01:23,754 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (10 of 85 remaining) [2024-10-13 10:01:23,754 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (9 of 85 remaining) [2024-10-13 10:01:23,754 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (8 of 85 remaining) [2024-10-13 10:01:23,754 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (7 of 85 remaining) [2024-10-13 10:01:23,754 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (6 of 85 remaining) [2024-10-13 10:01:23,754 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (5 of 85 remaining) [2024-10-13 10:01:23,754 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (4 of 85 remaining) [2024-10-13 10:01:23,754 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (3 of 85 remaining) [2024-10-13 10:01:23,754 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (2 of 85 remaining) [2024-10-13 10:01:23,754 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (1 of 85 remaining) [2024-10-13 10:01:23,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (0 of 85 remaining) [2024-10-13 10:01:23,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 10:01:23,755 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:01:23,762 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 10:01:23,763 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 10:01:23,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:01:23 BasicIcfg [2024-10-13 10:01:23,769 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 10:01:23,770 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 10:01:23,770 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 10:01:23,770 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 10:01:23,770 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:01:15" (3/4) ... [2024-10-13 10:01:23,772 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 10:01:23,775 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-13 10:01:23,775 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-13 10:01:23,781 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-10-13 10:01:23,781 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-13 10:01:23,782 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 10:01:23,782 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 10:01:23,881 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 10:01:23,882 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 10:01:23,882 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 10:01:23,882 INFO L158 Benchmark]: Toolchain (without parser) took 9226.54ms. Allocated memory was 172.0MB in the beginning and 377.5MB in the end (delta: 205.5MB). Free memory was 114.1MB in the beginning and 162.8MB in the end (delta: -48.6MB). Peak memory consumption was 161.6MB. Max. memory is 16.1GB. [2024-10-13 10:01:23,883 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 172.0MB. Free memory is still 137.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:01:23,883 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.69ms. Allocated memory is still 172.0MB. Free memory was 114.1MB in the beginning and 99.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 10:01:23,883 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.87ms. Allocated memory is still 172.0MB. Free memory was 99.4MB in the beginning and 96.5MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 10:01:23,883 INFO L158 Benchmark]: Boogie Preprocessor took 48.48ms. Allocated memory is still 172.0MB. Free memory was 96.5MB in the beginning and 94.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 10:01:23,884 INFO L158 Benchmark]: RCFGBuilder took 834.34ms. Allocated memory is still 172.0MB. Free memory was 94.0MB in the beginning and 63.4MB in the end (delta: 30.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-13 10:01:23,884 INFO L158 Benchmark]: TraceAbstraction took 7835.70ms. Allocated memory was 172.0MB in the beginning and 377.5MB in the end (delta: 205.5MB). Free memory was 62.5MB in the beginning and 169.1MB in the end (delta: -106.6MB). Peak memory consumption was 102.9MB. Max. memory is 16.1GB. [2024-10-13 10:01:23,884 INFO L158 Benchmark]: Witness Printer took 112.31ms. Allocated memory is still 377.5MB. Free memory was 169.1MB in the beginning and 162.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 10:01:23,885 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 172.0MB. Free memory is still 137.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.69ms. Allocated memory is still 172.0MB. Free memory was 114.1MB in the beginning and 99.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.87ms. Allocated memory is still 172.0MB. Free memory was 99.4MB in the beginning and 96.5MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.48ms. Allocated memory is still 172.0MB. Free memory was 96.5MB in the beginning and 94.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 834.34ms. Allocated memory is still 172.0MB. Free memory was 94.0MB in the beginning and 63.4MB in the end (delta: 30.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7835.70ms. Allocated memory was 172.0MB in the beginning and 377.5MB in the end (delta: 205.5MB). Free memory was 62.5MB in the beginning and 169.1MB in the end (delta: -106.6MB). Peak memory consumption was 102.9MB. Max. memory is 16.1GB. * Witness Printer took 112.31ms. Allocated memory is still 377.5MB. Free memory was 169.1MB in the beginning and 162.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: 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: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: 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, 609 locations, 85 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: 7.6s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1437 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 604 mSDsluCounter, 140 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 254 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1573 IncrementalHoareTripleChecker+Invalid, 1827 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 254 mSolverCounterUnsat, 120 mSDtfsCounter, 1573 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=763occurred in iteration=14, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1845 NumberOfCodeBlocks, 1845 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1827 ConstructedInterpolants, 0 QuantifiedInterpolants, 2544 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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 46 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-13 10:01:23,922 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