./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/chl-array-int-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version fca748b1 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/chl-array-int-symm.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8a0558934008acf79b7e5b205fa256c568a1b783af274566f36b253458639325 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 13:52:14,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 13:52:14,104 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-20 13:52:14,107 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 13:52:14,109 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 13:52:14,132 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 13:52:14,132 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 13:52:14,132 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 13:52:14,133 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 13:52:14,133 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 13:52:14,133 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 13:52:14,133 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 13:52:14,133 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 13:52:14,134 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 13:52:14,134 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 13:52:14,135 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 13:52:14,136 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 13:52:14,137 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 13:52:14,138 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 13:52:14,138 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 13:52:14,138 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 13:52:14,139 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 13:52:14,139 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-20 13:52:14,139 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 13:52:14,139 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 13:52:14,140 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 13:52:14,141 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 13:52:14,141 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 13:52:14,141 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 13:52:14,142 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 13:52:14,142 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 13:52:14,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 13:52:14,142 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 13:52:14,142 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 13:52:14,142 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 13:52:14,142 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 13:52:14,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 13:52:14,143 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 13:52:14,143 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 13:52:14,143 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 13:52:14,143 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 13:52:14,144 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 -> 8a0558934008acf79b7e5b205fa256c568a1b783af274566f36b253458639325 [2024-11-20 13:52:14,347 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 13:52:14,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 13:52:14,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 13:52:14,373 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 13:52:14,374 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 13:52:14,375 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c [2024-11-20 13:52:15,661 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 13:52:15,834 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 13:52:15,835 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c [2024-11-20 13:52:15,842 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/621c260a4/ed7294f881a246cfb377e1071e4e8002/FLAGf8715b2dd [2024-11-20 13:52:16,239 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/621c260a4/ed7294f881a246cfb377e1071e4e8002 [2024-11-20 13:52:16,241 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 13:52:16,242 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 13:52:16,244 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 13:52:16,244 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 13:52:16,249 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 13:52:16,249 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:52:16" (1/1) ... [2024-11-20 13:52:16,252 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bd1135b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:52:16, skipping insertion in model container [2024-11-20 13:52:16,252 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:52:16" (1/1) ... [2024-11-20 13:52:16,275 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 13:52:16,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 13:52:16,496 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 13:52:16,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 13:52:16,613 INFO L204 MainTranslator]: Completed translation [2024-11-20 13:52:16,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:52:16 WrapperNode [2024-11-20 13:52:16,614 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 13:52:16,615 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 13:52:16,615 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 13:52:16,615 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 13:52:16,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:52:16" (1/1) ... [2024-11-20 13:52:16,633 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:52:16" (1/1) ... [2024-11-20 13:52:16,660 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 14, calls inlined = 18, statements flattened = 351 [2024-11-20 13:52:16,660 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 13:52:16,661 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 13:52:16,661 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 13:52:16,661 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 13:52:16,668 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:52:16" (1/1) ... [2024-11-20 13:52:16,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:52:16" (1/1) ... [2024-11-20 13:52:16,673 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:52:16" (1/1) ... [2024-11-20 13:52:16,674 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:52:16" (1/1) ... [2024-11-20 13:52:16,686 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:52:16" (1/1) ... [2024-11-20 13:52:16,690 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:52:16" (1/1) ... [2024-11-20 13:52:16,692 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:52:16" (1/1) ... [2024-11-20 13:52:16,693 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:52:16" (1/1) ... [2024-11-20 13:52:16,696 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 13:52:16,697 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 13:52:16,697 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 13:52:16,697 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 13:52:16,698 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:52:16" (1/1) ... [2024-11-20 13:52:16,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 13:52:16,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 13:52:16,732 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 13:52:16,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 13:52:16,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 13:52:16,783 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-20 13:52:16,784 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-20 13:52:16,784 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-20 13:52:16,784 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-20 13:52:16,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-20 13:52:16,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-20 13:52:16,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 13:52:16,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 13:52:16,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 13:52:16,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-20 13:52:16,787 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-20 13:52:16,893 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 13:52:16,894 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 13:52:17,377 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-20 13:52:17,377 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 13:52:17,396 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 13:52:17,396 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-20 13:52:17,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:52:17 BoogieIcfgContainer [2024-11-20 13:52:17,397 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 13:52:17,398 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 13:52:17,398 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 13:52:17,401 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 13:52:17,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 01:52:16" (1/3) ... [2024-11-20 13:52:17,401 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c022049 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:52:17, skipping insertion in model container [2024-11-20 13:52:17,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:52:16" (2/3) ... [2024-11-20 13:52:17,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c022049 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:52:17, skipping insertion in model container [2024-11-20 13:52:17,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:52:17" (3/3) ... [2024-11-20 13:52:17,403 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-array-int-symm.wvr.c [2024-11-20 13:52:17,415 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 13:52:17,415 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2024-11-20 13:52:17,416 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-20 13:52:17,501 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-20 13:52:17,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 440 places, 459 transitions, 932 flow [2024-11-20 13:52:17,640 INFO L124 PetriNetUnfolderBase]: 26/457 cut-off events. [2024-11-20 13:52:17,641 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-20 13:52:17,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 466 conditions, 457 events. 26/457 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 888 event pairs, 0 based on Foata normal form. 0/389 useless extension candidates. Maximal degree in co-relation 274. Up to 3 conditions per place. [2024-11-20 13:52:17,654 INFO L82 GeneralOperation]: Start removeDead. Operand has 440 places, 459 transitions, 932 flow [2024-11-20 13:52:17,666 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 420 places, 437 transitions, 886 flow [2024-11-20 13:52:17,675 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 13:52:17,684 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;@424e0b12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 13:52:17,685 INFO L334 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2024-11-20 13:52:17,689 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 13:52:17,689 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2024-11-20 13:52:17,689 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 13:52:17,689 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:52:17,690 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:52:17,690 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-20 13:52:17,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:52:17,696 INFO L85 PathProgramCache]: Analyzing trace with hash 198780923, now seen corresponding path program 1 times [2024-11-20 13:52:17,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:52:17,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177362999] [2024-11-20 13:52:17,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:52:17,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:52:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:52:17,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:52:17,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:52:17,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177362999] [2024-11-20 13:52:17,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177362999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:52:17,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:52:17,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:52:17,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819780434] [2024-11-20 13:52:17,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:52:17,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:52:17,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:52:17,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:52:17,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:52:17,937 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 459 [2024-11-20 13:52:17,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 437 transitions, 886 flow. Second operand has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:17,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:52:17,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 459 [2024-11-20 13:52:17,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:52:18,049 INFO L124 PetriNetUnfolderBase]: 27/762 cut-off events. [2024-11-20 13:52:18,049 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-20 13:52:18,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 808 conditions, 762 events. 27/762 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2903 event pairs, 8 based on Foata normal form. 18/660 useless extension candidates. Maximal degree in co-relation 591. Up to 29 conditions per place. [2024-11-20 13:52:18,060 INFO L140 encePairwiseOnDemand]: 442/459 looper letters, 12 selfloop transitions, 2 changer transitions 6/422 dead transitions. [2024-11-20 13:52:18,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 422 transitions, 884 flow [2024-11-20 13:52:18,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:52:18,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:52:18,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1310 transitions. [2024-11-20 13:52:18,078 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9513435003631082 [2024-11-20 13:52:18,082 INFO L175 Difference]: Start difference. First operand has 420 places, 437 transitions, 886 flow. Second operand 3 states and 1310 transitions. [2024-11-20 13:52:18,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 422 transitions, 884 flow [2024-11-20 13:52:18,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 422 transitions, 876 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-20 13:52:18,094 INFO L231 Difference]: Finished difference. Result has 417 places, 416 transitions, 840 flow [2024-11-20 13:52:18,096 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=840, PETRI_PLACES=417, PETRI_TRANSITIONS=416} [2024-11-20 13:52:18,100 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, -3 predicate places. [2024-11-20 13:52:18,101 INFO L471 AbstractCegarLoop]: Abstraction has has 417 places, 416 transitions, 840 flow [2024-11-20 13:52:18,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:18,102 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:52:18,102 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:52:18,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 13:52:18,103 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-20 13:52:18,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:52:18,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1174509040, now seen corresponding path program 1 times [2024-11-20 13:52:18,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:52:18,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660685131] [2024-11-20 13:52:18,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:52:18,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:52:18,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:52:18,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:52:18,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:52:18,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660685131] [2024-11-20 13:52:18,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660685131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:52:18,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:52:18,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:52:18,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143785905] [2024-11-20 13:52:18,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:52:18,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:52:18,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:52:18,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:52:18,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:52:18,212 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 459 [2024-11-20 13:52:18,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 416 transitions, 840 flow. Second operand has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:18,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:52:18,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 459 [2024-11-20 13:52:18,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:52:18,325 INFO L124 PetriNetUnfolderBase]: 27/746 cut-off events. [2024-11-20 13:52:18,325 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-20 13:52:18,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 785 conditions, 746 events. 27/746 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2870 event pairs, 8 based on Foata normal form. 0/638 useless extension candidates. Maximal degree in co-relation 755. Up to 29 conditions per place. [2024-11-20 13:52:18,329 INFO L140 encePairwiseOnDemand]: 456/459 looper letters, 12 selfloop transitions, 2 changer transitions 0/415 dead transitions. [2024-11-20 13:52:18,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 415 transitions, 866 flow [2024-11-20 13:52:18,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:52:18,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:52:18,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1296 transitions. [2024-11-20 13:52:18,331 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9411764705882353 [2024-11-20 13:52:18,331 INFO L175 Difference]: Start difference. First operand has 417 places, 416 transitions, 840 flow. Second operand 3 states and 1296 transitions. [2024-11-20 13:52:18,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 415 transitions, 866 flow [2024-11-20 13:52:18,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 415 transitions, 862 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:52:18,337 INFO L231 Difference]: Finished difference. Result has 410 places, 415 transitions, 838 flow [2024-11-20 13:52:18,337 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=838, PETRI_PLACES=410, PETRI_TRANSITIONS=415} [2024-11-20 13:52:18,338 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, -10 predicate places. [2024-11-20 13:52:18,338 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 415 transitions, 838 flow [2024-11-20 13:52:18,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:18,339 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:52:18,339 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:52:18,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 13:52:18,339 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-20 13:52:18,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:52:18,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1661670269, now seen corresponding path program 1 times [2024-11-20 13:52:18,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:52:18,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665915791] [2024-11-20 13:52:18,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:52:18,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:52:18,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:52:18,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:52:18,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:52:18,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665915791] [2024-11-20 13:52:18,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665915791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:52:18,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:52:18,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:52:18,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124724219] [2024-11-20 13:52:18,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:52:18,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:52:18,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:52:18,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:52:18,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:52:18,388 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 459 [2024-11-20 13:52:18,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 415 transitions, 838 flow. Second operand has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:18,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:52:18,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 459 [2024-11-20 13:52:18,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:52:18,524 INFO L124 PetriNetUnfolderBase]: 62/1354 cut-off events. [2024-11-20 13:52:18,524 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-20 13:52:18,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1433 conditions, 1354 events. 62/1354 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7770 event pairs, 24 based on Foata normal form. 0/1156 useless extension candidates. Maximal degree in co-relation 1395. Up to 67 conditions per place. [2024-11-20 13:52:18,532 INFO L140 encePairwiseOnDemand]: 453/459 looper letters, 14 selfloop transitions, 1 changer transitions 0/410 dead transitions. [2024-11-20 13:52:18,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 410 transitions, 858 flow [2024-11-20 13:52:18,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:52:18,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:52:18,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1289 transitions. [2024-11-20 13:52:18,534 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9360929557007989 [2024-11-20 13:52:18,534 INFO L175 Difference]: Start difference. First operand has 410 places, 415 transitions, 838 flow. Second operand 3 states and 1289 transitions. [2024-11-20 13:52:18,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 410 transitions, 858 flow [2024-11-20 13:52:18,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 410 transitions, 854 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:52:18,540 INFO L231 Difference]: Finished difference. Result has 405 places, 410 transitions, 826 flow [2024-11-20 13:52:18,540 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=826, PETRI_PLACES=405, PETRI_TRANSITIONS=410} [2024-11-20 13:52:18,541 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, -15 predicate places. [2024-11-20 13:52:18,541 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 410 transitions, 826 flow [2024-11-20 13:52:18,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:18,542 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:52:18,542 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:52:18,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 13:52:18,542 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-20 13:52:18,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:52:18,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1383884967, now seen corresponding path program 1 times [2024-11-20 13:52:18,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:52:18,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7856896] [2024-11-20 13:52:18,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:52:18,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:52:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:52:18,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:52:18,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:52:18,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7856896] [2024-11-20 13:52:18,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7856896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:52:18,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:52:18,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:52:18,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989755307] [2024-11-20 13:52:18,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:52:18,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:52:18,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:52:18,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:52:18,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:52:18,632 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 459 [2024-11-20 13:52:18,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 410 transitions, 826 flow. Second operand has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:18,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:52:18,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 459 [2024-11-20 13:52:18,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:52:18,724 INFO L124 PetriNetUnfolderBase]: 24/645 cut-off events. [2024-11-20 13:52:18,725 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-20 13:52:18,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682 conditions, 645 events. 24/645 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2147 event pairs, 8 based on Foata normal form. 0/561 useless extension candidates. Maximal degree in co-relation 644. Up to 28 conditions per place. [2024-11-20 13:52:18,730 INFO L140 encePairwiseOnDemand]: 456/459 looper letters, 11 selfloop transitions, 2 changer transitions 0/409 dead transitions. [2024-11-20 13:52:18,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 409 transitions, 850 flow [2024-11-20 13:52:18,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:52:18,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:52:18,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1298 transitions. [2024-11-20 13:52:18,733 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9426289034132171 [2024-11-20 13:52:18,733 INFO L175 Difference]: Start difference. First operand has 405 places, 410 transitions, 826 flow. Second operand 3 states and 1298 transitions. [2024-11-20 13:52:18,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 409 transitions, 850 flow [2024-11-20 13:52:18,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 409 transitions, 849 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 13:52:18,739 INFO L231 Difference]: Finished difference. Result has 405 places, 409 transitions, 827 flow [2024-11-20 13:52:18,739 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=827, PETRI_PLACES=405, PETRI_TRANSITIONS=409} [2024-11-20 13:52:18,740 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, -15 predicate places. [2024-11-20 13:52:18,740 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 409 transitions, 827 flow [2024-11-20 13:52:18,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:18,741 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:52:18,741 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:52:18,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 13:52:18,741 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-20 13:52:18,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:52:18,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1526450652, now seen corresponding path program 1 times [2024-11-20 13:52:18,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:52:18,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027899924] [2024-11-20 13:52:18,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:52:18,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:52:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:52:19,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:52:19,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:52:19,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027899924] [2024-11-20 13:52:19,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027899924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:52:19,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:52:19,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 13:52:19,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547477787] [2024-11-20 13:52:19,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:52:19,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 13:52:19,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:52:19,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 13:52:19,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-20 13:52:19,473 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 459 [2024-11-20 13:52:19,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 409 transitions, 827 flow. Second operand has 6 states, 6 states have (on average 380.5) internal successors, (2283), 6 states have internal predecessors, (2283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:19,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:52:19,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 459 [2024-11-20 13:52:19,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:52:19,751 INFO L124 PetriNetUnfolderBase]: 393/2911 cut-off events. [2024-11-20 13:52:19,751 INFO L125 PetriNetUnfolderBase]: For 46/47 co-relation queries the response was YES. [2024-11-20 13:52:19,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3635 conditions, 2911 events. 393/2911 cut-off events. For 46/47 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 22385 event pairs, 288 based on Foata normal form. 0/2513 useless extension candidates. Maximal degree in co-relation 3598. Up to 691 conditions per place. [2024-11-20 13:52:19,762 INFO L140 encePairwiseOnDemand]: 447/459 looper letters, 52 selfloop transitions, 10 changer transitions 0/407 dead transitions. [2024-11-20 13:52:19,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 407 transitions, 947 flow [2024-11-20 13:52:19,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 13:52:19,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 13:52:19,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2338 transitions. [2024-11-20 13:52:19,766 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8489469862018881 [2024-11-20 13:52:19,766 INFO L175 Difference]: Start difference. First operand has 405 places, 409 transitions, 827 flow. Second operand 6 states and 2338 transitions. [2024-11-20 13:52:19,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 407 transitions, 947 flow [2024-11-20 13:52:19,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 407 transitions, 943 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:52:19,770 INFO L231 Difference]: Finished difference. Result has 406 places, 407 transitions, 839 flow [2024-11-20 13:52:19,771 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=819, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=839, PETRI_PLACES=406, PETRI_TRANSITIONS=407} [2024-11-20 13:52:19,772 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, -14 predicate places. [2024-11-20 13:52:19,772 INFO L471 AbstractCegarLoop]: Abstraction has has 406 places, 407 transitions, 839 flow [2024-11-20 13:52:19,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 380.5) internal successors, (2283), 6 states have internal predecessors, (2283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:19,773 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:52:19,773 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:52:19,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 13:52:19,773 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-20 13:52:19,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:52:19,774 INFO L85 PathProgramCache]: Analyzing trace with hash 2027577560, now seen corresponding path program 1 times [2024-11-20 13:52:19,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:52:19,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39902652] [2024-11-20 13:52:19,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:52:19,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:52:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:52:19,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:52:19,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:52:19,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39902652] [2024-11-20 13:52:19,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39902652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:52:19,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:52:19,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:52:19,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492130852] [2024-11-20 13:52:19,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:52:19,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:52:19,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:52:19,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:52:19,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:52:19,818 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 459 [2024-11-20 13:52:19,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 407 transitions, 839 flow. Second operand has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:19,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:52:19,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 459 [2024-11-20 13:52:19,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:52:19,947 INFO L124 PetriNetUnfolderBase]: 65/1347 cut-off events. [2024-11-20 13:52:19,947 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-20 13:52:19,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1437 conditions, 1347 events. 65/1347 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7667 event pairs, 24 based on Foata normal form. 0/1170 useless extension candidates. Maximal degree in co-relation 1404. Up to 69 conditions per place. [2024-11-20 13:52:19,959 INFO L140 encePairwiseOnDemand]: 453/459 looper letters, 14 selfloop transitions, 1 changer transitions 0/402 dead transitions. [2024-11-20 13:52:19,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 402 transitions, 859 flow [2024-11-20 13:52:19,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:52:19,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:52:19,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1289 transitions. [2024-11-20 13:52:19,961 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9360929557007989 [2024-11-20 13:52:19,962 INFO L175 Difference]: Start difference. First operand has 406 places, 407 transitions, 839 flow. Second operand 3 states and 1289 transitions. [2024-11-20 13:52:19,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 402 transitions, 859 flow [2024-11-20 13:52:19,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 402 transitions, 839 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-20 13:52:19,967 INFO L231 Difference]: Finished difference. Result has 398 places, 402 transitions, 811 flow [2024-11-20 13:52:19,967 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=811, PETRI_PLACES=398, PETRI_TRANSITIONS=402} [2024-11-20 13:52:19,968 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, -22 predicate places. [2024-11-20 13:52:19,968 INFO L471 AbstractCegarLoop]: Abstraction has has 398 places, 402 transitions, 811 flow [2024-11-20 13:52:19,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:19,969 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:52:19,969 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:52:19,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 13:52:19,969 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-20 13:52:19,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:52:19,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1140018953, now seen corresponding path program 1 times [2024-11-20 13:52:19,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:52:19,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755268806] [2024-11-20 13:52:19,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:52:19,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:52:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:52:20,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:52:20,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:52:20,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755268806] [2024-11-20 13:52:20,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755268806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:52:20,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:52:20,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:52:20,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144224549] [2024-11-20 13:52:20,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:52:20,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:52:20,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:52:20,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:52:20,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:52:20,040 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 459 [2024-11-20 13:52:20,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 402 transitions, 811 flow. Second operand has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:20,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:52:20,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 459 [2024-11-20 13:52:20,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:52:20,103 INFO L124 PetriNetUnfolderBase]: 24/633 cut-off events. [2024-11-20 13:52:20,103 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-20 13:52:20,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 671 conditions, 633 events. 24/633 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2034 event pairs, 8 based on Foata normal form. 0/561 useless extension candidates. Maximal degree in co-relation 633. Up to 28 conditions per place. [2024-11-20 13:52:20,106 INFO L140 encePairwiseOnDemand]: 456/459 looper letters, 11 selfloop transitions, 2 changer transitions 0/401 dead transitions. [2024-11-20 13:52:20,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 401 transitions, 835 flow [2024-11-20 13:52:20,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:52:20,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:52:20,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1298 transitions. [2024-11-20 13:52:20,108 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9426289034132171 [2024-11-20 13:52:20,109 INFO L175 Difference]: Start difference. First operand has 398 places, 402 transitions, 811 flow. Second operand 3 states and 1298 transitions. [2024-11-20 13:52:20,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 401 transitions, 835 flow [2024-11-20 13:52:20,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 401 transitions, 834 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 13:52:20,113 INFO L231 Difference]: Finished difference. Result has 398 places, 401 transitions, 812 flow [2024-11-20 13:52:20,113 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=812, PETRI_PLACES=398, PETRI_TRANSITIONS=401} [2024-11-20 13:52:20,114 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, -22 predicate places. [2024-11-20 13:52:20,114 INFO L471 AbstractCegarLoop]: Abstraction has has 398 places, 401 transitions, 812 flow [2024-11-20 13:52:20,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:20,115 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:52:20,115 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:52:20,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 13:52:20,115 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-20 13:52:20,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:52:20,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1506054664, now seen corresponding path program 1 times [2024-11-20 13:52:20,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:52:20,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576782083] [2024-11-20 13:52:20,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:52:20,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:52:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:52:20,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:52:20,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:52:20,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576782083] [2024-11-20 13:52:20,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576782083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:52:20,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:52:20,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:52:20,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073849361] [2024-11-20 13:52:20,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:52:20,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:52:20,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:52:20,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:52:20,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:52:20,165 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 430 out of 459 [2024-11-20 13:52:20,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 401 transitions, 812 flow. Second operand has 3 states, 3 states have (on average 431.3333333333333) internal successors, (1294), 3 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:20,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:52:20,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 430 of 459 [2024-11-20 13:52:20,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:52:20,214 INFO L124 PetriNetUnfolderBase]: 21/615 cut-off events. [2024-11-20 13:52:20,214 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2024-11-20 13:52:20,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 651 conditions, 615 events. 21/615 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1981 event pairs, 3 based on Foata normal form. 1/548 useless extension candidates. Maximal degree in co-relation 614. Up to 17 conditions per place. [2024-11-20 13:52:20,218 INFO L140 encePairwiseOnDemand]: 456/459 looper letters, 11 selfloop transitions, 2 changer transitions 0/401 dead transitions. [2024-11-20 13:52:20,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 401 transitions, 839 flow [2024-11-20 13:52:20,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:52:20,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:52:20,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1304 transitions. [2024-11-20 13:52:20,221 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9469862018881626 [2024-11-20 13:52:20,221 INFO L175 Difference]: Start difference. First operand has 398 places, 401 transitions, 812 flow. Second operand 3 states and 1304 transitions. [2024-11-20 13:52:20,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 401 transitions, 839 flow [2024-11-20 13:52:20,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 401 transitions, 835 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:52:20,225 INFO L231 Difference]: Finished difference. Result has 397 places, 400 transitions, 810 flow [2024-11-20 13:52:20,226 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=810, PETRI_PLACES=397, PETRI_TRANSITIONS=400} [2024-11-20 13:52:20,227 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, -23 predicate places. [2024-11-20 13:52:20,227 INFO L471 AbstractCegarLoop]: Abstraction has has 397 places, 400 transitions, 810 flow [2024-11-20 13:52:20,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 431.3333333333333) internal successors, (1294), 3 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:20,228 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:52:20,228 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:52:20,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 13:52:20,228 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-20 13:52:20,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:52:20,229 INFO L85 PathProgramCache]: Analyzing trace with hash 147824934, now seen corresponding path program 1 times [2024-11-20 13:52:20,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:52:20,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786610919] [2024-11-20 13:52:20,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:52:20,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:52:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:52:20,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:52:20,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:52:20,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786610919] [2024-11-20 13:52:20,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786610919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:52:20,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:52:20,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:52:20,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391915259] [2024-11-20 13:52:20,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:52:20,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:52:20,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:52:20,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:52:20,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:52:20,277 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 430 out of 459 [2024-11-20 13:52:20,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 400 transitions, 810 flow. Second operand has 3 states, 3 states have (on average 431.6666666666667) internal successors, (1295), 3 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:20,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:52:20,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 430 of 459 [2024-11-20 13:52:20,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:52:20,318 INFO L124 PetriNetUnfolderBase]: 18/504 cut-off events. [2024-11-20 13:52:20,318 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2024-11-20 13:52:20,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 504 events. 18/504 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1264 event pairs, 3 based on Foata normal form. 0/450 useless extension candidates. Maximal degree in co-relation 498. Up to 17 conditions per place. [2024-11-20 13:52:20,321 INFO L140 encePairwiseOnDemand]: 456/459 looper letters, 11 selfloop transitions, 2 changer transitions 0/400 dead transitions. [2024-11-20 13:52:20,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 400 transitions, 837 flow [2024-11-20 13:52:20,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:52:20,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:52:20,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1304 transitions. [2024-11-20 13:52:20,323 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9469862018881626 [2024-11-20 13:52:20,323 INFO L175 Difference]: Start difference. First operand has 397 places, 400 transitions, 810 flow. Second operand 3 states and 1304 transitions. [2024-11-20 13:52:20,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 400 transitions, 837 flow [2024-11-20 13:52:20,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 400 transitions, 833 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:52:20,328 INFO L231 Difference]: Finished difference. Result has 396 places, 399 transitions, 808 flow [2024-11-20 13:52:20,328 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=808, PETRI_PLACES=396, PETRI_TRANSITIONS=399} [2024-11-20 13:52:20,329 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, -24 predicate places. [2024-11-20 13:52:20,329 INFO L471 AbstractCegarLoop]: Abstraction has has 396 places, 399 transitions, 808 flow [2024-11-20 13:52:20,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 431.6666666666667) internal successors, (1295), 3 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:20,330 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:52:20,330 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] [2024-11-20 13:52:20,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 13:52:20,331 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-20 13:52:20,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:52:20,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1125389790, now seen corresponding path program 1 times [2024-11-20 13:52:20,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:52:20,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485998988] [2024-11-20 13:52:20,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:52:20,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:52:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:52:20,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:52:20,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:52:20,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485998988] [2024-11-20 13:52:20,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485998988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:52:20,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:52:20,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 13:52:20,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445190473] [2024-11-20 13:52:20,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:52:20,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:52:20,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:52:20,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:52:20,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:52:20,364 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 459 [2024-11-20 13:52:20,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 399 transitions, 808 flow. Second operand has 3 states, 3 states have (on average 432.6666666666667) internal successors, (1298), 3 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:20,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:52:20,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 459 [2024-11-20 13:52:20,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:52:20,426 INFO L124 PetriNetUnfolderBase]: 24/615 cut-off events. [2024-11-20 13:52:20,426 INFO L125 PetriNetUnfolderBase]: For 2/10 co-relation queries the response was YES. [2024-11-20 13:52:20,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 665 conditions, 615 events. 24/615 cut-off events. For 2/10 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1939 event pairs, 6 based on Foata normal form. 1/550 useless extension candidates. Maximal degree in co-relation 628. Up to 24 conditions per place. [2024-11-20 13:52:20,429 INFO L140 encePairwiseOnDemand]: 455/459 looper letters, 11 selfloop transitions, 3 changer transitions 0/401 dead transitions. [2024-11-20 13:52:20,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 401 transitions, 841 flow [2024-11-20 13:52:20,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:52:20,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:52:20,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1308 transitions. [2024-11-20 13:52:20,432 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9498910675381264 [2024-11-20 13:52:20,433 INFO L175 Difference]: Start difference. First operand has 396 places, 399 transitions, 808 flow. Second operand 3 states and 1308 transitions. [2024-11-20 13:52:20,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 401 transitions, 841 flow [2024-11-20 13:52:20,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 401 transitions, 837 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:52:20,439 INFO L231 Difference]: Finished difference. Result has 398 places, 400 transitions, 822 flow [2024-11-20 13:52:20,440 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=822, PETRI_PLACES=398, PETRI_TRANSITIONS=400} [2024-11-20 13:52:20,440 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, -22 predicate places. [2024-11-20 13:52:20,440 INFO L471 AbstractCegarLoop]: Abstraction has has 398 places, 400 transitions, 822 flow [2024-11-20 13:52:20,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 432.6666666666667) internal successors, (1298), 3 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:20,441 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:52:20,442 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:52:20,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 13:52:20,442 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-20 13:52:20,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:52:20,442 INFO L85 PathProgramCache]: Analyzing trace with hash 747286598, now seen corresponding path program 1 times [2024-11-20 13:52:20,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:52:20,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671736724] [2024-11-20 13:52:20,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:52:20,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:52:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:52:20,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:52:20,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:52:20,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671736724] [2024-11-20 13:52:20,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671736724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:52:20,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:52:20,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:52:20,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906667513] [2024-11-20 13:52:20,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:52:20,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:52:20,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:52:20,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:52:20,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:52:20,491 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 459 [2024-11-20 13:52:20,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 400 transitions, 822 flow. Second operand has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:20,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:52:20,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 459 [2024-11-20 13:52:20,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:52:20,608 INFO L124 PetriNetUnfolderBase]: 69/1225 cut-off events. [2024-11-20 13:52:20,608 INFO L125 PetriNetUnfolderBase]: For 22/23 co-relation queries the response was YES. [2024-11-20 13:52:20,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1353 conditions, 1225 events. 69/1225 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 6557 event pairs, 12 based on Foata normal form. 0/1091 useless extension candidates. Maximal degree in co-relation 1315. Up to 79 conditions per place. [2024-11-20 13:52:20,617 INFO L140 encePairwiseOnDemand]: 453/459 looper letters, 16 selfloop transitions, 2 changer transitions 0/401 dead transitions. [2024-11-20 13:52:20,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 401 transitions, 863 flow [2024-11-20 13:52:20,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:52:20,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:52:20,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1300 transitions. [2024-11-20 13:52:20,624 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.944081336238199 [2024-11-20 13:52:20,624 INFO L175 Difference]: Start difference. First operand has 398 places, 400 transitions, 822 flow. Second operand 3 states and 1300 transitions. [2024-11-20 13:52:20,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 401 transitions, 863 flow [2024-11-20 13:52:20,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 401 transitions, 857 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:52:20,630 INFO L231 Difference]: Finished difference. Result has 395 places, 398 transitions, 822 flow [2024-11-20 13:52:20,630 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=822, PETRI_PLACES=395, PETRI_TRANSITIONS=398} [2024-11-20 13:52:20,631 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, -25 predicate places. [2024-11-20 13:52:20,631 INFO L471 AbstractCegarLoop]: Abstraction has has 395 places, 398 transitions, 822 flow [2024-11-20 13:52:20,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:20,632 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:52:20,632 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] [2024-11-20 13:52:20,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 13:52:20,632 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-20 13:52:20,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:52:20,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1620033770, now seen corresponding path program 1 times [2024-11-20 13:52:20,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:52:20,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118047992] [2024-11-20 13:52:20,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:52:20,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:52:20,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:52:20,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:52:20,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:52:20,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118047992] [2024-11-20 13:52:20,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118047992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:52:20,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:52:20,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 13:52:20,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026854905] [2024-11-20 13:52:20,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:52:20,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 13:52:20,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:52:20,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 13:52:20,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-20 13:52:21,099 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 459 [2024-11-20 13:52:21,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 398 transitions, 822 flow. Second operand has 8 states, 8 states have (on average 412.125) internal successors, (3297), 8 states have internal predecessors, (3297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:21,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:52:21,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 459 [2024-11-20 13:52:21,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:52:21,303 INFO L124 PetriNetUnfolderBase]: 65/1275 cut-off events. [2024-11-20 13:52:21,303 INFO L125 PetriNetUnfolderBase]: For 7/19 co-relation queries the response was YES. [2024-11-20 13:52:21,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1493 conditions, 1275 events. 65/1275 cut-off events. For 7/19 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6563 event pairs, 15 based on Foata normal form. 3/1156 useless extension candidates. Maximal degree in co-relation 1453. Up to 70 conditions per place. [2024-11-20 13:52:21,311 INFO L140 encePairwiseOnDemand]: 443/459 looper letters, 43 selfloop transitions, 18 changer transitions 0/424 dead transitions. [2024-11-20 13:52:21,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 424 transitions, 1009 flow [2024-11-20 13:52:21,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 13:52:21,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-20 13:52:21,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 4970 transitions. [2024-11-20 13:52:21,318 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9023238925199709 [2024-11-20 13:52:21,318 INFO L175 Difference]: Start difference. First operand has 395 places, 398 transitions, 822 flow. Second operand 12 states and 4970 transitions. [2024-11-20 13:52:21,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 424 transitions, 1009 flow [2024-11-20 13:52:21,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 424 transitions, 1009 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-20 13:52:21,324 INFO L231 Difference]: Finished difference. Result has 412 places, 407 transitions, 915 flow [2024-11-20 13:52:21,324 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=915, PETRI_PLACES=412, PETRI_TRANSITIONS=407} [2024-11-20 13:52:21,325 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, -8 predicate places. [2024-11-20 13:52:21,325 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 407 transitions, 915 flow [2024-11-20 13:52:21,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 412.125) internal successors, (3297), 8 states have internal predecessors, (3297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:21,327 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:52:21,327 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] [2024-11-20 13:52:21,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 13:52:21,327 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-20 13:52:21,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:52:21,327 INFO L85 PathProgramCache]: Analyzing trace with hash 943823019, now seen corresponding path program 1 times [2024-11-20 13:52:21,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:52:21,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536390772] [2024-11-20 13:52:21,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:52:21,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:52:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:52:21,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:52:21,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:52:21,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536390772] [2024-11-20 13:52:21,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536390772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:52:21,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:52:21,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 13:52:21,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478847334] [2024-11-20 13:52:21,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:52:21,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:52:21,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:52:21,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:52:21,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:52:21,369 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 459 [2024-11-20 13:52:21,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 407 transitions, 915 flow. Second operand has 3 states, 3 states have (on average 433.0) internal successors, (1299), 3 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:21,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:52:21,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 459 [2024-11-20 13:52:21,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:52:21,468 INFO L124 PetriNetUnfolderBase]: 86/1151 cut-off events. [2024-11-20 13:52:21,468 INFO L125 PetriNetUnfolderBase]: For 72/75 co-relation queries the response was YES. [2024-11-20 13:52:21,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1388 conditions, 1151 events. 86/1151 cut-off events. For 72/75 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 6133 event pairs, 24 based on Foata normal form. 0/1030 useless extension candidates. Maximal degree in co-relation 1340. Up to 98 conditions per place. [2024-11-20 13:52:21,478 INFO L140 encePairwiseOnDemand]: 455/459 looper letters, 11 selfloop transitions, 3 changer transitions 0/409 dead transitions. [2024-11-20 13:52:21,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 409 transitions, 948 flow [2024-11-20 13:52:21,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:52:21,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:52:21,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1308 transitions. [2024-11-20 13:52:21,481 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9498910675381264 [2024-11-20 13:52:21,481 INFO L175 Difference]: Start difference. First operand has 412 places, 407 transitions, 915 flow. Second operand 3 states and 1308 transitions. [2024-11-20 13:52:21,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 409 transitions, 948 flow [2024-11-20 13:52:21,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 409 transitions, 948 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-20 13:52:21,487 INFO L231 Difference]: Finished difference. Result has 416 places, 408 transitions, 933 flow [2024-11-20 13:52:21,488 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=933, PETRI_PLACES=416, PETRI_TRANSITIONS=408} [2024-11-20 13:52:21,488 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, -4 predicate places. [2024-11-20 13:52:21,489 INFO L471 AbstractCegarLoop]: Abstraction has has 416 places, 408 transitions, 933 flow [2024-11-20 13:52:21,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 433.0) internal successors, (1299), 3 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:21,490 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:52:21,490 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:52:21,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 13:52:21,490 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-20 13:52:21,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:52:21,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1799874040, now seen corresponding path program 1 times [2024-11-20 13:52:21,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:52:21,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807141820] [2024-11-20 13:52:21,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:52:21,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:52:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:52:21,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:52:21,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:52:21,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807141820] [2024-11-20 13:52:21,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807141820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:52:21,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:52:21,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 13:52:21,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010994512] [2024-11-20 13:52:21,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:52:21,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 13:52:21,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:52:21,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 13:52:21,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-20 13:52:22,002 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 459 [2024-11-20 13:52:22,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 408 transitions, 933 flow. Second operand has 8 states, 8 states have (on average 412.25) internal successors, (3298), 8 states have internal predecessors, (3298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:22,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:52:22,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 459 [2024-11-20 13:52:22,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:52:22,155 INFO L124 PetriNetUnfolderBase]: 68/915 cut-off events. [2024-11-20 13:52:22,156 INFO L125 PetriNetUnfolderBase]: For 83/86 co-relation queries the response was YES. [2024-11-20 13:52:22,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1199 conditions, 915 events. 68/915 cut-off events. For 83/86 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4068 event pairs, 20 based on Foata normal form. 2/845 useless extension candidates. Maximal degree in co-relation 1147. Up to 105 conditions per place. [2024-11-20 13:52:22,163 INFO L140 encePairwiseOnDemand]: 445/459 looper letters, 45 selfloop transitions, 15 changer transitions 0/428 dead transitions. [2024-11-20 13:52:22,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 428 transitions, 1109 flow [2024-11-20 13:52:22,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 13:52:22,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-20 13:52:22,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4559 transitions. [2024-11-20 13:52:22,169 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9029510794216676 [2024-11-20 13:52:22,169 INFO L175 Difference]: Start difference. First operand has 416 places, 408 transitions, 933 flow. Second operand 11 states and 4559 transitions. [2024-11-20 13:52:22,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 428 transitions, 1109 flow [2024-11-20 13:52:22,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 428 transitions, 1099 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:52:22,177 INFO L231 Difference]: Finished difference. Result has 427 places, 411 transitions, 982 flow [2024-11-20 13:52:22,178 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=927, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=982, PETRI_PLACES=427, PETRI_TRANSITIONS=411} [2024-11-20 13:52:22,178 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, 7 predicate places. [2024-11-20 13:52:22,178 INFO L471 AbstractCegarLoop]: Abstraction has has 427 places, 411 transitions, 982 flow [2024-11-20 13:52:22,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 412.25) internal successors, (3298), 8 states have internal predecessors, (3298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:22,180 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:52:22,180 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:52:22,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 13:52:22,180 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-20 13:52:22,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:52:22,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1177895645, now seen corresponding path program 1 times [2024-11-20 13:52:22,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:52:22,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223055977] [2024-11-20 13:52:22,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:52:22,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:52:22,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:52:22,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 13:52:22,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:52:22,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223055977] [2024-11-20 13:52:22,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223055977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:52:22,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:52:22,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 13:52:22,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965558266] [2024-11-20 13:52:22,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:52:22,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 13:52:22,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:52:22,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 13:52:22,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-20 13:52:22,748 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 459 [2024-11-20 13:52:22,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 427 places, 411 transitions, 982 flow. Second operand has 8 states, 8 states have (on average 412.25) internal successors, (3298), 8 states have internal predecessors, (3298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:22,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:52:22,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 459 [2024-11-20 13:52:22,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:52:22,960 INFO L124 PetriNetUnfolderBase]: 75/1344 cut-off events. [2024-11-20 13:52:22,960 INFO L125 PetriNetUnfolderBase]: For 109/127 co-relation queries the response was YES. [2024-11-20 13:52:22,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1820 conditions, 1344 events. 75/1344 cut-off events. For 109/127 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 6800 event pairs, 23 based on Foata normal form. 4/1249 useless extension candidates. Maximal degree in co-relation 1762. Up to 114 conditions per place. [2024-11-20 13:52:22,969 INFO L140 encePairwiseOnDemand]: 444/459 looper letters, 48 selfloop transitions, 19 changer transitions 0/434 dead transitions. [2024-11-20 13:52:22,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 434 transitions, 1209 flow [2024-11-20 13:52:22,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 13:52:22,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-20 13:52:22,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4552 transitions. [2024-11-20 13:52:22,977 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9015646662705487 [2024-11-20 13:52:22,977 INFO L175 Difference]: Start difference. First operand has 427 places, 411 transitions, 982 flow. Second operand 11 states and 4552 transitions. [2024-11-20 13:52:22,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 434 transitions, 1209 flow [2024-11-20 13:52:22,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 434 transitions, 1188 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-20 13:52:22,983 INFO L231 Difference]: Finished difference. Result has 435 places, 423 transitions, 1093 flow [2024-11-20 13:52:22,984 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=961, PETRI_DIFFERENCE_MINUEND_PLACES=420, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1093, PETRI_PLACES=435, PETRI_TRANSITIONS=423} [2024-11-20 13:52:22,984 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, 15 predicate places. [2024-11-20 13:52:22,984 INFO L471 AbstractCegarLoop]: Abstraction has has 435 places, 423 transitions, 1093 flow [2024-11-20 13:52:22,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 412.25) internal successors, (3298), 8 states have internal predecessors, (3298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:22,985 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:52:22,985 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] [2024-11-20 13:52:22,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 13:52:22,986 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-20 13:52:22,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:52:22,986 INFO L85 PathProgramCache]: Analyzing trace with hash -74259029, now seen corresponding path program 1 times [2024-11-20 13:52:22,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:52:22,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861463075] [2024-11-20 13:52:22,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:52:22,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:52:23,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:52:23,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 13:52:23,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:52:23,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861463075] [2024-11-20 13:52:23,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861463075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:52:23,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:52:23,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 13:52:23,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682498106] [2024-11-20 13:52:23,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:52:23,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 13:52:23,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:52:23,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 13:52:23,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-20 13:52:23,463 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 459 [2024-11-20 13:52:23,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 423 transitions, 1093 flow. Second operand has 8 states, 8 states have (on average 412.375) internal successors, (3299), 8 states have internal predecessors, (3299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:23,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:52:23,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 459 [2024-11-20 13:52:23,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:52:23,729 INFO L124 PetriNetUnfolderBase]: 87/1207 cut-off events. [2024-11-20 13:52:23,729 INFO L125 PetriNetUnfolderBase]: For 205/210 co-relation queries the response was YES. [2024-11-20 13:52:23,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1690 conditions, 1207 events. 87/1207 cut-off events. For 205/210 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 6218 event pairs, 29 based on Foata normal form. 0/1115 useless extension candidates. Maximal degree in co-relation 1625. Up to 130 conditions per place. [2024-11-20 13:52:23,742 INFO L140 encePairwiseOnDemand]: 444/459 looper letters, 47 selfloop transitions, 18 changer transitions 0/440 dead transitions. [2024-11-20 13:52:23,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 440 transitions, 1293 flow [2024-11-20 13:52:23,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 13:52:23,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-20 13:52:23,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4552 transitions. [2024-11-20 13:52:23,749 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9015646662705487 [2024-11-20 13:52:23,749 INFO L175 Difference]: Start difference. First operand has 435 places, 423 transitions, 1093 flow. Second operand 11 states and 4552 transitions. [2024-11-20 13:52:23,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 440 transitions, 1293 flow [2024-11-20 13:52:23,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 440 transitions, 1289 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 13:52:23,755 INFO L231 Difference]: Finished difference. Result has 447 places, 429 transitions, 1184 flow [2024-11-20 13:52:23,756 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=1089, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1184, PETRI_PLACES=447, PETRI_TRANSITIONS=429} [2024-11-20 13:52:23,756 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, 27 predicate places. [2024-11-20 13:52:23,756 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 429 transitions, 1184 flow [2024-11-20 13:52:23,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 412.375) internal successors, (3299), 8 states have internal predecessors, (3299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:23,758 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:52:23,758 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] [2024-11-20 13:52:23,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 13:52:23,758 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-20 13:52:23,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:52:23,758 INFO L85 PathProgramCache]: Analyzing trace with hash 2030204769, now seen corresponding path program 1 times [2024-11-20 13:52:23,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:52:23,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821071591] [2024-11-20 13:52:23,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:52:23,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:52:23,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:52:23,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:52:23,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:52:23,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821071591] [2024-11-20 13:52:23,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821071591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:52:23,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:52:23,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:52:23,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029206311] [2024-11-20 13:52:23,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:52:23,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:52:23,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:52:23,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:52:23,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:52:23,806 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 459 [2024-11-20 13:52:23,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 429 transitions, 1184 flow. Second operand has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:23,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:52:23,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 459 [2024-11-20 13:52:23,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:52:23,937 INFO L124 PetriNetUnfolderBase]: 43/1283 cut-off events. [2024-11-20 13:52:23,937 INFO L125 PetriNetUnfolderBase]: For 191/202 co-relation queries the response was YES. [2024-11-20 13:52:23,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1727 conditions, 1283 events. 43/1283 cut-off events. For 191/202 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 5502 event pairs, 5 based on Foata normal form. 0/1207 useless extension candidates. Maximal degree in co-relation 1659. Up to 36 conditions per place. [2024-11-20 13:52:23,948 INFO L140 encePairwiseOnDemand]: 455/459 looper letters, 11 selfloop transitions, 1 changer transitions 0/426 dead transitions. [2024-11-20 13:52:23,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 426 transitions, 1202 flow [2024-11-20 13:52:23,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:52:23,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:52:23,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1299 transitions. [2024-11-20 13:52:23,951 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9433551198257081 [2024-11-20 13:52:23,951 INFO L175 Difference]: Start difference. First operand has 447 places, 429 transitions, 1184 flow. Second operand 3 states and 1299 transitions. [2024-11-20 13:52:23,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 426 transitions, 1202 flow [2024-11-20 13:52:23,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 426 transitions, 1181 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-20 13:52:23,958 INFO L231 Difference]: Finished difference. Result has 439 places, 426 transitions, 1159 flow [2024-11-20 13:52:23,958 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=1157, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1159, PETRI_PLACES=439, PETRI_TRANSITIONS=426} [2024-11-20 13:52:23,959 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, 19 predicate places. [2024-11-20 13:52:23,959 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 426 transitions, 1159 flow [2024-11-20 13:52:23,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:23,964 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:52:23,964 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:52:23,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 13:52:23,964 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-20 13:52:23,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:52:23,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1746833926, now seen corresponding path program 1 times [2024-11-20 13:52:23,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:52:23,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265232234] [2024-11-20 13:52:23,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:52:23,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:52:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:52:23,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:52:23,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:52:23,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265232234] [2024-11-20 13:52:23,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265232234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:52:23,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:52:23,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:52:23,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999015217] [2024-11-20 13:52:23,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:52:23,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:52:23,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:52:23,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:52:23,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:52:24,012 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 459 [2024-11-20 13:52:24,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 426 transitions, 1159 flow. Second operand has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:24,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:52:24,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 459 [2024-11-20 13:52:24,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:52:24,163 INFO L124 PetriNetUnfolderBase]: 46/1243 cut-off events. [2024-11-20 13:52:24,164 INFO L125 PetriNetUnfolderBase]: For 166/171 co-relation queries the response was YES. [2024-11-20 13:52:24,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1648 conditions, 1243 events. 46/1243 cut-off events. For 166/171 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 5759 event pairs, 6 based on Foata normal form. 5/1187 useless extension candidates. Maximal degree in co-relation 1581. Up to 38 conditions per place. [2024-11-20 13:52:24,172 INFO L140 encePairwiseOnDemand]: 453/459 looper letters, 5 selfloop transitions, 0 changer transitions 66/425 dead transitions. [2024-11-20 13:52:24,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 425 transitions, 1183 flow [2024-11-20 13:52:24,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:52:24,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:52:24,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1300 transitions. [2024-11-20 13:52:24,175 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.944081336238199 [2024-11-20 13:52:24,175 INFO L175 Difference]: Start difference. First operand has 439 places, 426 transitions, 1159 flow. Second operand 3 states and 1300 transitions. [2024-11-20 13:52:24,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 425 transitions, 1183 flow [2024-11-20 13:52:24,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 425 transitions, 1182 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 13:52:24,182 INFO L231 Difference]: Finished difference. Result has 437 places, 359 transitions, 856 flow [2024-11-20 13:52:24,183 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=1152, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=856, PETRI_PLACES=437, PETRI_TRANSITIONS=359} [2024-11-20 13:52:24,183 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, 17 predicate places. [2024-11-20 13:52:24,183 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 359 transitions, 856 flow [2024-11-20 13:52:24,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:24,184 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:52:24,184 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] [2024-11-20 13:52:24,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 13:52:24,184 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-20 13:52:24,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:52:24,185 INFO L85 PathProgramCache]: Analyzing trace with hash -628618380, now seen corresponding path program 1 times [2024-11-20 13:52:24,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:52:24,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322044267] [2024-11-20 13:52:24,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:52:24,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:52:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:52:24,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 13:52:24,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:52:24,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322044267] [2024-11-20 13:52:24,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322044267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:52:24,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:52:24,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 13:52:24,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707902357] [2024-11-20 13:52:24,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:52:24,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 13:52:24,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:52:24,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 13:52:24,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-20 13:52:24,886 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 459 [2024-11-20 13:52:24,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 359 transitions, 856 flow. Second operand has 6 states, 6 states have (on average 417.8333333333333) internal successors, (2507), 6 states have internal predecessors, (2507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:24,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:52:24,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 459 [2024-11-20 13:52:24,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:52:24,972 INFO L124 PetriNetUnfolderBase]: 29/648 cut-off events. [2024-11-20 13:52:24,972 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2024-11-20 13:52:24,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 895 conditions, 648 events. 29/648 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1923 event pairs, 2 based on Foata normal form. 0/610 useless extension candidates. Maximal degree in co-relation 872. Up to 29 conditions per place. [2024-11-20 13:52:24,978 INFO L140 encePairwiseOnDemand]: 452/459 looper letters, 25 selfloop transitions, 5 changer transitions 0/362 dead transitions. [2024-11-20 13:52:24,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 362 transitions, 927 flow [2024-11-20 13:52:24,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 13:52:24,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 13:52:24,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2522 transitions. [2024-11-20 13:52:24,984 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.915758896151053 [2024-11-20 13:52:24,985 INFO L175 Difference]: Start difference. First operand has 437 places, 359 transitions, 856 flow. Second operand 6 states and 2522 transitions. [2024-11-20 13:52:24,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 362 transitions, 927 flow [2024-11-20 13:52:24,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 362 transitions, 847 flow, removed 19 selfloop flow, removed 24 redundant places. [2024-11-20 13:52:24,990 INFO L231 Difference]: Finished difference. Result has 366 places, 357 transitions, 782 flow [2024-11-20 13:52:24,990 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=782, PETRI_PLACES=366, PETRI_TRANSITIONS=357} [2024-11-20 13:52:24,991 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, -54 predicate places. [2024-11-20 13:52:24,991 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 357 transitions, 782 flow [2024-11-20 13:52:24,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 417.8333333333333) internal successors, (2507), 6 states have internal predecessors, (2507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:24,991 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:52:24,992 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:52:24,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 13:52:24,992 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-20 13:52:24,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:52:24,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1488160694, now seen corresponding path program 1 times [2024-11-20 13:52:24,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:52:24,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286989766] [2024-11-20 13:52:24,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:52:24,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:52:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:52:25,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 13:52:25,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:52:25,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286989766] [2024-11-20 13:52:25,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286989766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:52:25,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:52:25,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:52:25,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156795695] [2024-11-20 13:52:25,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:52:25,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:52:25,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:52:25,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:52:25,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:52:25,051 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 459 [2024-11-20 13:52:25,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 357 transitions, 782 flow. Second operand has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:25,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:52:25,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 459 [2024-11-20 13:52:25,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:52:25,156 INFO L124 PetriNetUnfolderBase]: 68/1259 cut-off events. [2024-11-20 13:52:25,156 INFO L125 PetriNetUnfolderBase]: For 23/24 co-relation queries the response was YES. [2024-11-20 13:52:25,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1469 conditions, 1259 events. 68/1259 cut-off events. For 23/24 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 6595 event pairs, 17 based on Foata normal form. 0/1159 useless extension candidates. Maximal degree in co-relation 1459. Up to 85 conditions per place. [2024-11-20 13:52:25,163 INFO L140 encePairwiseOnDemand]: 453/459 looper letters, 14 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2024-11-20 13:52:25,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 357 transitions, 816 flow [2024-11-20 13:52:25,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:52:25,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:52:25,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1298 transitions. [2024-11-20 13:52:25,165 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9426289034132171 [2024-11-20 13:52:25,165 INFO L175 Difference]: Start difference. First operand has 366 places, 357 transitions, 782 flow. Second operand 3 states and 1298 transitions. [2024-11-20 13:52:25,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 357 transitions, 816 flow [2024-11-20 13:52:25,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 357 transitions, 806 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-20 13:52:25,169 INFO L231 Difference]: Finished difference. Result has 360 places, 355 transitions, 778 flow [2024-11-20 13:52:25,170 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=778, PETRI_PLACES=360, PETRI_TRANSITIONS=355} [2024-11-20 13:52:25,170 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, -60 predicate places. [2024-11-20 13:52:25,170 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 355 transitions, 778 flow [2024-11-20 13:52:25,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:25,171 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:52:25,171 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:52:25,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-20 13:52:25,171 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-20 13:52:25,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:52:25,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1669553918, now seen corresponding path program 1 times [2024-11-20 13:52:25,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:52:25,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015124660] [2024-11-20 13:52:25,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:52:25,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:52:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:52:25,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 13:52:25,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:52:25,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015124660] [2024-11-20 13:52:25,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015124660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:52:25,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:52:25,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 13:52:25,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001537801] [2024-11-20 13:52:25,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:52:25,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 13:52:25,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:52:25,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 13:52:25,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-20 13:52:25,822 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 459 [2024-11-20 13:52:25,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 355 transitions, 778 flow. Second operand has 6 states, 6 states have (on average 418.0) internal successors, (2508), 6 states have internal predecessors, (2508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:25,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:52:25,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 459 [2024-11-20 13:52:25,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:52:25,944 INFO L124 PetriNetUnfolderBase]: 57/799 cut-off events. [2024-11-20 13:52:25,944 INFO L125 PetriNetUnfolderBase]: For 40/42 co-relation queries the response was YES. [2024-11-20 13:52:25,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1015 conditions, 799 events. 57/799 cut-off events. For 40/42 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3459 event pairs, 4 based on Foata normal form. 0/760 useless extension candidates. Maximal degree in co-relation 1005. Up to 52 conditions per place. [2024-11-20 13:52:25,950 INFO L140 encePairwiseOnDemand]: 452/459 looper letters, 24 selfloop transitions, 5 changer transitions 0/357 dead transitions. [2024-11-20 13:52:25,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 357 transitions, 844 flow [2024-11-20 13:52:25,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 13:52:25,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 13:52:25,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2521 transitions. [2024-11-20 13:52:25,954 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9153957879448076 [2024-11-20 13:52:25,954 INFO L175 Difference]: Start difference. First operand has 360 places, 355 transitions, 778 flow. Second operand 6 states and 2521 transitions. [2024-11-20 13:52:25,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 357 transitions, 844 flow [2024-11-20 13:52:25,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 357 transitions, 844 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-20 13:52:25,958 INFO L231 Difference]: Finished difference. Result has 363 places, 353 transitions, 784 flow [2024-11-20 13:52:25,958 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=784, PETRI_PLACES=363, PETRI_TRANSITIONS=353} [2024-11-20 13:52:25,958 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, -57 predicate places. [2024-11-20 13:52:25,959 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 353 transitions, 784 flow [2024-11-20 13:52:25,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 418.0) internal successors, (2508), 6 states have internal predecessors, (2508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:25,960 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:52:25,960 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] [2024-11-20 13:52:25,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-20 13:52:25,960 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-20 13:52:25,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:52:25,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1624725530, now seen corresponding path program 1 times [2024-11-20 13:52:25,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:52:25,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729389740] [2024-11-20 13:52:25,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:52:25,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:52:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:52:26,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 13:52:26,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:52:26,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729389740] [2024-11-20 13:52:26,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729389740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:52:26,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:52:26,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 13:52:26,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017603449] [2024-11-20 13:52:26,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:52:26,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 13:52:26,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:52:26,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 13:52:26,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-20 13:52:26,722 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 459 [2024-11-20 13:52:26,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 353 transitions, 784 flow. Second operand has 6 states, 6 states have (on average 417.8333333333333) internal successors, (2507), 6 states have internal predecessors, (2507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:26,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:52:26,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 459 [2024-11-20 13:52:26,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:52:26,846 INFO L124 PetriNetUnfolderBase]: 33/766 cut-off events. [2024-11-20 13:52:26,846 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-20 13:52:26,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 961 conditions, 766 events. 33/766 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2611 event pairs, 3 based on Foata normal form. 0/734 useless extension candidates. Maximal degree in co-relation 950. Up to 29 conditions per place. [2024-11-20 13:52:26,852 INFO L140 encePairwiseOnDemand]: 452/459 looper letters, 25 selfloop transitions, 5 changer transitions 0/356 dead transitions. [2024-11-20 13:52:26,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 356 transitions, 855 flow [2024-11-20 13:52:26,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 13:52:26,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 13:52:26,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2522 transitions. [2024-11-20 13:52:26,856 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.915758896151053 [2024-11-20 13:52:26,856 INFO L175 Difference]: Start difference. First operand has 363 places, 353 transitions, 784 flow. Second operand 6 states and 2522 transitions. [2024-11-20 13:52:26,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 356 transitions, 855 flow [2024-11-20 13:52:26,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 356 transitions, 845 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-20 13:52:26,861 INFO L231 Difference]: Finished difference. Result has 361 places, 351 transitions, 780 flow [2024-11-20 13:52:26,861 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=780, PETRI_PLACES=361, PETRI_TRANSITIONS=351} [2024-11-20 13:52:26,862 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, -59 predicate places. [2024-11-20 13:52:26,862 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 351 transitions, 780 flow [2024-11-20 13:52:26,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 417.8333333333333) internal successors, (2507), 6 states have internal predecessors, (2507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:26,863 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:52:26,863 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] [2024-11-20 13:52:26,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-20 13:52:26,863 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-20 13:52:26,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:52:26,864 INFO L85 PathProgramCache]: Analyzing trace with hash 968370472, now seen corresponding path program 1 times [2024-11-20 13:52:26,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:52:26,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762637859] [2024-11-20 13:52:26,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:52:26,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:52:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:52:27,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 13:52:27,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:52:27,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762637859] [2024-11-20 13:52:27,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762637859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:52:27,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:52:27,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 13:52:27,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583682305] [2024-11-20 13:52:27,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:52:27,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 13:52:27,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:52:27,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 13:52:27,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-20 13:52:27,528 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 459 [2024-11-20 13:52:27,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 351 transitions, 780 flow. Second operand has 6 states, 6 states have (on average 418.0) internal successors, (2508), 6 states have internal predecessors, (2508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:27,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:52:27,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 459 [2024-11-20 13:52:27,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:52:27,615 INFO L124 PetriNetUnfolderBase]: 60/895 cut-off events. [2024-11-20 13:52:27,615 INFO L125 PetriNetUnfolderBase]: For 43/46 co-relation queries the response was YES. [2024-11-20 13:52:27,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1124 conditions, 895 events. 60/895 cut-off events. For 43/46 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3954 event pairs, 6 based on Foata normal form. 0/853 useless extension candidates. Maximal degree in co-relation 1113. Up to 56 conditions per place. [2024-11-20 13:52:27,621 INFO L140 encePairwiseOnDemand]: 452/459 looper letters, 24 selfloop transitions, 5 changer transitions 0/353 dead transitions. [2024-11-20 13:52:27,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 353 transitions, 846 flow [2024-11-20 13:52:27,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 13:52:27,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 13:52:27,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2521 transitions. [2024-11-20 13:52:27,623 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9153957879448076 [2024-11-20 13:52:27,623 INFO L175 Difference]: Start difference. First operand has 361 places, 351 transitions, 780 flow. Second operand 6 states and 2521 transitions. [2024-11-20 13:52:27,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 353 transitions, 846 flow [2024-11-20 13:52:27,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 353 transitions, 836 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-20 13:52:27,627 INFO L231 Difference]: Finished difference. Result has 359 places, 349 transitions, 776 flow [2024-11-20 13:52:27,628 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=776, PETRI_PLACES=359, PETRI_TRANSITIONS=349} [2024-11-20 13:52:27,628 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, -61 predicate places. [2024-11-20 13:52:27,628 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 349 transitions, 776 flow [2024-11-20 13:52:27,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 418.0) internal successors, (2508), 6 states have internal predecessors, (2508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:27,629 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:52:27,629 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-11-20 13:52:27,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-20 13:52:27,629 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-20 13:52:27,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:52:27,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1567427258, now seen corresponding path program 1 times [2024-11-20 13:52:27,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:52:27,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916680060] [2024-11-20 13:52:27,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:52:27,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:52:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:52:27,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 13:52:27,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:52:27,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916680060] [2024-11-20 13:52:27,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916680060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:52:27,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:52:27,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:52:27,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764755615] [2024-11-20 13:52:27,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:52:27,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:52:27,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:52:27,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:52:27,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:52:27,685 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 430 out of 459 [2024-11-20 13:52:27,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 349 transitions, 776 flow. Second operand has 3 states, 3 states have (on average 431.6666666666667) internal successors, (1295), 3 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:27,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:52:27,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 430 of 459 [2024-11-20 13:52:27,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:52:27,753 INFO L124 PetriNetUnfolderBase]: 29/866 cut-off events. [2024-11-20 13:52:27,753 INFO L125 PetriNetUnfolderBase]: For 7/9 co-relation queries the response was YES. [2024-11-20 13:52:27,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1020 conditions, 866 events. 29/866 cut-off events. For 7/9 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2861 event pairs, 3 based on Foata normal form. 0/833 useless extension candidates. Maximal degree in co-relation 1009. Up to 21 conditions per place. [2024-11-20 13:52:27,758 INFO L140 encePairwiseOnDemand]: 456/459 looper letters, 7 selfloop transitions, 2 changer transitions 0/349 dead transitions. [2024-11-20 13:52:27,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 349 transitions, 795 flow [2024-11-20 13:52:27,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:52:27,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:52:27,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1300 transitions. [2024-11-20 13:52:27,759 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.944081336238199 [2024-11-20 13:52:27,759 INFO L175 Difference]: Start difference. First operand has 359 places, 349 transitions, 776 flow. Second operand 3 states and 1300 transitions. [2024-11-20 13:52:27,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 349 transitions, 795 flow [2024-11-20 13:52:27,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 349 transitions, 785 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-20 13:52:27,763 INFO L231 Difference]: Finished difference. Result has 355 places, 348 transitions, 768 flow [2024-11-20 13:52:27,763 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=768, PETRI_PLACES=355, PETRI_TRANSITIONS=348} [2024-11-20 13:52:27,764 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, -65 predicate places. [2024-11-20 13:52:27,764 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 348 transitions, 768 flow [2024-11-20 13:52:27,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 431.6666666666667) internal successors, (1295), 3 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:27,764 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:52:27,764 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:52:27,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-20 13:52:27,765 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-11-20 13:52:27,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:52:27,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1990888607, now seen corresponding path program 1 times [2024-11-20 13:52:27,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:52:27,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306784037] [2024-11-20 13:52:27,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:52:27,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:52:27,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:52:27,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 13:52:27,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:52:27,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306784037] [2024-11-20 13:52:27,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306784037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:52:27,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:52:27,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:52:27,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956914257] [2024-11-20 13:52:27,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:52:27,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:52:27,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:52:27,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:52:27,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:52:27,824 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 430 out of 459 [2024-11-20 13:52:27,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 348 transitions, 768 flow. Second operand has 3 states, 3 states have (on average 432.0) internal successors, (1296), 3 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:27,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:52:27,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 430 of 459 [2024-11-20 13:52:27,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:52:27,878 INFO L124 PetriNetUnfolderBase]: 35/736 cut-off events. [2024-11-20 13:52:27,879 INFO L125 PetriNetUnfolderBase]: For 14/16 co-relation queries the response was YES. [2024-11-20 13:52:27,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 868 conditions, 736 events. 35/736 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2621 event pairs, 4 based on Foata normal form. 0/712 useless extension candidates. Maximal degree in co-relation 857. Up to 20 conditions per place. [2024-11-20 13:52:27,882 INFO L140 encePairwiseOnDemand]: 456/459 looper letters, 0 selfloop transitions, 0 changer transitions 348/348 dead transitions. [2024-11-20 13:52:27,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 348 transitions, 787 flow [2024-11-20 13:52:27,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:52:27,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:52:27,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1300 transitions. [2024-11-20 13:52:27,885 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.944081336238199 [2024-11-20 13:52:27,885 INFO L175 Difference]: Start difference. First operand has 355 places, 348 transitions, 768 flow. Second operand 3 states and 1300 transitions. [2024-11-20 13:52:27,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 348 transitions, 787 flow [2024-11-20 13:52:27,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 348 transitions, 783 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:52:27,888 INFO L231 Difference]: Finished difference. Result has 354 places, 0 transitions, 0 flow [2024-11-20 13:52:27,889 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=354, PETRI_TRANSITIONS=0} [2024-11-20 13:52:27,889 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, -66 predicate places. [2024-11-20 13:52:27,889 INFO L471 AbstractCegarLoop]: Abstraction has has 354 places, 0 transitions, 0 flow [2024-11-20 13:52:27,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 432.0) internal successors, (1296), 3 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:52:27,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (71 of 72 remaining) [2024-11-20 13:52:27,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (70 of 72 remaining) [2024-11-20 13:52:27,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (69 of 72 remaining) [2024-11-20 13:52:27,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (68 of 72 remaining) [2024-11-20 13:52:27,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (67 of 72 remaining) [2024-11-20 13:52:27,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (66 of 72 remaining) [2024-11-20 13:52:27,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (65 of 72 remaining) [2024-11-20 13:52:27,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (64 of 72 remaining) [2024-11-20 13:52:27,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (63 of 72 remaining) [2024-11-20 13:52:27,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (62 of 72 remaining) [2024-11-20 13:52:27,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (61 of 72 remaining) [2024-11-20 13:52:27,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (60 of 72 remaining) [2024-11-20 13:52:27,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (59 of 72 remaining) [2024-11-20 13:52:27,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (58 of 72 remaining) [2024-11-20 13:52:27,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (57 of 72 remaining) [2024-11-20 13:52:27,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (56 of 72 remaining) [2024-11-20 13:52:27,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (55 of 72 remaining) [2024-11-20 13:52:27,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (54 of 72 remaining) [2024-11-20 13:52:27,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (53 of 72 remaining) [2024-11-20 13:52:27,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (52 of 72 remaining) [2024-11-20 13:52:27,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (51 of 72 remaining) [2024-11-20 13:52:27,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (50 of 72 remaining) [2024-11-20 13:52:27,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (49 of 72 remaining) [2024-11-20 13:52:27,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (48 of 72 remaining) [2024-11-20 13:52:27,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (47 of 72 remaining) [2024-11-20 13:52:27,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (46 of 72 remaining) [2024-11-20 13:52:27,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (45 of 72 remaining) [2024-11-20 13:52:27,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (44 of 72 remaining) [2024-11-20 13:52:27,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (43 of 72 remaining) [2024-11-20 13:52:27,894 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (42 of 72 remaining) [2024-11-20 13:52:27,894 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (41 of 72 remaining) [2024-11-20 13:52:27,894 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (40 of 72 remaining) [2024-11-20 13:52:27,894 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (39 of 72 remaining) [2024-11-20 13:52:27,894 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (38 of 72 remaining) [2024-11-20 13:52:27,894 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (37 of 72 remaining) [2024-11-20 13:52:27,894 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (36 of 72 remaining) [2024-11-20 13:52:27,894 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (35 of 72 remaining) [2024-11-20 13:52:27,894 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (34 of 72 remaining) [2024-11-20 13:52:27,895 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (33 of 72 remaining) [2024-11-20 13:52:27,895 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (32 of 72 remaining) [2024-11-20 13:52:27,895 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (31 of 72 remaining) [2024-11-20 13:52:27,895 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (30 of 72 remaining) [2024-11-20 13:52:27,895 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 72 remaining) [2024-11-20 13:52:27,895 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 72 remaining) [2024-11-20 13:52:27,895 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (27 of 72 remaining) [2024-11-20 13:52:27,895 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (26 of 72 remaining) [2024-11-20 13:52:27,895 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (25 of 72 remaining) [2024-11-20 13:52:27,895 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (24 of 72 remaining) [2024-11-20 13:52:27,895 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (23 of 72 remaining) [2024-11-20 13:52:27,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (22 of 72 remaining) [2024-11-20 13:52:27,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (21 of 72 remaining) [2024-11-20 13:52:27,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (20 of 72 remaining) [2024-11-20 13:52:27,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (19 of 72 remaining) [2024-11-20 13:52:27,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (18 of 72 remaining) [2024-11-20 13:52:27,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (17 of 72 remaining) [2024-11-20 13:52:27,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (16 of 72 remaining) [2024-11-20 13:52:27,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (15 of 72 remaining) [2024-11-20 13:52:27,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (14 of 72 remaining) [2024-11-20 13:52:27,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (13 of 72 remaining) [2024-11-20 13:52:27,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (12 of 72 remaining) [2024-11-20 13:52:27,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (11 of 72 remaining) [2024-11-20 13:52:27,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (10 of 72 remaining) [2024-11-20 13:52:27,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (9 of 72 remaining) [2024-11-20 13:52:27,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (8 of 72 remaining) [2024-11-20 13:52:27,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (7 of 72 remaining) [2024-11-20 13:52:27,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (6 of 72 remaining) [2024-11-20 13:52:27,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (5 of 72 remaining) [2024-11-20 13:52:27,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (4 of 72 remaining) [2024-11-20 13:52:27,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (3 of 72 remaining) [2024-11-20 13:52:27,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (2 of 72 remaining) [2024-11-20 13:52:27,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (1 of 72 remaining) [2024-11-20 13:52:27,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (0 of 72 remaining) [2024-11-20 13:52:27,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-20 13:52:27,898 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:52:27,905 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-20 13:52:27,906 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 13:52:27,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 01:52:27 BasicIcfg [2024-11-20 13:52:27,910 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 13:52:27,910 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 13:52:27,910 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 13:52:27,910 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 13:52:27,910 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:52:17" (3/4) ... [2024-11-20 13:52:27,912 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-20 13:52:27,914 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-20 13:52:27,914 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-20 13:52:27,919 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2024-11-20 13:52:27,920 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-20 13:52:27,920 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-20 13:52:27,921 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-20 13:52:27,987 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 13:52:27,987 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-20 13:52:27,988 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 13:52:27,988 INFO L158 Benchmark]: Toolchain (without parser) took 11746.13ms. Allocated memory was 192.9MB in the beginning and 541.1MB in the end (delta: 348.1MB). Free memory was 124.0MB in the beginning and 192.8MB in the end (delta: -68.8MB). Peak memory consumption was 281.1MB. Max. memory is 16.1GB. [2024-11-20 13:52:27,988 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory is still 68.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 13:52:27,989 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.61ms. Allocated memory is still 192.9MB. Free memory was 123.8MB in the beginning and 161.6MB in the end (delta: -37.8MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2024-11-20 13:52:27,989 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.22ms. Allocated memory is still 192.9MB. Free memory was 161.6MB in the beginning and 158.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 13:52:27,989 INFO L158 Benchmark]: Boogie Preprocessor took 35.21ms. Allocated memory is still 192.9MB. Free memory was 158.7MB in the beginning and 155.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 13:52:27,989 INFO L158 Benchmark]: RCFGBuilder took 700.37ms. Allocated memory is still 192.9MB. Free memory was 155.3MB in the beginning and 118.3MB in the end (delta: 36.9MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-20 13:52:27,989 INFO L158 Benchmark]: TraceAbstraction took 10511.48ms. Allocated memory was 192.9MB in the beginning and 541.1MB in the end (delta: 348.1MB). Free memory was 117.5MB in the beginning and 200.2MB in the end (delta: -82.6MB). Peak memory consumption was 267.3MB. Max. memory is 16.1GB. [2024-11-20 13:52:27,990 INFO L158 Benchmark]: Witness Printer took 77.76ms. Allocated memory is still 541.1MB. Free memory was 200.2MB in the beginning and 192.8MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 13:52:27,991 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.14ms. Allocated memory is still 109.1MB. Free memory is still 68.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 370.61ms. Allocated memory is still 192.9MB. Free memory was 123.8MB in the beginning and 161.6MB in the end (delta: -37.8MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.22ms. Allocated memory is still 192.9MB. Free memory was 161.6MB in the beginning and 158.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.21ms. Allocated memory is still 192.9MB. Free memory was 158.7MB in the beginning and 155.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 700.37ms. Allocated memory is still 192.9MB. Free memory was 155.3MB in the beginning and 118.3MB in the end (delta: 36.9MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 10511.48ms. Allocated memory was 192.9MB in the beginning and 541.1MB in the end (delta: 348.1MB). Free memory was 117.5MB in the beginning and 200.2MB in the end (delta: -82.6MB). Peak memory consumption was 267.3MB. Max. memory is 16.1GB. * Witness Printer took 77.76ms. Allocated memory is still 541.1MB. Free memory was 200.2MB in the beginning and 192.8MB in the end (delta: 7.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: 49]: there are no data races For all program executions holds that there are no data races at this location - 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: 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: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: 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: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: 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: 103]: 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: 103]: 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: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: 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, 656 locations, 72 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: 10.4s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3591 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2299 mSDsluCounter, 3542 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3121 mSDsCounter, 610 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5770 IncrementalHoareTripleChecker+Invalid, 6380 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 610 mSolverCounterUnsat, 421 mSDtfsCounter, 5770 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1184occurred in iteration=16, InterpolantAutomatonStates: 123, 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.6s InterpolantComputationTime, 3156 NumberOfCodeBlocks, 3156 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 3131 ConstructedInterpolants, 0 QuantifiedInterpolants, 4560 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 16/16 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 42 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-20 13:52:28,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE