./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-name-comparator-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-name-comparator-subst.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3855d6da0b439f4c6a497e897f140f408df8c7fd65e3042f0fafae1979048a3d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:57:03,915 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:57:04,004 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-19 05:57:04,008 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:57:04,009 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:57:04,041 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:57:04,041 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:57:04,042 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:57:04,042 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:57:04,043 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:57:04,046 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:57:04,046 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:57:04,047 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:57:04,049 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:57:04,049 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:57:04,049 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:57:04,050 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:57:04,050 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:57:04,053 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:57:04,054 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:57:04,054 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:57:04,054 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:57:04,055 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 05:57:04,055 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:57:04,055 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 05:57:04,059 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:57:04,059 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:57:04,060 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:57:04,060 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:57:04,060 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:57:04,060 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:57:04,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:57:04,061 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:57:04,061 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:57:04,061 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:57:04,061 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:57:04,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:57:04,061 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:57:04,062 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:57:04,062 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:57:04,062 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:57:04,063 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 -> 3855d6da0b439f4c6a497e897f140f408df8c7fd65e3042f0fafae1979048a3d [2024-11-19 05:57:04,321 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:57:04,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:57:04,349 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:57:04,352 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:57:04,352 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:57:04,354 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-name-comparator-subst.wvr.c [2024-11-19 05:57:05,881 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:57:06,078 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:57:06,080 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-name-comparator-subst.wvr.c [2024-11-19 05:57:06,091 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7e1aea60/c74c6d2fa085408fb929f4bca34f7fac/FLAGfb154a808 [2024-11-19 05:57:06,456 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7e1aea60/c74c6d2fa085408fb929f4bca34f7fac [2024-11-19 05:57:06,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:57:06,460 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:57:06,461 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:57:06,461 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:57:06,466 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:57:06,466 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:57:06" (1/1) ... [2024-11-19 05:57:06,467 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54407901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:57:06, skipping insertion in model container [2024-11-19 05:57:06,467 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:57:06" (1/1) ... [2024-11-19 05:57:06,492 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:57:06,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:57:06,808 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:57:06,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:57:06,873 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:57:06,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:57:06 WrapperNode [2024-11-19 05:57:06,874 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:57:06,875 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:57:06,875 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:57:06,875 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:57:06,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:57:06" (1/1) ... [2024-11-19 05:57:06,895 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:57:06" (1/1) ... [2024-11-19 05:57:06,945 INFO L138 Inliner]: procedures = 25, calls = 30, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 848 [2024-11-19 05:57:06,946 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:57:06,947 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:57:06,947 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:57:06,947 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:57:06,961 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:57:06" (1/1) ... [2024-11-19 05:57:06,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:57:06" (1/1) ... [2024-11-19 05:57:06,971 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:57:06" (1/1) ... [2024-11-19 05:57:06,971 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:57:06" (1/1) ... [2024-11-19 05:57:06,988 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:57:06" (1/1) ... [2024-11-19 05:57:06,994 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:57:06" (1/1) ... [2024-11-19 05:57:06,997 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:57:06" (1/1) ... [2024-11-19 05:57:07,000 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:57:06" (1/1) ... [2024-11-19 05:57:07,006 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:57:07,007 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:57:07,007 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:57:07,007 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:57:07,008 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:57:06" (1/1) ... [2024-11-19 05:57:07,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:57:07,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:57:07,056 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 05:57:07,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 05:57:07,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:57:07,118 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 05:57:07,118 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 05:57:07,118 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 05:57:07,118 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 05:57:07,119 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-19 05:57:07,119 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-19 05:57:07,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 05:57:07,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 05:57:07,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 05:57:07,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:57:07,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:57:07,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 05:57:07,123 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 05:57:07,293 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:57:07,295 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:57:08,420 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 05:57:08,421 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:57:08,473 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:57:08,474 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-19 05:57:08,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:57:08 BoogieIcfgContainer [2024-11-19 05:57:08,474 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:57:08,480 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:57:08,480 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:57:08,486 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:57:08,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:57:06" (1/3) ... [2024-11-19 05:57:08,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d98b5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:57:08, skipping insertion in model container [2024-11-19 05:57:08,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:57:06" (2/3) ... [2024-11-19 05:57:08,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d98b5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:57:08, skipping insertion in model container [2024-11-19 05:57:08,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:57:08" (3/3) ... [2024-11-19 05:57:08,491 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-subst.wvr.c [2024-11-19 05:57:08,508 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:57:08,508 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 151 error locations. [2024-11-19 05:57:08,508 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 05:57:08,713 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-19 05:57:08,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1064 places, 1112 transitions, 2245 flow [2024-11-19 05:57:09,414 INFO L124 PetriNetUnfolderBase]: 58/1109 cut-off events. [2024-11-19 05:57:09,414 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 05:57:09,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1122 conditions, 1109 events. 58/1109 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3842 event pairs, 0 based on Foata normal form. 0/900 useless extension candidates. Maximal degree in co-relation 849. Up to 2 conditions per place. [2024-11-19 05:57:09,461 INFO L82 GeneralOperation]: Start removeDead. Operand has 1064 places, 1112 transitions, 2245 flow [2024-11-19 05:57:09,501 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1041 places, 1086 transitions, 2190 flow [2024-11-19 05:57:09,514 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:57:09,522 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;@48232270, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:57:09,523 INFO L334 AbstractCegarLoop]: Starting to check reachability of 283 error locations. [2024-11-19 05:57:09,528 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:57:09,528 INFO L124 PetriNetUnfolderBase]: 0/32 cut-off events. [2024-11-19 05:57:09,528 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:57:09,528 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:09,529 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] [2024-11-19 05:57:09,530 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2024-11-19 05:57:09,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:09,536 INFO L85 PathProgramCache]: Analyzing trace with hash 149958739, now seen corresponding path program 1 times [2024-11-19 05:57:09,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:09,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68293645] [2024-11-19 05:57:09,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:09,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:09,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:09,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:57:09,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:09,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68293645] [2024-11-19 05:57:09,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68293645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:09,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:09,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:09,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328821014] [2024-11-19 05:57:09,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:09,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:09,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:09,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:09,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:09,910 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1112 [2024-11-19 05:57:09,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1041 places, 1086 transitions, 2190 flow. Second operand has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:09,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:09,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1112 [2024-11-19 05:57:09,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:13,961 INFO L124 PetriNetUnfolderBase]: 612/12182 cut-off events. [2024-11-19 05:57:13,962 INFO L125 PetriNetUnfolderBase]: For 67/85 co-relation queries the response was YES. [2024-11-19 05:57:14,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12467 conditions, 12182 events. 612/12182 cut-off events. For 67/85 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 122904 event pairs, 95 based on Foata normal form. 282/9859 useless extension candidates. Maximal degree in co-relation 12186. Up to 185 conditions per place. [2024-11-19 05:57:14,300 INFO L140 encePairwiseOnDemand]: 1091/1112 looper letters, 19 selfloop transitions, 2 changer transitions 2/1067 dead transitions. [2024-11-19 05:57:14,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1042 places, 1067 transitions, 2194 flow [2024-11-19 05:57:14,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:14,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:14,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3247 transitions. [2024-11-19 05:57:14,327 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9733213429256595 [2024-11-19 05:57:14,329 INFO L175 Difference]: Start difference. First operand has 1041 places, 1086 transitions, 2190 flow. Second operand 3 states and 3247 transitions. [2024-11-19 05:57:14,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1042 places, 1067 transitions, 2194 flow [2024-11-19 05:57:14,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1036 places, 1067 transitions, 2182 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-19 05:57:14,362 INFO L231 Difference]: Finished difference. Result has 1036 places, 1065 transitions, 2140 flow [2024-11-19 05:57:14,367 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1112, PETRI_DIFFERENCE_MINUEND_FLOW=2140, PETRI_DIFFERENCE_MINUEND_PLACES=1034, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1067, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1065, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2140, PETRI_PLACES=1036, PETRI_TRANSITIONS=1065} [2024-11-19 05:57:14,379 INFO L277 CegarLoopForPetriNet]: 1041 programPoint places, -5 predicate places. [2024-11-19 05:57:14,380 INFO L471 AbstractCegarLoop]: Abstraction has has 1036 places, 1065 transitions, 2140 flow [2024-11-19 05:57:14,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:14,382 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:14,382 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] [2024-11-19 05:57:14,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:57:14,383 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2024-11-19 05:57:14,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:14,388 INFO L85 PathProgramCache]: Analyzing trace with hash 281971922, now seen corresponding path program 1 times [2024-11-19 05:57:14,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:14,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370199155] [2024-11-19 05:57:14,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:14,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:14,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:57:14,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:14,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370199155] [2024-11-19 05:57:14,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370199155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:14,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:14,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:14,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659032084] [2024-11-19 05:57:14,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:14,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:14,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:14,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:14,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:14,544 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1112 [2024-11-19 05:57:14,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1036 places, 1065 transitions, 2140 flow. Second operand has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:14,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:14,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1112 [2024-11-19 05:57:14,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:16,405 INFO L124 PetriNetUnfolderBase]: 226/4392 cut-off events. [2024-11-19 05:57:16,406 INFO L125 PetriNetUnfolderBase]: For 13/20 co-relation queries the response was YES. [2024-11-19 05:57:16,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4521 conditions, 4392 events. 226/4392 cut-off events. For 13/20 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 32828 event pairs, 45 based on Foata normal form. 0/3471 useless extension candidates. Maximal degree in co-relation 4480. Up to 110 conditions per place. [2024-11-19 05:57:16,604 INFO L140 encePairwiseOnDemand]: 1109/1112 looper letters, 19 selfloop transitions, 2 changer transitions 0/1064 dead transitions. [2024-11-19 05:57:16,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1035 places, 1064 transitions, 2180 flow [2024-11-19 05:57:16,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:16,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:16,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3229 transitions. [2024-11-19 05:57:16,613 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.967925659472422 [2024-11-19 05:57:16,614 INFO L175 Difference]: Start difference. First operand has 1036 places, 1065 transitions, 2140 flow. Second operand 3 states and 3229 transitions. [2024-11-19 05:57:16,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1035 places, 1064 transitions, 2180 flow [2024-11-19 05:57:16,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1033 places, 1064 transitions, 2176 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:16,636 INFO L231 Difference]: Finished difference. Result has 1033 places, 1064 transitions, 2138 flow [2024-11-19 05:57:16,638 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1112, PETRI_DIFFERENCE_MINUEND_FLOW=2134, PETRI_DIFFERENCE_MINUEND_PLACES=1031, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1064, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1062, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2138, PETRI_PLACES=1033, PETRI_TRANSITIONS=1064} [2024-11-19 05:57:16,639 INFO L277 CegarLoopForPetriNet]: 1041 programPoint places, -8 predicate places. [2024-11-19 05:57:16,639 INFO L471 AbstractCegarLoop]: Abstraction has has 1033 places, 1064 transitions, 2138 flow [2024-11-19 05:57:16,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:16,642 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:16,643 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] [2024-11-19 05:57:16,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:57:16,643 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2024-11-19 05:57:16,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:16,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1850467445, now seen corresponding path program 1 times [2024-11-19 05:57:16,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:16,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000110677] [2024-11-19 05:57:16,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:16,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:16,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:57:16,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:16,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000110677] [2024-11-19 05:57:16,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000110677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:16,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:16,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:16,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707129437] [2024-11-19 05:57:16,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:16,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:16,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:16,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:16,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:16,779 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1112 [2024-11-19 05:57:16,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1033 places, 1064 transitions, 2138 flow. Second operand has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:16,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:16,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1112 [2024-11-19 05:57:16,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:18,007 INFO L124 PetriNetUnfolderBase]: 240/3577 cut-off events. [2024-11-19 05:57:18,007 INFO L125 PetriNetUnfolderBase]: For 42/75 co-relation queries the response was YES. [2024-11-19 05:57:18,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3776 conditions, 3577 events. 240/3577 cut-off events. For 42/75 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 27187 event pairs, 95 based on Foata normal form. 0/2835 useless extension candidates. Maximal degree in co-relation 3727. Up to 185 conditions per place. [2024-11-19 05:57:18,126 INFO L140 encePairwiseOnDemand]: 1109/1112 looper letters, 19 selfloop transitions, 2 changer transitions 0/1063 dead transitions. [2024-11-19 05:57:18,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1034 places, 1063 transitions, 2178 flow [2024-11-19 05:57:18,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:18,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:18,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3229 transitions. [2024-11-19 05:57:18,133 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.967925659472422 [2024-11-19 05:57:18,133 INFO L175 Difference]: Start difference. First operand has 1033 places, 1064 transitions, 2138 flow. Second operand 3 states and 3229 transitions. [2024-11-19 05:57:18,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1034 places, 1063 transitions, 2178 flow [2024-11-19 05:57:18,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1032 places, 1063 transitions, 2174 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:18,150 INFO L231 Difference]: Finished difference. Result has 1032 places, 1063 transitions, 2136 flow [2024-11-19 05:57:18,152 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1112, PETRI_DIFFERENCE_MINUEND_FLOW=2132, PETRI_DIFFERENCE_MINUEND_PLACES=1030, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1063, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1061, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2136, PETRI_PLACES=1032, PETRI_TRANSITIONS=1063} [2024-11-19 05:57:18,153 INFO L277 CegarLoopForPetriNet]: 1041 programPoint places, -9 predicate places. [2024-11-19 05:57:18,153 INFO L471 AbstractCegarLoop]: Abstraction has has 1032 places, 1063 transitions, 2136 flow [2024-11-19 05:57:18,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:18,156 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:18,156 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:57:18,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:57:18,156 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2024-11-19 05:57:18,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:18,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1773364741, now seen corresponding path program 1 times [2024-11-19 05:57:18,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:18,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125363466] [2024-11-19 05:57:18,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:18,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:18,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:18,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:57:18,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:18,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125363466] [2024-11-19 05:57:18,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125363466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:18,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:18,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:18,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977210496] [2024-11-19 05:57:18,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:18,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:18,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:18,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:18,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:18,323 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1070 out of 1112 [2024-11-19 05:57:18,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1032 places, 1063 transitions, 2136 flow. Second operand has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:18,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:18,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1070 of 1112 [2024-11-19 05:57:18,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:20,132 INFO L124 PetriNetUnfolderBase]: 245/5502 cut-off events. [2024-11-19 05:57:20,132 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-11-19 05:57:20,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5578 conditions, 5502 events. 245/5502 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 43729 event pairs, 16 based on Foata normal form. 0/4349 useless extension candidates. Maximal degree in co-relation 5521. Up to 51 conditions per place. [2024-11-19 05:57:20,304 INFO L140 encePairwiseOnDemand]: 1109/1112 looper letters, 18 selfloop transitions, 2 changer transitions 0/1062 dead transitions. [2024-11-19 05:57:20,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1033 places, 1062 transitions, 2174 flow [2024-11-19 05:57:20,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:20,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:20,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3231 transitions. [2024-11-19 05:57:20,313 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9685251798561151 [2024-11-19 05:57:20,313 INFO L175 Difference]: Start difference. First operand has 1032 places, 1063 transitions, 2136 flow. Second operand 3 states and 3231 transitions. [2024-11-19 05:57:20,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1033 places, 1062 transitions, 2174 flow [2024-11-19 05:57:20,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1031 places, 1062 transitions, 2170 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:20,335 INFO L231 Difference]: Finished difference. Result has 1031 places, 1062 transitions, 2134 flow [2024-11-19 05:57:20,337 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1112, PETRI_DIFFERENCE_MINUEND_FLOW=2130, PETRI_DIFFERENCE_MINUEND_PLACES=1029, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1062, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1060, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2134, PETRI_PLACES=1031, PETRI_TRANSITIONS=1062} [2024-11-19 05:57:20,338 INFO L277 CegarLoopForPetriNet]: 1041 programPoint places, -10 predicate places. [2024-11-19 05:57:20,339 INFO L471 AbstractCegarLoop]: Abstraction has has 1031 places, 1062 transitions, 2134 flow [2024-11-19 05:57:20,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:20,341 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:20,341 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:57:20,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:57:20,342 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2024-11-19 05:57:20,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:20,343 INFO L85 PathProgramCache]: Analyzing trace with hash 2065779890, now seen corresponding path program 1 times [2024-11-19 05:57:20,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:20,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310877514] [2024-11-19 05:57:20,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:20,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:20,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:57:20,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:20,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310877514] [2024-11-19 05:57:20,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310877514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:20,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:20,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:20,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074199876] [2024-11-19 05:57:20,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:20,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:20,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:20,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:20,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:20,474 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1073 out of 1112 [2024-11-19 05:57:20,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1031 places, 1062 transitions, 2134 flow. Second operand has 3 states, 3 states have (on average 1074.3333333333333) internal successors, (3223), 3 states have internal predecessors, (3223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:20,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:20,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1073 of 1112 [2024-11-19 05:57:20,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:21,186 INFO L124 PetriNetUnfolderBase]: 73/1611 cut-off events. [2024-11-19 05:57:21,187 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 05:57:21,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1672 conditions, 1611 events. 73/1611 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 8227 event pairs, 12 based on Foata normal form. 0/1297 useless extension candidates. Maximal degree in co-relation 1607. Up to 40 conditions per place. [2024-11-19 05:57:21,264 INFO L140 encePairwiseOnDemand]: 1109/1112 looper letters, 15 selfloop transitions, 2 changer transitions 0/1061 dead transitions. [2024-11-19 05:57:21,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1032 places, 1061 transitions, 2166 flow [2024-11-19 05:57:21,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:21,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:21,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3237 transitions. [2024-11-19 05:57:21,273 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9703237410071942 [2024-11-19 05:57:21,273 INFO L175 Difference]: Start difference. First operand has 1031 places, 1062 transitions, 2134 flow. Second operand 3 states and 3237 transitions. [2024-11-19 05:57:21,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1032 places, 1061 transitions, 2166 flow [2024-11-19 05:57:21,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1030 places, 1061 transitions, 2162 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:21,296 INFO L231 Difference]: Finished difference. Result has 1030 places, 1061 transitions, 2132 flow [2024-11-19 05:57:21,297 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1112, PETRI_DIFFERENCE_MINUEND_FLOW=2128, PETRI_DIFFERENCE_MINUEND_PLACES=1028, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1061, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1059, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2132, PETRI_PLACES=1030, PETRI_TRANSITIONS=1061} [2024-11-19 05:57:21,298 INFO L277 CegarLoopForPetriNet]: 1041 programPoint places, -11 predicate places. [2024-11-19 05:57:21,299 INFO L471 AbstractCegarLoop]: Abstraction has has 1030 places, 1061 transitions, 2132 flow [2024-11-19 05:57:21,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1074.3333333333333) internal successors, (3223), 3 states have internal predecessors, (3223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:21,301 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:21,301 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] [2024-11-19 05:57:21,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:57:21,302 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2024-11-19 05:57:21,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:21,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1754966991, now seen corresponding path program 1 times [2024-11-19 05:57:21,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:21,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594244148] [2024-11-19 05:57:21,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:21,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:21,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:57:21,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:21,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594244148] [2024-11-19 05:57:21,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594244148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:21,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:21,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:21,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868498101] [2024-11-19 05:57:21,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:21,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:21,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:21,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:21,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:21,398 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1074 out of 1112 [2024-11-19 05:57:21,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1030 places, 1061 transitions, 2132 flow. Second operand has 3 states, 3 states have (on average 1075.3333333333333) internal successors, (3226), 3 states have internal predecessors, (3226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:21,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:21,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1074 of 1112 [2024-11-19 05:57:21,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:22,732 INFO L124 PetriNetUnfolderBase]: 167/3835 cut-off events. [2024-11-19 05:57:22,732 INFO L125 PetriNetUnfolderBase]: For 1/3 co-relation queries the response was YES. [2024-11-19 05:57:22,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3889 conditions, 3835 events. 167/3835 cut-off events. For 1/3 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 26013 event pairs, 10 based on Foata normal form. 0/3045 useless extension candidates. Maximal degree in co-relation 3816. Up to 35 conditions per place. [2024-11-19 05:57:22,809 INFO L140 encePairwiseOnDemand]: 1109/1112 looper letters, 14 selfloop transitions, 2 changer transitions 0/1060 dead transitions. [2024-11-19 05:57:22,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1031 places, 1060 transitions, 2162 flow [2024-11-19 05:57:22,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:22,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:22,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3239 transitions. [2024-11-19 05:57:22,816 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9709232613908872 [2024-11-19 05:57:22,817 INFO L175 Difference]: Start difference. First operand has 1030 places, 1061 transitions, 2132 flow. Second operand 3 states and 3239 transitions. [2024-11-19 05:57:22,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1031 places, 1060 transitions, 2162 flow [2024-11-19 05:57:22,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1029 places, 1060 transitions, 2158 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:22,833 INFO L231 Difference]: Finished difference. Result has 1029 places, 1060 transitions, 2130 flow [2024-11-19 05:57:22,835 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1112, PETRI_DIFFERENCE_MINUEND_FLOW=2126, PETRI_DIFFERENCE_MINUEND_PLACES=1027, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1060, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1058, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2130, PETRI_PLACES=1029, PETRI_TRANSITIONS=1060} [2024-11-19 05:57:22,835 INFO L277 CegarLoopForPetriNet]: 1041 programPoint places, -12 predicate places. [2024-11-19 05:57:22,836 INFO L471 AbstractCegarLoop]: Abstraction has has 1029 places, 1060 transitions, 2130 flow [2024-11-19 05:57:22,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1075.3333333333333) internal successors, (3226), 3 states have internal predecessors, (3226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:22,838 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:22,838 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] [2024-11-19 05:57:22,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:57:22,839 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2024-11-19 05:57:22,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:22,839 INFO L85 PathProgramCache]: Analyzing trace with hash 949180969, now seen corresponding path program 1 times [2024-11-19 05:57:22,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:22,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325960150] [2024-11-19 05:57:22,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:22,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:22,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:22,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:57:22,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:22,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325960150] [2024-11-19 05:57:22,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325960150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:22,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:22,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:22,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804248373] [2024-11-19 05:57:22,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:22,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:22,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:22,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:22,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:22,980 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1067 out of 1112 [2024-11-19 05:57:22,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1029 places, 1060 transitions, 2130 flow. Second operand has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:22,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:22,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1067 of 1112 [2024-11-19 05:57:22,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:25,379 INFO L124 PetriNetUnfolderBase]: 349/7719 cut-off events. [2024-11-19 05:57:25,379 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2024-11-19 05:57:25,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7822 conditions, 7719 events. 349/7719 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 68367 event pairs, 24 based on Foata normal form. 0/6095 useless extension candidates. Maximal degree in co-relation 7741. Up to 70 conditions per place. [2024-11-19 05:57:25,603 INFO L140 encePairwiseOnDemand]: 1109/1112 looper letters, 21 selfloop transitions, 2 changer transitions 0/1059 dead transitions. [2024-11-19 05:57:25,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1030 places, 1059 transitions, 2174 flow [2024-11-19 05:57:25,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:25,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:25,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3225 transitions. [2024-11-19 05:57:25,611 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.966726618705036 [2024-11-19 05:57:25,611 INFO L175 Difference]: Start difference. First operand has 1029 places, 1060 transitions, 2130 flow. Second operand 3 states and 3225 transitions. [2024-11-19 05:57:25,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1030 places, 1059 transitions, 2174 flow [2024-11-19 05:57:25,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1028 places, 1059 transitions, 2170 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:25,633 INFO L231 Difference]: Finished difference. Result has 1028 places, 1059 transitions, 2128 flow [2024-11-19 05:57:25,635 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1112, PETRI_DIFFERENCE_MINUEND_FLOW=2124, PETRI_DIFFERENCE_MINUEND_PLACES=1026, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1059, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1057, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2128, PETRI_PLACES=1028, PETRI_TRANSITIONS=1059} [2024-11-19 05:57:25,636 INFO L277 CegarLoopForPetriNet]: 1041 programPoint places, -13 predicate places. [2024-11-19 05:57:25,636 INFO L471 AbstractCegarLoop]: Abstraction has has 1028 places, 1059 transitions, 2128 flow [2024-11-19 05:57:25,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:25,639 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:25,639 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] [2024-11-19 05:57:25,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:57:25,640 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2024-11-19 05:57:25,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:25,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1976604881, now seen corresponding path program 1 times [2024-11-19 05:57:25,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:25,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345795937] [2024-11-19 05:57:25,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:25,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:25,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:57:25,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:25,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345795937] [2024-11-19 05:57:25,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345795937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:25,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:25,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:25,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463452799] [2024-11-19 05:57:25,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:25,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:25,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:25,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:25,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:25,944 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1112 [2024-11-19 05:57:25,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1028 places, 1059 transitions, 2128 flow. Second operand has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:25,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:25,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1112 [2024-11-19 05:57:25,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:27,039 INFO L124 PetriNetUnfolderBase]: 149/3282 cut-off events. [2024-11-19 05:57:27,040 INFO L125 PetriNetUnfolderBase]: For 9/30 co-relation queries the response was YES. [2024-11-19 05:57:27,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3351 conditions, 3282 events. 149/3282 cut-off events. For 9/30 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 21607 event pairs, 16 based on Foata normal form. 0/2610 useless extension candidates. Maximal degree in co-relation 3262. Up to 52 conditions per place. [2024-11-19 05:57:27,179 INFO L140 encePairwiseOnDemand]: 1109/1112 looper letters, 19 selfloop transitions, 2 changer transitions 0/1058 dead transitions. [2024-11-19 05:57:27,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1029 places, 1058 transitions, 2168 flow [2024-11-19 05:57:27,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:27,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:27,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3229 transitions. [2024-11-19 05:57:27,185 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.967925659472422 [2024-11-19 05:57:27,185 INFO L175 Difference]: Start difference. First operand has 1028 places, 1059 transitions, 2128 flow. Second operand 3 states and 3229 transitions. [2024-11-19 05:57:27,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1029 places, 1058 transitions, 2168 flow [2024-11-19 05:57:27,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1027 places, 1058 transitions, 2164 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:27,201 INFO L231 Difference]: Finished difference. Result has 1027 places, 1058 transitions, 2126 flow [2024-11-19 05:57:27,203 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1112, PETRI_DIFFERENCE_MINUEND_FLOW=2122, PETRI_DIFFERENCE_MINUEND_PLACES=1025, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1058, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1056, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2126, PETRI_PLACES=1027, PETRI_TRANSITIONS=1058} [2024-11-19 05:57:27,205 INFO L277 CegarLoopForPetriNet]: 1041 programPoint places, -14 predicate places. [2024-11-19 05:57:27,206 INFO L471 AbstractCegarLoop]: Abstraction has has 1027 places, 1058 transitions, 2126 flow [2024-11-19 05:57:27,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:27,208 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:27,208 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:57:27,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 05:57:27,209 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2024-11-19 05:57:27,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:27,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1884930899, now seen corresponding path program 1 times [2024-11-19 05:57:27,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:27,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842090160] [2024-11-19 05:57:27,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:27,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:27,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:57:27,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:27,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842090160] [2024-11-19 05:57:27,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842090160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:27,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:27,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:27,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560607853] [2024-11-19 05:57:27,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:27,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:27,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:27,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:27,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:27,292 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1073 out of 1112 [2024-11-19 05:57:27,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1027 places, 1058 transitions, 2126 flow. Second operand has 3 states, 3 states have (on average 1074.3333333333333) internal successors, (3223), 3 states have internal predecessors, (3223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:27,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:27,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1073 of 1112 [2024-11-19 05:57:27,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:27,731 INFO L124 PetriNetUnfolderBase]: 73/1607 cut-off events. [2024-11-19 05:57:27,731 INFO L125 PetriNetUnfolderBase]: For 8/14 co-relation queries the response was YES. [2024-11-19 05:57:27,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1662 conditions, 1607 events. 73/1607 cut-off events. For 8/14 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 7834 event pairs, 12 based on Foata normal form. 0/1295 useless extension candidates. Maximal degree in co-relation 1565. Up to 40 conditions per place. [2024-11-19 05:57:27,811 INFO L140 encePairwiseOnDemand]: 1109/1112 looper letters, 15 selfloop transitions, 2 changer transitions 0/1057 dead transitions. [2024-11-19 05:57:27,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1028 places, 1057 transitions, 2158 flow [2024-11-19 05:57:27,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:27,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:27,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3237 transitions. [2024-11-19 05:57:27,818 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9703237410071942 [2024-11-19 05:57:27,818 INFO L175 Difference]: Start difference. First operand has 1027 places, 1058 transitions, 2126 flow. Second operand 3 states and 3237 transitions. [2024-11-19 05:57:27,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1028 places, 1057 transitions, 2158 flow [2024-11-19 05:57:27,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1026 places, 1057 transitions, 2154 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:27,837 INFO L231 Difference]: Finished difference. Result has 1026 places, 1057 transitions, 2124 flow [2024-11-19 05:57:27,839 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1112, PETRI_DIFFERENCE_MINUEND_FLOW=2120, PETRI_DIFFERENCE_MINUEND_PLACES=1024, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1057, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1055, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2124, PETRI_PLACES=1026, PETRI_TRANSITIONS=1057} [2024-11-19 05:57:27,839 INFO L277 CegarLoopForPetriNet]: 1041 programPoint places, -15 predicate places. [2024-11-19 05:57:27,840 INFO L471 AbstractCegarLoop]: Abstraction has has 1026 places, 1057 transitions, 2124 flow [2024-11-19 05:57:27,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1074.3333333333333) internal successors, (3223), 3 states have internal predecessors, (3223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:27,842 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:27,842 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] [2024-11-19 05:57:27,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 05:57:27,842 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2024-11-19 05:57:27,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:27,843 INFO L85 PathProgramCache]: Analyzing trace with hash -175922964, now seen corresponding path program 1 times [2024-11-19 05:57:27,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:27,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688890252] [2024-11-19 05:57:27,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:27,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:27,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:27,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:57:27,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:27,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688890252] [2024-11-19 05:57:27,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688890252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:27,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:27,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:27,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136411382] [2024-11-19 05:57:27,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:27,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:27,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:27,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:27,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:27,917 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1074 out of 1112 [2024-11-19 05:57:27,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1026 places, 1057 transitions, 2124 flow. Second operand has 3 states, 3 states have (on average 1075.3333333333333) internal successors, (3226), 3 states have internal predecessors, (3226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:27,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:27,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1074 of 1112 [2024-11-19 05:57:27,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:28,710 INFO L124 PetriNetUnfolderBase]: 107/2446 cut-off events. [2024-11-19 05:57:28,710 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2024-11-19 05:57:28,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2495 conditions, 2446 events. 107/2446 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 13733 event pairs, 10 based on Foata normal form. 0/1958 useless extension candidates. Maximal degree in co-relation 2390. Up to 35 conditions per place. [2024-11-19 05:57:28,808 INFO L140 encePairwiseOnDemand]: 1109/1112 looper letters, 14 selfloop transitions, 2 changer transitions 0/1056 dead transitions. [2024-11-19 05:57:28,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1027 places, 1056 transitions, 2154 flow [2024-11-19 05:57:28,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:28,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:28,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3239 transitions. [2024-11-19 05:57:28,812 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9709232613908872 [2024-11-19 05:57:28,812 INFO L175 Difference]: Start difference. First operand has 1026 places, 1057 transitions, 2124 flow. Second operand 3 states and 3239 transitions. [2024-11-19 05:57:28,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1027 places, 1056 transitions, 2154 flow [2024-11-19 05:57:28,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1025 places, 1056 transitions, 2150 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:28,827 INFO L231 Difference]: Finished difference. Result has 1025 places, 1056 transitions, 2122 flow [2024-11-19 05:57:28,829 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1112, PETRI_DIFFERENCE_MINUEND_FLOW=2118, PETRI_DIFFERENCE_MINUEND_PLACES=1023, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1056, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1054, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2122, PETRI_PLACES=1025, PETRI_TRANSITIONS=1056} [2024-11-19 05:57:28,830 INFO L277 CegarLoopForPetriNet]: 1041 programPoint places, -16 predicate places. [2024-11-19 05:57:28,830 INFO L471 AbstractCegarLoop]: Abstraction has has 1025 places, 1056 transitions, 2122 flow [2024-11-19 05:57:28,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1075.3333333333333) internal successors, (3226), 3 states have internal predecessors, (3226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:28,832 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:28,833 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] [2024-11-19 05:57:28,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 05:57:28,833 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2024-11-19 05:57:28,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:28,834 INFO L85 PathProgramCache]: Analyzing trace with hash -2144197116, now seen corresponding path program 1 times [2024-11-19 05:57:28,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:28,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580280991] [2024-11-19 05:57:28,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:28,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:28,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:57:28,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:28,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580280991] [2024-11-19 05:57:28,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580280991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:28,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:28,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:28,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518853526] [2024-11-19 05:57:28,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:28,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:28,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:28,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:28,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:28,950 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1067 out of 1112 [2024-11-19 05:57:28,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1025 places, 1056 transitions, 2122 flow. Second operand has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:28,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:28,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1067 of 1112 [2024-11-19 05:57:28,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:30,547 INFO L124 PetriNetUnfolderBase]: 205/4391 cut-off events. [2024-11-19 05:57:30,548 INFO L125 PetriNetUnfolderBase]: For 13/97 co-relation queries the response was YES. [2024-11-19 05:57:30,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4482 conditions, 4391 events. 205/4391 cut-off events. For 13/97 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 32450 event pairs, 24 based on Foata normal form. 0/3480 useless extension candidates. Maximal degree in co-relation 4369. Up to 70 conditions per place. [2024-11-19 05:57:30,800 INFO L140 encePairwiseOnDemand]: 1109/1112 looper letters, 21 selfloop transitions, 2 changer transitions 0/1055 dead transitions. [2024-11-19 05:57:30,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1026 places, 1055 transitions, 2166 flow [2024-11-19 05:57:30,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:30,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:30,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3225 transitions. [2024-11-19 05:57:30,809 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.966726618705036 [2024-11-19 05:57:30,809 INFO L175 Difference]: Start difference. First operand has 1025 places, 1056 transitions, 2122 flow. Second operand 3 states and 3225 transitions. [2024-11-19 05:57:30,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1026 places, 1055 transitions, 2166 flow [2024-11-19 05:57:30,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1024 places, 1055 transitions, 2162 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:30,829 INFO L231 Difference]: Finished difference. Result has 1024 places, 1055 transitions, 2120 flow [2024-11-19 05:57:30,831 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1112, PETRI_DIFFERENCE_MINUEND_FLOW=2116, PETRI_DIFFERENCE_MINUEND_PLACES=1022, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1055, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1053, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2120, PETRI_PLACES=1024, PETRI_TRANSITIONS=1055} [2024-11-19 05:57:30,832 INFO L277 CegarLoopForPetriNet]: 1041 programPoint places, -17 predicate places. [2024-11-19 05:57:30,832 INFO L471 AbstractCegarLoop]: Abstraction has has 1024 places, 1055 transitions, 2120 flow [2024-11-19 05:57:30,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:30,834 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:30,834 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:57:30,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 05:57:30,835 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2024-11-19 05:57:30,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:30,835 INFO L85 PathProgramCache]: Analyzing trace with hash -630342891, now seen corresponding path program 1 times [2024-11-19 05:57:30,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:30,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455011751] [2024-11-19 05:57:30,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:30,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:30,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:57:30,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:30,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455011751] [2024-11-19 05:57:30,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455011751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:30,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:30,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:30,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976808733] [2024-11-19 05:57:30,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:30,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:30,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:30,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:30,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:30,949 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1112 [2024-11-19 05:57:30,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1024 places, 1055 transitions, 2120 flow. Second operand has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:30,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:30,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1112 [2024-11-19 05:57:30,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:31,679 INFO L124 PetriNetUnfolderBase]: 77/1572 cut-off events. [2024-11-19 05:57:31,680 INFO L125 PetriNetUnfolderBase]: For 18/20 co-relation queries the response was YES. [2024-11-19 05:57:31,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1635 conditions, 1572 events. 77/1572 cut-off events. For 18/20 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 7453 event pairs, 16 based on Foata normal form. 0/1275 useless extension candidates. Maximal degree in co-relation 1514. Up to 54 conditions per place. [2024-11-19 05:57:31,763 INFO L140 encePairwiseOnDemand]: 1109/1112 looper letters, 19 selfloop transitions, 2 changer transitions 0/1054 dead transitions. [2024-11-19 05:57:31,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1025 places, 1054 transitions, 2160 flow [2024-11-19 05:57:31,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:31,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:31,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3229 transitions. [2024-11-19 05:57:31,770 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.967925659472422 [2024-11-19 05:57:31,770 INFO L175 Difference]: Start difference. First operand has 1024 places, 1055 transitions, 2120 flow. Second operand 3 states and 3229 transitions. [2024-11-19 05:57:31,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1025 places, 1054 transitions, 2160 flow [2024-11-19 05:57:31,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1023 places, 1054 transitions, 2156 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:31,791 INFO L231 Difference]: Finished difference. Result has 1023 places, 1054 transitions, 2118 flow [2024-11-19 05:57:31,793 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1112, PETRI_DIFFERENCE_MINUEND_FLOW=2114, PETRI_DIFFERENCE_MINUEND_PLACES=1021, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1054, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1052, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2118, PETRI_PLACES=1023, PETRI_TRANSITIONS=1054} [2024-11-19 05:57:31,794 INFO L277 CegarLoopForPetriNet]: 1041 programPoint places, -18 predicate places. [2024-11-19 05:57:31,796 INFO L471 AbstractCegarLoop]: Abstraction has has 1023 places, 1054 transitions, 2118 flow [2024-11-19 05:57:31,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:31,798 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:31,798 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] [2024-11-19 05:57:31,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 05:57:31,799 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2024-11-19 05:57:31,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:31,799 INFO L85 PathProgramCache]: Analyzing trace with hash -819246570, now seen corresponding path program 1 times [2024-11-19 05:57:31,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:31,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555546935] [2024-11-19 05:57:31,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:31,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:31,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:31,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:57:31,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:31,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555546935] [2024-11-19 05:57:31,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555546935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:31,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:31,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:31,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297764202] [2024-11-19 05:57:31,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:31,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:31,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:31,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:31,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:31,892 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1073 out of 1112 [2024-11-19 05:57:31,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1023 places, 1054 transitions, 2118 flow. Second operand has 3 states, 3 states have (on average 1074.3333333333333) internal successors, (3223), 3 states have internal predecessors, (3223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:31,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:31,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1073 of 1112 [2024-11-19 05:57:31,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:32,386 INFO L124 PetriNetUnfolderBase]: 73/1603 cut-off events. [2024-11-19 05:57:32,386 INFO L125 PetriNetUnfolderBase]: For 14/16 co-relation queries the response was YES. [2024-11-19 05:57:32,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1652 conditions, 1603 events. 73/1603 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 7331 event pairs, 12 based on Foata normal form. 0/1296 useless extension candidates. Maximal degree in co-relation 1523. Up to 40 conditions per place. [2024-11-19 05:57:32,447 INFO L140 encePairwiseOnDemand]: 1109/1112 looper letters, 15 selfloop transitions, 2 changer transitions 0/1053 dead transitions. [2024-11-19 05:57:32,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1024 places, 1053 transitions, 2150 flow [2024-11-19 05:57:32,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:32,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:32,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3237 transitions. [2024-11-19 05:57:32,452 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9703237410071942 [2024-11-19 05:57:32,453 INFO L175 Difference]: Start difference. First operand has 1023 places, 1054 transitions, 2118 flow. Second operand 3 states and 3237 transitions. [2024-11-19 05:57:32,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1024 places, 1053 transitions, 2150 flow [2024-11-19 05:57:32,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1022 places, 1053 transitions, 2146 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:32,474 INFO L231 Difference]: Finished difference. Result has 1022 places, 1053 transitions, 2116 flow [2024-11-19 05:57:32,476 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1112, PETRI_DIFFERENCE_MINUEND_FLOW=2112, PETRI_DIFFERENCE_MINUEND_PLACES=1020, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1053, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1051, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2116, PETRI_PLACES=1022, PETRI_TRANSITIONS=1053} [2024-11-19 05:57:32,477 INFO L277 CegarLoopForPetriNet]: 1041 programPoint places, -19 predicate places. [2024-11-19 05:57:32,477 INFO L471 AbstractCegarLoop]: Abstraction has has 1022 places, 1053 transitions, 2116 flow [2024-11-19 05:57:32,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1074.3333333333333) internal successors, (3223), 3 states have internal predecessors, (3223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:32,478 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:32,479 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] [2024-11-19 05:57:32,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 05:57:32,479 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2024-11-19 05:57:32,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:32,480 INFO L85 PathProgramCache]: Analyzing trace with hash 828211859, now seen corresponding path program 1 times [2024-11-19 05:57:32,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:32,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83470363] [2024-11-19 05:57:32,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:32,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:32,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:57:32,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:32,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83470363] [2024-11-19 05:57:32,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83470363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:32,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:32,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:32,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561173866] [2024-11-19 05:57:32,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:32,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:32,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:32,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:32,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:32,554 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1074 out of 1112 [2024-11-19 05:57:32,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1022 places, 1053 transitions, 2116 flow. Second operand has 3 states, 3 states have (on average 1075.3333333333333) internal successors, (3226), 3 states have internal predecessors, (3226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:32,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:32,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1074 of 1112 [2024-11-19 05:57:32,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:32,940 INFO L124 PetriNetUnfolderBase]: 47/1072 cut-off events. [2024-11-19 05:57:32,940 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2024-11-19 05:57:32,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 1072 events. 47/1072 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4432 event pairs, 10 based on Foata normal form. 0/887 useless extension candidates. Maximal degree in co-relation 979. Up to 35 conditions per place. [2024-11-19 05:57:32,985 INFO L140 encePairwiseOnDemand]: 1109/1112 looper letters, 14 selfloop transitions, 2 changer transitions 0/1052 dead transitions. [2024-11-19 05:57:32,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1023 places, 1052 transitions, 2146 flow [2024-11-19 05:57:32,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:32,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:32,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3239 transitions. [2024-11-19 05:57:32,990 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9709232613908872 [2024-11-19 05:57:32,990 INFO L175 Difference]: Start difference. First operand has 1022 places, 1053 transitions, 2116 flow. Second operand 3 states and 3239 transitions. [2024-11-19 05:57:32,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1023 places, 1052 transitions, 2146 flow [2024-11-19 05:57:32,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1021 places, 1052 transitions, 2142 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:33,006 INFO L231 Difference]: Finished difference. Result has 1021 places, 1052 transitions, 2114 flow [2024-11-19 05:57:33,008 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1112, PETRI_DIFFERENCE_MINUEND_FLOW=2110, PETRI_DIFFERENCE_MINUEND_PLACES=1019, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1052, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1050, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2114, PETRI_PLACES=1021, PETRI_TRANSITIONS=1052} [2024-11-19 05:57:33,009 INFO L277 CegarLoopForPetriNet]: 1041 programPoint places, -20 predicate places. [2024-11-19 05:57:33,009 INFO L471 AbstractCegarLoop]: Abstraction has has 1021 places, 1052 transitions, 2114 flow [2024-11-19 05:57:33,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1075.3333333333333) internal successors, (3226), 3 states have internal predecessors, (3226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:33,010 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:33,010 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] [2024-11-19 05:57:33,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 05:57:33,011 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2024-11-19 05:57:33,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:33,011 INFO L85 PathProgramCache]: Analyzing trace with hash 795872891, now seen corresponding path program 1 times [2024-11-19 05:57:33,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:33,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001046463] [2024-11-19 05:57:33,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:33,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:33,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:57:33,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:33,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001046463] [2024-11-19 05:57:33,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001046463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:33,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:33,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:33,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430288062] [2024-11-19 05:57:33,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:33,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:33,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:33,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:33,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:33,114 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1067 out of 1112 [2024-11-19 05:57:33,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1021 places, 1052 transitions, 2114 flow. Second operand has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:33,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:33,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1067 of 1112 [2024-11-19 05:57:33,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:33,666 INFO L124 PetriNetUnfolderBase]: 85/1601 cut-off events. [2024-11-19 05:57:33,667 INFO L125 PetriNetUnfolderBase]: For 26/28 co-relation queries the response was YES. [2024-11-19 05:57:33,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1680 conditions, 1601 events. 85/1601 cut-off events. For 26/28 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 8323 event pairs, 24 based on Foata normal form. 0/1295 useless extension candidates. Maximal degree in co-relation 1535. Up to 70 conditions per place. [2024-11-19 05:57:33,730 INFO L140 encePairwiseOnDemand]: 1109/1112 looper letters, 21 selfloop transitions, 2 changer transitions 0/1051 dead transitions. [2024-11-19 05:57:33,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1022 places, 1051 transitions, 2158 flow [2024-11-19 05:57:33,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:33,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:33,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3225 transitions. [2024-11-19 05:57:33,734 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.966726618705036 [2024-11-19 05:57:33,734 INFO L175 Difference]: Start difference. First operand has 1021 places, 1052 transitions, 2114 flow. Second operand 3 states and 3225 transitions. [2024-11-19 05:57:33,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1022 places, 1051 transitions, 2158 flow [2024-11-19 05:57:33,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1020 places, 1051 transitions, 2154 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:33,747 INFO L231 Difference]: Finished difference. Result has 1020 places, 1051 transitions, 2112 flow [2024-11-19 05:57:33,749 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1112, PETRI_DIFFERENCE_MINUEND_FLOW=2108, PETRI_DIFFERENCE_MINUEND_PLACES=1018, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1051, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1049, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2112, PETRI_PLACES=1020, PETRI_TRANSITIONS=1051} [2024-11-19 05:57:33,749 INFO L277 CegarLoopForPetriNet]: 1041 programPoint places, -21 predicate places. [2024-11-19 05:57:33,749 INFO L471 AbstractCegarLoop]: Abstraction has has 1020 places, 1051 transitions, 2112 flow [2024-11-19 05:57:33,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:33,750 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:33,750 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] [2024-11-19 05:57:33,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 05:57:33,751 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2024-11-19 05:57:33,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:33,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1948909320, now seen corresponding path program 1 times [2024-11-19 05:57:33,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:33,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667175363] [2024-11-19 05:57:33,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:33,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:33,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:33,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:57:33,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:33,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667175363] [2024-11-19 05:57:33,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667175363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:33,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:33,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:33,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938169073] [2024-11-19 05:57:33,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:33,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:33,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:33,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:33,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:33,847 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1076 out of 1112 [2024-11-19 05:57:33,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1020 places, 1051 transitions, 2112 flow. Second operand has 3 states, 3 states have (on average 1077.3333333333333) internal successors, (3232), 3 states have internal predecessors, (3232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:33,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:33,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1076 of 1112 [2024-11-19 05:57:33,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:34,595 INFO L124 PetriNetUnfolderBase]: 121/2611 cut-off events. [2024-11-19 05:57:34,595 INFO L125 PetriNetUnfolderBase]: For 6/10 co-relation queries the response was YES. [2024-11-19 05:57:34,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2667 conditions, 2611 events. 121/2611 cut-off events. For 6/10 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 14424 event pairs, 15 based on Foata normal form. 0/2093 useless extension candidates. Maximal degree in co-relation 2514. Up to 43 conditions per place. [2024-11-19 05:57:34,695 INFO L140 encePairwiseOnDemand]: 1109/1112 looper letters, 12 selfloop transitions, 2 changer transitions 0/1050 dead transitions. [2024-11-19 05:57:34,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1021 places, 1050 transitions, 2138 flow [2024-11-19 05:57:34,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:34,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:34,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3243 transitions. [2024-11-19 05:57:34,700 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9721223021582733 [2024-11-19 05:57:34,700 INFO L175 Difference]: Start difference. First operand has 1020 places, 1051 transitions, 2112 flow. Second operand 3 states and 3243 transitions. [2024-11-19 05:57:34,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1021 places, 1050 transitions, 2138 flow [2024-11-19 05:57:34,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1019 places, 1050 transitions, 2134 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:34,710 INFO L231 Difference]: Finished difference. Result has 1019 places, 1050 transitions, 2110 flow [2024-11-19 05:57:34,711 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1112, PETRI_DIFFERENCE_MINUEND_FLOW=2106, PETRI_DIFFERENCE_MINUEND_PLACES=1017, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1050, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1048, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2110, PETRI_PLACES=1019, PETRI_TRANSITIONS=1050} [2024-11-19 05:57:34,711 INFO L277 CegarLoopForPetriNet]: 1041 programPoint places, -22 predicate places. [2024-11-19 05:57:34,711 INFO L471 AbstractCegarLoop]: Abstraction has has 1019 places, 1050 transitions, 2110 flow [2024-11-19 05:57:34,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1077.3333333333333) internal successors, (3232), 3 states have internal predecessors, (3232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:34,712 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:34,712 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] [2024-11-19 05:57:34,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 05:57:34,713 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2024-11-19 05:57:34,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:34,713 INFO L85 PathProgramCache]: Analyzing trace with hash -819245984, now seen corresponding path program 1 times [2024-11-19 05:57:34,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:34,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057687896] [2024-11-19 05:57:34,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:34,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:35,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:57:35,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:35,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057687896] [2024-11-19 05:57:35,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057687896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:35,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:35,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:57:35,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783216556] [2024-11-19 05:57:35,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:35,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:57:35,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:35,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:57:35,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:57:35,524 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1060 out of 1112 [2024-11-19 05:57:35,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1019 places, 1050 transitions, 2110 flow. Second operand has 6 states, 6 states have (on average 1061.5) internal successors, (6369), 6 states have internal predecessors, (6369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:35,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:35,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1060 of 1112 [2024-11-19 05:57:35,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:39,775 INFO L124 PetriNetUnfolderBase]: 893/12790 cut-off events. [2024-11-19 05:57:39,776 INFO L125 PetriNetUnfolderBase]: For 59/68 co-relation queries the response was YES. [2024-11-19 05:57:40,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13410 conditions, 12790 events. 893/12790 cut-off events. For 59/68 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 132389 event pairs, 264 based on Foata normal form. 0/10061 useless extension candidates. Maximal degree in co-relation 13198. Up to 580 conditions per place. [2024-11-19 05:57:40,265 INFO L140 encePairwiseOnDemand]: 1106/1112 looper letters, 26 selfloop transitions, 5 changer transitions 0/1049 dead transitions. [2024-11-19 05:57:40,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1023 places, 1049 transitions, 2170 flow [2024-11-19 05:57:40,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:57:40,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:57:40,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6392 transitions. [2024-11-19 05:57:40,277 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9580335731414868 [2024-11-19 05:57:40,277 INFO L175 Difference]: Start difference. First operand has 1019 places, 1050 transitions, 2110 flow. Second operand 6 states and 6392 transitions. [2024-11-19 05:57:40,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1023 places, 1049 transitions, 2170 flow [2024-11-19 05:57:40,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1021 places, 1049 transitions, 2166 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:40,289 INFO L231 Difference]: Finished difference. Result has 1021 places, 1049 transitions, 2114 flow [2024-11-19 05:57:40,290 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1112, PETRI_DIFFERENCE_MINUEND_FLOW=2104, PETRI_DIFFERENCE_MINUEND_PLACES=1016, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1049, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1044, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2114, PETRI_PLACES=1021, PETRI_TRANSITIONS=1049} [2024-11-19 05:57:40,291 INFO L277 CegarLoopForPetriNet]: 1041 programPoint places, -20 predicate places. [2024-11-19 05:57:40,291 INFO L471 AbstractCegarLoop]: Abstraction has has 1021 places, 1049 transitions, 2114 flow [2024-11-19 05:57:40,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1061.5) internal successors, (6369), 6 states have internal predecessors, (6369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:40,293 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:40,293 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] [2024-11-19 05:57:40,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 05:57:40,293 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2024-11-19 05:57:40,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:40,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1681895888, now seen corresponding path program 1 times [2024-11-19 05:57:40,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:40,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017987177] [2024-11-19 05:57:40,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:40,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:40,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-19 05:57:40,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:40,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017987177] [2024-11-19 05:57:40,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017987177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:40,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:40,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:40,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512736715] [2024-11-19 05:57:40,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:40,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:40,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:40,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:40,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:40,392 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1075 out of 1112 [2024-11-19 05:57:40,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1021 places, 1049 transitions, 2114 flow. Second operand has 3 states, 3 states have (on average 1076.6666666666667) internal successors, (3230), 3 states have internal predecessors, (3230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:40,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:40,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1075 of 1112 [2024-11-19 05:57:40,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:41,371 INFO L124 PetriNetUnfolderBase]: 163/3539 cut-off events. [2024-11-19 05:57:41,371 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2024-11-19 05:57:41,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3620 conditions, 3539 events. 163/3539 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 22944 event pairs, 9 based on Foata normal form. 0/2820 useless extension candidates. Maximal degree in co-relation 3602. Up to 43 conditions per place. [2024-11-19 05:57:41,496 INFO L140 encePairwiseOnDemand]: 1109/1112 looper letters, 16 selfloop transitions, 2 changer transitions 0/1050 dead transitions. [2024-11-19 05:57:41,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1022 places, 1050 transitions, 2154 flow [2024-11-19 05:57:41,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:41,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:41,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3244 transitions. [2024-11-19 05:57:41,501 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9724220623501199 [2024-11-19 05:57:41,501 INFO L175 Difference]: Start difference. First operand has 1021 places, 1049 transitions, 2114 flow. Second operand 3 states and 3244 transitions. [2024-11-19 05:57:41,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1022 places, 1050 transitions, 2154 flow [2024-11-19 05:57:41,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1017 places, 1050 transitions, 2144 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:57:41,513 INFO L231 Difference]: Finished difference. Result has 1017 places, 1048 transitions, 2106 flow [2024-11-19 05:57:41,514 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1112, PETRI_DIFFERENCE_MINUEND_FLOW=2102, PETRI_DIFFERENCE_MINUEND_PLACES=1015, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1048, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1046, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2106, PETRI_PLACES=1017, PETRI_TRANSITIONS=1048} [2024-11-19 05:57:41,514 INFO L277 CegarLoopForPetriNet]: 1041 programPoint places, -24 predicate places. [2024-11-19 05:57:41,514 INFO L471 AbstractCegarLoop]: Abstraction has has 1017 places, 1048 transitions, 2106 flow [2024-11-19 05:57:41,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1076.6666666666667) internal successors, (3230), 3 states have internal predecessors, (3230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:41,515 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:41,515 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] [2024-11-19 05:57:41,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 05:57:41,516 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2024-11-19 05:57:41,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:41,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1709151732, now seen corresponding path program 1 times [2024-11-19 05:57:41,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:41,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342024094] [2024-11-19 05:57:41,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:41,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:41,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:57:41,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:41,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342024094] [2024-11-19 05:57:41,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342024094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:41,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:41,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:41,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474015112] [2024-11-19 05:57:41,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:41,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:41,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:41,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:41,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:41,633 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1112 [2024-11-19 05:57:41,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1017 places, 1048 transitions, 2106 flow. Second operand has 3 states, 3 states have (on average 1070.6666666666667) internal successors, (3212), 3 states have internal predecessors, (3212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:41,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:41,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1112 [2024-11-19 05:57:41,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:42,119 INFO L124 PetriNetUnfolderBase]: 115/2154 cut-off events. [2024-11-19 05:57:42,119 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 05:57:42,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2274 conditions, 2154 events. 115/2154 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 13272 event pairs, 26 based on Foata normal form. 0/1739 useless extension candidates. Maximal degree in co-relation 2062. Up to 73 conditions per place. [2024-11-19 05:57:42,207 INFO L140 encePairwiseOnDemand]: 1109/1112 looper letters, 22 selfloop transitions, 2 changer transitions 0/1049 dead transitions. [2024-11-19 05:57:42,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1018 places, 1049 transitions, 2158 flow [2024-11-19 05:57:42,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:42,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:42,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3232 transitions. [2024-11-19 05:57:42,212 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9688249400479616 [2024-11-19 05:57:42,213 INFO L175 Difference]: Start difference. First operand has 1017 places, 1048 transitions, 2106 flow. Second operand 3 states and 3232 transitions. [2024-11-19 05:57:42,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1018 places, 1049 transitions, 2158 flow [2024-11-19 05:57:42,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1016 places, 1049 transitions, 2154 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:42,228 INFO L231 Difference]: Finished difference. Result has 1016 places, 1047 transitions, 2104 flow [2024-11-19 05:57:42,229 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1112, PETRI_DIFFERENCE_MINUEND_FLOW=2100, PETRI_DIFFERENCE_MINUEND_PLACES=1014, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1047, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1045, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2104, PETRI_PLACES=1016, PETRI_TRANSITIONS=1047} [2024-11-19 05:57:42,230 INFO L277 CegarLoopForPetriNet]: 1041 programPoint places, -25 predicate places. [2024-11-19 05:57:42,230 INFO L471 AbstractCegarLoop]: Abstraction has has 1016 places, 1047 transitions, 2104 flow [2024-11-19 05:57:42,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1070.6666666666667) internal successors, (3212), 3 states have internal predecessors, (3212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:42,231 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:42,231 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] [2024-11-19 05:57:42,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 05:57:42,231 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2024-11-19 05:57:42,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:42,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1285035561, now seen corresponding path program 1 times [2024-11-19 05:57:42,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:42,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068454159] [2024-11-19 05:57:42,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:42,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:42,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:57:42,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:42,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068454159] [2024-11-19 05:57:42,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068454159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:42,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:42,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:42,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156364747] [2024-11-19 05:57:42,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:42,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:42,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:42,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:42,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:42,311 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1075 out of 1112 [2024-11-19 05:57:42,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1016 places, 1047 transitions, 2104 flow. Second operand has 3 states, 3 states have (on average 1077.0) internal successors, (3231), 3 states have internal predecessors, (3231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:42,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:42,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1075 of 1112 [2024-11-19 05:57:42,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:42,684 INFO L124 PetriNetUnfolderBase]: 79/1602 cut-off events. [2024-11-19 05:57:42,684 INFO L125 PetriNetUnfolderBase]: For 11/20 co-relation queries the response was YES. [2024-11-19 05:57:42,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1671 conditions, 1602 events. 79/1602 cut-off events. For 11/20 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7921 event pairs, 14 based on Foata normal form. 0/1300 useless extension candidates. Maximal degree in co-relation 1454. Up to 43 conditions per place. [2024-11-19 05:57:42,759 INFO L140 encePairwiseOnDemand]: 1109/1112 looper letters, 16 selfloop transitions, 2 changer transitions 0/1048 dead transitions. [2024-11-19 05:57:42,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1017 places, 1048 transitions, 2144 flow [2024-11-19 05:57:42,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:42,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:42,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3244 transitions. [2024-11-19 05:57:42,762 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9724220623501199 [2024-11-19 05:57:42,762 INFO L175 Difference]: Start difference. First operand has 1016 places, 1047 transitions, 2104 flow. Second operand 3 states and 3244 transitions. [2024-11-19 05:57:42,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1017 places, 1048 transitions, 2144 flow [2024-11-19 05:57:42,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1015 places, 1048 transitions, 2140 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:42,774 INFO L231 Difference]: Finished difference. Result has 1015 places, 1046 transitions, 2102 flow [2024-11-19 05:57:42,775 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1112, PETRI_DIFFERENCE_MINUEND_FLOW=2098, PETRI_DIFFERENCE_MINUEND_PLACES=1013, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1046, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1044, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2102, PETRI_PLACES=1015, PETRI_TRANSITIONS=1046} [2024-11-19 05:57:42,776 INFO L277 CegarLoopForPetriNet]: 1041 programPoint places, -26 predicate places. [2024-11-19 05:57:42,776 INFO L471 AbstractCegarLoop]: Abstraction has has 1015 places, 1046 transitions, 2102 flow [2024-11-19 05:57:42,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1077.0) internal successors, (3231), 3 states have internal predecessors, (3231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:42,777 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:42,777 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] [2024-11-19 05:57:42,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 05:57:42,777 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2024-11-19 05:57:42,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:42,777 INFO L85 PathProgramCache]: Analyzing trace with hash 504439445, now seen corresponding path program 1 times [2024-11-19 05:57:42,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:42,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712901248] [2024-11-19 05:57:42,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:42,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:42,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:57:42,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:42,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712901248] [2024-11-19 05:57:42,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712901248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:42,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:42,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:42,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455072674] [2024-11-19 05:57:42,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:42,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:42,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:42,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:42,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:42,855 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1055 out of 1112 [2024-11-19 05:57:42,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1015 places, 1046 transitions, 2102 flow. Second operand has 3 states, 3 states have (on average 1056.3333333333333) internal successors, (3169), 3 states have internal predecessors, (3169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:42,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:42,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1055 of 1112 [2024-11-19 05:57:42,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:45,453 INFO L124 PetriNetUnfolderBase]: 847/10614 cut-off events. [2024-11-19 05:57:45,454 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-11-19 05:57:45,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11414 conditions, 10614 events. 847/10614 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 103469 event pairs, 190 based on Foata normal form. 0/8479 useless extension candidates. Maximal degree in co-relation 10900. Up to 658 conditions per place. [2024-11-19 05:57:45,937 INFO L140 encePairwiseOnDemand]: 1100/1112 looper letters, 29 selfloop transitions, 2 changer transitions 0/1040 dead transitions. [2024-11-19 05:57:45,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1007 places, 1040 transitions, 2154 flow [2024-11-19 05:57:45,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:45,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:45,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3206 transitions. [2024-11-19 05:57:45,941 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9610311750599521 [2024-11-19 05:57:45,941 INFO L175 Difference]: Start difference. First operand has 1015 places, 1046 transitions, 2102 flow. Second operand 3 states and 3206 transitions. [2024-11-19 05:57:45,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1007 places, 1040 transitions, 2154 flow [2024-11-19 05:57:45,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1005 places, 1040 transitions, 2150 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:45,959 INFO L231 Difference]: Finished difference. Result has 1006 places, 1038 transitions, 2092 flow [2024-11-19 05:57:45,960 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1112, PETRI_DIFFERENCE_MINUEND_FLOW=2078, PETRI_DIFFERENCE_MINUEND_PLACES=1003, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1036, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1034, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2092, PETRI_PLACES=1006, PETRI_TRANSITIONS=1038} [2024-11-19 05:57:45,961 INFO L277 CegarLoopForPetriNet]: 1041 programPoint places, -35 predicate places. [2024-11-19 05:57:45,961 INFO L471 AbstractCegarLoop]: Abstraction has has 1006 places, 1038 transitions, 2092 flow [2024-11-19 05:57:45,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1056.3333333333333) internal successors, (3169), 3 states have internal predecessors, (3169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:45,962 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:45,962 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] [2024-11-19 05:57:45,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 05:57:45,963 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2024-11-19 05:57:45,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:45,963 INFO L85 PathProgramCache]: Analyzing trace with hash -564917577, now seen corresponding path program 1 times [2024-11-19 05:57:45,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:45,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229044242] [2024-11-19 05:57:45,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:45,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:46,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:57:46,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:46,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229044242] [2024-11-19 05:57:46,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229044242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:46,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:46,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:46,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396054460] [2024-11-19 05:57:46,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:46,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:46,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:46,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:46,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:46,057 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1055 out of 1112 [2024-11-19 05:57:46,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1006 places, 1038 transitions, 2092 flow. Second operand has 3 states, 3 states have (on average 1056.3333333333333) internal successors, (3169), 3 states have internal predecessors, (3169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:46,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:46,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1055 of 1112 [2024-11-19 05:57:46,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:48,029 INFO L124 PetriNetUnfolderBase]: 451/6342 cut-off events. [2024-11-19 05:57:48,029 INFO L125 PetriNetUnfolderBase]: For 31/77 co-relation queries the response was YES. [2024-11-19 05:57:48,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6718 conditions, 6342 events. 451/6342 cut-off events. For 31/77 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 51655 event pairs, 110 based on Foata normal form. 1/5113 useless extension candidates. Maximal degree in co-relation 6242. Up to 340 conditions per place. [2024-11-19 05:57:48,453 INFO L140 encePairwiseOnDemand]: 1100/1112 looper letters, 29 selfloop transitions, 2 changer transitions 0/1032 dead transitions. [2024-11-19 05:57:48,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 998 places, 1032 transitions, 2144 flow [2024-11-19 05:57:48,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:48,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:48,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3206 transitions. [2024-11-19 05:57:48,456 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9610311750599521 [2024-11-19 05:57:48,456 INFO L175 Difference]: Start difference. First operand has 1006 places, 1038 transitions, 2092 flow. Second operand 3 states and 3206 transitions. [2024-11-19 05:57:48,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 998 places, 1032 transitions, 2144 flow [2024-11-19 05:57:48,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 998 places, 1032 transitions, 2144 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:57:48,471 INFO L231 Difference]: Finished difference. Result has 999 places, 1030 transitions, 2086 flow [2024-11-19 05:57:48,472 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1112, PETRI_DIFFERENCE_MINUEND_FLOW=2072, PETRI_DIFFERENCE_MINUEND_PLACES=996, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1028, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1026, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2086, PETRI_PLACES=999, PETRI_TRANSITIONS=1030} [2024-11-19 05:57:48,473 INFO L277 CegarLoopForPetriNet]: 1041 programPoint places, -42 predicate places. [2024-11-19 05:57:48,473 INFO L471 AbstractCegarLoop]: Abstraction has has 999 places, 1030 transitions, 2086 flow [2024-11-19 05:57:48,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1056.3333333333333) internal successors, (3169), 3 states have internal predecessors, (3169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:48,474 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:48,474 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] [2024-11-19 05:57:48,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 05:57:48,475 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2024-11-19 05:57:48,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:48,475 INFO L85 PathProgramCache]: Analyzing trace with hash -87173598, now seen corresponding path program 1 times [2024-11-19 05:57:48,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:48,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596780341] [2024-11-19 05:57:48,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:48,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:48,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:57:48,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:48,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596780341] [2024-11-19 05:57:48,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596780341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:48,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:48,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:48,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640011199] [2024-11-19 05:57:48,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:48,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:48,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:48,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:48,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:48,581 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1112 [2024-11-19 05:57:48,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 999 places, 1030 transitions, 2086 flow. Second operand has 3 states, 3 states have (on average 1071.0) internal successors, (3213), 3 states have internal predecessors, (3213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:48,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:48,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1112 [2024-11-19 05:57:48,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:49,389 INFO L124 PetriNetUnfolderBase]: 166/2871 cut-off events. [2024-11-19 05:57:49,389 INFO L125 PetriNetUnfolderBase]: For 17/44 co-relation queries the response was YES. [2024-11-19 05:57:49,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3040 conditions, 2871 events. 166/2871 cut-off events. For 17/44 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 20454 event pairs, 37 based on Foata normal form. 0/2341 useless extension candidates. Maximal degree in co-relation 2250. Up to 106 conditions per place. [2024-11-19 05:57:49,534 INFO L140 encePairwiseOnDemand]: 1109/1112 looper letters, 22 selfloop transitions, 2 changer transitions 0/1031 dead transitions. [2024-11-19 05:57:49,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1000 places, 1031 transitions, 2138 flow [2024-11-19 05:57:49,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:49,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:49,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3232 transitions. [2024-11-19 05:57:49,537 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9688249400479616 [2024-11-19 05:57:49,537 INFO L175 Difference]: Start difference. First operand has 999 places, 1030 transitions, 2086 flow. Second operand 3 states and 3232 transitions. [2024-11-19 05:57:49,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1000 places, 1031 transitions, 2138 flow [2024-11-19 05:57:49,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1000 places, 1031 transitions, 2138 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:57:49,548 INFO L231 Difference]: Finished difference. Result has 1000 places, 1029 transitions, 2088 flow [2024-11-19 05:57:49,549 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1112, PETRI_DIFFERENCE_MINUEND_FLOW=2084, PETRI_DIFFERENCE_MINUEND_PLACES=998, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1029, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1027, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2088, PETRI_PLACES=1000, PETRI_TRANSITIONS=1029} [2024-11-19 05:57:49,549 INFO L277 CegarLoopForPetriNet]: 1041 programPoint places, -41 predicate places. [2024-11-19 05:57:49,550 INFO L471 AbstractCegarLoop]: Abstraction has has 1000 places, 1029 transitions, 2088 flow [2024-11-19 05:57:49,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1071.0) internal successors, (3213), 3 states have internal predecessors, (3213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:49,550 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:49,550 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] [2024-11-19 05:57:49,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 05:57:49,550 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2024-11-19 05:57:49,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:49,551 INFO L85 PathProgramCache]: Analyzing trace with hash -2145898268, now seen corresponding path program 1 times [2024-11-19 05:57:49,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:49,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833457538] [2024-11-19 05:57:49,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:49,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:49,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:57:49,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:49,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833457538] [2024-11-19 05:57:49,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833457538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:49,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:49,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:49,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873468591] [2024-11-19 05:57:49,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:49,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:49,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:49,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:49,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:49,633 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1075 out of 1112 [2024-11-19 05:57:49,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1000 places, 1029 transitions, 2088 flow. Second operand has 3 states, 3 states have (on average 1077.3333333333333) internal successors, (3232), 3 states have internal predecessors, (3232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:49,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:49,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1075 of 1112 [2024-11-19 05:57:49,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:50,262 INFO L124 PetriNetUnfolderBase]: 105/2080 cut-off events. [2024-11-19 05:57:50,262 INFO L125 PetriNetUnfolderBase]: For 21/35 co-relation queries the response was YES. [2024-11-19 05:57:50,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2161 conditions, 2080 events. 105/2080 cut-off events. For 21/35 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 11845 event pairs, 14 based on Foata normal form. 1/1711 useless extension candidates. Maximal degree in co-relation 1934. Up to 48 conditions per place. [2024-11-19 05:57:50,321 INFO L140 encePairwiseOnDemand]: 1109/1112 looper letters, 16 selfloop transitions, 2 changer transitions 0/1030 dead transitions. [2024-11-19 05:57:50,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1001 places, 1030 transitions, 2128 flow [2024-11-19 05:57:50,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:50,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:50,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3244 transitions. [2024-11-19 05:57:50,324 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9724220623501199 [2024-11-19 05:57:50,324 INFO L175 Difference]: Start difference. First operand has 1000 places, 1029 transitions, 2088 flow. Second operand 3 states and 3244 transitions. [2024-11-19 05:57:50,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1001 places, 1030 transitions, 2128 flow [2024-11-19 05:57:50,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 999 places, 1030 transitions, 2124 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:50,333 INFO L231 Difference]: Finished difference. Result has 999 places, 1028 transitions, 2086 flow [2024-11-19 05:57:50,334 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1112, PETRI_DIFFERENCE_MINUEND_FLOW=2082, PETRI_DIFFERENCE_MINUEND_PLACES=997, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1028, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1026, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2086, PETRI_PLACES=999, PETRI_TRANSITIONS=1028} [2024-11-19 05:57:50,334 INFO L277 CegarLoopForPetriNet]: 1041 programPoint places, -42 predicate places. [2024-11-19 05:57:50,334 INFO L471 AbstractCegarLoop]: Abstraction has has 999 places, 1028 transitions, 2086 flow [2024-11-19 05:57:50,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1077.3333333333333) internal successors, (3232), 3 states have internal predecessors, (3232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:50,335 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:50,335 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] [2024-11-19 05:57:50,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 05:57:50,335 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2024-11-19 05:57:50,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:50,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1775177189, now seen corresponding path program 1 times [2024-11-19 05:57:50,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:50,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249987805] [2024-11-19 05:57:50,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:50,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:50,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:57:50,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:50,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249987805] [2024-11-19 05:57:50,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249987805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:50,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:50,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:50,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618730872] [2024-11-19 05:57:50,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:50,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:50,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:50,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:50,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:50,419 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1066 out of 1112 [2024-11-19 05:57:50,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 999 places, 1028 transitions, 2086 flow. Second operand has 3 states, 3 states have (on average 1067.3333333333333) internal successors, (3202), 3 states have internal predecessors, (3202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:50,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:50,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1066 of 1112 [2024-11-19 05:57:50,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:51,339 INFO L124 PetriNetUnfolderBase]: 191/3773 cut-off events. [2024-11-19 05:57:51,339 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-11-19 05:57:51,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3916 conditions, 3773 events. 191/3773 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 25710 event pairs, 8 based on Foata normal form. 0/3081 useless extension candidates. Maximal degree in co-relation 3438. Up to 42 conditions per place. [2024-11-19 05:57:51,517 INFO L140 encePairwiseOnDemand]: 1098/1112 looper letters, 18 selfloop transitions, 9 changer transitions 0/1029 dead transitions. [2024-11-19 05:57:51,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 996 places, 1029 transitions, 2144 flow [2024-11-19 05:57:51,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:51,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:51,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3230 transitions. [2024-11-19 05:57:51,520 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9682254196642686 [2024-11-19 05:57:51,520 INFO L175 Difference]: Start difference. First operand has 999 places, 1028 transitions, 2086 flow. Second operand 3 states and 3230 transitions. [2024-11-19 05:57:51,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 996 places, 1029 transitions, 2144 flow [2024-11-19 05:57:51,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 994 places, 1029 transitions, 2140 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:51,534 INFO L231 Difference]: Finished difference. Result has 995 places, 1027 transitions, 2115 flow [2024-11-19 05:57:51,536 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1112, PETRI_DIFFERENCE_MINUEND_FLOW=2072, PETRI_DIFFERENCE_MINUEND_PLACES=992, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1023, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1014, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2115, PETRI_PLACES=995, PETRI_TRANSITIONS=1027} [2024-11-19 05:57:51,536 INFO L277 CegarLoopForPetriNet]: 1041 programPoint places, -46 predicate places. [2024-11-19 05:57:51,537 INFO L471 AbstractCegarLoop]: Abstraction has has 995 places, 1027 transitions, 2115 flow [2024-11-19 05:57:51,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1067.3333333333333) internal successors, (3202), 3 states have internal predecessors, (3202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:51,537 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:51,538 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] [2024-11-19 05:57:51,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 05:57:51,538 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2024-11-19 05:57:51,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:51,538 INFO L85 PathProgramCache]: Analyzing trace with hash -398434658, now seen corresponding path program 1 times [2024-11-19 05:57:51,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:51,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658227519] [2024-11-19 05:57:51,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:51,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:51,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:57:51,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:51,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658227519] [2024-11-19 05:57:51,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658227519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:51,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:51,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:51,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263644071] [2024-11-19 05:57:51,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:51,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:51,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:51,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:51,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:51,630 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1072 out of 1112 [2024-11-19 05:57:51,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 995 places, 1027 transitions, 2115 flow. Second operand has 3 states, 3 states have (on average 1073.6666666666667) internal successors, (3221), 3 states have internal predecessors, (3221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:51,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:51,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1072 of 1112 [2024-11-19 05:57:51,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:52,640 INFO L124 PetriNetUnfolderBase]: 183/3668 cut-off events. [2024-11-19 05:57:52,640 INFO L125 PetriNetUnfolderBase]: For 61/77 co-relation queries the response was YES. [2024-11-19 05:57:52,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3848 conditions, 3668 events. 183/3668 cut-off events. For 61/77 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 28355 event pairs, 20 based on Foata normal form. 1/3011 useless extension candidates. Maximal degree in co-relation 3369. Up to 68 conditions per place. [2024-11-19 05:57:52,820 INFO L140 encePairwiseOnDemand]: 1109/1112 looper letters, 22 selfloop transitions, 3 changer transitions 0/1028 dead transitions. [2024-11-19 05:57:52,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 996 places, 1028 transitions, 2169 flow [2024-11-19 05:57:52,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:52,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:52,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3238 transitions. [2024-11-19 05:57:52,823 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9706235011990407 [2024-11-19 05:57:52,823 INFO L175 Difference]: Start difference. First operand has 995 places, 1027 transitions, 2115 flow. Second operand 3 states and 3238 transitions. [2024-11-19 05:57:52,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 996 places, 1028 transitions, 2169 flow [2024-11-19 05:57:52,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 995 places, 1028 transitions, 2160 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:57:52,835 INFO L231 Difference]: Finished difference. Result has 995 places, 1026 transitions, 2110 flow [2024-11-19 05:57:52,836 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1112, PETRI_DIFFERENCE_MINUEND_FLOW=2104, PETRI_DIFFERENCE_MINUEND_PLACES=993, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1026, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1023, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2110, PETRI_PLACES=995, PETRI_TRANSITIONS=1026} [2024-11-19 05:57:52,836 INFO L277 CegarLoopForPetriNet]: 1041 programPoint places, -46 predicate places. [2024-11-19 05:57:52,837 INFO L471 AbstractCegarLoop]: Abstraction has has 995 places, 1026 transitions, 2110 flow [2024-11-19 05:57:52,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1073.6666666666667) internal successors, (3221), 3 states have internal predecessors, (3221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:52,837 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:52,837 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] [2024-11-19 05:57:52,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 05:57:52,838 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2024-11-19 05:57:52,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:52,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1030864098, now seen corresponding path program 1 times [2024-11-19 05:57:52,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:52,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670199238] [2024-11-19 05:57:52,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:52,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:52,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:52,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:57:52,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:52,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670199238] [2024-11-19 05:57:52,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670199238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:52,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:52,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:52,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846536690] [2024-11-19 05:57:52,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:52,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:52,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:52,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:52,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:52,921 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1055 out of 1112 [2024-11-19 05:57:52,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 995 places, 1026 transitions, 2110 flow. Second operand has 3 states, 3 states have (on average 1056.6666666666667) internal successors, (3170), 3 states have internal predecessors, (3170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:52,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:52,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1055 of 1112 [2024-11-19 05:57:52,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:57,356 INFO L124 PetriNetUnfolderBase]: 1560/19946 cut-off events. [2024-11-19 05:57:57,357 INFO L125 PetriNetUnfolderBase]: For 144/150 co-relation queries the response was YES. [2024-11-19 05:57:57,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21183 conditions, 19946 events. 1560/19946 cut-off events. For 144/150 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 223223 event pairs, 370 based on Foata normal form. 0/16098 useless extension candidates. Maximal degree in co-relation 15915. Up to 1175 conditions per place. [2024-11-19 05:57:58,094 INFO L140 encePairwiseOnDemand]: 1100/1112 looper letters, 29 selfloop transitions, 2 changer transitions 0/1020 dead transitions. [2024-11-19 05:57:58,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 987 places, 1020 transitions, 2162 flow [2024-11-19 05:57:58,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:58,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:58,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3206 transitions. [2024-11-19 05:57:58,098 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9610311750599521 [2024-11-19 05:57:58,098 INFO L175 Difference]: Start difference. First operand has 995 places, 1026 transitions, 2110 flow. Second operand 3 states and 3206 transitions. [2024-11-19 05:57:58,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 987 places, 1020 transitions, 2162 flow [2024-11-19 05:57:58,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 985 places, 1020 transitions, 2156 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:58,113 INFO L231 Difference]: Finished difference. Result has 986 places, 1018 transitions, 2098 flow [2024-11-19 05:57:58,115 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1112, PETRI_DIFFERENCE_MINUEND_FLOW=2084, PETRI_DIFFERENCE_MINUEND_PLACES=983, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1016, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1014, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2098, PETRI_PLACES=986, PETRI_TRANSITIONS=1018} [2024-11-19 05:57:58,115 INFO L277 CegarLoopForPetriNet]: 1041 programPoint places, -55 predicate places. [2024-11-19 05:57:58,115 INFO L471 AbstractCegarLoop]: Abstraction has has 986 places, 1018 transitions, 2098 flow [2024-11-19 05:57:58,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1056.6666666666667) internal successors, (3170), 3 states have internal predecessors, (3170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:58,116 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:58,116 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] [2024-11-19 05:57:58,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-19 05:57:58,117 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2024-11-19 05:57:58,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:58,117 INFO L85 PathProgramCache]: Analyzing trace with hash -366839030, now seen corresponding path program 1 times [2024-11-19 05:57:58,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:58,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086640451] [2024-11-19 05:57:58,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:58,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:58,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:57:58,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:58,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086640451] [2024-11-19 05:57:58,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086640451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:58,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:58,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:58,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028132789] [2024-11-19 05:57:58,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:58,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:58,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:58,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:58,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:58,221 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1112 [2024-11-19 05:57:58,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 986 places, 1018 transitions, 2098 flow. Second operand has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:58,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:58,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1112 [2024-11-19 05:57:58,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:58,862 INFO L124 PetriNetUnfolderBase]: 180/3058 cut-off events. [2024-11-19 05:57:58,862 INFO L125 PetriNetUnfolderBase]: For 44/58 co-relation queries the response was YES. [2024-11-19 05:57:58,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3261 conditions, 3058 events. 180/3058 cut-off events. For 44/58 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 22337 event pairs, 37 based on Foata normal form. 1/2538 useless extension candidates. Maximal degree in co-relation 2524. Up to 139 conditions per place. [2024-11-19 05:57:58,984 INFO L140 encePairwiseOnDemand]: 1109/1112 looper letters, 22 selfloop transitions, 2 changer transitions 0/1019 dead transitions. [2024-11-19 05:57:58,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 987 places, 1019 transitions, 2150 flow [2024-11-19 05:57:58,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:58,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:58,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3232 transitions. [2024-11-19 05:57:58,988 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9688249400479616 [2024-11-19 05:57:58,988 INFO L175 Difference]: Start difference. First operand has 986 places, 1018 transitions, 2098 flow. Second operand 3 states and 3232 transitions. [2024-11-19 05:57:58,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 987 places, 1019 transitions, 2150 flow [2024-11-19 05:57:58,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 987 places, 1019 transitions, 2150 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:57:59,003 INFO L231 Difference]: Finished difference. Result has 987 places, 1017 transitions, 2100 flow [2024-11-19 05:57:59,004 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1112, PETRI_DIFFERENCE_MINUEND_FLOW=2096, PETRI_DIFFERENCE_MINUEND_PLACES=985, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1017, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1015, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2100, PETRI_PLACES=987, PETRI_TRANSITIONS=1017} [2024-11-19 05:57:59,005 INFO L277 CegarLoopForPetriNet]: 1041 programPoint places, -54 predicate places. [2024-11-19 05:57:59,005 INFO L471 AbstractCegarLoop]: Abstraction has has 987 places, 1017 transitions, 2100 flow [2024-11-19 05:57:59,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:59,006 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:59,006 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] [2024-11-19 05:57:59,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 05:57:59,006 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2024-11-19 05:57:59,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:59,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1453408567, now seen corresponding path program 1 times [2024-11-19 05:57:59,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:59,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26860025] [2024-11-19 05:57:59,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:59,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:59,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:57:59,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:59,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26860025] [2024-11-19 05:57:59,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26860025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:59,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:59,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:59,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341590656] [2024-11-19 05:57:59,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:59,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:59,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:59,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:59,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:59,103 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1112 [2024-11-19 05:57:59,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 987 places, 1017 transitions, 2100 flow. Second operand has 3 states, 3 states have (on average 1064.6666666666667) internal successors, (3194), 3 states have internal predecessors, (3194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:59,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:59,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1112 [2024-11-19 05:57:59,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:00,377 INFO L124 PetriNetUnfolderBase]: 298/5500 cut-off events. [2024-11-19 05:58:00,377 INFO L125 PetriNetUnfolderBase]: For 14/28 co-relation queries the response was YES. [2024-11-19 05:58:00,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5754 conditions, 5500 events. 298/5500 cut-off events. For 14/28 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 44854 event pairs, 15 based on Foata normal form. 0/4551 useless extension candidates. Maximal degree in co-relation 5387. Up to 68 conditions per place. [2024-11-19 05:58:00,525 INFO L140 encePairwiseOnDemand]: 1097/1112 looper letters, 20 selfloop transitions, 9 changer transitions 0/1017 dead transitions. [2024-11-19 05:58:00,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 983 places, 1017 transitions, 2160 flow [2024-11-19 05:58:00,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:00,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:00,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3224 transitions. [2024-11-19 05:58:00,527 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9664268585131894 [2024-11-19 05:58:00,527 INFO L175 Difference]: Start difference. First operand has 987 places, 1017 transitions, 2100 flow. Second operand 3 states and 3224 transitions. [2024-11-19 05:58:00,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 983 places, 1017 transitions, 2160 flow [2024-11-19 05:58:00,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 981 places, 1017 transitions, 2156 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:00,541 INFO L231 Difference]: Finished difference. Result has 982 places, 1015 transitions, 2127 flow [2024-11-19 05:58:00,542 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1112, PETRI_DIFFERENCE_MINUEND_FLOW=2084, PETRI_DIFFERENCE_MINUEND_PLACES=979, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1011, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1002, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2127, PETRI_PLACES=982, PETRI_TRANSITIONS=1015} [2024-11-19 05:58:00,543 INFO L277 CegarLoopForPetriNet]: 1041 programPoint places, -59 predicate places. [2024-11-19 05:58:00,544 INFO L471 AbstractCegarLoop]: Abstraction has has 982 places, 1015 transitions, 2127 flow [2024-11-19 05:58:00,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1064.6666666666667) internal successors, (3194), 3 states have internal predecessors, (3194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:00,544 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:00,545 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] [2024-11-19 05:58:00,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-19 05:58:00,545 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2024-11-19 05:58:00,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:00,545 INFO L85 PathProgramCache]: Analyzing trace with hash -956146267, now seen corresponding path program 1 times [2024-11-19 05:58:00,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:00,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215450048] [2024-11-19 05:58:00,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:00,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:00,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:58:00,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:00,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215450048] [2024-11-19 05:58:00,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215450048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:00,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:00,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:00,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005880029] [2024-11-19 05:58:00,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:00,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:00,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:00,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:00,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:00,638 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1071 out of 1112 [2024-11-19 05:58:00,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 982 places, 1015 transitions, 2127 flow. Second operand has 3 states, 3 states have (on average 1073.0) internal successors, (3219), 3 states have internal predecessors, (3219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:00,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:00,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1071 of 1112 [2024-11-19 05:58:00,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:01,972 INFO L124 PetriNetUnfolderBase]: 285/5368 cut-off events. [2024-11-19 05:58:01,972 INFO L125 PetriNetUnfolderBase]: For 113/166 co-relation queries the response was YES. [2024-11-19 05:58:02,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5675 conditions, 5368 events. 285/5368 cut-off events. For 113/166 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 47647 event pairs, 30 based on Foata normal form. 0/4450 useless extension candidates. Maximal degree in co-relation 5082. Up to 105 conditions per place. [2024-11-19 05:58:02,156 INFO L140 encePairwiseOnDemand]: 1109/1112 looper letters, 23 selfloop transitions, 3 changer transitions 0/1016 dead transitions. [2024-11-19 05:58:02,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 983 places, 1016 transitions, 2183 flow [2024-11-19 05:58:02,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:02,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:02,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3236 transitions. [2024-11-19 05:58:02,158 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9700239808153477 [2024-11-19 05:58:02,158 INFO L175 Difference]: Start difference. First operand has 982 places, 1015 transitions, 2127 flow. Second operand 3 states and 3236 transitions. [2024-11-19 05:58:02,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 983 places, 1016 transitions, 2183 flow [2024-11-19 05:58:02,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 982 places, 1016 transitions, 2174 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:58:02,172 INFO L231 Difference]: Finished difference. Result has 982 places, 1014 transitions, 2122 flow [2024-11-19 05:58:02,173 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1112, PETRI_DIFFERENCE_MINUEND_FLOW=2116, PETRI_DIFFERENCE_MINUEND_PLACES=980, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1014, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1011, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2122, PETRI_PLACES=982, PETRI_TRANSITIONS=1014} [2024-11-19 05:58:02,174 INFO L277 CegarLoopForPetriNet]: 1041 programPoint places, -59 predicate places. [2024-11-19 05:58:02,174 INFO L471 AbstractCegarLoop]: Abstraction has has 982 places, 1014 transitions, 2122 flow [2024-11-19 05:58:02,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1073.0) internal successors, (3219), 3 states have internal predecessors, (3219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:02,174 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:02,175 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] [2024-11-19 05:58:02,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-19 05:58:02,175 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2024-11-19 05:58:02,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:02,175 INFO L85 PathProgramCache]: Analyzing trace with hash -2095080157, now seen corresponding path program 1 times [2024-11-19 05:58:02,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:02,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3235879] [2024-11-19 05:58:02,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:02,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:02,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:58:02,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:02,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3235879] [2024-11-19 05:58:02,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3235879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:02,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:02,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:58:02,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667069706] [2024-11-19 05:58:02,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:02,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:02,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:02,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:02,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:02,264 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1078 out of 1112 [2024-11-19 05:58:02,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 982 places, 1014 transitions, 2122 flow. Second operand has 3 states, 3 states have (on average 1080.3333333333333) internal successors, (3241), 3 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:02,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:02,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1078 of 1112 [2024-11-19 05:58:02,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:03,449 INFO L124 PetriNetUnfolderBase]: 215/4585 cut-off events. [2024-11-19 05:58:03,449 INFO L125 PetriNetUnfolderBase]: For 12/22 co-relation queries the response was YES. [2024-11-19 05:58:03,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4787 conditions, 4585 events. 215/4585 cut-off events. For 12/22 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 38422 event pairs, 4 based on Foata normal form. 1/3825 useless extension candidates. Maximal degree in co-relation 4034. Up to 33 conditions per place. [2024-11-19 05:58:03,655 INFO L140 encePairwiseOnDemand]: 1109/1112 looper letters, 18 selfloop transitions, 2 changer transitions 0/1020 dead transitions. [2024-11-19 05:58:03,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 984 places, 1020 transitions, 2179 flow [2024-11-19 05:58:03,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:03,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:03,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3255 transitions. [2024-11-19 05:58:03,658 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9757194244604317 [2024-11-19 05:58:03,658 INFO L175 Difference]: Start difference. First operand has 982 places, 1014 transitions, 2122 flow. Second operand 3 states and 3255 transitions. [2024-11-19 05:58:03,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 984 places, 1020 transitions, 2179 flow [2024-11-19 05:58:03,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 982 places, 1020 transitions, 2173 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:03,675 INFO L231 Difference]: Finished difference. Result has 984 places, 1015 transitions, 2130 flow [2024-11-19 05:58:03,677 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1112, PETRI_DIFFERENCE_MINUEND_FLOW=2116, PETRI_DIFFERENCE_MINUEND_PLACES=980, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1014, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1012, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2130, PETRI_PLACES=984, PETRI_TRANSITIONS=1015} [2024-11-19 05:58:03,677 INFO L277 CegarLoopForPetriNet]: 1041 programPoint places, -57 predicate places. [2024-11-19 05:58:03,677 INFO L471 AbstractCegarLoop]: Abstraction has has 984 places, 1015 transitions, 2130 flow [2024-11-19 05:58:03,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1080.3333333333333) internal successors, (3241), 3 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:03,678 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:03,678 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] [2024-11-19 05:58:03,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-19 05:58:03,679 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2024-11-19 05:58:03,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:03,679 INFO L85 PathProgramCache]: Analyzing trace with hash -972581327, now seen corresponding path program 1 times [2024-11-19 05:58:03,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:03,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555765411] [2024-11-19 05:58:03,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:03,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:03,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:58:03,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:03,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555765411] [2024-11-19 05:58:03,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555765411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:03,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:03,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:03,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704918475] [2024-11-19 05:58:03,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:03,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:03,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:03,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:03,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:03,762 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1112 [2024-11-19 05:58:03,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 984 places, 1015 transitions, 2130 flow. Second operand has 3 states, 3 states have (on average 1065.0) internal successors, (3195), 3 states have internal predecessors, (3195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:03,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:03,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1112 [2024-11-19 05:58:03,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:04,899 INFO L124 PetriNetUnfolderBase]: 255/4097 cut-off events. [2024-11-19 05:58:04,899 INFO L125 PetriNetUnfolderBase]: For 69/81 co-relation queries the response was YES. [2024-11-19 05:58:05,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4454 conditions, 4097 events. 255/4097 cut-off events. For 69/81 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 32828 event pairs, 42 based on Foata normal form. 3/3439 useless extension candidates. Maximal degree in co-relation 3682. Up to 142 conditions per place. [2024-11-19 05:58:05,068 INFO L140 encePairwiseOnDemand]: 1097/1112 looper letters, 16 selfloop transitions, 8 changer transitions 14/1015 dead transitions. [2024-11-19 05:58:05,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 980 places, 1015 transitions, 2188 flow [2024-11-19 05:58:05,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:05,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:05,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3223 transitions. [2024-11-19 05:58:05,070 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9661270983213429 [2024-11-19 05:58:05,070 INFO L175 Difference]: Start difference. First operand has 984 places, 1015 transitions, 2130 flow. Second operand 3 states and 3223 transitions. [2024-11-19 05:58:05,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 980 places, 1015 transitions, 2188 flow [2024-11-19 05:58:05,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 979 places, 1015 transitions, 2186 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:58:05,085 INFO L231 Difference]: Finished difference. Result has 980 places, 999 transitions, 2123 flow [2024-11-19 05:58:05,087 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1112, PETRI_DIFFERENCE_MINUEND_FLOW=2116, PETRI_DIFFERENCE_MINUEND_PLACES=977, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1009, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1001, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2123, PETRI_PLACES=980, PETRI_TRANSITIONS=999} [2024-11-19 05:58:05,088 INFO L277 CegarLoopForPetriNet]: 1041 programPoint places, -61 predicate places. [2024-11-19 05:58:05,088 INFO L471 AbstractCegarLoop]: Abstraction has has 980 places, 999 transitions, 2123 flow [2024-11-19 05:58:05,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1065.0) internal successors, (3195), 3 states have internal predecessors, (3195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:05,088 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:05,089 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-19 05:58:05,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-19 05:58:05,089 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2024-11-19 05:58:05,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:05,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1901075455, now seen corresponding path program 1 times [2024-11-19 05:58:05,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:05,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155049708] [2024-11-19 05:58:05,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:05,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:05,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:58:05,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:05,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155049708] [2024-11-19 05:58:05,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155049708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:05,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:05,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:05,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052445164] [2024-11-19 05:58:05,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:05,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:05,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:05,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:05,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:05,176 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1057 out of 1112 [2024-11-19 05:58:05,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 980 places, 999 transitions, 2123 flow. Second operand has 3 states, 3 states have (on average 1058.6666666666667) internal successors, (3176), 3 states have internal predecessors, (3176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:05,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:05,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1057 of 1112 [2024-11-19 05:58:05,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:07,567 INFO L124 PetriNetUnfolderBase]: 488/9044 cut-off events. [2024-11-19 05:58:07,567 INFO L125 PetriNetUnfolderBase]: For 80/116 co-relation queries the response was YES. [2024-11-19 05:58:07,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9907 conditions, 9044 events. 488/9044 cut-off events. For 80/116 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 83309 event pairs, 14 based on Foata normal form. 2/7652 useless extension candidates. Maximal degree in co-relation 9080. Up to 166 conditions per place. [2024-11-19 05:58:07,984 INFO L140 encePairwiseOnDemand]: 1095/1112 looper letters, 23 selfloop transitions, 9 changer transitions 0/997 dead transitions. [2024-11-19 05:58:07,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 960 places, 997 transitions, 2185 flow [2024-11-19 05:58:07,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:07,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:07,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3211 transitions. [2024-11-19 05:58:07,987 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9625299760191847 [2024-11-19 05:58:07,987 INFO L175 Difference]: Start difference. First operand has 980 places, 999 transitions, 2123 flow. Second operand 3 states and 3211 transitions. [2024-11-19 05:58:07,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 960 places, 997 transitions, 2185 flow [2024-11-19 05:58:07,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 959 places, 997 transitions, 2177 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:58:08,006 INFO L231 Difference]: Finished difference. Result has 961 places, 995 transitions, 2151 flow [2024-11-19 05:58:08,007 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1112, PETRI_DIFFERENCE_MINUEND_FLOW=2099, PETRI_DIFFERENCE_MINUEND_PLACES=957, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=991, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=982, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2151, PETRI_PLACES=961, PETRI_TRANSITIONS=995} [2024-11-19 05:58:08,008 INFO L277 CegarLoopForPetriNet]: 1041 programPoint places, -80 predicate places. [2024-11-19 05:58:08,008 INFO L471 AbstractCegarLoop]: Abstraction has has 961 places, 995 transitions, 2151 flow [2024-11-19 05:58:08,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1058.6666666666667) internal successors, (3176), 3 states have internal predecessors, (3176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:08,009 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:08,009 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] [2024-11-19 05:58:08,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-19 05:58:08,009 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2024-11-19 05:58:08,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:08,010 INFO L85 PathProgramCache]: Analyzing trace with hash -95304662, now seen corresponding path program 1 times [2024-11-19 05:58:08,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:08,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891233341] [2024-11-19 05:58:08,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:08,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:08,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:58:08,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:08,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891233341] [2024-11-19 05:58:08,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891233341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:08,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:08,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:08,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418099420] [2024-11-19 05:58:08,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:08,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:08,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:08,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:08,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:08,102 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1112 [2024-11-19 05:58:08,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 961 places, 995 transitions, 2151 flow. Second operand has 3 states, 3 states have (on average 1071.0) internal successors, (3213), 3 states have internal predecessors, (3213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:08,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:08,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1112 [2024-11-19 05:58:08,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:10,105 INFO L124 PetriNetUnfolderBase]: 367/7058 cut-off events. [2024-11-19 05:58:10,105 INFO L125 PetriNetUnfolderBase]: For 166/204 co-relation queries the response was YES. [2024-11-19 05:58:10,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7780 conditions, 7058 events. 367/7058 cut-off events. For 166/204 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 68240 event pairs, 48 based on Foata normal form. 2/5984 useless extension candidates. Maximal degree in co-relation 6211. Up to 147 conditions per place. [2024-11-19 05:58:10,348 INFO L140 encePairwiseOnDemand]: 1109/1112 looper letters, 24 selfloop transitions, 3 changer transitions 0/996 dead transitions. [2024-11-19 05:58:10,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 962 places, 996 transitions, 2209 flow [2024-11-19 05:58:10,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:10,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:10,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3231 transitions. [2024-11-19 05:58:10,350 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9685251798561151 [2024-11-19 05:58:10,350 INFO L175 Difference]: Start difference. First operand has 961 places, 995 transitions, 2151 flow. Second operand 3 states and 3231 transitions. [2024-11-19 05:58:10,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 962 places, 996 transitions, 2209 flow [2024-11-19 05:58:10,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 960 places, 996 transitions, 2191 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:10,364 INFO L231 Difference]: Finished difference. Result has 960 places, 994 transitions, 2137 flow [2024-11-19 05:58:10,365 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1112, PETRI_DIFFERENCE_MINUEND_FLOW=2131, PETRI_DIFFERENCE_MINUEND_PLACES=958, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=994, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=991, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2137, PETRI_PLACES=960, PETRI_TRANSITIONS=994} [2024-11-19 05:58:10,365 INFO L277 CegarLoopForPetriNet]: 1041 programPoint places, -81 predicate places. [2024-11-19 05:58:10,366 INFO L471 AbstractCegarLoop]: Abstraction has has 960 places, 994 transitions, 2137 flow [2024-11-19 05:58:10,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1071.0) internal successors, (3213), 3 states have internal predecessors, (3213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:10,366 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:10,366 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] [2024-11-19 05:58:10,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-19 05:58:10,367 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2024-11-19 05:58:10,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:10,367 INFO L85 PathProgramCache]: Analyzing trace with hash -347496526, now seen corresponding path program 1 times [2024-11-19 05:58:10,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:10,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976456898] [2024-11-19 05:58:10,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:10,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:10,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:58:10,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:10,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976456898] [2024-11-19 05:58:10,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976456898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:10,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:10,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:10,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98574811] [2024-11-19 05:58:10,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:10,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:10,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:10,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:10,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:10,460 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1071 out of 1112 [2024-11-19 05:58:10,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 960 places, 994 transitions, 2137 flow. Second operand has 3 states, 3 states have (on average 1073.3333333333333) internal successors, (3220), 3 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:10,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:10,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1071 of 1112 [2024-11-19 05:58:10,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:11,612 INFO L124 PetriNetUnfolderBase]: 259/4213 cut-off events. [2024-11-19 05:58:11,612 INFO L125 PetriNetUnfolderBase]: For 187/205 co-relation queries the response was YES. [2024-11-19 05:58:11,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4725 conditions, 4213 events. 259/4213 cut-off events. For 187/205 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 33656 event pairs, 60 based on Foata normal form. 1/3550 useless extension candidates. Maximal degree in co-relation 3940. Up to 212 conditions per place. [2024-11-19 05:58:11,808 INFO L140 encePairwiseOnDemand]: 1109/1112 looper letters, 20 selfloop transitions, 3 changer transitions 0/995 dead transitions. [2024-11-19 05:58:11,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 961 places, 995 transitions, 2187 flow [2024-11-19 05:58:11,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:11,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:11,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3233 transitions. [2024-11-19 05:58:11,810 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9691247002398081 [2024-11-19 05:58:11,810 INFO L175 Difference]: Start difference. First operand has 960 places, 994 transitions, 2137 flow. Second operand 3 states and 3233 transitions. [2024-11-19 05:58:11,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 961 places, 995 transitions, 2187 flow [2024-11-19 05:58:11,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 959 places, 995 transitions, 2181 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:11,822 INFO L231 Difference]: Finished difference. Result has 959 places, 993 transitions, 2135 flow [2024-11-19 05:58:11,823 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1112, PETRI_DIFFERENCE_MINUEND_FLOW=2129, PETRI_DIFFERENCE_MINUEND_PLACES=957, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=993, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=990, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2135, PETRI_PLACES=959, PETRI_TRANSITIONS=993} [2024-11-19 05:58:11,823 INFO L277 CegarLoopForPetriNet]: 1041 programPoint places, -82 predicate places. [2024-11-19 05:58:11,823 INFO L471 AbstractCegarLoop]: Abstraction has has 959 places, 993 transitions, 2135 flow [2024-11-19 05:58:11,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1073.3333333333333) internal successors, (3220), 3 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:11,824 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:11,824 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] [2024-11-19 05:58:11,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-19 05:58:11,824 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2024-11-19 05:58:11,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:11,825 INFO L85 PathProgramCache]: Analyzing trace with hash 2104380561, now seen corresponding path program 1 times [2024-11-19 05:58:11,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:11,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308383273] [2024-11-19 05:58:11,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:11,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:11,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:58:11,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:11,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308383273] [2024-11-19 05:58:11,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308383273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:11,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:11,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:58:11,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792023951] [2024-11-19 05:58:11,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:11,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:11,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:11,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:11,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:11,937 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1078 out of 1112 [2024-11-19 05:58:11,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 959 places, 993 transitions, 2135 flow. Second operand has 3 states, 3 states have (on average 1080.6666666666667) internal successors, (3242), 3 states have internal predecessors, (3242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:11,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:11,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1078 of 1112 [2024-11-19 05:58:11,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:14,072 INFO L124 PetriNetUnfolderBase]: 267/5701 cut-off events. [2024-11-19 05:58:14,073 INFO L125 PetriNetUnfolderBase]: For 34/90 co-relation queries the response was YES. [2024-11-19 05:58:14,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6129 conditions, 5701 events. 267/5701 cut-off events. For 34/90 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 50734 event pairs, 8 based on Foata normal form. 0/4817 useless extension candidates. Maximal degree in co-relation 4950. Up to 89 conditions per place. [2024-11-19 05:58:14,495 INFO L140 encePairwiseOnDemand]: 1109/1112 looper letters, 15 selfloop transitions, 2 changer transitions 0/997 dead transitions. [2024-11-19 05:58:14,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 961 places, 997 transitions, 2180 flow [2024-11-19 05:58:14,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:14,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:14,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3252 transitions. [2024-11-19 05:58:14,497 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9748201438848921 [2024-11-19 05:58:14,498 INFO L175 Difference]: Start difference. First operand has 959 places, 993 transitions, 2135 flow. Second operand 3 states and 3252 transitions. [2024-11-19 05:58:14,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 961 places, 997 transitions, 2180 flow [2024-11-19 05:58:14,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 959 places, 997 transitions, 2174 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:14,512 INFO L231 Difference]: Finished difference. Result has 961 places, 994 transitions, 2143 flow [2024-11-19 05:58:14,513 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1112, PETRI_DIFFERENCE_MINUEND_FLOW=2129, PETRI_DIFFERENCE_MINUEND_PLACES=957, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=993, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=991, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2143, PETRI_PLACES=961, PETRI_TRANSITIONS=994} [2024-11-19 05:58:14,514 INFO L277 CegarLoopForPetriNet]: 1041 programPoint places, -80 predicate places. [2024-11-19 05:58:14,514 INFO L471 AbstractCegarLoop]: Abstraction has has 961 places, 994 transitions, 2143 flow [2024-11-19 05:58:14,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1080.6666666666667) internal successors, (3242), 3 states have internal predecessors, (3242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:14,515 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:14,515 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-19 05:58:14,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-19 05:58:14,516 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2024-11-19 05:58:14,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:14,516 INFO L85 PathProgramCache]: Analyzing trace with hash 806392463, now seen corresponding path program 1 times [2024-11-19 05:58:14,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:14,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778166110] [2024-11-19 05:58:14,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:14,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:14,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:14,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:58:14,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:14,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778166110] [2024-11-19 05:58:14,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778166110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:14,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:14,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:14,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236692525] [2024-11-19 05:58:14,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:14,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:14,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:14,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:14,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:14,605 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1057 out of 1112 [2024-11-19 05:58:14,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 961 places, 994 transitions, 2143 flow. Second operand has 3 states, 3 states have (on average 1059.0) internal successors, (3177), 3 states have internal predecessors, (3177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:14,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:14,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1057 of 1112 [2024-11-19 05:58:14,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:18,636 INFO L124 PetriNetUnfolderBase]: 631/10693 cut-off events. [2024-11-19 05:58:18,636 INFO L125 PetriNetUnfolderBase]: For 84/240 co-relation queries the response was YES. [2024-11-19 05:58:19,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11798 conditions, 10693 events. 631/10693 cut-off events. For 84/240 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 110632 event pairs, 67 based on Foata normal form. 0/9062 useless extension candidates. Maximal degree in co-relation 9704. Up to 336 conditions per place. [2024-11-19 05:58:19,971 INFO L140 encePairwiseOnDemand]: 1095/1112 looper letters, 23 selfloop transitions, 9 changer transitions 0/992 dead transitions. [2024-11-19 05:58:19,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 955 places, 992 transitions, 2205 flow [2024-11-19 05:58:19,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:19,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:19,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3211 transitions. [2024-11-19 05:58:19,973 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9625299760191847 [2024-11-19 05:58:19,973 INFO L175 Difference]: Start difference. First operand has 961 places, 994 transitions, 2143 flow. Second operand 3 states and 3211 transitions. [2024-11-19 05:58:19,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 955 places, 992 transitions, 2205 flow [2024-11-19 05:58:19,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 954 places, 992 transitions, 2203 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:58:19,983 INFO L231 Difference]: Finished difference. Result has 956 places, 990 transitions, 2177 flow [2024-11-19 05:58:19,984 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1112, PETRI_DIFFERENCE_MINUEND_FLOW=2125, PETRI_DIFFERENCE_MINUEND_PLACES=952, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=986, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=977, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2177, PETRI_PLACES=956, PETRI_TRANSITIONS=990} [2024-11-19 05:58:19,984 INFO L277 CegarLoopForPetriNet]: 1041 programPoint places, -85 predicate places. [2024-11-19 05:58:19,985 INFO L471 AbstractCegarLoop]: Abstraction has has 956 places, 990 transitions, 2177 flow [2024-11-19 05:58:19,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1059.0) internal successors, (3177), 3 states have internal predecessors, (3177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:19,985 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:19,986 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:58:19,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-19 05:58:19,986 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2024-11-19 05:58:19,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:19,987 INFO L85 PathProgramCache]: Analyzing trace with hash -2063144847, now seen corresponding path program 1 times [2024-11-19 05:58:19,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:19,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883212044] [2024-11-19 05:58:19,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:19,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:20,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:20,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:58:20,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:20,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883212044] [2024-11-19 05:58:20,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883212044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:20,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:20,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:20,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282577688] [2024-11-19 05:58:20,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:20,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:20,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:20,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:20,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:20,090 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1112 [2024-11-19 05:58:20,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 956 places, 990 transitions, 2177 flow. Second operand has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:20,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:20,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1112 [2024-11-19 05:58:20,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:23,736 INFO L124 PetriNetUnfolderBase]: 484/8694 cut-off events. [2024-11-19 05:58:23,737 INFO L125 PetriNetUnfolderBase]: For 386/637 co-relation queries the response was YES. [2024-11-19 05:58:24,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9793 conditions, 8694 events. 484/8694 cut-off events. For 386/637 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 92238 event pairs, 59 based on Foata normal form. 0/7387 useless extension candidates. Maximal degree in co-relation 7686. Up to 284 conditions per place. [2024-11-19 05:58:24,127 INFO L140 encePairwiseOnDemand]: 1109/1112 looper letters, 24 selfloop transitions, 3 changer transitions 0/991 dead transitions. [2024-11-19 05:58:24,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 957 places, 991 transitions, 2235 flow [2024-11-19 05:58:24,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:24,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:24,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3231 transitions. [2024-11-19 05:58:24,130 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9685251798561151 [2024-11-19 05:58:24,130 INFO L175 Difference]: Start difference. First operand has 956 places, 990 transitions, 2177 flow. Second operand 3 states and 3231 transitions. [2024-11-19 05:58:24,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 957 places, 991 transitions, 2235 flow [2024-11-19 05:58:24,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 955 places, 991 transitions, 2217 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:24,140 INFO L231 Difference]: Finished difference. Result has 955 places, 989 transitions, 2163 flow [2024-11-19 05:58:24,141 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1112, PETRI_DIFFERENCE_MINUEND_FLOW=2157, PETRI_DIFFERENCE_MINUEND_PLACES=953, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=989, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=986, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2163, PETRI_PLACES=955, PETRI_TRANSITIONS=989} [2024-11-19 05:58:24,141 INFO L277 CegarLoopForPetriNet]: 1041 programPoint places, -86 predicate places. [2024-11-19 05:58:24,141 INFO L471 AbstractCegarLoop]: Abstraction has has 955 places, 989 transitions, 2163 flow [2024-11-19 05:58:24,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:24,142 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:24,142 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:58:24,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-19 05:58:24,142 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread1Err36ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2024-11-19 05:58:24,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:24,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1349876757, now seen corresponding path program 1 times [2024-11-19 05:58:24,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:24,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131235022] [2024-11-19 05:58:24,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:24,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:24,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:58:24,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:24,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131235022] [2024-11-19 05:58:24,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131235022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:24,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:24,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:24,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965102920] [2024-11-19 05:58:24,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:24,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:24,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:24,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:24,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:24,214 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1071 out of 1112 [2024-11-19 05:58:24,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 955 places, 989 transitions, 2163 flow. Second operand has 3 states, 3 states have (on average 1072.6666666666667) internal successors, (3218), 3 states have internal predecessors, (3218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:24,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:24,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1071 of 1112 [2024-11-19 05:58:24,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:26,815 INFO L124 PetriNetUnfolderBase]: 263/5241 cut-off events. [2024-11-19 05:58:26,816 INFO L125 PetriNetUnfolderBase]: For 12/84 co-relation queries the response was YES. [2024-11-19 05:58:27,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5874 conditions, 5241 events. 263/5241 cut-off events. For 12/84 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 48411 event pairs, 6 based on Foata normal form. 2/4548 useless extension candidates. Maximal degree in co-relation 4566. Up to 106 conditions per place. [2024-11-19 05:58:27,051 INFO L140 encePairwiseOnDemand]: 1105/1112 looper letters, 15 selfloop transitions, 3 changer transitions 0/987 dead transitions. [2024-11-19 05:58:27,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 953 places, 987 transitions, 2197 flow [2024-11-19 05:58:27,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:27,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:27,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3235 transitions. [2024-11-19 05:58:27,054 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9697242206235012 [2024-11-19 05:58:27,054 INFO L175 Difference]: Start difference. First operand has 955 places, 989 transitions, 2163 flow. Second operand 3 states and 3235 transitions. [2024-11-19 05:58:27,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 953 places, 987 transitions, 2197 flow [2024-11-19 05:58:27,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 951 places, 987 transitions, 2191 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:27,064 INFO L231 Difference]: Finished difference. Result has 951 places, 985 transitions, 2155 flow [2024-11-19 05:58:27,065 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1112, PETRI_DIFFERENCE_MINUEND_FLOW=2149, PETRI_DIFFERENCE_MINUEND_PLACES=949, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=985, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=982, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2155, PETRI_PLACES=951, PETRI_TRANSITIONS=985} [2024-11-19 05:58:27,065 INFO L277 CegarLoopForPetriNet]: 1041 programPoint places, -90 predicate places. [2024-11-19 05:58:27,065 INFO L471 AbstractCegarLoop]: Abstraction has has 951 places, 985 transitions, 2155 flow [2024-11-19 05:58:27,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1072.6666666666667) internal successors, (3218), 3 states have internal predecessors, (3218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:27,066 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:27,066 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:58:27,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-19 05:58:27,066 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2024-11-19 05:58:27,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:27,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1976844359, now seen corresponding path program 1 times [2024-11-19 05:58:27,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:27,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485624716] [2024-11-19 05:58:27,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:27,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:27,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:58:27,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:27,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485624716] [2024-11-19 05:58:27,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485624716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:27,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:27,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:58:27,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976161649] [2024-11-19 05:58:27,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:27,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:27,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:27,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:27,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:27,158 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1078 out of 1112 [2024-11-19 05:58:27,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 951 places, 985 transitions, 2155 flow. Second operand has 3 states, 3 states have (on average 1081.0) internal successors, (3243), 3 states have internal predecessors, (3243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:27,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:27,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1078 of 1112 [2024-11-19 05:58:27,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand