./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-node-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-node-symm.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9db11e263e78e3a6bd75c2a0c3dda64920ec857df2fbb1d0b7b1072a48f36a31 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:57:09,561 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:57:09,608 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:09,613 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:57:09,614 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:57:09,645 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:57:09,645 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:57:09,646 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:57:09,646 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:57:09,646 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:57:09,647 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:57:09,647 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:57:09,647 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:57:09,648 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:57:09,648 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:57:09,648 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:57:09,648 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:57:09,649 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:57:09,649 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:57:09,649 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:57:09,649 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:57:09,653 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:57:09,653 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 05:57:09,653 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:57:09,653 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 05:57:09,660 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:57:09,660 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:57:09,660 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:57:09,660 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:57:09,661 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:57:09,661 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:57:09,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:57:09,661 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:57:09,661 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:57:09,662 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:57:09,662 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:57:09,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:57:09,662 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:57:09,662 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:57:09,662 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:57:09,663 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:57:09,663 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 -> 9db11e263e78e3a6bd75c2a0c3dda64920ec857df2fbb1d0b7b1072a48f36a31 [2024-11-19 05:57:09,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:57:09,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:57:09,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:57:09,912 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:57:09,912 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:57:09,913 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-symm.wvr.c [2024-11-19 05:57:11,229 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:57:11,405 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:57:11,406 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-symm.wvr.c [2024-11-19 05:57:11,413 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bea64e65/4326df9ca4544231a92e9ac96020332f/FLAG193734ab4 [2024-11-19 05:57:11,790 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bea64e65/4326df9ca4544231a92e9ac96020332f [2024-11-19 05:57:11,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:57:11,793 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:57:11,795 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:57:11,795 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:57:11,799 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:57:11,799 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:57:11" (1/1) ... [2024-11-19 05:57:11,800 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17058fa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:57:11, skipping insertion in model container [2024-11-19 05:57:11,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:57:11" (1/1) ... [2024-11-19 05:57:11,822 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:57:12,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:57:12,066 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:57:12,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:57:12,117 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:57:12,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:57:12 WrapperNode [2024-11-19 05:57:12,118 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:57:12,119 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:57:12,120 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:57:12,120 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:57:12,126 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:12" (1/1) ... [2024-11-19 05:57:12,136 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:12" (1/1) ... [2024-11-19 05:57:12,166 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 19, calls inlined = 25, statements flattened = 541 [2024-11-19 05:57:12,167 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:57:12,168 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:57:12,168 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:57:12,168 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:57:12,176 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:12" (1/1) ... [2024-11-19 05:57:12,176 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:12" (1/1) ... [2024-11-19 05:57:12,181 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:12" (1/1) ... [2024-11-19 05:57:12,181 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:12" (1/1) ... [2024-11-19 05:57:12,196 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:12" (1/1) ... [2024-11-19 05:57:12,200 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:12" (1/1) ... [2024-11-19 05:57:12,203 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:12" (1/1) ... [2024-11-19 05:57:12,205 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:12" (1/1) ... [2024-11-19 05:57:12,208 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:57:12,209 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:57:12,210 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:57:12,210 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:57:12,210 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:57:12" (1/1) ... [2024-11-19 05:57:12,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:57:12,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:57:12,251 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:12,253 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:12,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:57:12,288 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 05:57:12,288 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 05:57:12,288 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 05:57:12,288 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 05:57:12,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 05:57:12,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 05:57:12,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 05:57:12,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:57:12,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:57:12,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 05:57:12,292 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:12,397 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:57:12,399 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:57:13,038 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 05:57:13,038 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:57:13,066 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:57:13,066 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-19 05:57:13,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:57:13 BoogieIcfgContainer [2024-11-19 05:57:13,067 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:57:13,068 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:57:13,068 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:57:13,071 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:57:13,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:57:11" (1/3) ... [2024-11-19 05:57:13,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e50ccb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:57:13, skipping insertion in model container [2024-11-19 05:57:13,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:57:12" (2/3) ... [2024-11-19 05:57:13,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e50ccb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:57:13, skipping insertion in model container [2024-11-19 05:57:13,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:57:13" (3/3) ... [2024-11-19 05:57:13,079 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-node-symm.wvr.c [2024-11-19 05:57:13,093 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:57:13,094 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 78 error locations. [2024-11-19 05:57:13,094 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 05:57:13,265 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-19 05:57:13,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 691 places, 717 transitions, 1448 flow [2024-11-19 05:57:13,504 INFO L124 PetriNetUnfolderBase]: 33/715 cut-off events. [2024-11-19 05:57:13,504 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 05:57:13,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 724 conditions, 715 events. 33/715 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1121 event pairs, 0 based on Foata normal form. 0/604 useless extension candidates. Maximal degree in co-relation 521. Up to 2 conditions per place. [2024-11-19 05:57:13,520 INFO L82 GeneralOperation]: Start removeDead. Operand has 691 places, 717 transitions, 1448 flow [2024-11-19 05:57:13,531 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 669 places, 693 transitions, 1398 flow [2024-11-19 05:57:13,543 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:57:13,551 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;@eef6268, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:57:13,552 INFO L334 AbstractCegarLoop]: Starting to check reachability of 130 error locations. [2024-11-19 05:57:13,554 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:57:13,555 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2024-11-19 05:57:13,555 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:57:13,555 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:13,557 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:57:13,558 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-19 05:57:13,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:13,563 INFO L85 PathProgramCache]: Analyzing trace with hash 2005720421, now seen corresponding path program 1 times [2024-11-19 05:57:13,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:13,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845528293] [2024-11-19 05:57:13,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:13,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:13,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:13,732 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:13,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:13,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845528293] [2024-11-19 05:57:13,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845528293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:13,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:13,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:13,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550064105] [2024-11-19 05:57:13,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:13,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:13,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:13,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:13,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:13,870 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 675 out of 717 [2024-11-19 05:57:13,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 669 places, 693 transitions, 1398 flow. Second operand has 3 states, 3 states have (on average 676.3333333333334) internal successors, (2029), 3 states have internal predecessors, (2029), 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:13,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:13,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 675 of 717 [2024-11-19 05:57:13,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:14,096 INFO L124 PetriNetUnfolderBase]: 39/1279 cut-off events. [2024-11-19 05:57:14,097 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-11-19 05:57:14,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1347 conditions, 1279 events. 39/1279 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 5135 event pairs, 15 based on Foata normal form. 33/1089 useless extension candidates. Maximal degree in co-relation 949. Up to 48 conditions per place. [2024-11-19 05:57:14,136 INFO L140 encePairwiseOnDemand]: 695/717 looper letters, 17 selfloop transitions, 2 changer transitions 11/673 dead transitions. [2024-11-19 05:57:14,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 670 places, 673 transitions, 1396 flow [2024-11-19 05:57:14,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:14,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:14,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2064 transitions. [2024-11-19 05:57:14,153 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9595536959553695 [2024-11-19 05:57:14,155 INFO L175 Difference]: Start difference. First operand has 669 places, 693 transitions, 1398 flow. Second operand 3 states and 2064 transitions. [2024-11-19 05:57:14,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 670 places, 673 transitions, 1396 flow [2024-11-19 05:57:14,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 666 places, 673 transitions, 1388 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 05:57:14,172 INFO L231 Difference]: Finished difference. Result has 666 places, 662 transitions, 1332 flow [2024-11-19 05:57:14,175 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1350, PETRI_DIFFERENCE_MINUEND_PLACES=664, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1332, PETRI_PLACES=666, PETRI_TRANSITIONS=662} [2024-11-19 05:57:14,177 INFO L277 CegarLoopForPetriNet]: 669 programPoint places, -3 predicate places. [2024-11-19 05:57:14,178 INFO L471 AbstractCegarLoop]: Abstraction has has 666 places, 662 transitions, 1332 flow [2024-11-19 05:57:14,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 676.3333333333334) internal successors, (2029), 3 states have internal predecessors, (2029), 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,179 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:14,179 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:57:14,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:57:14,180 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-19 05:57:14,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:14,180 INFO L85 PathProgramCache]: Analyzing trace with hash 66804907, now seen corresponding path program 1 times [2024-11-19 05:57:14,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:14,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879780317] [2024-11-19 05:57:14,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:14,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:14,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:14,230 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,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:14,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879780317] [2024-11-19 05:57:14,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879780317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:14,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:14,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:14,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656899332] [2024-11-19 05:57:14,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:14,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:14,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:14,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:14,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:14,283 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 661 out of 717 [2024-11-19 05:57:14,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 666 places, 662 transitions, 1332 flow. Second operand has 3 states, 3 states have (on average 662.0) internal successors, (1986), 3 states have internal predecessors, (1986), 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,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:14,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 661 of 717 [2024-11-19 05:57:14,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:14,668 INFO L124 PetriNetUnfolderBase]: 97/2038 cut-off events. [2024-11-19 05:57:14,668 INFO L125 PetriNetUnfolderBase]: For 10/14 co-relation queries the response was YES. [2024-11-19 05:57:14,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2177 conditions, 2038 events. 97/2038 cut-off events. For 10/14 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 11737 event pairs, 48 based on Foata normal form. 0/1703 useless extension candidates. Maximal degree in co-relation 2141. Up to 125 conditions per place. [2024-11-19 05:57:14,682 INFO L140 encePairwiseOnDemand]: 706/717 looper letters, 24 selfloop transitions, 1 changer transitions 0/652 dead transitions. [2024-11-19 05:57:14,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 647 places, 652 transitions, 1362 flow [2024-11-19 05:57:14,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:14,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:14,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2018 transitions. [2024-11-19 05:57:14,686 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9381682938168294 [2024-11-19 05:57:14,686 INFO L175 Difference]: Start difference. First operand has 666 places, 662 transitions, 1332 flow. Second operand 3 states and 2018 transitions. [2024-11-19 05:57:14,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 647 places, 652 transitions, 1362 flow [2024-11-19 05:57:14,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 645 places, 652 transitions, 1358 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:14,695 INFO L231 Difference]: Finished difference. Result has 645 places, 652 transitions, 1310 flow [2024-11-19 05:57:14,696 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1308, PETRI_DIFFERENCE_MINUEND_PLACES=643, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=652, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=651, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1310, PETRI_PLACES=645, PETRI_TRANSITIONS=652} [2024-11-19 05:57:14,698 INFO L277 CegarLoopForPetriNet]: 669 programPoint places, -24 predicate places. [2024-11-19 05:57:14,698 INFO L471 AbstractCegarLoop]: Abstraction has has 645 places, 652 transitions, 1310 flow [2024-11-19 05:57:14,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 662.0) internal successors, (1986), 3 states have internal predecessors, (1986), 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,700 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:14,700 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] [2024-11-19 05:57:14,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:57:14,701 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-19 05:57:14,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:14,701 INFO L85 PathProgramCache]: Analyzing trace with hash -373621965, now seen corresponding path program 1 times [2024-11-19 05:57:14,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:14,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269494555] [2024-11-19 05:57:14,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:14,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:14,772 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,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:14,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269494555] [2024-11-19 05:57:14,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269494555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:14,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:14,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:14,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899283586] [2024-11-19 05:57:14,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:14,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:14,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:14,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:14,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:14,849 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 675 out of 717 [2024-11-19 05:57:14,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 645 places, 652 transitions, 1310 flow. Second operand has 3 states, 3 states have (on average 676.3333333333334) internal successors, (2029), 3 states have internal predecessors, (2029), 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,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:14,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 675 of 717 [2024-11-19 05:57:14,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:14,991 INFO L124 PetriNetUnfolderBase]: 39/1263 cut-off events. [2024-11-19 05:57:14,992 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2024-11-19 05:57:14,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1321 conditions, 1263 events. 39/1263 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4922 event pairs, 15 based on Foata normal form. 0/1067 useless extension candidates. Maximal degree in co-relation 1285. Up to 48 conditions per place. [2024-11-19 05:57:15,000 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 17 selfloop transitions, 2 changer transitions 0/651 dead transitions. [2024-11-19 05:57:15,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 646 places, 651 transitions, 1346 flow [2024-11-19 05:57:15,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:15,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:15,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2045 transitions. [2024-11-19 05:57:15,005 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9507205950720595 [2024-11-19 05:57:15,005 INFO L175 Difference]: Start difference. First operand has 645 places, 652 transitions, 1310 flow. Second operand 3 states and 2045 transitions. [2024-11-19 05:57:15,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 646 places, 651 transitions, 1346 flow [2024-11-19 05:57:15,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 645 places, 651 transitions, 1345 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:57:15,014 INFO L231 Difference]: Finished difference. Result has 645 places, 651 transitions, 1311 flow [2024-11-19 05:57:15,015 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1307, PETRI_DIFFERENCE_MINUEND_PLACES=643, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=651, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=649, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1311, PETRI_PLACES=645, PETRI_TRANSITIONS=651} [2024-11-19 05:57:15,016 INFO L277 CegarLoopForPetriNet]: 669 programPoint places, -24 predicate places. [2024-11-19 05:57:15,016 INFO L471 AbstractCegarLoop]: Abstraction has has 645 places, 651 transitions, 1311 flow [2024-11-19 05:57:15,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 676.3333333333334) internal successors, (2029), 3 states have internal predecessors, (2029), 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:15,018 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:15,018 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] [2024-11-19 05:57:15,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:57:15,019 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-19 05:57:15,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:15,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1391590869, now seen corresponding path program 1 times [2024-11-19 05:57:15,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:15,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409334067] [2024-11-19 05:57:15,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:15,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:15,061 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:15,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:15,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409334067] [2024-11-19 05:57:15,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409334067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:15,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:15,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:15,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000867913] [2024-11-19 05:57:15,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:15,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:15,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:15,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:15,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:15,114 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 661 out of 717 [2024-11-19 05:57:15,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 645 places, 651 transitions, 1311 flow. Second operand has 3 states, 3 states have (on average 662.0) internal successors, (1986), 3 states have internal predecessors, (1986), 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:15,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:15,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 661 of 717 [2024-11-19 05:57:15,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:15,346 INFO L124 PetriNetUnfolderBase]: 98/2027 cut-off events. [2024-11-19 05:57:15,346 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-11-19 05:57:15,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2169 conditions, 2027 events. 98/2027 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 11490 event pairs, 48 based on Foata normal form. 0/1726 useless extension candidates. Maximal degree in co-relation 2134. Up to 127 conditions per place. [2024-11-19 05:57:15,360 INFO L140 encePairwiseOnDemand]: 706/717 looper letters, 24 selfloop transitions, 1 changer transitions 0/641 dead transitions. [2024-11-19 05:57:15,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 637 places, 641 transitions, 1341 flow [2024-11-19 05:57:15,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:15,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:15,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2018 transitions. [2024-11-19 05:57:15,367 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9381682938168294 [2024-11-19 05:57:15,367 INFO L175 Difference]: Start difference. First operand has 645 places, 651 transitions, 1311 flow. Second operand 3 states and 2018 transitions. [2024-11-19 05:57:15,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 637 places, 641 transitions, 1341 flow [2024-11-19 05:57:15,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 635 places, 641 transitions, 1337 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:15,377 INFO L231 Difference]: Finished difference. Result has 635 places, 641 transitions, 1289 flow [2024-11-19 05:57:15,378 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=641, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=640, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1289, PETRI_PLACES=635, PETRI_TRANSITIONS=641} [2024-11-19 05:57:15,379 INFO L277 CegarLoopForPetriNet]: 669 programPoint places, -34 predicate places. [2024-11-19 05:57:15,380 INFO L471 AbstractCegarLoop]: Abstraction has has 635 places, 641 transitions, 1289 flow [2024-11-19 05:57:15,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 662.0) internal successors, (1986), 3 states have internal predecessors, (1986), 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:15,381 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:15,381 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] [2024-11-19 05:57:15,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:57:15,383 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-19 05:57:15,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:15,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1851419430, now seen corresponding path program 1 times [2024-11-19 05:57:15,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:15,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983075662] [2024-11-19 05:57:15,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:15,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:15,422 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:15,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:15,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983075662] [2024-11-19 05:57:15,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983075662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:15,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:15,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:15,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105445412] [2024-11-19 05:57:15,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:15,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:15,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:15,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:15,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:15,440 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 682 out of 717 [2024-11-19 05:57:15,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 641 transitions, 1289 flow. Second operand has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 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:15,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:15,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 682 of 717 [2024-11-19 05:57:15,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:15,544 INFO L124 PetriNetUnfolderBase]: 16/789 cut-off events. [2024-11-19 05:57:15,544 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-11-19 05:57:15,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 811 conditions, 789 events. 16/789 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1390 event pairs, 1 based on Foata normal form. 0/694 useless extension candidates. Maximal degree in co-relation 775. Up to 13 conditions per place. [2024-11-19 05:57:15,556 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 10 selfloop transitions, 2 changer transitions 0/640 dead transitions. [2024-11-19 05:57:15,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 640 transitions, 1311 flow [2024-11-19 05:57:15,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:15,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:15,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2059 transitions. [2024-11-19 05:57:15,560 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9572291957229195 [2024-11-19 05:57:15,560 INFO L175 Difference]: Start difference. First operand has 635 places, 641 transitions, 1289 flow. Second operand 3 states and 2059 transitions. [2024-11-19 05:57:15,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 640 transitions, 1311 flow [2024-11-19 05:57:15,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 635 places, 640 transitions, 1310 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:57:15,570 INFO L231 Difference]: Finished difference. Result has 635 places, 640 transitions, 1290 flow [2024-11-19 05:57:15,571 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1286, PETRI_DIFFERENCE_MINUEND_PLACES=633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=640, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=638, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1290, PETRI_PLACES=635, PETRI_TRANSITIONS=640} [2024-11-19 05:57:15,572 INFO L277 CegarLoopForPetriNet]: 669 programPoint places, -34 predicate places. [2024-11-19 05:57:15,572 INFO L471 AbstractCegarLoop]: Abstraction has has 635 places, 640 transitions, 1290 flow [2024-11-19 05:57:15,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 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:15,573 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:15,573 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:57:15,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:57:15,574 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-19 05:57:15,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:15,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1970348823, now seen corresponding path program 1 times [2024-11-19 05:57:15,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:15,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069679358] [2024-11-19 05:57:15,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:15,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:15,645 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:15,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:15,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069679358] [2024-11-19 05:57:15,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069679358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:15,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:15,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:15,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747221844] [2024-11-19 05:57:15,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:15,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:15,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:15,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:15,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:15,671 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 682 out of 717 [2024-11-19 05:57:15,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 640 transitions, 1290 flow. Second operand has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 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:15,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:15,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 682 of 717 [2024-11-19 05:57:15,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:15,801 INFO L124 PetriNetUnfolderBase]: 24/1086 cut-off events. [2024-11-19 05:57:15,802 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-11-19 05:57:15,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 1086 events. 24/1086 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3388 event pairs, 3 based on Foata normal form. 0/943 useless extension candidates. Maximal degree in co-relation 1080. Up to 17 conditions per place. [2024-11-19 05:57:15,811 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 10 selfloop transitions, 2 changer transitions 0/639 dead transitions. [2024-11-19 05:57:15,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 639 transitions, 1312 flow [2024-11-19 05:57:15,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:15,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:15,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2059 transitions. [2024-11-19 05:57:15,815 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9572291957229195 [2024-11-19 05:57:15,815 INFO L175 Difference]: Start difference. First operand has 635 places, 640 transitions, 1290 flow. Second operand 3 states and 2059 transitions. [2024-11-19 05:57:15,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 639 transitions, 1312 flow [2024-11-19 05:57:15,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 634 places, 639 transitions, 1308 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:15,824 INFO L231 Difference]: Finished difference. Result has 634 places, 639 transitions, 1288 flow [2024-11-19 05:57:15,825 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1284, PETRI_DIFFERENCE_MINUEND_PLACES=632, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=639, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=637, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1288, PETRI_PLACES=634, PETRI_TRANSITIONS=639} [2024-11-19 05:57:15,826 INFO L277 CegarLoopForPetriNet]: 669 programPoint places, -35 predicate places. [2024-11-19 05:57:15,826 INFO L471 AbstractCegarLoop]: Abstraction has has 634 places, 639 transitions, 1288 flow [2024-11-19 05:57:15,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 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:15,828 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:15,828 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:57:15,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:57:15,828 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-19 05:57:15,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:15,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1865204960, now seen corresponding path program 1 times [2024-11-19 05:57:15,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:15,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225416359] [2024-11-19 05:57:15,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:15,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:15,864 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:15,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:15,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225416359] [2024-11-19 05:57:15,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225416359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:15,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:15,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:15,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018401073] [2024-11-19 05:57:15,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:15,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:15,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:15,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:15,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:15,890 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 682 out of 717 [2024-11-19 05:57:15,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 634 places, 639 transitions, 1288 flow. Second operand has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 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:15,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:15,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 682 of 717 [2024-11-19 05:57:15,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:16,003 INFO L124 PetriNetUnfolderBase]: 24/1085 cut-off events. [2024-11-19 05:57:16,003 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-11-19 05:57:16,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1115 conditions, 1085 events. 24/1085 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3341 event pairs, 3 based on Foata normal form. 0/943 useless extension candidates. Maximal degree in co-relation 1079. Up to 17 conditions per place. [2024-11-19 05:57:16,013 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 10 selfloop transitions, 2 changer transitions 0/638 dead transitions. [2024-11-19 05:57:16,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 635 places, 638 transitions, 1310 flow [2024-11-19 05:57:16,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:16,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:16,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2059 transitions. [2024-11-19 05:57:16,016 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9572291957229195 [2024-11-19 05:57:16,016 INFO L175 Difference]: Start difference. First operand has 634 places, 639 transitions, 1288 flow. Second operand 3 states and 2059 transitions. [2024-11-19 05:57:16,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 635 places, 638 transitions, 1310 flow [2024-11-19 05:57:16,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 638 transitions, 1306 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:16,024 INFO L231 Difference]: Finished difference. Result has 633 places, 638 transitions, 1286 flow [2024-11-19 05:57:16,025 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1282, PETRI_DIFFERENCE_MINUEND_PLACES=631, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=638, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=636, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1286, PETRI_PLACES=633, PETRI_TRANSITIONS=638} [2024-11-19 05:57:16,026 INFO L277 CegarLoopForPetriNet]: 669 programPoint places, -36 predicate places. [2024-11-19 05:57:16,026 INFO L471 AbstractCegarLoop]: Abstraction has has 633 places, 638 transitions, 1286 flow [2024-11-19 05:57:16,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 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,027 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:16,027 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] [2024-11-19 05:57:16,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:57:16,028 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-19 05:57:16,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:16,028 INFO L85 PathProgramCache]: Analyzing trace with hash 57690957, now seen corresponding path program 1 times [2024-11-19 05:57:16,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:16,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599826767] [2024-11-19 05:57:16,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:16,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:16,069 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,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:16,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599826767] [2024-11-19 05:57:16,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599826767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:16,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:16,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:16,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466780016] [2024-11-19 05:57:16,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:16,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:16,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:16,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:16,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:16,099 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 682 out of 717 [2024-11-19 05:57:16,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 633 places, 638 transitions, 1286 flow. Second operand has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 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,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:16,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 682 of 717 [2024-11-19 05:57:16,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:16,165 INFO L124 PetriNetUnfolderBase]: 13/652 cut-off events. [2024-11-19 05:57:16,165 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-19 05:57:16,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 675 conditions, 652 events. 13/652 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1036 event pairs, 1 based on Foata normal form. 0/583 useless extension candidates. Maximal degree in co-relation 639. Up to 13 conditions per place. [2024-11-19 05:57:16,173 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 10 selfloop transitions, 2 changer transitions 0/637 dead transitions. [2024-11-19 05:57:16,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 634 places, 637 transitions, 1308 flow [2024-11-19 05:57:16,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:16,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:16,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2059 transitions. [2024-11-19 05:57:16,176 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9572291957229195 [2024-11-19 05:57:16,176 INFO L175 Difference]: Start difference. First operand has 633 places, 638 transitions, 1286 flow. Second operand 3 states and 2059 transitions. [2024-11-19 05:57:16,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 634 places, 637 transitions, 1308 flow [2024-11-19 05:57:16,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 632 places, 637 transitions, 1304 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:16,185 INFO L231 Difference]: Finished difference. Result has 632 places, 637 transitions, 1284 flow [2024-11-19 05:57:16,186 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1280, PETRI_DIFFERENCE_MINUEND_PLACES=630, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=637, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=635, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1284, PETRI_PLACES=632, PETRI_TRANSITIONS=637} [2024-11-19 05:57:16,186 INFO L277 CegarLoopForPetriNet]: 669 programPoint places, -37 predicate places. [2024-11-19 05:57:16,187 INFO L471 AbstractCegarLoop]: Abstraction has has 632 places, 637 transitions, 1284 flow [2024-11-19 05:57:16,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 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,188 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:16,188 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] [2024-11-19 05:57:16,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 05:57:16,189 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-19 05:57:16,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:16,189 INFO L85 PathProgramCache]: Analyzing trace with hash -2001292974, now seen corresponding path program 1 times [2024-11-19 05:57:16,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:16,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240602079] [2024-11-19 05:57:16,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:16,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:16,224 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,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:16,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240602079] [2024-11-19 05:57:16,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240602079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:16,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:16,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:16,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93838302] [2024-11-19 05:57:16,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:16,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:16,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:16,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:16,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:16,255 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 682 out of 717 [2024-11-19 05:57:16,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 632 places, 637 transitions, 1284 flow. Second operand has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 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,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:16,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 682 of 717 [2024-11-19 05:57:16,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:16,340 INFO L124 PetriNetUnfolderBase]: 18/769 cut-off events. [2024-11-19 05:57:16,341 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2024-11-19 05:57:16,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 796 conditions, 769 events. 18/769 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1446 event pairs, 3 based on Foata normal form. 0/678 useless extension candidates. Maximal degree in co-relation 760. Up to 17 conditions per place. [2024-11-19 05:57:16,346 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 10 selfloop transitions, 2 changer transitions 0/636 dead transitions. [2024-11-19 05:57:16,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 636 transitions, 1306 flow [2024-11-19 05:57:16,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:16,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:16,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2059 transitions. [2024-11-19 05:57:16,350 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9572291957229195 [2024-11-19 05:57:16,350 INFO L175 Difference]: Start difference. First operand has 632 places, 637 transitions, 1284 flow. Second operand 3 states and 2059 transitions. [2024-11-19 05:57:16,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 633 places, 636 transitions, 1306 flow [2024-11-19 05:57:16,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 631 places, 636 transitions, 1302 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:16,356 INFO L231 Difference]: Finished difference. Result has 631 places, 636 transitions, 1282 flow [2024-11-19 05:57:16,357 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1278, PETRI_DIFFERENCE_MINUEND_PLACES=629, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=636, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=634, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1282, PETRI_PLACES=631, PETRI_TRANSITIONS=636} [2024-11-19 05:57:16,358 INFO L277 CegarLoopForPetriNet]: 669 programPoint places, -38 predicate places. [2024-11-19 05:57:16,358 INFO L471 AbstractCegarLoop]: Abstraction has has 631 places, 636 transitions, 1282 flow [2024-11-19 05:57:16,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 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,359 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:16,359 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 05:57:16,360 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-19 05:57:16,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:16,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1874968655, now seen corresponding path program 1 times [2024-11-19 05:57:16,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:16,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611731684] [2024-11-19 05:57:16,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:16,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:16,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:16,388 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,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:16,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611731684] [2024-11-19 05:57:16,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611731684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:16,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:16,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:16,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836866352] [2024-11-19 05:57:16,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:16,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:16,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:16,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:16,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:16,411 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 682 out of 717 [2024-11-19 05:57:16,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 631 places, 636 transitions, 1282 flow. Second operand has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 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,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:16,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 682 of 717 [2024-11-19 05:57:16,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:16,488 INFO L124 PetriNetUnfolderBase]: 18/749 cut-off events. [2024-11-19 05:57:16,489 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2024-11-19 05:57:16,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 776 conditions, 749 events. 18/749 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1405 event pairs, 3 based on Foata normal form. 0/662 useless extension candidates. Maximal degree in co-relation 740. Up to 17 conditions per place. [2024-11-19 05:57:16,496 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 10 selfloop transitions, 2 changer transitions 0/635 dead transitions. [2024-11-19 05:57:16,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 632 places, 635 transitions, 1304 flow [2024-11-19 05:57:16,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:16,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:16,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2059 transitions. [2024-11-19 05:57:16,500 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9572291957229195 [2024-11-19 05:57:16,500 INFO L175 Difference]: Start difference. First operand has 631 places, 636 transitions, 1282 flow. Second operand 3 states and 2059 transitions. [2024-11-19 05:57:16,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 632 places, 635 transitions, 1304 flow [2024-11-19 05:57:16,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 630 places, 635 transitions, 1300 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:16,507 INFO L231 Difference]: Finished difference. Result has 630 places, 635 transitions, 1280 flow [2024-11-19 05:57:16,509 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1276, PETRI_DIFFERENCE_MINUEND_PLACES=628, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=633, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1280, PETRI_PLACES=630, PETRI_TRANSITIONS=635} [2024-11-19 05:57:16,509 INFO L277 CegarLoopForPetriNet]: 669 programPoint places, -39 predicate places. [2024-11-19 05:57:16,509 INFO L471 AbstractCegarLoop]: Abstraction has has 630 places, 635 transitions, 1280 flow [2024-11-19 05:57:16,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 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,511 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:16,511 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:16,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 05:57:16,511 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-19 05:57:16,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:16,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1094246123, now seen corresponding path program 1 times [2024-11-19 05:57:16,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:16,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61418774] [2024-11-19 05:57:16,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:16,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:16,547 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,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:16,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61418774] [2024-11-19 05:57:16,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61418774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:16,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:16,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:16,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735745834] [2024-11-19 05:57:16,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:16,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:16,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:16,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:16,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:16,574 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 681 out of 717 [2024-11-19 05:57:16,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 630 places, 635 transitions, 1280 flow. Second operand has 3 states, 3 states have (on average 682.3333333333334) internal successors, (2047), 3 states have internal predecessors, (2047), 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,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:16,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 681 of 717 [2024-11-19 05:57:16,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:16,687 INFO L124 PetriNetUnfolderBase]: 29/1076 cut-off events. [2024-11-19 05:57:16,688 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 05:57:16,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 1076 events. 29/1076 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3714 event pairs, 8 based on Foata normal form. 0/937 useless extension candidates. Maximal degree in co-relation 1080. Up to 28 conditions per place. [2024-11-19 05:57:16,693 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 11 selfloop transitions, 2 changer transitions 0/634 dead transitions. [2024-11-19 05:57:16,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 631 places, 634 transitions, 1304 flow [2024-11-19 05:57:16,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:16,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:16,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2057 transitions. [2024-11-19 05:57:16,696 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9562993956299396 [2024-11-19 05:57:16,696 INFO L175 Difference]: Start difference. First operand has 630 places, 635 transitions, 1280 flow. Second operand 3 states and 2057 transitions. [2024-11-19 05:57:16,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 631 places, 634 transitions, 1304 flow [2024-11-19 05:57:16,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 629 places, 634 transitions, 1300 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:16,702 INFO L231 Difference]: Finished difference. Result has 629 places, 634 transitions, 1278 flow [2024-11-19 05:57:16,703 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1274, PETRI_DIFFERENCE_MINUEND_PLACES=627, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=634, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=632, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1278, PETRI_PLACES=629, PETRI_TRANSITIONS=634} [2024-11-19 05:57:16,704 INFO L277 CegarLoopForPetriNet]: 669 programPoint places, -40 predicate places. [2024-11-19 05:57:16,704 INFO L471 AbstractCegarLoop]: Abstraction has has 629 places, 634 transitions, 1278 flow [2024-11-19 05:57:16,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 682.3333333333334) internal successors, (2047), 3 states have internal predecessors, (2047), 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,705 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:16,705 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:16,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 05:57:16,705 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-19 05:57:16,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:16,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1101532531, now seen corresponding path program 1 times [2024-11-19 05:57:16,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:16,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135970164] [2024-11-19 05:57:16,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:16,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:17,147 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:17,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:17,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135970164] [2024-11-19 05:57:17,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135970164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:17,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:17,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:57:17,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867343163] [2024-11-19 05:57:17,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:17,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:57:17,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:17,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:57:17,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:57:17,427 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 717 [2024-11-19 05:57:17,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 629 places, 634 transitions, 1278 flow. Second operand has 6 states, 6 states have (on average 627.5) internal successors, (3765), 6 states have internal predecessors, (3765), 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:17,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:17,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 717 [2024-11-19 05:57:17,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:17,913 INFO L124 PetriNetUnfolderBase]: 439/4180 cut-off events. [2024-11-19 05:57:17,914 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-11-19 05:57:17,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5008 conditions, 4180 events. 439/4180 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 32668 event pairs, 360 based on Foata normal form. 0/3604 useless extension candidates. Maximal degree in co-relation 4973. Up to 792 conditions per place. [2024-11-19 05:57:17,935 INFO L140 encePairwiseOnDemand]: 705/717 looper letters, 58 selfloop transitions, 10 changer transitions 0/632 dead transitions. [2024-11-19 05:57:17,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 632 places, 632 transitions, 1410 flow [2024-11-19 05:57:17,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:57:17,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:57:17,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3826 transitions. [2024-11-19 05:57:17,942 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8893537889353789 [2024-11-19 05:57:17,942 INFO L175 Difference]: Start difference. First operand has 629 places, 634 transitions, 1278 flow. Second operand 6 states and 3826 transitions. [2024-11-19 05:57:17,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 632 places, 632 transitions, 1410 flow [2024-11-19 05:57:17,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 630 places, 632 transitions, 1406 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:17,949 INFO L231 Difference]: Finished difference. Result has 630 places, 632 transitions, 1290 flow [2024-11-19 05:57:17,950 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1270, PETRI_DIFFERENCE_MINUEND_PLACES=625, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=632, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=622, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1290, PETRI_PLACES=630, PETRI_TRANSITIONS=632} [2024-11-19 05:57:17,951 INFO L277 CegarLoopForPetriNet]: 669 programPoint places, -39 predicate places. [2024-11-19 05:57:17,952 INFO L471 AbstractCegarLoop]: Abstraction has has 630 places, 632 transitions, 1290 flow [2024-11-19 05:57:17,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 627.5) internal successors, (3765), 6 states have internal predecessors, (3765), 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:17,954 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:17,954 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] [2024-11-19 05:57:17,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 05:57:17,954 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-19 05:57:17,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:17,955 INFO L85 PathProgramCache]: Analyzing trace with hash -540705592, now seen corresponding path program 1 times [2024-11-19 05:57:17,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:17,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83488627] [2024-11-19 05:57:17,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:17,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:17,995 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:17,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:17,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83488627] [2024-11-19 05:57:17,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83488627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:17,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:17,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:17,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541347301] [2024-11-19 05:57:17,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:17,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:17,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:17,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:17,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:18,018 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 681 out of 717 [2024-11-19 05:57:18,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 630 places, 632 transitions, 1290 flow. Second operand has 3 states, 3 states have (on average 682.3333333333334) internal successors, (2047), 3 states have internal predecessors, (2047), 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,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:18,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 681 of 717 [2024-11-19 05:57:18,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:18,189 INFO L124 PetriNetUnfolderBase]: 29/1079 cut-off events. [2024-11-19 05:57:18,189 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2024-11-19 05:57:18,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1127 conditions, 1079 events. 29/1079 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3344 event pairs, 8 based on Foata normal form. 0/941 useless extension candidates. Maximal degree in co-relation 1094. Up to 28 conditions per place. [2024-11-19 05:57:18,196 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 11 selfloop transitions, 2 changer transitions 0/631 dead transitions. [2024-11-19 05:57:18,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 631 places, 631 transitions, 1314 flow [2024-11-19 05:57:18,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:18,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:18,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2057 transitions. [2024-11-19 05:57:18,200 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9562993956299396 [2024-11-19 05:57:18,200 INFO L175 Difference]: Start difference. First operand has 630 places, 632 transitions, 1290 flow. Second operand 3 states and 2057 transitions. [2024-11-19 05:57:18,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 631 places, 631 transitions, 1314 flow [2024-11-19 05:57:18,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 626 places, 631 transitions, 1294 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:57:18,207 INFO L231 Difference]: Finished difference. Result has 626 places, 631 transitions, 1272 flow [2024-11-19 05:57:18,208 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1268, PETRI_DIFFERENCE_MINUEND_PLACES=624, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1272, PETRI_PLACES=626, PETRI_TRANSITIONS=631} [2024-11-19 05:57:18,209 INFO L277 CegarLoopForPetriNet]: 669 programPoint places, -43 predicate places. [2024-11-19 05:57:18,209 INFO L471 AbstractCegarLoop]: Abstraction has has 626 places, 631 transitions, 1272 flow [2024-11-19 05:57:18,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 682.3333333333334) internal successors, (2047), 3 states have internal predecessors, (2047), 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,210 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:18,210 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:57:18,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 05:57:18,210 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-19 05:57:18,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:18,211 INFO L85 PathProgramCache]: Analyzing trace with hash -810752413, now seen corresponding path program 1 times [2024-11-19 05:57:18,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:18,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129065870] [2024-11-19 05:57:18,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:18,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:18,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:18,328 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,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:18,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129065870] [2024-11-19 05:57:18,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129065870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:18,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:18,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:18,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616986709] [2024-11-19 05:57:18,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:18,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:18,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:18,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:18,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:18,484 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 717 [2024-11-19 05:57:18,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 626 places, 631 transitions, 1272 flow. Second operand has 3 states, 3 states have (on average 628.0) internal successors, (1884), 3 states have internal predecessors, (1884), 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,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:18,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 717 [2024-11-19 05:57:18,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:19,003 INFO L124 PetriNetUnfolderBase]: 439/4177 cut-off events. [2024-11-19 05:57:19,003 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-11-19 05:57:19,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5005 conditions, 4177 events. 439/4177 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 32626 event pairs, 360 based on Foata normal form. 0/3604 useless extension candidates. Maximal degree in co-relation 4970. Up to 798 conditions per place. [2024-11-19 05:57:19,023 INFO L140 encePairwiseOnDemand]: 711/717 looper letters, 64 selfloop transitions, 4 changer transitions 0/629 dead transitions. [2024-11-19 05:57:19,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 626 places, 629 transitions, 1404 flow [2024-11-19 05:57:19,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:19,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:19,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1948 transitions. [2024-11-19 05:57:19,027 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.905625290562529 [2024-11-19 05:57:19,027 INFO L175 Difference]: Start difference. First operand has 626 places, 631 transitions, 1272 flow. Second operand 3 states and 1948 transitions. [2024-11-19 05:57:19,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 626 places, 629 transitions, 1404 flow [2024-11-19 05:57:19,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 624 places, 629 transitions, 1400 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:19,036 INFO L231 Difference]: Finished difference. Result has 624 places, 629 transitions, 1272 flow [2024-11-19 05:57:19,037 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1264, PETRI_DIFFERENCE_MINUEND_PLACES=622, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=629, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=625, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1272, PETRI_PLACES=624, PETRI_TRANSITIONS=629} [2024-11-19 05:57:19,037 INFO L277 CegarLoopForPetriNet]: 669 programPoint places, -45 predicate places. [2024-11-19 05:57:19,038 INFO L471 AbstractCegarLoop]: Abstraction has has 624 places, 629 transitions, 1272 flow [2024-11-19 05:57:19,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 628.0) internal successors, (1884), 3 states have internal predecessors, (1884), 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:19,039 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:19,039 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:57:19,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 05:57:19,039 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-19 05:57:19,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:19,040 INFO L85 PathProgramCache]: Analyzing trace with hash 16048852, now seen corresponding path program 1 times [2024-11-19 05:57:19,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:19,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648906074] [2024-11-19 05:57:19,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:19,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:19,101 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:19,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:19,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648906074] [2024-11-19 05:57:19,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648906074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:19,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:19,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:19,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370875801] [2024-11-19 05:57:19,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:19,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:19,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:19,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:19,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:19,119 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 683 out of 717 [2024-11-19 05:57:19,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 624 places, 629 transitions, 1272 flow. Second operand has 3 states, 3 states have (on average 684.3333333333334) internal successors, (2053), 3 states have internal predecessors, (2053), 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:19,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:19,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 683 of 717 [2024-11-19 05:57:19,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:19,228 INFO L124 PetriNetUnfolderBase]: 18/780 cut-off events. [2024-11-19 05:57:19,228 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-11-19 05:57:19,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 809 conditions, 780 events. 18/780 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1747 event pairs, 3 based on Foata normal form. 0/696 useless extension candidates. Maximal degree in co-relation 788. Up to 16 conditions per place. [2024-11-19 05:57:19,235 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 9 selfloop transitions, 2 changer transitions 0/628 dead transitions. [2024-11-19 05:57:19,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 625 places, 628 transitions, 1292 flow [2024-11-19 05:57:19,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:19,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:19,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2061 transitions. [2024-11-19 05:57:19,239 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9581589958158996 [2024-11-19 05:57:19,239 INFO L175 Difference]: Start difference. First operand has 624 places, 629 transitions, 1272 flow. Second operand 3 states and 2061 transitions. [2024-11-19 05:57:19,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 625 places, 628 transitions, 1292 flow [2024-11-19 05:57:19,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 623 places, 628 transitions, 1284 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:19,248 INFO L231 Difference]: Finished difference. Result has 623 places, 628 transitions, 1266 flow [2024-11-19 05:57:19,250 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1262, PETRI_DIFFERENCE_MINUEND_PLACES=621, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=626, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1266, PETRI_PLACES=623, PETRI_TRANSITIONS=628} [2024-11-19 05:57:19,251 INFO L277 CegarLoopForPetriNet]: 669 programPoint places, -46 predicate places. [2024-11-19 05:57:19,251 INFO L471 AbstractCegarLoop]: Abstraction has has 623 places, 628 transitions, 1266 flow [2024-11-19 05:57:19,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 684.3333333333334) internal successors, (2053), 3 states have internal predecessors, (2053), 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:19,257 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:19,257 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, 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:19,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 05:57:19,257 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-19 05:57:19,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:19,258 INFO L85 PathProgramCache]: Analyzing trace with hash -846056421, now seen corresponding path program 1 times [2024-11-19 05:57:19,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:19,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633319586] [2024-11-19 05:57:19,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:19,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:19,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:19,329 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:19,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:19,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633319586] [2024-11-19 05:57:19,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633319586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:19,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:19,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:19,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675595785] [2024-11-19 05:57:19,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:19,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:19,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:19,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:19,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:19,347 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 683 out of 717 [2024-11-19 05:57:19,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 623 places, 628 transitions, 1266 flow. Second operand has 3 states, 3 states have (on average 684.3333333333334) internal successors, (2053), 3 states have internal predecessors, (2053), 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:19,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:19,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 683 of 717 [2024-11-19 05:57:19,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:19,468 INFO L124 PetriNetUnfolderBase]: 21/884 cut-off events. [2024-11-19 05:57:19,468 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-19 05:57:19,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 911 conditions, 884 events. 21/884 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2029 event pairs, 3 based on Foata normal form. 0/782 useless extension candidates. Maximal degree in co-relation 875. Up to 16 conditions per place. [2024-11-19 05:57:19,475 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 9 selfloop transitions, 2 changer transitions 0/627 dead transitions. [2024-11-19 05:57:19,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 627 transitions, 1286 flow [2024-11-19 05:57:19,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:19,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:19,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2061 transitions. [2024-11-19 05:57:19,480 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9581589958158996 [2024-11-19 05:57:19,480 INFO L175 Difference]: Start difference. First operand has 623 places, 628 transitions, 1266 flow. Second operand 3 states and 2061 transitions. [2024-11-19 05:57:19,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 624 places, 627 transitions, 1286 flow [2024-11-19 05:57:19,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 622 places, 627 transitions, 1282 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:19,489 INFO L231 Difference]: Finished difference. Result has 622 places, 627 transitions, 1264 flow [2024-11-19 05:57:19,490 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1260, PETRI_DIFFERENCE_MINUEND_PLACES=620, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=625, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1264, PETRI_PLACES=622, PETRI_TRANSITIONS=627} [2024-11-19 05:57:19,490 INFO L277 CegarLoopForPetriNet]: 669 programPoint places, -47 predicate places. [2024-11-19 05:57:19,491 INFO L471 AbstractCegarLoop]: Abstraction has has 622 places, 627 transitions, 1264 flow [2024-11-19 05:57:19,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 684.3333333333334) internal successors, (2053), 3 states have internal predecessors, (2053), 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:19,492 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:19,492 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, 1, 1, 1, 1, 1, 1, 1, 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:19,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 05:57:19,492 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-19 05:57:19,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:19,493 INFO L85 PathProgramCache]: Analyzing trace with hash -99937825, now seen corresponding path program 1 times [2024-11-19 05:57:19,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:19,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668969589] [2024-11-19 05:57:19,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:19,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:19,554 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:19,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:19,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668969589] [2024-11-19 05:57:19,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668969589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:19,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:19,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:19,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827976934] [2024-11-19 05:57:19,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:19,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:19,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:19,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:19,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:19,572 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 679 out of 717 [2024-11-19 05:57:19,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 622 places, 627 transitions, 1264 flow. Second operand has 3 states, 3 states have (on average 680.3333333333334) internal successors, (2041), 3 states have internal predecessors, (2041), 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:19,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:19,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 679 of 717 [2024-11-19 05:57:19,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:19,825 INFO L124 PetriNetUnfolderBase]: 57/1622 cut-off events. [2024-11-19 05:57:19,825 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-19 05:57:19,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1699 conditions, 1622 events. 57/1622 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7666 event pairs, 19 based on Foata normal form. 0/1420 useless extension candidates. Maximal degree in co-relation 1664. Up to 61 conditions per place. [2024-11-19 05:57:19,832 INFO L140 encePairwiseOnDemand]: 711/717 looper letters, 14 selfloop transitions, 2 changer transitions 0/626 dead transitions. [2024-11-19 05:57:19,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 620 places, 626 transitions, 1295 flow [2024-11-19 05:57:19,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:19,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:19,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2057 transitions. [2024-11-19 05:57:19,836 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9562993956299396 [2024-11-19 05:57:19,836 INFO L175 Difference]: Start difference. First operand has 622 places, 627 transitions, 1264 flow. Second operand 3 states and 2057 transitions. [2024-11-19 05:57:19,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 620 places, 626 transitions, 1295 flow [2024-11-19 05:57:19,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 618 places, 626 transitions, 1291 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:19,846 INFO L231 Difference]: Finished difference. Result has 619 places, 625 transitions, 1266 flow [2024-11-19 05:57:19,846 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1252, PETRI_DIFFERENCE_MINUEND_PLACES=616, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=623, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=621, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1266, PETRI_PLACES=619, PETRI_TRANSITIONS=625} [2024-11-19 05:57:19,847 INFO L277 CegarLoopForPetriNet]: 669 programPoint places, -50 predicate places. [2024-11-19 05:57:19,847 INFO L471 AbstractCegarLoop]: Abstraction has has 619 places, 625 transitions, 1266 flow [2024-11-19 05:57:19,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 680.3333333333334) internal successors, (2041), 3 states have internal predecessors, (2041), 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:19,847 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:19,848 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 05:57:19,848 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-19 05:57:19,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:19,848 INFO L85 PathProgramCache]: Analyzing trace with hash -541474882, now seen corresponding path program 1 times [2024-11-19 05:57:19,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:19,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179920271] [2024-11-19 05:57:19,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:19,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:19,898 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:19,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:19,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179920271] [2024-11-19 05:57:19,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179920271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:19,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:19,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:19,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354034327] [2024-11-19 05:57:19,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:19,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:19,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:19,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:19,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:19,913 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 679 out of 717 [2024-11-19 05:57:19,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 619 places, 625 transitions, 1266 flow. Second operand has 3 states, 3 states have (on average 680.6666666666666) internal successors, (2042), 3 states have internal predecessors, (2042), 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:19,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:19,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 679 of 717 [2024-11-19 05:57:19,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:20,085 INFO L124 PetriNetUnfolderBase]: 57/1633 cut-off events. [2024-11-19 05:57:20,085 INFO L125 PetriNetUnfolderBase]: For 8/12 co-relation queries the response was YES. [2024-11-19 05:57:20,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1716 conditions, 1633 events. 57/1633 cut-off events. For 8/12 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 7896 event pairs, 15 based on Foata normal form. 0/1448 useless extension candidates. Maximal degree in co-relation 1681. Up to 62 conditions per place. [2024-11-19 05:57:20,095 INFO L140 encePairwiseOnDemand]: 711/717 looper letters, 14 selfloop transitions, 2 changer transitions 0/624 dead transitions. [2024-11-19 05:57:20,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 617 places, 624 transitions, 1297 flow [2024-11-19 05:57:20,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:20,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:20,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2057 transitions. [2024-11-19 05:57:20,098 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9562993956299396 [2024-11-19 05:57:20,098 INFO L175 Difference]: Start difference. First operand has 619 places, 625 transitions, 1266 flow. Second operand 3 states and 2057 transitions. [2024-11-19 05:57:20,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 617 places, 624 transitions, 1297 flow [2024-11-19 05:57:20,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 617 places, 624 transitions, 1297 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:57:20,108 INFO L231 Difference]: Finished difference. Result has 618 places, 623 transitions, 1272 flow [2024-11-19 05:57:20,109 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1258, PETRI_DIFFERENCE_MINUEND_PLACES=615, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=621, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=619, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1272, PETRI_PLACES=618, PETRI_TRANSITIONS=623} [2024-11-19 05:57:20,110 INFO L277 CegarLoopForPetriNet]: 669 programPoint places, -51 predicate places. [2024-11-19 05:57:20,110 INFO L471 AbstractCegarLoop]: Abstraction has has 618 places, 623 transitions, 1272 flow [2024-11-19 05:57:20,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 680.6666666666666) internal successors, (2042), 3 states have internal predecessors, (2042), 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,110 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:20,111 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 05:57:20,111 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-19 05:57:20,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:20,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1470427909, now seen corresponding path program 1 times [2024-11-19 05:57:20,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:20,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155619369] [2024-11-19 05:57:20,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:20,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:20,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:20,262 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,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:20,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155619369] [2024-11-19 05:57:20,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155619369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:20,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:20,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 05:57:20,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804223926] [2024-11-19 05:57:20,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:20,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 05:57:20,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:20,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 05:57:20,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 05:57:20,558 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 665 out of 717 [2024-11-19 05:57:20,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 618 places, 623 transitions, 1272 flow. Second operand has 7 states, 7 states have (on average 668.2857142857143) internal successors, (4678), 7 states have internal predecessors, (4678), 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,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:20,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 665 of 717 [2024-11-19 05:57:20,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:20,858 INFO L124 PetriNetUnfolderBase]: 38/1636 cut-off events. [2024-11-19 05:57:20,858 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2024-11-19 05:57:20,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1726 conditions, 1636 events. 38/1636 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7765 event pairs, 0 based on Foata normal form. 1/1472 useless extension candidates. Maximal degree in co-relation 1687. Up to 29 conditions per place. [2024-11-19 05:57:20,871 INFO L140 encePairwiseOnDemand]: 707/717 looper letters, 45 selfloop transitions, 9 changer transitions 0/647 dead transitions. [2024-11-19 05:57:20,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 647 transitions, 1432 flow [2024-11-19 05:57:20,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 05:57:20,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 05:57:20,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 4710 transitions. [2024-11-19 05:57:20,878 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9384339509862523 [2024-11-19 05:57:20,878 INFO L175 Difference]: Start difference. First operand has 618 places, 623 transitions, 1272 flow. Second operand 7 states and 4710 transitions. [2024-11-19 05:57:20,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 624 places, 647 transitions, 1432 flow [2024-11-19 05:57:20,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 624 places, 647 transitions, 1432 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:57:20,886 INFO L231 Difference]: Finished difference. Result has 628 places, 629 transitions, 1329 flow [2024-11-19 05:57:20,886 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1272, PETRI_DIFFERENCE_MINUEND_PLACES=618, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=623, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=614, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1329, PETRI_PLACES=628, PETRI_TRANSITIONS=629} [2024-11-19 05:57:20,887 INFO L277 CegarLoopForPetriNet]: 669 programPoint places, -41 predicate places. [2024-11-19 05:57:20,887 INFO L471 AbstractCegarLoop]: Abstraction has has 628 places, 629 transitions, 1329 flow [2024-11-19 05:57:20,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 668.2857142857143) internal successors, (4678), 7 states have internal predecessors, (4678), 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,888 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:20,888 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 05:57:20,888 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-19 05:57:20,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:20,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1514169382, now seen corresponding path program 1 times [2024-11-19 05:57:20,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:20,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766691326] [2024-11-19 05:57:20,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:20,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:21,420 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,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:21,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766691326] [2024-11-19 05:57:21,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766691326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:21,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:21,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:57:21,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834431200] [2024-11-19 05:57:21,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:21,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:57:21,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:21,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:57:21,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:57:21,813 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 717 [2024-11-19 05:57:21,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 628 places, 629 transitions, 1329 flow. Second operand has 6 states, 6 states have (on average 655.6666666666666) internal successors, (3934), 6 states have internal predecessors, (3934), 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,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:21,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 717 [2024-11-19 05:57:21,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:22,462 INFO L124 PetriNetUnfolderBase]: 350/4930 cut-off events. [2024-11-19 05:57:22,462 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-11-19 05:57:22,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5626 conditions, 4930 events. 350/4930 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 40397 event pairs, 140 based on Foata normal form. 0/4372 useless extension candidates. Maximal degree in co-relation 5582. Up to 508 conditions per place. [2024-11-19 05:57:22,494 INFO L140 encePairwiseOnDemand]: 705/717 looper letters, 54 selfloop transitions, 8 changer transitions 0/649 dead transitions. [2024-11-19 05:57:22,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 629 places, 649 transitions, 1497 flow [2024-11-19 05:57:22,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:57:22,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:57:22,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3990 transitions. [2024-11-19 05:57:22,499 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9274755927475593 [2024-11-19 05:57:22,499 INFO L175 Difference]: Start difference. First operand has 628 places, 629 transitions, 1329 flow. Second operand 6 states and 3990 transitions. [2024-11-19 05:57:22,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 629 places, 649 transitions, 1497 flow [2024-11-19 05:57:22,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 627 places, 649 transitions, 1492 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:22,508 INFO L231 Difference]: Finished difference. Result has 631 places, 633 transitions, 1378 flow [2024-11-19 05:57:22,508 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1316, PETRI_DIFFERENCE_MINUEND_PLACES=622, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=617, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1378, PETRI_PLACES=631, PETRI_TRANSITIONS=633} [2024-11-19 05:57:22,509 INFO L277 CegarLoopForPetriNet]: 669 programPoint places, -38 predicate places. [2024-11-19 05:57:22,509 INFO L471 AbstractCegarLoop]: Abstraction has has 631 places, 633 transitions, 1378 flow [2024-11-19 05:57:22,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 655.6666666666666) internal successors, (3934), 6 states have internal predecessors, (3934), 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,510 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:22,510 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 05:57:22,510 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-19 05:57:22,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:22,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1165139869, now seen corresponding path program 1 times [2024-11-19 05:57:22,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:22,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81931057] [2024-11-19 05:57:22,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:22,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:22,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:22,565 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,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:22,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81931057] [2024-11-19 05:57:22,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81931057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:22,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:22,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:22,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711264558] [2024-11-19 05:57:22,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:22,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:22,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:22,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:22,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:22,597 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 717 [2024-11-19 05:57:22,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 631 places, 633 transitions, 1378 flow. Second operand has 3 states, 3 states have (on average 685.6666666666666) internal successors, (2057), 3 states have internal predecessors, (2057), 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,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:22,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 717 [2024-11-19 05:57:22,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:22,932 INFO L124 PetriNetUnfolderBase]: 94/3082 cut-off events. [2024-11-19 05:57:22,932 INFO L125 PetriNetUnfolderBase]: For 21/39 co-relation queries the response was YES. [2024-11-19 05:57:22,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3315 conditions, 3082 events. 94/3082 cut-off events. For 21/39 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 22973 event pairs, 8 based on Foata normal form. 2/2734 useless extension candidates. Maximal degree in co-relation 3271. Up to 40 conditions per place. [2024-11-19 05:57:22,955 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 10 selfloop transitions, 2 changer transitions 0/633 dead transitions. [2024-11-19 05:57:22,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 632 places, 633 transitions, 1403 flow [2024-11-19 05:57:22,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:22,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:22,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2065 transitions. [2024-11-19 05:57:22,958 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9600185960018596 [2024-11-19 05:57:22,958 INFO L175 Difference]: Start difference. First operand has 631 places, 633 transitions, 1378 flow. Second operand 3 states and 2065 transitions. [2024-11-19 05:57:22,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 632 places, 633 transitions, 1403 flow [2024-11-19 05:57:22,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 632 places, 633 transitions, 1403 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:57:22,967 INFO L231 Difference]: Finished difference. Result has 632 places, 632 transitions, 1380 flow [2024-11-19 05:57:22,968 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1376, PETRI_DIFFERENCE_MINUEND_PLACES=630, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=632, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1380, PETRI_PLACES=632, PETRI_TRANSITIONS=632} [2024-11-19 05:57:22,969 INFO L277 CegarLoopForPetriNet]: 669 programPoint places, -37 predicate places. [2024-11-19 05:57:22,969 INFO L471 AbstractCegarLoop]: Abstraction has has 632 places, 632 transitions, 1380 flow [2024-11-19 05:57:22,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 685.6666666666666) internal successors, (2057), 3 states have internal predecessors, (2057), 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,970 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:22,970 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 05:57:22,970 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-19 05:57:22,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:22,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1007295623, now seen corresponding path program 1 times [2024-11-19 05:57:22,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:22,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266645857] [2024-11-19 05:57:22,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:22,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:23,468 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:23,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:23,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266645857] [2024-11-19 05:57:23,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266645857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:23,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:23,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:57:23,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820110372] [2024-11-19 05:57:23,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:23,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:57:23,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:23,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:57:23,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:57:23,891 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 717 [2024-11-19 05:57:23,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 632 places, 632 transitions, 1380 flow. Second operand has 6 states, 6 states have (on average 655.8333333333334) internal successors, (3935), 6 states have internal predecessors, (3935), 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:23,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:23,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 717 [2024-11-19 05:57:23,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:24,867 INFO L124 PetriNetUnfolderBase]: 368/5642 cut-off events. [2024-11-19 05:57:24,867 INFO L125 PetriNetUnfolderBase]: For 51/77 co-relation queries the response was YES. [2024-11-19 05:57:24,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6468 conditions, 5642 events. 368/5642 cut-off events. For 51/77 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 49395 event pairs, 132 based on Foata normal form. 0/5054 useless extension candidates. Maximal degree in co-relation 6421. Up to 540 conditions per place. [2024-11-19 05:57:24,913 INFO L140 encePairwiseOnDemand]: 705/717 looper letters, 54 selfloop transitions, 8 changer transitions 0/652 dead transitions. [2024-11-19 05:57:24,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 652 transitions, 1548 flow [2024-11-19 05:57:24,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:57:24,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:57:24,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3990 transitions. [2024-11-19 05:57:24,919 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9274755927475593 [2024-11-19 05:57:24,920 INFO L175 Difference]: Start difference. First operand has 632 places, 632 transitions, 1380 flow. Second operand 6 states and 3990 transitions. [2024-11-19 05:57:24,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 633 places, 652 transitions, 1548 flow [2024-11-19 05:57:24,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 631 places, 652 transitions, 1544 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:24,930 INFO L231 Difference]: Finished difference. Result has 635 places, 636 transitions, 1430 flow [2024-11-19 05:57:24,931 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1368, PETRI_DIFFERENCE_MINUEND_PLACES=626, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=620, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1430, PETRI_PLACES=635, PETRI_TRANSITIONS=636} [2024-11-19 05:57:24,931 INFO L277 CegarLoopForPetriNet]: 669 programPoint places, -34 predicate places. [2024-11-19 05:57:24,931 INFO L471 AbstractCegarLoop]: Abstraction has has 635 places, 636 transitions, 1430 flow [2024-11-19 05:57:24,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 655.8333333333334) internal successors, (3935), 6 states have internal predecessors, (3935), 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:24,932 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:24,932 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 05:57:24,933 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-19 05:57:24,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:24,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1245044220, now seen corresponding path program 1 times [2024-11-19 05:57:24,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:24,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636700509] [2024-11-19 05:57:24,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:24,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:24,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:24,994 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:24,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:24,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636700509] [2024-11-19 05:57:24,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636700509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:24,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:24,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:24,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130741125] [2024-11-19 05:57:24,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:24,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:24,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:24,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:24,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:25,020 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 717 [2024-11-19 05:57:25,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 636 transitions, 1430 flow. Second operand has 3 states, 3 states have (on average 686.0) internal successors, (2058), 3 states have internal predecessors, (2058), 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,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:25,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 717 [2024-11-19 05:57:25,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:25,573 INFO L124 PetriNetUnfolderBase]: 120/3688 cut-off events. [2024-11-19 05:57:25,574 INFO L125 PetriNetUnfolderBase]: For 51/65 co-relation queries the response was YES. [2024-11-19 05:57:25,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4017 conditions, 3688 events. 120/3688 cut-off events. For 51/65 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 28967 event pairs, 8 based on Foata normal form. 0/3274 useless extension candidates. Maximal degree in co-relation 3969. Up to 64 conditions per place. [2024-11-19 05:57:25,601 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 10 selfloop transitions, 2 changer transitions 0/636 dead transitions. [2024-11-19 05:57:25,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 636 transitions, 1455 flow [2024-11-19 05:57:25,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:25,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:25,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2065 transitions. [2024-11-19 05:57:25,607 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9600185960018596 [2024-11-19 05:57:25,607 INFO L175 Difference]: Start difference. First operand has 635 places, 636 transitions, 1430 flow. Second operand 3 states and 2065 transitions. [2024-11-19 05:57:25,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 636 transitions, 1455 flow [2024-11-19 05:57:25,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 636 places, 636 transitions, 1455 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:57:25,621 INFO L231 Difference]: Finished difference. Result has 636 places, 635 transitions, 1432 flow [2024-11-19 05:57:25,622 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1428, PETRI_DIFFERENCE_MINUEND_PLACES=634, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=633, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1432, PETRI_PLACES=636, PETRI_TRANSITIONS=635} [2024-11-19 05:57:25,622 INFO L277 CegarLoopForPetriNet]: 669 programPoint places, -33 predicate places. [2024-11-19 05:57:25,622 INFO L471 AbstractCegarLoop]: Abstraction has has 636 places, 635 transitions, 1432 flow [2024-11-19 05:57:25,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.0) internal successors, (2058), 3 states have internal predecessors, (2058), 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,623 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:25,623 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 05:57:25,624 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-19 05:57:25,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:25,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1353609207, now seen corresponding path program 1 times [2024-11-19 05:57:25,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:25,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409429242] [2024-11-19 05:57:25,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:25,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:25,675 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,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:25,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409429242] [2024-11-19 05:57:25,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409429242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:25,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:25,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:25,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159049840] [2024-11-19 05:57:25,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:25,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:25,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:25,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:25,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:25,691 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 717 [2024-11-19 05:57:25,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 636 places, 635 transitions, 1432 flow. Second operand has 3 states, 3 states have (on average 685.6666666666666) internal successors, (2057), 3 states have internal predecessors, (2057), 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,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:25,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 717 [2024-11-19 05:57:25,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:26,171 INFO L124 PetriNetUnfolderBase]: 122/3650 cut-off events. [2024-11-19 05:57:26,171 INFO L125 PetriNetUnfolderBase]: For 37/49 co-relation queries the response was YES. [2024-11-19 05:57:26,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4028 conditions, 3650 events. 122/3650 cut-off events. For 37/49 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 30160 event pairs, 8 based on Foata normal form. 0/3258 useless extension candidates. Maximal degree in co-relation 3979. Up to 84 conditions per place. [2024-11-19 05:57:26,197 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 10 selfloop transitions, 2 changer transitions 0/635 dead transitions. [2024-11-19 05:57:26,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 637 places, 635 transitions, 1457 flow [2024-11-19 05:57:26,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:26,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:26,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2065 transitions. [2024-11-19 05:57:26,201 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9600185960018596 [2024-11-19 05:57:26,202 INFO L175 Difference]: Start difference. First operand has 636 places, 635 transitions, 1432 flow. Second operand 3 states and 2065 transitions. [2024-11-19 05:57:26,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 637 places, 635 transitions, 1457 flow [2024-11-19 05:57:26,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 635 places, 635 transitions, 1453 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:26,209 INFO L231 Difference]: Finished difference. Result has 635 places, 634 transitions, 1430 flow [2024-11-19 05:57:26,210 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1426, PETRI_DIFFERENCE_MINUEND_PLACES=633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=634, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=632, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1430, PETRI_PLACES=635, PETRI_TRANSITIONS=634} [2024-11-19 05:57:26,210 INFO L277 CegarLoopForPetriNet]: 669 programPoint places, -34 predicate places. [2024-11-19 05:57:26,211 INFO L471 AbstractCegarLoop]: Abstraction has has 635 places, 634 transitions, 1430 flow [2024-11-19 05:57:26,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 685.6666666666666) internal successors, (2057), 3 states have internal predecessors, (2057), 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:26,211 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:26,211 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 05:57:26,211 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-19 05:57:26,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:26,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1886608756, now seen corresponding path program 1 times [2024-11-19 05:57:26,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:26,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448378658] [2024-11-19 05:57:26,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:26,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:26,261 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:26,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:26,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448378658] [2024-11-19 05:57:26,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448378658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:26,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:26,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:26,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384760442] [2024-11-19 05:57:26,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:26,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:26,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:26,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:26,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:26,272 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 685 out of 717 [2024-11-19 05:57:26,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 634 transitions, 1430 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 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:26,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:26,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 685 of 717 [2024-11-19 05:57:26,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:26,934 INFO L124 PetriNetUnfolderBase]: 156/5304 cut-off events. [2024-11-19 05:57:26,935 INFO L125 PetriNetUnfolderBase]: For 43/55 co-relation queries the response was YES. [2024-11-19 05:57:26,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5679 conditions, 5304 events. 156/5304 cut-off events. For 43/55 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 48800 event pairs, 8 based on Foata normal form. 0/4740 useless extension candidates. Maximal degree in co-relation 5630. Up to 96 conditions per place. [2024-11-19 05:57:26,977 INFO L140 encePairwiseOnDemand]: 713/717 looper letters, 10 selfloop transitions, 2 changer transitions 0/635 dead transitions. [2024-11-19 05:57:26,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 635 places, 635 transitions, 1457 flow [2024-11-19 05:57:26,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:26,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:26,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2069 transitions. [2024-11-19 05:57:26,980 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9618781961878197 [2024-11-19 05:57:26,980 INFO L175 Difference]: Start difference. First operand has 635 places, 634 transitions, 1430 flow. Second operand 3 states and 2069 transitions. [2024-11-19 05:57:26,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 635 places, 635 transitions, 1457 flow [2024-11-19 05:57:26,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 635 transitions, 1453 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:26,988 INFO L231 Difference]: Finished difference. Result has 634 places, 634 transitions, 1436 flow [2024-11-19 05:57:26,989 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1422, PETRI_DIFFERENCE_MINUEND_PLACES=631, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=632, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1436, PETRI_PLACES=634, PETRI_TRANSITIONS=634} [2024-11-19 05:57:26,989 INFO L277 CegarLoopForPetriNet]: 669 programPoint places, -35 predicate places. [2024-11-19 05:57:26,989 INFO L471 AbstractCegarLoop]: Abstraction has has 634 places, 634 transitions, 1436 flow [2024-11-19 05:57:26,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 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:26,990 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:26,990 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 05:57:26,990 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-19 05:57:26,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:26,990 INFO L85 PathProgramCache]: Analyzing trace with hash -492115608, now seen corresponding path program 1 times [2024-11-19 05:57:26,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:26,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135467569] [2024-11-19 05:57:26,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:26,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:27,041 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,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:27,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135467569] [2024-11-19 05:57:27,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135467569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:27,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:27,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:27,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791892448] [2024-11-19 05:57:27,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:27,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:27,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:27,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:27,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:27,056 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 717 [2024-11-19 05:57:27,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 634 places, 634 transitions, 1436 flow. Second operand has 3 states, 3 states have (on average 686.0) internal successors, (2058), 3 states have internal predecessors, (2058), 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,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:27,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 717 [2024-11-19 05:57:27,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:27,614 INFO L124 PetriNetUnfolderBase]: 142/4748 cut-off events. [2024-11-19 05:57:27,614 INFO L125 PetriNetUnfolderBase]: For 55/69 co-relation queries the response was YES. [2024-11-19 05:57:27,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5194 conditions, 4748 events. 142/4748 cut-off events. For 55/69 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 42481 event pairs, 8 based on Foata normal form. 0/4258 useless extension candidates. Maximal degree in co-relation 5145. Up to 116 conditions per place. [2024-11-19 05:57:27,644 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 10 selfloop transitions, 2 changer transitions 0/634 dead transitions. [2024-11-19 05:57:27,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 635 places, 634 transitions, 1461 flow [2024-11-19 05:57:27,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:27,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:27,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2065 transitions. [2024-11-19 05:57:27,647 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9600185960018596 [2024-11-19 05:57:27,648 INFO L175 Difference]: Start difference. First operand has 634 places, 634 transitions, 1436 flow. Second operand 3 states and 2065 transitions. [2024-11-19 05:57:27,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 635 places, 634 transitions, 1461 flow [2024-11-19 05:57:27,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 635 places, 634 transitions, 1461 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:57:27,656 INFO L231 Difference]: Finished difference. Result has 635 places, 633 transitions, 1438 flow [2024-11-19 05:57:27,657 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1434, PETRI_DIFFERENCE_MINUEND_PLACES=633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=631, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1438, PETRI_PLACES=635, PETRI_TRANSITIONS=633} [2024-11-19 05:57:27,658 INFO L277 CegarLoopForPetriNet]: 669 programPoint places, -34 predicate places. [2024-11-19 05:57:27,658 INFO L471 AbstractCegarLoop]: Abstraction has has 635 places, 633 transitions, 1438 flow [2024-11-19 05:57:27,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.0) internal successors, (2058), 3 states have internal predecessors, (2058), 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,658 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:27,658 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 05:57:27,659 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-19 05:57:27,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:27,660 INFO L85 PathProgramCache]: Analyzing trace with hash 96207784, now seen corresponding path program 1 times [2024-11-19 05:57:27,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:27,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372490558] [2024-11-19 05:57:27,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:27,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:27,767 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,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:27,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372490558] [2024-11-19 05:57:27,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372490558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:27,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:27,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:27,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640690221] [2024-11-19 05:57:27,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:27,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:27,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:27,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:27,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:27,894 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 672 out of 717 [2024-11-19 05:57:27,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 633 transitions, 1438 flow. Second operand has 3 states, 3 states have (on average 674.3333333333334) internal successors, (2023), 3 states have internal predecessors, (2023), 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,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:27,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 672 of 717 [2024-11-19 05:57:27,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:28,594 INFO L124 PetriNetUnfolderBase]: 162/5386 cut-off events. [2024-11-19 05:57:28,595 INFO L125 PetriNetUnfolderBase]: For 43/55 co-relation queries the response was YES. [2024-11-19 05:57:28,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5845 conditions, 5386 events. 162/5386 cut-off events. For 43/55 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 48938 event pairs, 8 based on Foata normal form. 0/4848 useless extension candidates. Maximal degree in co-relation 5792. Up to 100 conditions per place. [2024-11-19 05:57:28,639 INFO L140 encePairwiseOnDemand]: 713/717 looper letters, 23 selfloop transitions, 2 changer transitions 0/634 dead transitions. [2024-11-19 05:57:28,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 635 places, 634 transitions, 1491 flow [2024-11-19 05:57:28,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:28,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:28,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2043 transitions. [2024-11-19 05:57:28,642 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9497907949790795 [2024-11-19 05:57:28,642 INFO L175 Difference]: Start difference. First operand has 635 places, 633 transitions, 1438 flow. Second operand 3 states and 2043 transitions. [2024-11-19 05:57:28,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 635 places, 634 transitions, 1491 flow [2024-11-19 05:57:28,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 634 transitions, 1487 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:28,650 INFO L231 Difference]: Finished difference. Result has 634 places, 633 transitions, 1444 flow [2024-11-19 05:57:28,650 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1430, PETRI_DIFFERENCE_MINUEND_PLACES=631, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1444, PETRI_PLACES=634, PETRI_TRANSITIONS=633} [2024-11-19 05:57:28,651 INFO L277 CegarLoopForPetriNet]: 669 programPoint places, -35 predicate places. [2024-11-19 05:57:28,651 INFO L471 AbstractCegarLoop]: Abstraction has has 634 places, 633 transitions, 1444 flow [2024-11-19 05:57:28,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 674.3333333333334) internal successors, (2023), 3 states have internal predecessors, (2023), 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,652 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:28,652 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-19 05:57:28,652 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-19 05:57:28,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:28,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1511264939, now seen corresponding path program 1 times [2024-11-19 05:57:28,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:28,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116399971] [2024-11-19 05:57:28,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:28,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:28,700 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,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:28,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116399971] [2024-11-19 05:57:28,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116399971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:28,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:28,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:28,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062206401] [2024-11-19 05:57:28,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:28,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:28,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:28,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:28,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:28,710 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 685 out of 717 [2024-11-19 05:57:28,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 634 places, 633 transitions, 1444 flow. Second operand has 3 states, 3 states have (on average 686.6666666666666) internal successors, (2060), 3 states have internal predecessors, (2060), 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,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:28,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 685 of 717 [2024-11-19 05:57:28,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:29,519 INFO L124 PetriNetUnfolderBase]: 184/6558 cut-off events. [2024-11-19 05:57:29,520 INFO L125 PetriNetUnfolderBase]: For 59/73 co-relation queries the response was YES. [2024-11-19 05:57:29,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7042 conditions, 6558 events. 184/6558 cut-off events. For 59/73 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 65601 event pairs, 4 based on Foata normal form. 0/5918 useless extension candidates. Maximal degree in co-relation 6992. Up to 100 conditions per place. [2024-11-19 05:57:29,570 INFO L140 encePairwiseOnDemand]: 713/717 looper letters, 11 selfloop transitions, 2 changer transitions 0/635 dead transitions. [2024-11-19 05:57:29,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 634 places, 635 transitions, 1476 flow [2024-11-19 05:57:29,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:29,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:29,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2070 transitions. [2024-11-19 05:57:29,572 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9623430962343096 [2024-11-19 05:57:29,572 INFO L175 Difference]: Start difference. First operand has 634 places, 633 transitions, 1444 flow. Second operand 3 states and 2070 transitions. [2024-11-19 05:57:29,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 634 places, 635 transitions, 1476 flow [2024-11-19 05:57:29,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 634 places, 635 transitions, 1476 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:57:29,579 INFO L231 Difference]: Finished difference. Result has 635 places, 633 transitions, 1454 flow [2024-11-19 05:57:29,579 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1440, PETRI_DIFFERENCE_MINUEND_PLACES=632, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1454, PETRI_PLACES=635, PETRI_TRANSITIONS=633} [2024-11-19 05:57:29,580 INFO L277 CegarLoopForPetriNet]: 669 programPoint places, -34 predicate places. [2024-11-19 05:57:29,580 INFO L471 AbstractCegarLoop]: Abstraction has has 635 places, 633 transitions, 1454 flow [2024-11-19 05:57:29,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.6666666666666) internal successors, (2060), 3 states have internal predecessors, (2060), 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:29,581 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:29,581 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 05:57:29,581 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-19 05:57:29,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:29,581 INFO L85 PathProgramCache]: Analyzing trace with hash -886118762, now seen corresponding path program 1 times [2024-11-19 05:57:29,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:29,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13481553] [2024-11-19 05:57:29,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:29,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:29,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:29,635 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:29,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:29,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13481553] [2024-11-19 05:57:29,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13481553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:29,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:29,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:57:29,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488848407] [2024-11-19 05:57:29,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:29,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:29,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:29,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:29,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:29,645 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 685 out of 717 [2024-11-19 05:57:29,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 633 transitions, 1454 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 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:29,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:29,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 685 of 717 [2024-11-19 05:57:29,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:30,456 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1886] thread2EXIT-->L90: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][619], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 492#L90true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 799#true, 699#(= |#race~id_0~0| 0), Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), 814#true, Black: 756#(<= 2147483647 ~id_0~0), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-19 05:57:30,457 INFO L294 olderBase$Statistics]: this new event has 404 ancestors and is not cut-off event [2024-11-19 05:57:30,457 INFO L297 olderBase$Statistics]: existing Event has 412 ancestors and is not cut-off event [2024-11-19 05:57:30,457 INFO L297 olderBase$Statistics]: existing Event has 432 ancestors and is not cut-off event [2024-11-19 05:57:30,457 INFO L297 olderBase$Statistics]: existing Event has 440 ancestors and is not cut-off event [2024-11-19 05:57:30,462 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1886] thread2EXIT-->L90: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][619], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 492#L90true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), 814#true, Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-19 05:57:30,462 INFO L294 olderBase$Statistics]: this new event has 416 ancestors and is not cut-off event [2024-11-19 05:57:30,462 INFO L297 olderBase$Statistics]: existing Event has 444 ancestors and is not cut-off event [2024-11-19 05:57:30,462 INFO L297 olderBase$Statistics]: existing Event has 452 ancestors and is not cut-off event [2024-11-19 05:57:30,462 INFO L297 olderBase$Statistics]: existing Event has 424 ancestors and is not cut-off event [2024-11-19 05:57:30,464 INFO L124 PetriNetUnfolderBase]: 150/6044 cut-off events. [2024-11-19 05:57:30,464 INFO L125 PetriNetUnfolderBase]: For 53/85 co-relation queries the response was YES. [2024-11-19 05:57:30,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6681 conditions, 6044 events. 150/6044 cut-off events. For 53/85 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 59629 event pairs, 12 based on Foata normal form. 2/5520 useless extension candidates. Maximal degree in co-relation 6630. Up to 157 conditions per place. [2024-11-19 05:57:30,583 INFO L140 encePairwiseOnDemand]: 713/717 looper letters, 11 selfloop transitions, 3 changer transitions 0/636 dead transitions. [2024-11-19 05:57:30,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 637 places, 636 transitions, 1489 flow [2024-11-19 05:57:30,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:30,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:30,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2070 transitions. [2024-11-19 05:57:30,585 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9623430962343096 [2024-11-19 05:57:30,585 INFO L175 Difference]: Start difference. First operand has 635 places, 633 transitions, 1454 flow. Second operand 3 states and 2070 transitions. [2024-11-19 05:57:30,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 637 places, 636 transitions, 1489 flow [2024-11-19 05:57:30,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 637 places, 636 transitions, 1489 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:57:30,594 INFO L231 Difference]: Finished difference. Result has 639 places, 635 transitions, 1476 flow [2024-11-19 05:57:30,595 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1454, PETRI_DIFFERENCE_MINUEND_PLACES=635, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1476, PETRI_PLACES=639, PETRI_TRANSITIONS=635} [2024-11-19 05:57:30,595 INFO L277 CegarLoopForPetriNet]: 669 programPoint places, -30 predicate places. [2024-11-19 05:57:30,595 INFO L471 AbstractCegarLoop]: Abstraction has has 639 places, 635 transitions, 1476 flow [2024-11-19 05:57:30,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 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,596 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:30,596 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-19 05:57:30,597 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-19 05:57:30,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:30,597 INFO L85 PathProgramCache]: Analyzing trace with hash 334805314, now seen corresponding path program 1 times [2024-11-19 05:57:30,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:30,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964246362] [2024-11-19 05:57:30,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:30,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:30,760 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,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:30,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964246362] [2024-11-19 05:57:30,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964246362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:30,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:30,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:30,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831956560] [2024-11-19 05:57:30,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:30,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:30,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:30,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:30,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:30,903 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 672 out of 717 [2024-11-19 05:57:30,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 639 places, 635 transitions, 1476 flow. Second operand has 3 states, 3 states have (on average 674.6666666666666) internal successors, (2024), 3 states have internal predecessors, (2024), 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,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:30,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 672 of 717 [2024-11-19 05:57:30,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:31,912 INFO L124 PetriNetUnfolderBase]: 160/6416 cut-off events. [2024-11-19 05:57:31,913 INFO L125 PetriNetUnfolderBase]: For 123/137 co-relation queries the response was YES. [2024-11-19 05:57:31,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7164 conditions, 6416 events. 160/6416 cut-off events. For 123/137 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 63285 event pairs, 6 based on Foata normal form. 0/5896 useless extension candidates. Maximal degree in co-relation 7109. Up to 106 conditions per place. [2024-11-19 05:57:31,982 INFO L140 encePairwiseOnDemand]: 713/717 looper letters, 24 selfloop transitions, 2 changer transitions 0/637 dead transitions. [2024-11-19 05:57:31,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 639 places, 637 transitions, 1534 flow [2024-11-19 05:57:31,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:31,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:31,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2044 transitions. [2024-11-19 05:57:31,984 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9502556950255695 [2024-11-19 05:57:31,984 INFO L175 Difference]: Start difference. First operand has 639 places, 635 transitions, 1476 flow. Second operand 3 states and 2044 transitions. [2024-11-19 05:57:31,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 639 places, 637 transitions, 1534 flow [2024-11-19 05:57:31,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 637 places, 637 transitions, 1528 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:31,994 INFO L231 Difference]: Finished difference. Result has 638 places, 635 transitions, 1480 flow [2024-11-19 05:57:31,995 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=635, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=631, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1480, PETRI_PLACES=638, PETRI_TRANSITIONS=635} [2024-11-19 05:57:31,995 INFO L277 CegarLoopForPetriNet]: 669 programPoint places, -31 predicate places. [2024-11-19 05:57:31,995 INFO L471 AbstractCegarLoop]: Abstraction has has 638 places, 635 transitions, 1480 flow [2024-11-19 05:57:31,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 674.6666666666666) internal successors, (2024), 3 states have internal predecessors, (2024), 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,996 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:31,996 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-19 05:57:31,996 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-19 05:57:31,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:31,997 INFO L85 PathProgramCache]: Analyzing trace with hash -862090347, now seen corresponding path program 1 times [2024-11-19 05:57:31,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:31,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600524483] [2024-11-19 05:57:31,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:31,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:32,042 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,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:32,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600524483] [2024-11-19 05:57:32,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600524483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:32,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:32,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:57:32,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295189034] [2024-11-19 05:57:32,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:32,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:32,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:32,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:32,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:32,051 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 685 out of 717 [2024-11-19 05:57:32,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 638 places, 635 transitions, 1480 flow. Second operand has 3 states, 3 states have (on average 686.6666666666666) internal successors, (2060), 3 states have internal predecessors, (2060), 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,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:32,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 685 of 717 [2024-11-19 05:57:32,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:32,835 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1885] thread1EXIT-->L89-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][620], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), 224#L89-1true, Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, 460#L60-33true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 756#(<= 2147483647 ~id_0~0), 825#(not |thread2Thread1of1ForFork0_#t~short20#1|), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-19 05:57:32,835 INFO L294 olderBase$Statistics]: this new event has 381 ancestors and is cut-off event [2024-11-19 05:57:32,835 INFO L297 olderBase$Statistics]: existing Event has 409 ancestors and is cut-off event [2024-11-19 05:57:32,835 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2024-11-19 05:57:32,835 INFO L297 olderBase$Statistics]: existing Event has 417 ancestors and is cut-off event [2024-11-19 05:57:32,873 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1885] thread1EXIT-->L89-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][620], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 799#true, 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), 224#L89-1true, Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, 460#L60-33true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), 825#(not |thread2Thread1of1ForFork0_#t~short20#1|), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-19 05:57:32,873 INFO L294 olderBase$Statistics]: this new event has 393 ancestors and is cut-off event [2024-11-19 05:57:32,873 INFO L297 olderBase$Statistics]: existing Event has 421 ancestors and is cut-off event [2024-11-19 05:57:32,873 INFO L297 olderBase$Statistics]: existing Event has 429 ancestors and is cut-off event [2024-11-19 05:57:32,873 INFO L297 olderBase$Statistics]: existing Event has 401 ancestors and is cut-off event [2024-11-19 05:57:32,892 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1885] thread1EXIT-->L89-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][572], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), 224#L89-1true, Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 823#true, 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 544#L60-67true, 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-19 05:57:32,893 INFO L294 olderBase$Statistics]: this new event has 403 ancestors and is cut-off event [2024-11-19 05:57:32,893 INFO L297 olderBase$Statistics]: existing Event has 431 ancestors and is cut-off event [2024-11-19 05:57:32,893 INFO L297 olderBase$Statistics]: existing Event has 459 ancestors and is cut-off event [2024-11-19 05:57:32,893 INFO L297 olderBase$Statistics]: existing Event has 431 ancestors and is cut-off event [2024-11-19 05:57:32,910 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1885] thread1EXIT-->L89-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][572], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), 224#L89-1true, Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 823#true, 705#(= |#race~id_3~0| 0), Black: 819#true, 544#L60-67true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-19 05:57:32,910 INFO L294 olderBase$Statistics]: this new event has 415 ancestors and is cut-off event [2024-11-19 05:57:32,910 INFO L297 olderBase$Statistics]: existing Event has 471 ancestors and is cut-off event [2024-11-19 05:57:32,910 INFO L297 olderBase$Statistics]: existing Event has 443 ancestors and is cut-off event [2024-11-19 05:57:32,910 INFO L297 olderBase$Statistics]: existing Event has 443 ancestors and is cut-off event [2024-11-19 05:57:32,919 INFO L124 PetriNetUnfolderBase]: 146/5998 cut-off events. [2024-11-19 05:57:32,920 INFO L125 PetriNetUnfolderBase]: For 91/107 co-relation queries the response was YES. [2024-11-19 05:57:32,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6797 conditions, 5998 events. 146/5998 cut-off events. For 91/107 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 56427 event pairs, 10 based on Foata normal form. 0/5526 useless extension candidates. Maximal degree in co-relation 6744. Up to 173 conditions per place. [2024-11-19 05:57:32,955 INFO L140 encePairwiseOnDemand]: 713/717 looper letters, 11 selfloop transitions, 3 changer transitions 0/638 dead transitions. [2024-11-19 05:57:32,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 640 places, 638 transitions, 1515 flow [2024-11-19 05:57:32,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:32,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:32,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2070 transitions. [2024-11-19 05:57:32,956 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9623430962343096 [2024-11-19 05:57:32,956 INFO L175 Difference]: Start difference. First operand has 638 places, 635 transitions, 1480 flow. Second operand 3 states and 2070 transitions. [2024-11-19 05:57:32,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 640 places, 638 transitions, 1515 flow [2024-11-19 05:57:32,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 640 places, 638 transitions, 1515 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:57:32,963 INFO L231 Difference]: Finished difference. Result has 642 places, 637 transitions, 1502 flow [2024-11-19 05:57:32,964 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1480, PETRI_DIFFERENCE_MINUEND_PLACES=638, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=632, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1502, PETRI_PLACES=642, PETRI_TRANSITIONS=637} [2024-11-19 05:57:32,964 INFO L277 CegarLoopForPetriNet]: 669 programPoint places, -27 predicate places. [2024-11-19 05:57:32,965 INFO L471 AbstractCegarLoop]: Abstraction has has 642 places, 637 transitions, 1502 flow [2024-11-19 05:57:32,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.6666666666666) internal successors, (2060), 3 states have internal predecessors, (2060), 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,965 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:32,965 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-19 05:57:32,966 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-19 05:57:32,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:32,966 INFO L85 PathProgramCache]: Analyzing trace with hash -2024586780, now seen corresponding path program 1 times [2024-11-19 05:57:32,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:32,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705752563] [2024-11-19 05:57:32,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:32,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:33,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:57:33,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:33,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705752563] [2024-11-19 05:57:33,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705752563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:33,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:33,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:33,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680412094] [2024-11-19 05:57:33,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:33,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:33,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:33,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:33,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:33,027 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 717 [2024-11-19 05:57:33,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 642 places, 637 transitions, 1502 flow. Second operand has 3 states, 3 states have (on average 685.6666666666666) internal successors, (2057), 3 states have internal predecessors, (2057), 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,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:33,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 717 [2024-11-19 05:57:33,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:33,973 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1886] thread2EXIT-->L90: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][620], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 492#L90true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 823#true, Black: 819#true, 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 825#(not |thread2Thread1of1ForFork0_#t~short20#1|), 828#true, 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 756#(<= 2147483647 ~id_0~0), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-19 05:57:33,973 INFO L294 olderBase$Statistics]: this new event has 440 ancestors and is not cut-off event [2024-11-19 05:57:33,973 INFO L297 olderBase$Statistics]: existing Event has 468 ancestors and is not cut-off event [2024-11-19 05:57:33,973 INFO L297 olderBase$Statistics]: existing Event has 448 ancestors and is not cut-off event [2024-11-19 05:57:33,973 INFO L297 olderBase$Statistics]: existing Event has 476 ancestors and is not cut-off event [2024-11-19 05:57:33,976 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1886] thread2EXIT-->L90: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][620], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 492#L90true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 823#true, 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 825#(not |thread2Thread1of1ForFork0_#t~short20#1|), 828#true, 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-19 05:57:33,976 INFO L294 olderBase$Statistics]: this new event has 452 ancestors and is not cut-off event [2024-11-19 05:57:33,976 INFO L297 olderBase$Statistics]: existing Event has 488 ancestors and is not cut-off event [2024-11-19 05:57:33,976 INFO L297 olderBase$Statistics]: existing Event has 460 ancestors and is not cut-off event [2024-11-19 05:57:33,976 INFO L297 olderBase$Statistics]: existing Event has 480 ancestors and is not cut-off event [2024-11-19 05:57:33,978 INFO L124 PetriNetUnfolderBase]: 112/6394 cut-off events. [2024-11-19 05:57:33,978 INFO L125 PetriNetUnfolderBase]: For 139/179 co-relation queries the response was YES. [2024-11-19 05:57:34,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7344 conditions, 6394 events. 112/6394 cut-off events. For 139/179 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 62698 event pairs, 2 based on Foata normal form. 0/5990 useless extension candidates. Maximal degree in co-relation 7289. Up to 100 conditions per place. [2024-11-19 05:57:34,049 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 12 selfloop transitions, 1 changer transitions 0/638 dead transitions. [2024-11-19 05:57:34,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 642 places, 638 transitions, 1533 flow [2024-11-19 05:57:34,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:34,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:34,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2067 transitions. [2024-11-19 05:57:34,050 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9609483960948396 [2024-11-19 05:57:34,051 INFO L175 Difference]: Start difference. First operand has 642 places, 637 transitions, 1502 flow. Second operand 3 states and 2067 transitions. [2024-11-19 05:57:34,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 642 places, 638 transitions, 1533 flow [2024-11-19 05:57:34,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 640 places, 638 transitions, 1527 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:34,060 INFO L231 Difference]: Finished difference. Result has 640 places, 635 transitions, 1494 flow [2024-11-19 05:57:34,060 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1492, PETRI_DIFFERENCE_MINUEND_PLACES=638, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=634, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1494, PETRI_PLACES=640, PETRI_TRANSITIONS=635} [2024-11-19 05:57:34,061 INFO L277 CegarLoopForPetriNet]: 669 programPoint places, -29 predicate places. [2024-11-19 05:57:34,061 INFO L471 AbstractCegarLoop]: Abstraction has has 640 places, 635 transitions, 1494 flow [2024-11-19 05:57:34,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 685.6666666666666) internal successors, (2057), 3 states have internal predecessors, (2057), 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,062 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:34,062 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-19 05:57:34,062 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-19 05:57:34,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:34,062 INFO L85 PathProgramCache]: Analyzing trace with hash -7656952, now seen corresponding path program 1 times [2024-11-19 05:57:34,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:34,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616466553] [2024-11-19 05:57:34,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:34,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:34,110 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:34,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:34,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616466553] [2024-11-19 05:57:34,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616466553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:34,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:34,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:34,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106617335] [2024-11-19 05:57:34,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:34,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:34,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:34,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:34,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:34,123 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 717 [2024-11-19 05:57:34,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 640 places, 635 transitions, 1494 flow. Second operand has 3 states, 3 states have (on average 685.6666666666666) internal successors, (2057), 3 states have internal predecessors, (2057), 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,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:34,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 717 [2024-11-19 05:57:34,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:34,975 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1886] thread2EXIT-->L90: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][618], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 492#L90true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), 831#true, Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 825#(not |thread2Thread1of1ForFork0_#t~short20#1|), 828#true, Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-19 05:57:34,975 INFO L294 olderBase$Statistics]: this new event has 440 ancestors and is not cut-off event [2024-11-19 05:57:34,975 INFO L297 olderBase$Statistics]: existing Event has 476 ancestors and is not cut-off event [2024-11-19 05:57:34,976 INFO L297 olderBase$Statistics]: existing Event has 448 ancestors and is not cut-off event [2024-11-19 05:57:34,976 INFO L297 olderBase$Statistics]: existing Event has 468 ancestors and is not cut-off event [2024-11-19 05:57:34,977 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1886] thread2EXIT-->L90: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][618], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 492#L90true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), 831#true, Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), 828#true, Black: 825#(not |thread2Thread1of1ForFork0_#t~short20#1|), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-19 05:57:34,978 INFO L294 olderBase$Statistics]: this new event has 452 ancestors and is not cut-off event [2024-11-19 05:57:34,978 INFO L297 olderBase$Statistics]: existing Event has 480 ancestors and is not cut-off event [2024-11-19 05:57:34,978 INFO L297 olderBase$Statistics]: existing Event has 460 ancestors and is not cut-off event [2024-11-19 05:57:34,978 INFO L297 olderBase$Statistics]: existing Event has 488 ancestors and is not cut-off event [2024-11-19 05:57:34,979 INFO L124 PetriNetUnfolderBase]: 110/5956 cut-off events. [2024-11-19 05:57:34,979 INFO L125 PetriNetUnfolderBase]: For 69/85 co-relation queries the response was YES. [2024-11-19 05:57:35,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6810 conditions, 5956 events. 110/5956 cut-off events. For 69/85 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 56683 event pairs, 2 based on Foata normal form. 0/5592 useless extension candidates. Maximal degree in co-relation 6755. Up to 100 conditions per place. [2024-11-19 05:57:35,022 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 12 selfloop transitions, 1 changer transitions 0/636 dead transitions. [2024-11-19 05:57:35,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 640 places, 636 transitions, 1525 flow [2024-11-19 05:57:35,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:35,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:35,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2067 transitions. [2024-11-19 05:57:35,024 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9609483960948396 [2024-11-19 05:57:35,024 INFO L175 Difference]: Start difference. First operand has 640 places, 635 transitions, 1494 flow. Second operand 3 states and 2067 transitions. [2024-11-19 05:57:35,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 640 places, 636 transitions, 1525 flow [2024-11-19 05:57:35,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 639 places, 636 transitions, 1524 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:57:35,031 INFO L231 Difference]: Finished difference. Result has 639 places, 633 transitions, 1491 flow [2024-11-19 05:57:35,031 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1489, PETRI_DIFFERENCE_MINUEND_PLACES=637, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=632, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1491, PETRI_PLACES=639, PETRI_TRANSITIONS=633} [2024-11-19 05:57:35,032 INFO L277 CegarLoopForPetriNet]: 669 programPoint places, -30 predicate places. [2024-11-19 05:57:35,032 INFO L471 AbstractCegarLoop]: Abstraction has has 639 places, 633 transitions, 1491 flow [2024-11-19 05:57:35,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 685.6666666666666) internal successors, (2057), 3 states have internal predecessors, (2057), 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,033 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:35,033 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-19 05:57:35,033 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-19 05:57:35,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:35,034 INFO L85 PathProgramCache]: Analyzing trace with hash -2097212317, now seen corresponding path program 1 times [2024-11-19 05:57:35,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:35,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246673850] [2024-11-19 05:57:35,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:35,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:35,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:35,086 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,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:35,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246673850] [2024-11-19 05:57:35,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246673850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:35,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:35,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:35,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200329826] [2024-11-19 05:57:35,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:35,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:35,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:35,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:35,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:35,098 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 717 [2024-11-19 05:57:35,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 639 places, 633 transitions, 1491 flow. Second operand has 3 states, 3 states have (on average 686.0) internal successors, (2058), 3 states have internal predecessors, (2058), 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,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:35,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 717 [2024-11-19 05:57:35,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:36,078 INFO L124 PetriNetUnfolderBase]: 120/6482 cut-off events. [2024-11-19 05:57:36,078 INFO L125 PetriNetUnfolderBase]: For 107/127 co-relation queries the response was YES. [2024-11-19 05:57:36,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7418 conditions, 6482 events. 120/6482 cut-off events. For 107/127 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 61132 event pairs, 6 based on Foata normal form. 0/6100 useless extension candidates. Maximal degree in co-relation 7363. Up to 108 conditions per place. [2024-11-19 05:57:36,151 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 11 selfloop transitions, 1 changer transitions 0/633 dead transitions. [2024-11-19 05:57:36,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 639 places, 633 transitions, 1517 flow [2024-11-19 05:57:36,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:36,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:36,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2066 transitions. [2024-11-19 05:57:36,153 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9604834960483496 [2024-11-19 05:57:36,153 INFO L175 Difference]: Start difference. First operand has 639 places, 633 transitions, 1491 flow. Second operand 3 states and 2066 transitions. [2024-11-19 05:57:36,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 639 places, 633 transitions, 1517 flow [2024-11-19 05:57:36,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 638 places, 633 transitions, 1516 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:57:36,161 INFO L231 Difference]: Finished difference. Result has 638 places, 631 transitions, 1488 flow [2024-11-19 05:57:36,162 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1486, PETRI_DIFFERENCE_MINUEND_PLACES=636, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1488, PETRI_PLACES=638, PETRI_TRANSITIONS=631} [2024-11-19 05:57:36,162 INFO L277 CegarLoopForPetriNet]: 669 programPoint places, -31 predicate places. [2024-11-19 05:57:36,162 INFO L471 AbstractCegarLoop]: Abstraction has has 638 places, 631 transitions, 1488 flow [2024-11-19 05:57:36,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.0) internal successors, (2058), 3 states have internal predecessors, (2058), 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:36,163 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:36,163 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-19 05:57:36,163 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread2Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-19 05:57:36,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:36,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1081316377, now seen corresponding path program 1 times [2024-11-19 05:57:36,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:36,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677599783] [2024-11-19 05:57:36,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:36,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:36,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:36,212 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:36,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:36,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677599783] [2024-11-19 05:57:36,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677599783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:36,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:36,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:36,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445659876] [2024-11-19 05:57:36,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:36,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:36,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:36,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:36,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:36,227 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 717 [2024-11-19 05:57:36,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 638 places, 631 transitions, 1488 flow. Second operand has 3 states, 3 states have (on average 686.0) internal successors, (2058), 3 states have internal predecessors, (2058), 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:36,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:36,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 717 [2024-11-19 05:57:36,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:37,106 INFO L124 PetriNetUnfolderBase]: 120/6342 cut-off events. [2024-11-19 05:57:37,106 INFO L125 PetriNetUnfolderBase]: For 107/127 co-relation queries the response was YES. [2024-11-19 05:57:37,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7276 conditions, 6342 events. 120/6342 cut-off events. For 107/127 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 59511 event pairs, 6 based on Foata normal form. 0/6000 useless extension candidates. Maximal degree in co-relation 7221. Up to 108 conditions per place. [2024-11-19 05:57:37,166 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 11 selfloop transitions, 1 changer transitions 0/631 dead transitions. [2024-11-19 05:57:37,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 638 places, 631 transitions, 1514 flow [2024-11-19 05:57:37,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:37,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:37,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2066 transitions. [2024-11-19 05:57:37,168 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9604834960483496 [2024-11-19 05:57:37,168 INFO L175 Difference]: Start difference. First operand has 638 places, 631 transitions, 1488 flow. Second operand 3 states and 2066 transitions. [2024-11-19 05:57:37,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 638 places, 631 transitions, 1514 flow [2024-11-19 05:57:37,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 637 places, 631 transitions, 1513 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:57:37,177 INFO L231 Difference]: Finished difference. Result has 637 places, 629 transitions, 1485 flow [2024-11-19 05:57:37,178 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1483, PETRI_DIFFERENCE_MINUEND_PLACES=635, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=629, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=628, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1485, PETRI_PLACES=637, PETRI_TRANSITIONS=629} [2024-11-19 05:57:37,178 INFO L277 CegarLoopForPetriNet]: 669 programPoint places, -32 predicate places. [2024-11-19 05:57:37,179 INFO L471 AbstractCegarLoop]: Abstraction has has 637 places, 629 transitions, 1485 flow [2024-11-19 05:57:37,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.0) internal successors, (2058), 3 states have internal predecessors, (2058), 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:37,180 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:37,180 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-19 05:57:37,180 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread1Err24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-19 05:57:37,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:37,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1485592779, now seen corresponding path program 1 times [2024-11-19 05:57:37,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:37,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571753501] [2024-11-19 05:57:37,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:37,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:37,236 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:37,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:37,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571753501] [2024-11-19 05:57:37,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571753501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:37,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:37,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:37,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513919093] [2024-11-19 05:57:37,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:37,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:37,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:37,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:37,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:37,252 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 717 [2024-11-19 05:57:37,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 637 places, 629 transitions, 1485 flow. Second operand has 3 states, 3 states have (on average 685.6666666666666) internal successors, (2057), 3 states have internal predecessors, (2057), 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:37,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:37,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 717 [2024-11-19 05:57:37,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:38,266 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1886] thread2EXIT-->L90: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][612], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 492#L90true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, 837#true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 825#(not |thread2Thread1of1ForFork0_#t~short20#1|), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-19 05:57:38,266 INFO L294 olderBase$Statistics]: this new event has 468 ancestors and is not cut-off event [2024-11-19 05:57:38,267 INFO L297 olderBase$Statistics]: existing Event has 476 ancestors and is not cut-off event [2024-11-19 05:57:38,267 INFO L297 olderBase$Statistics]: existing Event has 476 ancestors and is not cut-off event [2024-11-19 05:57:38,267 INFO L297 olderBase$Statistics]: existing Event has 484 ancestors and is not cut-off event [2024-11-19 05:57:38,269 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1886] thread2EXIT-->L90: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][612], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 492#L90true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, 837#true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 799#true, 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 819#true, 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 825#(not |thread2Thread1of1ForFork0_#t~short20#1|), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-19 05:57:38,269 INFO L294 olderBase$Statistics]: this new event has 480 ancestors and is not cut-off event [2024-11-19 05:57:38,269 INFO L297 olderBase$Statistics]: existing Event has 488 ancestors and is not cut-off event [2024-11-19 05:57:38,270 INFO L297 olderBase$Statistics]: existing Event has 488 ancestors and is not cut-off event [2024-11-19 05:57:38,270 INFO L297 olderBase$Statistics]: existing Event has 496 ancestors and is not cut-off event [2024-11-19 05:57:38,272 INFO L124 PetriNetUnfolderBase]: 116/6104 cut-off events. [2024-11-19 05:57:38,272 INFO L125 PetriNetUnfolderBase]: For 73/141 co-relation queries the response was YES. [2024-11-19 05:57:38,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7178 conditions, 6104 events. 116/6104 cut-off events. For 73/141 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 58214 event pairs, 12 based on Foata normal form. 2/5832 useless extension candidates. Maximal degree in co-relation 7123. Up to 196 conditions per place. [2024-11-19 05:57:38,332 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 10 selfloop transitions, 2 changer transitions 0/629 dead transitions. [2024-11-19 05:57:38,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 638 places, 629 transitions, 1510 flow [2024-11-19 05:57:38,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:38,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:38,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2065 transitions. [2024-11-19 05:57:38,334 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9600185960018596 [2024-11-19 05:57:38,334 INFO L175 Difference]: Start difference. First operand has 637 places, 629 transitions, 1485 flow. Second operand 3 states and 2065 transitions. [2024-11-19 05:57:38,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 638 places, 629 transitions, 1510 flow [2024-11-19 05:57:38,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 637 places, 629 transitions, 1509 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:57:38,342 INFO L231 Difference]: Finished difference. Result has 637 places, 628 transitions, 1486 flow [2024-11-19 05:57:38,343 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1482, PETRI_DIFFERENCE_MINUEND_PLACES=635, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=626, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1486, PETRI_PLACES=637, PETRI_TRANSITIONS=628} [2024-11-19 05:57:38,343 INFO L277 CegarLoopForPetriNet]: 669 programPoint places, -32 predicate places. [2024-11-19 05:57:38,343 INFO L471 AbstractCegarLoop]: Abstraction has has 637 places, 628 transitions, 1486 flow [2024-11-19 05:57:38,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 685.6666666666666) internal successors, (2057), 3 states have internal predecessors, (2057), 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:38,344 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:38,344 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-19 05:57:38,344 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-19 05:57:38,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:38,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1765812143, now seen corresponding path program 1 times [2024-11-19 05:57:38,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:38,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067225768] [2024-11-19 05:57:38,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:38,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:38,393 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:38,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:38,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067225768] [2024-11-19 05:57:38,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067225768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:38,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:38,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:38,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964936022] [2024-11-19 05:57:38,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:38,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:38,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:38,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:38,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:38,409 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 717 [2024-11-19 05:57:38,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 637 places, 628 transitions, 1486 flow. Second operand has 3 states, 3 states have (on average 686.0) internal successors, (2058), 3 states have internal predecessors, (2058), 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:38,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:38,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 717 [2024-11-19 05:57:38,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:39,332 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1885] thread1EXIT-->L89-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][562], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 843#true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 463#L60-62true, 699#(= |#race~id_0~0| 0), 224#L89-1true, Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 819#true, 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 823#true, Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-19 05:57:39,333 INFO L294 olderBase$Statistics]: this new event has 470 ancestors and is cut-off event [2024-11-19 05:57:39,333 INFO L297 olderBase$Statistics]: existing Event has 462 ancestors and is cut-off event [2024-11-19 05:57:39,333 INFO L297 olderBase$Statistics]: existing Event has 454 ancestors and is cut-off event [2024-11-19 05:57:39,333 INFO L297 olderBase$Statistics]: existing Event has 462 ancestors and is cut-off event [2024-11-19 05:57:39,377 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1885] thread1EXIT-->L89-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][562], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 843#true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 799#true, 756#(<= 2147483647 ~id_0~0), 463#L60-62true, 699#(= |#race~id_0~0| 0), 224#L89-1true, Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 823#true, 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-19 05:57:39,377 INFO L294 olderBase$Statistics]: this new event has 482 ancestors and is cut-off event [2024-11-19 05:57:39,377 INFO L297 olderBase$Statistics]: existing Event has 474 ancestors and is cut-off event [2024-11-19 05:57:39,377 INFO L297 olderBase$Statistics]: existing Event has 466 ancestors and is cut-off event [2024-11-19 05:57:39,377 INFO L297 olderBase$Statistics]: existing Event has 474 ancestors and is cut-off event [2024-11-19 05:57:39,400 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L60-61-->L60-62: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet26#1=|v_thread2Thread1of1ForFork0_#t~nondet26#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet26#1][530], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 843#true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 463#L60-62true, 699#(= |#race~id_0~0| 0), 224#L89-1true, Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), Black: 823#true, 751#(= |#race~get_5~0| 0), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-19 05:57:39,400 INFO L294 olderBase$Statistics]: this new event has 454 ancestors and is not cut-off event [2024-11-19 05:57:39,400 INFO L297 olderBase$Statistics]: existing Event has 462 ancestors and is not cut-off event [2024-11-19 05:57:39,400 INFO L297 olderBase$Statistics]: existing Event has 470 ancestors and is not cut-off event [2024-11-19 05:57:39,400 INFO L297 olderBase$Statistics]: existing Event has 462 ancestors and is not cut-off event [2024-11-19 05:57:39,401 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1885] thread1EXIT-->L89-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][610], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 845#(= |thread2Thread1of1ForFork0_#t~nondet26#1| |#race~result_9~0|), 202#L60-63true, Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), 224#L89-1true, Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), Black: 823#true, 751#(= |#race~get_5~0| 0), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-19 05:57:39,401 INFO L294 olderBase$Statistics]: this new event has 455 ancestors and is cut-off event [2024-11-19 05:57:39,401 INFO L297 olderBase$Statistics]: existing Event has 463 ancestors and is cut-off event [2024-11-19 05:57:39,401 INFO L297 olderBase$Statistics]: existing Event has 463 ancestors and is cut-off event [2024-11-19 05:57:39,401 INFO L297 olderBase$Statistics]: existing Event has 471 ancestors and is cut-off event [2024-11-19 05:57:39,402 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1885] thread1EXIT-->L89-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][610], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 314#L60-64true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 845#(= |thread2Thread1of1ForFork0_#t~nondet26#1| |#race~result_9~0|), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), 224#L89-1true, Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), Black: 823#true, 751#(= |#race~get_5~0| 0), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-19 05:57:39,402 INFO L294 olderBase$Statistics]: this new event has 456 ancestors and is cut-off event [2024-11-19 05:57:39,403 INFO L297 olderBase$Statistics]: existing Event has 464 ancestors and is cut-off event [2024-11-19 05:57:39,403 INFO L297 olderBase$Statistics]: existing Event has 472 ancestors and is cut-off event [2024-11-19 05:57:39,403 INFO L297 olderBase$Statistics]: existing Event has 464 ancestors and is cut-off event [2024-11-19 05:57:39,408 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1885] thread1EXIT-->L89-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][562], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 843#true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), 224#L89-1true, Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 464#L62true, 751#(= |#race~get_5~0| 0), Black: 825#(not |thread2Thread1of1ForFork0_#t~short20#1|), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-19 05:57:39,408 INFO L294 olderBase$Statistics]: this new event has 465 ancestors and is cut-off event [2024-11-19 05:57:39,408 INFO L297 olderBase$Statistics]: existing Event has 473 ancestors and is cut-off event [2024-11-19 05:57:39,408 INFO L297 olderBase$Statistics]: existing Event has 481 ancestors and is cut-off event [2024-11-19 05:57:39,409 INFO L297 olderBase$Statistics]: existing Event has 473 ancestors and is cut-off event [2024-11-19 05:57:39,409 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L60-61-->L60-62: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet26#1=|v_thread2Thread1of1ForFork0_#t~nondet26#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet26#1][530], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 843#true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 799#true, 756#(<= 2147483647 ~id_0~0), 463#L60-62true, 699#(= |#race~id_0~0| 0), 224#L89-1true, Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 819#true, 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 823#true, 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-19 05:57:39,409 INFO L294 olderBase$Statistics]: this new event has 466 ancestors and is not cut-off event [2024-11-19 05:57:39,410 INFO L297 olderBase$Statistics]: existing Event has 474 ancestors and is not cut-off event [2024-11-19 05:57:39,410 INFO L297 olderBase$Statistics]: existing Event has 482 ancestors and is not cut-off event [2024-11-19 05:57:39,410 INFO L297 olderBase$Statistics]: existing Event has 474 ancestors and is not cut-off event [2024-11-19 05:57:39,410 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1885] thread1EXIT-->L89-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][610], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, 845#(= |thread2Thread1of1ForFork0_#t~nondet26#1| |#race~result_9~0|), Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 202#L60-63true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 799#true, 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), 224#L89-1true, Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 819#true, 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 823#true, 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-19 05:57:39,410 INFO L294 olderBase$Statistics]: this new event has 467 ancestors and is cut-off event [2024-11-19 05:57:39,410 INFO L297 olderBase$Statistics]: existing Event has 475 ancestors and is cut-off event [2024-11-19 05:57:39,410 INFO L297 olderBase$Statistics]: existing Event has 483 ancestors and is cut-off event [2024-11-19 05:57:39,410 INFO L297 olderBase$Statistics]: existing Event has 475 ancestors and is cut-off event [2024-11-19 05:57:39,411 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1885] thread1EXIT-->L89-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][610], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 314#L60-64true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, 845#(= |thread2Thread1of1ForFork0_#t~nondet26#1| |#race~result_9~0|), Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 799#true, 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), 224#L89-1true, Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 819#true, 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 823#true, 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-19 05:57:39,411 INFO L294 olderBase$Statistics]: this new event has 468 ancestors and is cut-off event [2024-11-19 05:57:39,411 INFO L297 olderBase$Statistics]: existing Event has 484 ancestors and is cut-off event [2024-11-19 05:57:39,411 INFO L297 olderBase$Statistics]: existing Event has 476 ancestors and is cut-off event [2024-11-19 05:57:39,411 INFO L297 olderBase$Statistics]: existing Event has 476 ancestors and is cut-off event [2024-11-19 05:57:39,416 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1885] thread1EXIT-->L89-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][562], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 843#true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 799#true, 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), 224#L89-1true, Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 819#true, 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), 464#L62true, Black: 825#(not |thread2Thread1of1ForFork0_#t~short20#1|), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-19 05:57:39,416 INFO L294 olderBase$Statistics]: this new event has 477 ancestors and is cut-off event [2024-11-19 05:57:39,416 INFO L297 olderBase$Statistics]: existing Event has 485 ancestors and is cut-off event [2024-11-19 05:57:39,416 INFO L297 olderBase$Statistics]: existing Event has 493 ancestors and is cut-off event [2024-11-19 05:57:39,416 INFO L297 olderBase$Statistics]: existing Event has 485 ancestors and is cut-off event [2024-11-19 05:57:39,419 INFO L124 PetriNetUnfolderBase]: 158/6108 cut-off events. [2024-11-19 05:57:39,419 INFO L125 PetriNetUnfolderBase]: For 147/165 co-relation queries the response was YES. [2024-11-19 05:57:39,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7298 conditions, 6108 events. 158/6108 cut-off events. For 147/165 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 57980 event pairs, 16 based on Foata normal form. 0/5824 useless extension candidates. Maximal degree in co-relation 7243. Up to 224 conditions per place. [2024-11-19 05:57:39,473 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 10 selfloop transitions, 2 changer transitions 0/628 dead transitions. [2024-11-19 05:57:39,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 638 places, 628 transitions, 1511 flow [2024-11-19 05:57:39,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:39,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:39,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2065 transitions. [2024-11-19 05:57:39,475 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9600185960018596 [2024-11-19 05:57:39,475 INFO L175 Difference]: Start difference. First operand has 637 places, 628 transitions, 1486 flow. Second operand 3 states and 2065 transitions. [2024-11-19 05:57:39,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 638 places, 628 transitions, 1511 flow [2024-11-19 05:57:39,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 636 places, 628 transitions, 1507 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:39,484 INFO L231 Difference]: Finished difference. Result has 636 places, 627 transitions, 1484 flow [2024-11-19 05:57:39,485 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1480, PETRI_DIFFERENCE_MINUEND_PLACES=634, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=625, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1484, PETRI_PLACES=636, PETRI_TRANSITIONS=627} [2024-11-19 05:57:39,485 INFO L277 CegarLoopForPetriNet]: 669 programPoint places, -33 predicate places. [2024-11-19 05:57:39,485 INFO L471 AbstractCegarLoop]: Abstraction has has 636 places, 627 transitions, 1484 flow [2024-11-19 05:57:39,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.0) internal successors, (2058), 3 states have internal predecessors, (2058), 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:39,486 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:39,486 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-19 05:57:39,486 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-19 05:57:39,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:39,487 INFO L85 PathProgramCache]: Analyzing trace with hash -320657541, now seen corresponding path program 1 times [2024-11-19 05:57:39,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:39,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115690885] [2024-11-19 05:57:39,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:39,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:39,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:39,571 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:39,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:39,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115690885] [2024-11-19 05:57:39,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115690885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:39,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:39,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:39,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622658994] [2024-11-19 05:57:39,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:39,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:39,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:39,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:39,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:39,585 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 717 [2024-11-19 05:57:39,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 636 places, 627 transitions, 1484 flow. Second operand has 3 states, 3 states have (on average 686.6666666666666) internal successors, (2060), 3 states have internal predecessors, (2060), 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:39,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:39,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 717 [2024-11-19 05:57:39,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:40,457 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1886] thread2EXIT-->L90: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][610], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 843#true, 492#L90true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 846#true, 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 825#(not |thread2Thread1of1ForFork0_#t~short20#1|), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-19 05:57:40,457 INFO L294 olderBase$Statistics]: this new event has 468 ancestors and is not cut-off event [2024-11-19 05:57:40,457 INFO L297 olderBase$Statistics]: existing Event has 476 ancestors and is not cut-off event [2024-11-19 05:57:40,457 INFO L297 olderBase$Statistics]: existing Event has 484 ancestors and is not cut-off event [2024-11-19 05:57:40,457 INFO L297 olderBase$Statistics]: existing Event has 476 ancestors and is not cut-off event [2024-11-19 05:57:40,459 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1886] thread2EXIT-->L90: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][610], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 843#true, 492#L90true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 799#true, 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 846#true, Black: 819#true, 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 825#(not |thread2Thread1of1ForFork0_#t~short20#1|), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-19 05:57:40,459 INFO L294 olderBase$Statistics]: this new event has 480 ancestors and is not cut-off event [2024-11-19 05:57:40,460 INFO L297 olderBase$Statistics]: existing Event has 488 ancestors and is not cut-off event [2024-11-19 05:57:40,460 INFO L297 olderBase$Statistics]: existing Event has 488 ancestors and is not cut-off event [2024-11-19 05:57:40,460 INFO L297 olderBase$Statistics]: existing Event has 496 ancestors and is not cut-off event [2024-11-19 05:57:40,462 INFO L124 PetriNetUnfolderBase]: 98/5948 cut-off events. [2024-11-19 05:57:40,462 INFO L125 PetriNetUnfolderBase]: For 73/111 co-relation queries the response was YES. [2024-11-19 05:57:40,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6934 conditions, 5948 events. 98/5948 cut-off events. For 73/111 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 56193 event pairs, 6 based on Foata normal form. 0/5734 useless extension candidates. Maximal degree in co-relation 6879. Up to 124 conditions per place. [2024-11-19 05:57:40,521 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 9 selfloop transitions, 1 changer transitions 0/625 dead transitions. [2024-11-19 05:57:40,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 625 transitions, 1500 flow [2024-11-19 05:57:40,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:40,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:40,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2064 transitions. [2024-11-19 05:57:40,522 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9595536959553695 [2024-11-19 05:57:40,522 INFO L175 Difference]: Start difference. First operand has 636 places, 627 transitions, 1484 flow. Second operand 3 states and 2064 transitions. [2024-11-19 05:57:40,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 625 transitions, 1500 flow [2024-11-19 05:57:40,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 634 places, 625 transitions, 1496 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:57:40,530 INFO L231 Difference]: Finished difference. Result has 634 places, 625 transitions, 1478 flow [2024-11-19 05:57:40,531 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1476, PETRI_DIFFERENCE_MINUEND_PLACES=632, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=624, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1478, PETRI_PLACES=634, PETRI_TRANSITIONS=625} [2024-11-19 05:57:40,531 INFO L277 CegarLoopForPetriNet]: 669 programPoint places, -35 predicate places. [2024-11-19 05:57:40,531 INFO L471 AbstractCegarLoop]: Abstraction has has 634 places, 625 transitions, 1478 flow [2024-11-19 05:57:40,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.6666666666666) internal successors, (2060), 3 states have internal predecessors, (2060), 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,532 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:40,532 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-19 05:57:40,532 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-19 05:57:40,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:40,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1347211417, now seen corresponding path program 1 times [2024-11-19 05:57:40,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:40,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503420725] [2024-11-19 05:57:40,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:40,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:40,592 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,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:40,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503420725] [2024-11-19 05:57:40,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503420725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:40,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:40,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:40,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278344398] [2024-11-19 05:57:40,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:40,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:40,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:40,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:40,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:40,606 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 717 [2024-11-19 05:57:40,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 634 places, 625 transitions, 1478 flow. Second operand has 3 states, 3 states have (on average 686.6666666666666) internal successors, (2060), 3 states have internal predecessors, (2060), 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,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:40,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 717 [2024-11-19 05:57:40,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:41,416 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1885] thread1EXIT-->L89-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][562], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 202#L60-63true, Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), 224#L89-1true, Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, 849#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 846#true, 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), Black: 823#true, 751#(= |#race~get_5~0| 0), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-19 05:57:41,417 INFO L294 olderBase$Statistics]: this new event has 471 ancestors and is cut-off event [2024-11-19 05:57:41,417 INFO L297 olderBase$Statistics]: existing Event has 463 ancestors and is cut-off event [2024-11-19 05:57:41,417 INFO L297 olderBase$Statistics]: existing Event has 455 ancestors and is cut-off event [2024-11-19 05:57:41,417 INFO L297 olderBase$Statistics]: existing Event has 463 ancestors and is cut-off event [2024-11-19 05:57:41,432 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1885] thread1EXIT-->L89-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][562], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 202#L60-63true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 799#true, 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), 224#L89-1true, Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), 849#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 846#true, Black: 819#true, 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 823#true, 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-19 05:57:41,432 INFO L294 olderBase$Statistics]: this new event has 475 ancestors and is cut-off event [2024-11-19 05:57:41,432 INFO L297 olderBase$Statistics]: existing Event has 475 ancestors and is cut-off event [2024-11-19 05:57:41,432 INFO L297 olderBase$Statistics]: existing Event has 483 ancestors and is cut-off event [2024-11-19 05:57:41,432 INFO L297 olderBase$Statistics]: existing Event has 467 ancestors and is cut-off event [2024-11-19 05:57:41,442 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1824] L60-62-->L60-63: Formula: (= |v_#race~result_9~0_1| |v_thread2Thread1of1ForFork0_#t~nondet26#1_3|) InVars {thread2Thread1of1ForFork0_#t~nondet26#1=|v_thread2Thread1of1ForFork0_#t~nondet26#1_3|} OutVars{thread2Thread1of1ForFork0_#t~nondet26#1=|v_thread2Thread1of1ForFork0_#t~nondet26#1_3|, #race~result_9~0=|v_#race~result_9~0_1|} AuxVars[] AssignedVars[#race~result_9~0][535], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 202#L60-63true, Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), 224#L89-1true, Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, 849#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 846#true, 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), Black: 823#true, 751#(= |#race~get_5~0| 0), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-19 05:57:41,442 INFO L294 olderBase$Statistics]: this new event has 455 ancestors and is not cut-off event [2024-11-19 05:57:41,442 INFO L297 olderBase$Statistics]: existing Event has 471 ancestors and is not cut-off event [2024-11-19 05:57:41,442 INFO L297 olderBase$Statistics]: existing Event has 463 ancestors and is not cut-off event [2024-11-19 05:57:41,442 INFO L297 olderBase$Statistics]: existing Event has 463 ancestors and is not cut-off event [2024-11-19 05:57:41,446 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1824] L60-62-->L60-63: Formula: (= |v_#race~result_9~0_1| |v_thread2Thread1of1ForFork0_#t~nondet26#1_3|) InVars {thread2Thread1of1ForFork0_#t~nondet26#1=|v_thread2Thread1of1ForFork0_#t~nondet26#1_3|} OutVars{thread2Thread1of1ForFork0_#t~nondet26#1=|v_thread2Thread1of1ForFork0_#t~nondet26#1_3|, #race~result_9~0=|v_#race~result_9~0_1|} AuxVars[] AssignedVars[#race~result_9~0][535], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 202#L60-63true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 799#true, 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), 224#L89-1true, Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), 849#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 846#true, Black: 819#true, 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 823#true, 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-19 05:57:41,446 INFO L294 olderBase$Statistics]: this new event has 467 ancestors and is not cut-off event [2024-11-19 05:57:41,446 INFO L297 olderBase$Statistics]: existing Event has 475 ancestors and is not cut-off event [2024-11-19 05:57:41,446 INFO L297 olderBase$Statistics]: existing Event has 475 ancestors and is not cut-off event [2024-11-19 05:57:41,446 INFO L297 olderBase$Statistics]: existing Event has 483 ancestors and is not cut-off event [2024-11-19 05:57:41,450 INFO L124 PetriNetUnfolderBase]: 104/5994 cut-off events. [2024-11-19 05:57:41,450 INFO L125 PetriNetUnfolderBase]: For 93/111 co-relation queries the response was YES. [2024-11-19 05:57:41,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6900 conditions, 5994 events. 104/5994 cut-off events. For 93/111 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 56146 event pairs, 8 based on Foata normal form. 8/5784 useless extension candidates. Maximal degree in co-relation 6845. Up to 138 conditions per place. [2024-11-19 05:57:41,481 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 0 selfloop transitions, 0 changer transitions 623/623 dead transitions. [2024-11-19 05:57:41,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 634 places, 623 transitions, 1492 flow [2024-11-19 05:57:41,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:41,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:41,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2063 transitions. [2024-11-19 05:57:41,484 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9590887959088796 [2024-11-19 05:57:41,484 INFO L175 Difference]: Start difference. First operand has 634 places, 625 transitions, 1478 flow. Second operand 3 states and 2063 transitions. [2024-11-19 05:57:41,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 634 places, 623 transitions, 1492 flow [2024-11-19 05:57:41,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 623 transitions, 1491 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:57:41,489 INFO L231 Difference]: Finished difference. Result has 633 places, 0 transitions, 0 flow [2024-11-19 05:57:41,489 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1473, PETRI_DIFFERENCE_MINUEND_PLACES=631, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=623, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=623, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=633, PETRI_TRANSITIONS=0} [2024-11-19 05:57:41,490 INFO L277 CegarLoopForPetriNet]: 669 programPoint places, -36 predicate places. [2024-11-19 05:57:41,490 INFO L471 AbstractCegarLoop]: Abstraction has has 633 places, 0 transitions, 0 flow [2024-11-19 05:57:41,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.6666666666666) internal successors, (2060), 3 states have internal predecessors, (2060), 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,493 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (129 of 130 remaining) [2024-11-19 05:57:41,493 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (128 of 130 remaining) [2024-11-19 05:57:41,493 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (127 of 130 remaining) [2024-11-19 05:57:41,493 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (126 of 130 remaining) [2024-11-19 05:57:41,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (125 of 130 remaining) [2024-11-19 05:57:41,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (124 of 130 remaining) [2024-11-19 05:57:41,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (123 of 130 remaining) [2024-11-19 05:57:41,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (122 of 130 remaining) [2024-11-19 05:57:41,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (121 of 130 remaining) [2024-11-19 05:57:41,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (120 of 130 remaining) [2024-11-19 05:57:41,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (119 of 130 remaining) [2024-11-19 05:57:41,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (118 of 130 remaining) [2024-11-19 05:57:41,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (117 of 130 remaining) [2024-11-19 05:57:41,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (116 of 130 remaining) [2024-11-19 05:57:41,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (115 of 130 remaining) [2024-11-19 05:57:41,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (114 of 130 remaining) [2024-11-19 05:57:41,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (113 of 130 remaining) [2024-11-19 05:57:41,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (112 of 130 remaining) [2024-11-19 05:57:41,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (111 of 130 remaining) [2024-11-19 05:57:41,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (110 of 130 remaining) [2024-11-19 05:57:41,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (109 of 130 remaining) [2024-11-19 05:57:41,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (108 of 130 remaining) [2024-11-19 05:57:41,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (107 of 130 remaining) [2024-11-19 05:57:41,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (106 of 130 remaining) [2024-11-19 05:57:41,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (105 of 130 remaining) [2024-11-19 05:57:41,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (104 of 130 remaining) [2024-11-19 05:57:41,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (103 of 130 remaining) [2024-11-19 05:57:41,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (102 of 130 remaining) [2024-11-19 05:57:41,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (101 of 130 remaining) [2024-11-19 05:57:41,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (100 of 130 remaining) [2024-11-19 05:57:41,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (99 of 130 remaining) [2024-11-19 05:57:41,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (98 of 130 remaining) [2024-11-19 05:57:41,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (97 of 130 remaining) [2024-11-19 05:57:41,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (96 of 130 remaining) [2024-11-19 05:57:41,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (95 of 130 remaining) [2024-11-19 05:57:41,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (94 of 130 remaining) [2024-11-19 05:57:41,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (93 of 130 remaining) [2024-11-19 05:57:41,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (92 of 130 remaining) [2024-11-19 05:57:41,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (91 of 130 remaining) [2024-11-19 05:57:41,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (90 of 130 remaining) [2024-11-19 05:57:41,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (89 of 130 remaining) [2024-11-19 05:57:41,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (88 of 130 remaining) [2024-11-19 05:57:41,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (87 of 130 remaining) [2024-11-19 05:57:41,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (86 of 130 remaining) [2024-11-19 05:57:41,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (85 of 130 remaining) [2024-11-19 05:57:41,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (84 of 130 remaining) [2024-11-19 05:57:41,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (83 of 130 remaining) [2024-11-19 05:57:41,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (82 of 130 remaining) [2024-11-19 05:57:41,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (81 of 130 remaining) [2024-11-19 05:57:41,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (80 of 130 remaining) [2024-11-19 05:57:41,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (79 of 130 remaining) [2024-11-19 05:57:41,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (78 of 130 remaining) [2024-11-19 05:57:41,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (77 of 130 remaining) [2024-11-19 05:57:41,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (76 of 130 remaining) [2024-11-19 05:57:41,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (75 of 130 remaining) [2024-11-19 05:57:41,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (74 of 130 remaining) [2024-11-19 05:57:41,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (73 of 130 remaining) [2024-11-19 05:57:41,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (72 of 130 remaining) [2024-11-19 05:57:41,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (71 of 130 remaining) [2024-11-19 05:57:41,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (70 of 130 remaining) [2024-11-19 05:57:41,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (69 of 130 remaining) [2024-11-19 05:57:41,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (68 of 130 remaining) [2024-11-19 05:57:41,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (67 of 130 remaining) [2024-11-19 05:57:41,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (66 of 130 remaining) [2024-11-19 05:57:41,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (65 of 130 remaining) [2024-11-19 05:57:41,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (64 of 130 remaining) [2024-11-19 05:57:41,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (63 of 130 remaining) [2024-11-19 05:57:41,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (62 of 130 remaining) [2024-11-19 05:57:41,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (61 of 130 remaining) [2024-11-19 05:57:41,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (60 of 130 remaining) [2024-11-19 05:57:41,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (59 of 130 remaining) [2024-11-19 05:57:41,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (58 of 130 remaining) [2024-11-19 05:57:41,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (57 of 130 remaining) [2024-11-19 05:57:41,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (56 of 130 remaining) [2024-11-19 05:57:41,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (55 of 130 remaining) [2024-11-19 05:57:41,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (54 of 130 remaining) [2024-11-19 05:57:41,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (53 of 130 remaining) [2024-11-19 05:57:41,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (52 of 130 remaining) [2024-11-19 05:57:41,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 130 remaining) [2024-11-19 05:57:41,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 130 remaining) [2024-11-19 05:57:41,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (49 of 130 remaining) [2024-11-19 05:57:41,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (48 of 130 remaining) [2024-11-19 05:57:41,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (47 of 130 remaining) [2024-11-19 05:57:41,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (46 of 130 remaining) [2024-11-19 05:57:41,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (45 of 130 remaining) [2024-11-19 05:57:41,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (44 of 130 remaining) [2024-11-19 05:57:41,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (43 of 130 remaining) [2024-11-19 05:57:41,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (42 of 130 remaining) [2024-11-19 05:57:41,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (41 of 130 remaining) [2024-11-19 05:57:41,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (40 of 130 remaining) [2024-11-19 05:57:41,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (39 of 130 remaining) [2024-11-19 05:57:41,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (38 of 130 remaining) [2024-11-19 05:57:41,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (37 of 130 remaining) [2024-11-19 05:57:41,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (36 of 130 remaining) [2024-11-19 05:57:41,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (35 of 130 remaining) [2024-11-19 05:57:41,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (34 of 130 remaining) [2024-11-19 05:57:41,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (33 of 130 remaining) [2024-11-19 05:57:41,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (32 of 130 remaining) [2024-11-19 05:57:41,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (31 of 130 remaining) [2024-11-19 05:57:41,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (30 of 130 remaining) [2024-11-19 05:57:41,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (29 of 130 remaining) [2024-11-19 05:57:41,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (28 of 130 remaining) [2024-11-19 05:57:41,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (27 of 130 remaining) [2024-11-19 05:57:41,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (26 of 130 remaining) [2024-11-19 05:57:41,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (25 of 130 remaining) [2024-11-19 05:57:41,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (24 of 130 remaining) [2024-11-19 05:57:41,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (23 of 130 remaining) [2024-11-19 05:57:41,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (22 of 130 remaining) [2024-11-19 05:57:41,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (21 of 130 remaining) [2024-11-19 05:57:41,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (20 of 130 remaining) [2024-11-19 05:57:41,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (19 of 130 remaining) [2024-11-19 05:57:41,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (18 of 130 remaining) [2024-11-19 05:57:41,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (17 of 130 remaining) [2024-11-19 05:57:41,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (16 of 130 remaining) [2024-11-19 05:57:41,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (15 of 130 remaining) [2024-11-19 05:57:41,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (14 of 130 remaining) [2024-11-19 05:57:41,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (13 of 130 remaining) [2024-11-19 05:57:41,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (12 of 130 remaining) [2024-11-19 05:57:41,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (11 of 130 remaining) [2024-11-19 05:57:41,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (10 of 130 remaining) [2024-11-19 05:57:41,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (9 of 130 remaining) [2024-11-19 05:57:41,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (8 of 130 remaining) [2024-11-19 05:57:41,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (7 of 130 remaining) [2024-11-19 05:57:41,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (6 of 130 remaining) [2024-11-19 05:57:41,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (5 of 130 remaining) [2024-11-19 05:57:41,504 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (4 of 130 remaining) [2024-11-19 05:57:41,504 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (3 of 130 remaining) [2024-11-19 05:57:41,504 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (2 of 130 remaining) [2024-11-19 05:57:41,504 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (1 of 130 remaining) [2024-11-19 05:57:41,504 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (0 of 130 remaining) [2024-11-19 05:57:41,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-19 05:57:41,504 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:57:41,510 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 05:57:41,510 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 05:57:41,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 05:57:41 BasicIcfg [2024-11-19 05:57:41,519 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 05:57:41,519 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 05:57:41,520 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 05:57:41,520 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 05:57:41,520 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:57:13" (3/4) ... [2024-11-19 05:57:41,521 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 05:57:41,524 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-19 05:57:41,524 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-19 05:57:41,534 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2024-11-19 05:57:41,535 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-19 05:57:41,535 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 05:57:41,536 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 05:57:41,641 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 05:57:41,641 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 05:57:41,641 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 05:57:41,642 INFO L158 Benchmark]: Toolchain (without parser) took 29848.57ms. Allocated memory was 184.5MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 134.7MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 298.6MB. Max. memory is 16.1GB. [2024-11-19 05:57:41,642 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 184.5MB. Free memory is still 153.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 05:57:41,642 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.74ms. Allocated memory is still 184.5MB. Free memory was 134.7MB in the beginning and 118.9MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 05:57:41,642 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.28ms. Allocated memory is still 184.5MB. Free memory was 118.9MB in the beginning and 114.8MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 05:57:41,642 INFO L158 Benchmark]: Boogie Preprocessor took 41.23ms. Allocated memory is still 184.5MB. Free memory was 114.8MB in the beginning and 110.9MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 05:57:41,643 INFO L158 Benchmark]: RCFGBuilder took 857.23ms. Allocated memory is still 184.5MB. Free memory was 110.9MB in the beginning and 62.3MB in the end (delta: 48.6MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-19 05:57:41,643 INFO L158 Benchmark]: TraceAbstraction took 28450.76ms. Allocated memory was 184.5MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 61.6MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-11-19 05:57:41,643 INFO L158 Benchmark]: Witness Printer took 121.87ms. Allocated memory is still 2.3GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-19 05:57:41,644 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 184.5MB. Free memory is still 153.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.74ms. Allocated memory is still 184.5MB. Free memory was 134.7MB in the beginning and 118.9MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.28ms. Allocated memory is still 184.5MB. Free memory was 118.9MB in the beginning and 114.8MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.23ms. Allocated memory is still 184.5MB. Free memory was 114.8MB in the beginning and 110.9MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 857.23ms. Allocated memory is still 184.5MB. Free memory was 110.9MB in the beginning and 62.3MB in the end (delta: 48.6MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 28450.76ms. Allocated memory was 184.5MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 61.6MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 121.87ms. Allocated memory is still 2.3GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 985 locations, 130 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 28.2s, OverallIterations: 39, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 23.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2821 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1256 mSDsluCounter, 822 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 472 mSDsCounter, 547 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3471 IncrementalHoareTripleChecker+Invalid, 4018 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 547 mSolverCounterUnsat, 350 mSDtfsCounter, 3471 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1502occurred in iteration=31, InterpolantAutomatonStates: 130, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 8741 NumberOfCodeBlocks, 8741 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 8702 ConstructedInterpolants, 0 QuantifiedInterpolants, 9201 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 78 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-19 05:57:41,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE