Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r265-tall-174931349700054.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is MedleyB-PT-B01, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-174931349700054
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 6.2K Jun 6 09:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Jun 6 09:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 6 09:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 6 09:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 12:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 12:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 12:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 9.5K Jun 6 09:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Jun 6 09:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 6 09:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Jun 6 09:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 12:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 155K Jun 5 20:08 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 MedleyB-PT-B01-UpperBounds-00
FORMULA_NAME MedleyB-PT-B01-UpperBounds-01
FORMULA_NAME MedleyB-PT-B01-UpperBounds-02
FORMULA_NAME MedleyB-PT-B01-UpperBounds-03
FORMULA_NAME MedleyB-PT-B01-UpperBounds-04
FORMULA_NAME MedleyB-PT-B01-UpperBounds-05
FORMULA_NAME MedleyB-PT-B01-UpperBounds-06
FORMULA_NAME MedleyB-PT-B01-UpperBounds-07
FORMULA_NAME MedleyB-PT-B01-UpperBounds-08
FORMULA_NAME MedleyB-PT-B01-UpperBounds-09
FORMULA_NAME MedleyB-PT-B01-UpperBounds-10
FORMULA_NAME MedleyB-PT-B01-UpperBounds-11
FORMULA_NAME MedleyB-PT-B01-UpperBounds-12
FORMULA_NAME MedleyB-PT-B01-UpperBounds-13
FORMULA_NAME MedleyB-PT-B01-UpperBounds-14
FORMULA_NAME MedleyB-PT-B01-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749318984190

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-07 17:56:25] [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]
[2025-06-07 17:56:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 17:56:25] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2025-06-07 17:56:25] [INFO ] Transformed 925 places.
[2025-06-07 17:56:25] [INFO ] Transformed 1037 transitions.
[2025-06-07 17:56:25] [INFO ] Found NUPN structural information;
[2025-06-07 17:56:25] [INFO ] Parsed PT model containing 925 places and 1037 transitions and 2433 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 1037 rows 925 cols
[2025-06-07 17:56:25] [INFO ] Computed 4 invariants in 44 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (163 resets) in 30 ms. (322 steps per ms)
FORMULA MedleyB-PT-B01-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B01-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B01-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B01-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B01-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110009 steps (448 resets) in 91 ms. (1195 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-07 17:56:25] [INFO ] Invariant cache hit.
[2025-06-07 17:56:26] [INFO ] [Real]Absence check using 4 positive place invariants in 17 ms returned sat
[2025-06-07 17:56:26] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2025-06-07 17:56:27] [INFO ] Deduced a trap composed of 396 places in 809 ms of which 132 ms to minimize.
[2025-06-07 17:56:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:56:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 15 ms returned sat
[2025-06-07 17:56:28] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2025-06-07 17:56:28] [INFO ] Deduced a trap composed of 396 places in 251 ms of which 6 ms to minimize.
[2025-06-07 17:56:28] [INFO ] Deduced a trap composed of 395 places in 228 ms of which 4 ms to minimize.
[2025-06-07 17:56:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 624 ms
[2025-06-07 17:56:28] [INFO ] Computed and/alt/rep : 995/1451/995 causal constraints (skipped 41 transitions) in 70 ms.
[2025-06-07 17:56:32] [INFO ] Deduced a trap composed of 396 places in 222 ms of which 4 ms to minimize.
[2025-06-07 17:56:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 314 ms
[2025-06-07 17:56:32] [INFO ] Added : 295 causal constraints over 59 iterations in 3600 ms. Result :sat
Minimization took 328 ms.
[2025-06-07 17:56:32] [INFO ] [Real]Absence check using 4 positive place invariants in 14 ms returned sat
[2025-06-07 17:56:33] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2025-06-07 17:56:33] [INFO ] Deduced a trap composed of 395 places in 246 ms of which 4 ms to minimize.
[2025-06-07 17:56:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:56:33] [INFO ] [Nat]Absence check using 4 positive place invariants in 16 ms returned sat
[2025-06-07 17:56:33] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2025-06-07 17:56:34] [INFO ] Deduced a trap composed of 395 places in 193 ms of which 4 ms to minimize.
[2025-06-07 17:56:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 273 ms
[2025-06-07 17:56:34] [INFO ] Computed and/alt/rep : 995/1451/995 causal constraints (skipped 41 transitions) in 46 ms.
[2025-06-07 17:56:38] [INFO ] Added : 373 causal constraints over 75 iterations in 3891 ms. Result :sat
Minimization took 369 ms.
[2025-06-07 17:56:38] [INFO ] [Real]Absence check using 4 positive place invariants in 14 ms returned sat
[2025-06-07 17:56:38] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2025-06-07 17:56:38] [INFO ] Computed and/alt/rep : 995/1451/995 causal constraints (skipped 41 transitions) in 45 ms.
[2025-06-07 17:56:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:56:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 15 ms returned sat
[2025-06-07 17:56:39] [INFO ] [Nat]Absence check using state equation in 260 ms returned sat
[2025-06-07 17:56:39] [INFO ] Computed and/alt/rep : 995/1451/995 causal constraints (skipped 41 transitions) in 52 ms.
[2025-06-07 17:56:44] [INFO ] Added : 415 causal constraints over 83 iterations in 4569 ms. Result :unknown
[2025-06-07 17:56:44] [INFO ] [Real]Absence check using 4 positive place invariants in 15 ms returned sat
[2025-06-07 17:56:44] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2025-06-07 17:56:44] [INFO ] Deduced a trap composed of 395 places in 271 ms of which 5 ms to minimize.
[2025-06-07 17:56:44] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:56:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 16 ms returned sat
[2025-06-07 17:56:45] [INFO ] [Nat]Absence check using state equation in 289 ms returned sat
[2025-06-07 17:56:45] [INFO ] Deduced a trap composed of 395 places in 264 ms of which 5 ms to minimize.
[2025-06-07 17:56:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 340 ms
[2025-06-07 17:56:45] [INFO ] Computed and/alt/rep : 995/1451/995 causal constraints (skipped 41 transitions) in 58 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2025-06-07 17:56:50] [INFO ] [Real]Absence check using 4 positive place invariants in 14 ms returned sat
[2025-06-07 17:56:50] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2025-06-07 17:56:50] [INFO ] Deduced a trap composed of 395 places in 205 ms of which 4 ms to minimize.
[2025-06-07 17:56:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:56:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 15 ms returned sat
[2025-06-07 17:56:51] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2025-06-07 17:56:51] [INFO ] Deduced a trap composed of 395 places in 201 ms of which 4 ms to minimize.
[2025-06-07 17:56:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
[2025-06-07 17:56:51] [INFO ] Computed and/alt/rep : 995/1451/995 causal constraints (skipped 41 transitions) in 46 ms.
[2025-06-07 17:56:55] [INFO ] Added : 383 causal constraints over 77 iterations in 4258 ms. Result :unknown
[2025-06-07 17:56:55] [INFO ] [Real]Absence check using 4 positive place invariants in 15 ms returned sat
[2025-06-07 17:56:56] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2025-06-07 17:56:56] [INFO ] Deduced a trap composed of 396 places in 247 ms of which 5 ms to minimize.
[2025-06-07 17:56:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:56:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 15 ms returned sat
[2025-06-07 17:56:57] [INFO ] [Nat]Absence check using state equation in 303 ms returned sat
[2025-06-07 17:56:57] [INFO ] Deduced a trap composed of 396 places in 244 ms of which 6 ms to minimize.
[2025-06-07 17:56:57] [INFO ] Deduced a trap composed of 395 places in 192 ms of which 4 ms to minimize.
[2025-06-07 17:56:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 566 ms
[2025-06-07 17:56:57] [INFO ] Computed and/alt/rep : 995/1451/995 causal constraints (skipped 41 transitions) in 55 ms.
[2025-06-07 17:57:01] [INFO ] Added : 333 causal constraints over 67 iterations in 3600 ms. Result :sat
Minimization took 364 ms.
[2025-06-07 17:57:01] [INFO ] [Real]Absence check using 4 positive place invariants in 14 ms returned sat
[2025-06-07 17:57:02] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2025-06-07 17:57:02] [INFO ] Deduced a trap composed of 396 places in 244 ms of which 5 ms to minimize.
[2025-06-07 17:57:02] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:57:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 15 ms returned sat
[2025-06-07 17:57:02] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2025-06-07 17:57:03] [INFO ] Deduced a trap composed of 396 places in 244 ms of which 5 ms to minimize.
[2025-06-07 17:57:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 324 ms
[2025-06-07 17:57:03] [INFO ] Computed and/alt/rep : 995/1451/995 causal constraints (skipped 41 transitions) in 60 ms.
[2025-06-07 17:57:06] [INFO ] Added : 293 causal constraints over 59 iterations in 3000 ms. Result :sat
Minimization took 443 ms.
[2025-06-07 17:57:06] [INFO ] [Real]Absence check using 4 positive place invariants in 15 ms returned sat
[2025-06-07 17:57:07] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2025-06-07 17:57:07] [INFO ] Deduced a trap composed of 399 places in 194 ms of which 4 ms to minimize.
[2025-06-07 17:57:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:57:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 15 ms returned sat
[2025-06-07 17:57:07] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2025-06-07 17:57:08] [INFO ] Deduced a trap composed of 399 places in 192 ms of which 4 ms to minimize.
[2025-06-07 17:57:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2025-06-07 17:57:08] [INFO ] Computed and/alt/rep : 995/1451/995 causal constraints (skipped 41 transitions) in 55 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Maximisation of solution failed !
Minimization took 0 ms.
[2025-06-07 17:57:12] [INFO ] [Real]Absence check using 4 positive place invariants in 15 ms returned sat
[2025-06-07 17:57:12] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2025-06-07 17:57:13] [INFO ] Computed and/alt/rep : 995/1451/995 causal constraints (skipped 41 transitions) in 46 ms.
[2025-06-07 17:57:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:57:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 15 ms returned sat
[2025-06-07 17:57:14] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2025-06-07 17:57:14] [INFO ] Computed and/alt/rep : 995/1451/995 causal constraints (skipped 41 transitions) in 57 ms.
[2025-06-07 17:57:15] [INFO ] Added : 69 causal constraints over 14 iterations in 822 ms. Result :sat
Minimization took 399 ms.
[2025-06-07 17:57:15] [INFO ] [Real]Absence check using 4 positive place invariants in 15 ms returned sat
[2025-06-07 17:57:15] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2025-06-07 17:57:15] [INFO ] Computed and/alt/rep : 995/1451/995 causal constraints (skipped 41 transitions) in 47 ms.
[2025-06-07 17:57:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:57:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 15 ms returned sat
[2025-06-07 17:57:16] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2025-06-07 17:57:16] [INFO ] Computed and/alt/rep : 995/1451/995 causal constraints (skipped 41 transitions) in 56 ms.
[2025-06-07 17:57:21] [INFO ] Deduced a trap composed of 487 places in 276 ms of which 9 ms to minimize.
[2025-06-07 17:57:21] [INFO ] Deduced a trap composed of 419 places in 197 ms of which 5 ms to minimize.
[2025-06-07 17:57:21] [INFO ] Deduced a trap composed of 396 places in 191 ms of which 5 ms to minimize.
[2025-06-07 17:57:21] [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 9
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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-07 17:57:21] [INFO ] [Real]Absence check using 4 positive place invariants in 15 ms returned sat
[2025-06-07 17:57:22] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2025-06-07 17:57:22] [INFO ] Deduced a trap composed of 395 places in 200 ms of which 4 ms to minimize.
[2025-06-07 17:57:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:57:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 15 ms returned sat
[2025-06-07 17:57:22] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2025-06-07 17:57:23] [INFO ] Deduced a trap composed of 395 places in 203 ms of which 4 ms to minimize.
[2025-06-07 17:57:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2025-06-07 17:57:23] [INFO ] Computed and/alt/rep : 995/1451/995 causal constraints (skipped 41 transitions) in 48 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA MedleyB-PT-B01-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 1, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 10 out of 925 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 925/925 places, 1037/1037 transitions.
Graph (trivial) has 900 edges and 925 vertex of which 49 / 925 are part of one of the 8 SCC in 5 ms
Free SCC test removed 41 places
Drop transitions (Empty/Sink Transition effects.) removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Graph (complete) has 1186 edges and 884 vertex of which 878 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 685 transitions
Trivial Post-agglo rules discarded 685 transitions
Performed 685 trivial Post agglomeration. Transition count delta: 685
Iterating post reduction 0 with 688 rules applied. Total rules applied 690 place count 878 transition count 293
Reduce places removed 685 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 702 rules applied. Total rules applied 1392 place count 193 transition count 276
Reduce places removed 6 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 13 rules applied. Total rules applied 1405 place count 187 transition count 269
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 1412 place count 180 transition count 269
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 33 Pre rules applied. Total rules applied 1412 place count 180 transition count 236
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 1478 place count 147 transition count 236
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 1513 place count 112 transition count 201
Iterating global reduction 4 with 35 rules applied. Total rules applied 1548 place count 112 transition count 201
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1548 place count 112 transition count 200
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1550 place count 111 transition count 200
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 1569 place count 92 transition count 144
Iterating global reduction 4 with 19 rules applied. Total rules applied 1588 place count 92 transition count 144
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1597 place count 92 transition count 135
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1602 place count 87 transition count 130
Iterating global reduction 5 with 5 rules applied. Total rules applied 1607 place count 87 transition count 130
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1610 place count 84 transition count 127
Iterating global reduction 5 with 3 rules applied. Total rules applied 1613 place count 84 transition count 127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1616 place count 84 transition count 124
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 1642 place count 71 transition count 111
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1643 place count 71 transition count 110
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1646 place count 68 transition count 107
Iterating global reduction 7 with 3 rules applied. Total rules applied 1649 place count 68 transition count 107
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1652 place count 65 transition count 104
Iterating global reduction 7 with 3 rules applied. Total rules applied 1655 place count 65 transition count 104
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1658 place count 62 transition count 101
Iterating global reduction 7 with 3 rules applied. Total rules applied 1661 place count 62 transition count 101
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1669 place count 58 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1670 place count 58 transition count 113
Free-agglomeration rule applied 19 times with reduction of 3 identical transitions.
Iterating global reduction 8 with 19 rules applied. Total rules applied 1689 place count 58 transition count 91
Reduce places removed 19 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 23 rules applied. Total rules applied 1712 place count 39 transition count 87
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1713 place count 38 transition count 86
Iterating global reduction 9 with 1 rules applied. Total rules applied 1714 place count 38 transition count 86
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 9 with 12 rules applied. Total rules applied 1726 place count 38 transition count 74
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 1730 place count 38 transition count 74
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1732 place count 38 transition count 72
Applied a total of 1732 rules in 101 ms. Remains 38 /925 variables (removed 887) and now considering 72/1037 (removed 965) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 38/925 places, 72/1037 transitions.
// Phase 1: matrix 72 rows 38 cols
[2025-06-07 17:57:27] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 1, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA MedleyB-PT-B01-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 881 ms. (1133 steps per ms)
FORMULA MedleyB-PT-B01-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B01-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B01-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B01-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B01-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B01-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B01-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B01-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B01-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 300 ms. (3322 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 )
[2025-06-07 17:57:29] [INFO ] Flatten gal took : 29 ms
[2025-06-07 17:57:29] [INFO ] Flatten gal took : 9 ms
[2025-06-07 17:57:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality751007931345230399.gal : 6 ms
[2025-06-07 17:57:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2881845123002811375.prop : 0 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality751007931345230399.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2881845123002811375.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
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 63754 ms.

BK_STOP 1749319049281

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="MedleyB-PT-B01"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is MedleyB-PT-B01, 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 r265-tall-174931349700054"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyB-PT-B01.tgz
mv MedleyB-PT-B01 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;