About the Execution of 2025-gold for Philosophers-COL-000500
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r223-smll-177969946300007.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool gold2025
Input is Philosophers-COL-000500, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-smll-177969946300007
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 7.7K Mar 5 10:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Mar 5 10:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Mar 5 10:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Mar 5 10:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Mar 16 08:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 16 08:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 16 08:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 16 08:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Mar 5 10:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 5 10:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Mar 5 10:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Mar 5 10:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 16 08:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 16 08:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 31K Mar 3 18:30 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME Philosophers-COL-000500-UpperBounds-00
FORMULA_NAME Philosophers-COL-000500-UpperBounds-01
FORMULA_NAME Philosophers-COL-000500-UpperBounds-02
FORMULA_NAME Philosophers-COL-000500-UpperBounds-03
FORMULA_NAME Philosophers-COL-000500-UpperBounds-04
FORMULA_NAME Philosophers-COL-000500-UpperBounds-05
FORMULA_NAME Philosophers-COL-000500-UpperBounds-06
FORMULA_NAME Philosophers-COL-000500-UpperBounds-07
FORMULA_NAME Philosophers-COL-000500-UpperBounds-08
FORMULA_NAME Philosophers-COL-000500-UpperBounds-09
FORMULA_NAME Philosophers-COL-000500-UpperBounds-10
FORMULA_NAME Philosophers-COL-000500-UpperBounds-11
FORMULA_NAME Philosophers-COL-000500-UpperBounds-12
FORMULA_NAME Philosophers-COL-000500-UpperBounds-13
FORMULA_NAME Philosophers-COL-000500-UpperBounds-14
FORMULA_NAME Philosophers-COL-000500-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779786844760
Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-000500
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202505121319
[2026-05-26 09:14:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 09:14:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 09:14:07] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2026-05-26 09:14:07] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-26 09:14:08] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1278 ms
[2026-05-26 09:14:08] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 2500 PT places and 2500.0 transition bindings in 41 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Reduction of identical properties reduced properties to check from 16 to 5
[2026-05-26 09:14:08] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 10 ms.
[2026-05-26 09:14:08] [INFO ] Skeletonized 5 HLPN properties in 0 ms.
// Phase 1: matrix 5 rows 5 cols
[2026-05-26 09:14:08] [INFO ] Computed 2 invariants in 5 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 500, 0, 500] Max Struct:[250, 500, 500, 500, 500]
FORMULA Philosophers-COL-000500-UpperBounds-13 500 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000500-UpperBounds-08 500 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000500-UpperBounds-09 500 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000500-UpperBounds-10 500 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000500-UpperBounds-03 500 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2026-05-26 09:14:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 09:14:08] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2026-05-26 09:14:08] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2026-05-26 09:14:08] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-26 09:14:08] [INFO ] Added : 1 causal constraints over 1 iterations in 26 ms. Result :sat
Minimization took 9 ms.
[2026-05-26 09:14:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 09:14:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-26 09:14:09] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2026-05-26 09:14:09] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-26 09:14:09] [INFO ] Added : 1 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 5 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 09:14:09] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-26 09:14:09] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2026-05-26 09:14:09] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-26 09:14:09] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 3 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 09:14:09] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2026-05-26 09:14:09] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2026-05-26 09:14:09] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-26 09:14:09] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0] Max Struct:[250, 500, 500]
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 500) 500) 500)]] contains successor/predecessor on variables of sort Philo
[2026-05-26 09:14:09] [INFO ] Unfolded HLPN to a Petri net with 2500 places and 2500 transitions 8000 arcs in 154 ms.
[2026-05-26 09:14:09] [INFO ] Unfolded 3 HLPN properties in 1 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0] Max Struct:[250, 500, 500]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0] Max Struct:[250, 500, 500]
// Phase 1: matrix 2500 rows 2500 cols
[2026-05-26 09:14:09] [INFO ] Computed 1000 invariants in 76 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[250, 500, 500]
RANDOM walk for 10000 steps (2 resets) in 1597 ms. (6 steps per ms)
BEST_FIRST walk for 30003 steps (6 resets) in 1004 ms. (29 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[84, 256, 209] Max Struct:[250, 500, 500]
[2026-05-26 09:14:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 09:14:13] [INFO ] [Real]Absence check using 1000 positive place invariants in 415 ms returned sat
[2026-05-26 09:14:15] [INFO ] [Real]Absence check using state equation in 1802 ms returned sat
[2026-05-26 09:14:16] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 346 ms.
[2026-05-26 09:14:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2252)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 09:14:18] [INFO ] [Real]Absence check using 1000 positive place invariants in 733 ms returned sat
[2026-05-26 09:14:20] [INFO ] [Real]Absence check using state equation in 2074 ms returned sat
[2026-05-26 09:14:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 09:14:22] [INFO ] [Nat]Absence check using 1000 positive place invariants in 729 ms returned sat
[2026-05-26 09:14:23] [INFO ] [Nat]Absence check using state equation in 1809 ms returned sat
[2026-05-26 09:14:24] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 178 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 09:14:27] [INFO ] [Real]Absence check using 1000 positive place invariants in 633 ms returned sat
[2026-05-26 09:14:28] [INFO ] [Real]Absence check using state equation in 1652 ms returned sat
[2026-05-26 09:14:29] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 189 ms.
[2026-05-26 09:14:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 09:14:32] [INFO ] [Nat]Absence check using 1000 positive place invariants in 727 ms returned sat
[2026-05-26 09:14:33] [INFO ] [Nat]Absence check using state equation in 1606 ms returned sat
[2026-05-26 09:14:34] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 210 ms.
[2026-05-26 09:14:35] [INFO ] Added : 45 causal constraints over 9 iterations in 1959 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[84, 256, 209] Max Struct:[250, 500, 500]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[84, 256, 227] Max Struct:[250, 500, 500]
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 202 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 223 ms. Remains : 2500/2500 places, 2500/2500 transitions.
[2026-05-26 09:14:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[84, 256, 227] Max Struct:[250, 500, 500]
RANDOM walk for 461452 steps (2 resets) in 30001 ms. (15 steps per ms)
FORMULA Philosophers-COL-000500-UpperBounds-07 500 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Philosophers-COL-000500-UpperBounds-11 500 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Philosophers-COL-000500-UpperBounds-12 500 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Philosophers-COL-000500-UpperBounds-14 500 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Philosophers-COL-000500-UpperBounds-06 500 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 255829 steps (0 resets) in 10023 ms. (25 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[84, 335] Max Struct:[250, 500]
[2026-05-26 09:15:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 09:15:22] [INFO ] [Real]Absence check using 1000 positive place invariants in 548 ms returned sat
[2026-05-26 09:15:24] [INFO ] [Real]Absence check using state equation in 1827 ms returned sat
[2026-05-26 09:15:25] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 277 ms.
[2026-05-26 09:15:30] [INFO ] Added : 85 causal constraints over 17 iterations in 5772 ms. Result :sat
Minimization took 1004 ms.
[2026-05-26 09:15:32] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 09:15:32] [INFO ] [Nat]Absence check using 1000 positive place invariants in 358 ms returned sat
[2026-05-26 09:15:34] [INFO ] [Nat]Absence check using state equation in 1792 ms returned sat
[2026-05-26 09:15:35] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 269 ms.
[2026-05-26 09:15:39] [INFO ] Added : 85 causal constraints over 17 iterations in 4794 ms. Result :sat
Minimization took 1122 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 09:15:42] [INFO ] [Real]Absence check using 1000 positive place invariants in 651 ms returned sat
[2026-05-26 09:15:43] [INFO ] [Real]Absence check using state equation in 1658 ms returned sat
[2026-05-26 09:15:44] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 222 ms.
[2026-05-26 09:15:47] [INFO ] Added : 41 causal constraints over 9 iterations in 2987 ms. Result :sat
Minimization took 1102 ms.
[2026-05-26 09:15:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 09:15:49] [INFO ] [Nat]Absence check using 1000 positive place invariants in 784 ms returned sat
[2026-05-26 09:15:51] [INFO ] [Nat]Absence check using state equation in 1633 ms returned sat
[2026-05-26 09:15:51] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 235 ms.
[2026-05-26 09:15:54] [INFO ] Added : 41 causal constraints over 9 iterations in 2364 ms. Result :sat
Minimization took 889 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[84, 335] Max Struct:[250, 500]
FORMULA Philosophers-COL-000500-UpperBounds-15 500 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000500-UpperBounds-01 500 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[194] Max Struct:[250]
Support contains 500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Free-agglomeration rule (complex) applied 1000 times.
Iterating global reduction 0 with 1000 rules applied. Total rules applied 1000 place count 2500 transition count 1500
Reduce places removed 1000 places and 0 transitions.
Ensure Unique test removed 500 transitions
Reduce isomorphic transitions removed 500 transitions.
Iterating post reduction 0 with 1500 rules applied. Total rules applied 2500 place count 1500 transition count 1000
Applied a total of 2500 rules in 681 ms. Remains 1500 /2500 variables (removed 1000) and now considering 1000/2500 (removed 1500) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 681 ms. Remains : 1500/2500 places, 1000/2500 transitions.
// Phase 1: matrix 1000 rows 1500 cols
[2026-05-26 09:16:14] [INFO ] Computed 1000 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[194] Max Struct:[250]
RANDOM walk for 401251 steps (1 resets) in 30001 ms. (13 steps per ms)
BEST_FIRST walk for 134276 steps (0 resets) in 5007 ms. (26 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[219] Max Struct:[250]
[2026-05-26 09:16:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 09:16:50] [INFO ] [Real]Absence check using 1000 positive place invariants in 541 ms returned sat
[2026-05-26 09:16:51] [INFO ] [Real]Absence check using state equation in 968 ms returned sat
[2026-05-26 09:16:51] [INFO ] Computed and/alt/rep : 500/500/500 causal constraints (skipped 0 transitions) in 86 ms.
[2026-05-26 09:16:51] [INFO ] Added : 0 causal constraints over 0 iterations in 252 ms. Result :sat
Minimization took 410 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[219] Max Struct:[250]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[250] Max Struct:[250]
Support contains 500 out of 1500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1500/1500 places, 1000/1000 transitions.
Applied a total of 0 rules in 56 ms. Remains 1500 /1500 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 1500/1500 places, 1000/1000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1500/1500 places, 1000/1000 transitions.
Applied a total of 0 rules in 72 ms. Remains 1500 /1500 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2026-05-26 09:16:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 09:16:56] [INFO ] Implicit Places using invariants in 2441 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 405, 406, 407, 408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499]
Discarding 500 places :
Implicit Place search using SMT only with invariants took 2451 ms to find 500 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1000/1500 places, 1000/1000 transitions.
Applied a total of 0 rules in 25 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2554 ms. Remains : 1000/1500 places, 1000/1000 transitions.
// Phase 1: matrix 1000 rows 1000 cols
[2026-05-26 09:16:56] [INFO ] Computed 500 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[250] Max Struct:[250]
FORMULA Philosophers-COL-000500-UpperBounds-02 250 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000500-UpperBounds-04 250 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000500-UpperBounds-05 250 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000500-UpperBounds-00 250 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 833135 steps (2 resets) in 30001 ms. (27 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2026-05-26 09:17:27] [INFO ] Flatten gal took : 174 ms
[2026-05-26 09:17:27] [INFO ] Flatten gal took : 114 ms
[2026-05-26 09:17:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6761465857561826171.gal : 64 ms
[2026-05-26 09:17:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16531463231729617154.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6761465857561826171.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16531463231729617154.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:188)
at java.base/java.io.BufferedInputStream.read1(BufferedInputStream.java:343)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:420)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 200527 ms.
BK_STOP 1779787047588
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-COL-000500"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool gold2025"
echo " Input is Philosophers-COL-000500, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r223-smll-177969946300007"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000500.tgz
mv Philosophers-COL-000500 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;