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.r139-smll-174876533200034.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 MedleyA-PT-22, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-smll-174876533200034
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 238K May 29 14:32 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 MedleyA-PT-22-UpperBounds-00
FORMULA_NAME MedleyA-PT-22-UpperBounds-01
FORMULA_NAME MedleyA-PT-22-UpperBounds-02
FORMULA_NAME MedleyA-PT-22-UpperBounds-03
FORMULA_NAME MedleyA-PT-22-UpperBounds-04
FORMULA_NAME MedleyA-PT-22-UpperBounds-05
FORMULA_NAME MedleyA-PT-22-UpperBounds-06
FORMULA_NAME MedleyA-PT-22-UpperBounds-07
FORMULA_NAME MedleyA-PT-22-UpperBounds-08
FORMULA_NAME MedleyA-PT-22-UpperBounds-09
FORMULA_NAME MedleyA-PT-22-UpperBounds-10
FORMULA_NAME MedleyA-PT-22-UpperBounds-11
FORMULA_NAME MedleyA-PT-22-UpperBounds-12
FORMULA_NAME MedleyA-PT-22-UpperBounds-13
FORMULA_NAME MedleyA-PT-22-UpperBounds-14
FORMULA_NAME MedleyA-PT-22-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748896382364

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-22
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 20:33:04] [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-02 20:33:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 20:33:04] [INFO ] Load time of PNML (sax parser for PT used): 208 ms
[2025-06-02 20:33:04] [INFO ] Transformed 307 places.
[2025-06-02 20:33:04] [INFO ] Transformed 740 transitions.
[2025-06-02 20:33:04] [INFO ] Found NUPN structural information;
[2025-06-02 20:33:04] [INFO ] Parsed PT model containing 307 places and 740 transitions and 3829 arcs in 391 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 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 740 rows 307 cols
[2025-06-02 20:33:04] [INFO ] Computed 24 invariants in 49 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 (285 resets) in 81 ms. (121 steps per ms)
FORMULA MedleyA-PT-22-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-22-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-22-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-22-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-22-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-22-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-22-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-22-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80006 steps (476 resets) in 220 ms. (362 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-02 20:33:05] [INFO ] Invariant cache hit.
[2025-06-02 20:33:05] [INFO ] [Real]Absence check using 10 positive place invariants in 30 ms returned sat
[2025-06-02 20:33:05] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 18 ms returned sat
[2025-06-02 20:33:06] [INFO ] [Real]Absence check using state equation in 507 ms returned sat
[2025-06-02 20:33:07] [INFO ] Deduced a trap composed of 36 places in 625 ms of which 76 ms to minimize.
[2025-06-02 20:33:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:33:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2025-06-02 20:33:07] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 10 ms returned sat
[2025-06-02 20:33:07] [INFO ] [Nat]Absence check using state equation in 327 ms returned sat
[2025-06-02 20:33:08] [INFO ] Deduced a trap composed of 36 places in 357 ms of which 4 ms to minimize.
[2025-06-02 20:33:08] [INFO ] Deduced a trap composed of 40 places in 307 ms of which 4 ms to minimize.
[2025-06-02 20:33:08] [INFO ] Deduced a trap composed of 41 places in 212 ms of which 4 ms to minimize.
[2025-06-02 20:33:09] [INFO ] Deduced a trap composed of 45 places in 271 ms of which 3 ms to minimize.
[2025-06-02 20:33:09] [INFO ] Deduced a trap composed of 77 places in 312 ms of which 4 ms to minimize.
[2025-06-02 20:33:09] [INFO ] Deduced a trap composed of 41 places in 213 ms of which 3 ms to minimize.
[2025-06-02 20:33:10] [INFO ] Deduced a trap composed of 51 places in 201 ms of which 2 ms to minimize.
[2025-06-02 20:33:10] [INFO ] Deduced a trap composed of 54 places in 190 ms of which 3 ms to minimize.
[2025-06-02 20:33:10] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 2 ms to minimize.
[2025-06-02 20:33:10] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2568 ms
[2025-06-02 20:33:10] [INFO ] Computed and/alt/rep : 188/493/188 causal constraints (skipped 551 transitions) in 146 ms.
[2025-06-02 20:33:11] [INFO ] Deduced a trap composed of 48 places in 228 ms of which 3 ms to minimize.
[2025-06-02 20:33:11] [INFO ] Deduced a trap composed of 35 places in 240 ms of which 3 ms to minimize.
[2025-06-02 20:33:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 588 ms
[2025-06-02 20:33:11] [INFO ] Added : 56 causal constraints over 12 iterations in 1485 ms. Result :sat
Minimization took 381 ms.
[2025-06-02 20:33:12] [INFO ] [Real]Absence check using 10 positive place invariants in 17 ms returned sat
[2025-06-02 20:33:12] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 12 ms returned sat
[2025-06-02 20:33:12] [INFO ] [Real]Absence check using state equation in 374 ms returned sat
[2025-06-02 20:33:13] [INFO ] Deduced a trap composed of 36 places in 255 ms of which 3 ms to minimize.
[2025-06-02 20:33:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:33:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2025-06-02 20:33:13] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 11 ms returned sat
[2025-06-02 20:33:13] [INFO ] [Nat]Absence check using state equation in 336 ms returned sat
[2025-06-02 20:33:13] [INFO ] Deduced a trap composed of 36 places in 234 ms of which 3 ms to minimize.
[2025-06-02 20:33:14] [INFO ] Deduced a trap composed of 46 places in 257 ms of which 3 ms to minimize.
[2025-06-02 20:33:14] [INFO ] Deduced a trap composed of 59 places in 245 ms of which 3 ms to minimize.
[2025-06-02 20:33:14] [INFO ] Deduced a trap composed of 44 places in 150 ms of which 2 ms to minimize.
[2025-06-02 20:33:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1043 ms
[2025-06-02 20:33:14] [INFO ] Computed and/alt/rep : 188/493/188 causal constraints (skipped 551 transitions) in 103 ms.
[2025-06-02 20:33:16] [INFO ] Deduced a trap composed of 42 places in 300 ms of which 3 ms to minimize.
[2025-06-02 20:33:16] [INFO ] Deduced a trap composed of 60 places in 263 ms of which 3 ms to minimize.
[2025-06-02 20:33:16] [INFO ] Deduced a trap composed of 36 places in 280 ms of which 3 ms to minimize.
[2025-06-02 20:33:16] [INFO ] Deduced a trap composed of 40 places in 237 ms of which 3 ms to minimize.
[2025-06-02 20:33:17] [INFO ] Deduced a trap composed of 39 places in 267 ms of which 3 ms to minimize.
[2025-06-02 20:33:17] [INFO ] Deduced a trap composed of 33 places in 251 ms of which 3 ms to minimize.
[2025-06-02 20:33:17] [INFO ] Deduced a trap composed of 74 places in 183 ms of which 4 ms to minimize.
[2025-06-02 20:33:17] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 2 ms to minimize.
[2025-06-02 20:33:18] [INFO ] Deduced a trap composed of 72 places in 140 ms of which 2 ms to minimize.
Maximisation of solution failed !
Minimization took 1 ms.
[2025-06-02 20:33:18] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2025-06-02 20:33:18] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 15 ms returned sat
[2025-06-02 20:33:18] [INFO ] [Real]Absence check using state equation in 308 ms returned sat
[2025-06-02 20:33:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:33:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 19 ms returned sat
[2025-06-02 20:33:18] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 11 ms returned sat
[2025-06-02 20:33:19] [INFO ] [Nat]Absence check using state equation in 299 ms returned sat
[2025-06-02 20:33:19] [INFO ] Computed and/alt/rep : 188/493/188 causal constraints (skipped 551 transitions) in 92 ms.
[2025-06-02 20:33:20] [INFO ] Deduced a trap composed of 33 places in 322 ms of which 5 ms to minimize.
[2025-06-02 20:33:21] [INFO ] Deduced a trap composed of 44 places in 185 ms of which 4 ms to minimize.
[2025-06-02 20:33:21] [INFO ] Deduced a trap composed of 39 places in 190 ms of which 2 ms to minimize.
[2025-06-02 20:33:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 923 ms
[2025-06-02 20:33:21] [INFO ] Added : 87 causal constraints over 18 iterations in 2328 ms. Result :sat
Minimization took 522 ms.
[2025-06-02 20:33:22] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2025-06-02 20:33:22] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 9 ms returned sat
[2025-06-02 20:33:22] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2025-06-02 20:33:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:33:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned sat
[2025-06-02 20:33:22] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 11 ms returned sat
[2025-06-02 20:33:22] [INFO ] [Nat]Absence check using state equation in 331 ms returned sat
[2025-06-02 20:33:23] [INFO ] Deduced a trap composed of 52 places in 215 ms of which 3 ms to minimize.
[2025-06-02 20:33:23] [INFO ] Deduced a trap composed of 39 places in 176 ms of which 2 ms to minimize.
[2025-06-02 20:33:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 493 ms
[2025-06-02 20:33:23] [INFO ] Computed and/alt/rep : 188/493/188 causal constraints (skipped 551 transitions) in 74 ms.
[2025-06-02 20:33:24] [INFO ] Deduced a trap composed of 33 places in 284 ms of which 4 ms to minimize.
[2025-06-02 20:33:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 370 ms
[2025-06-02 20:33:24] [INFO ] Added : 80 causal constraints over 17 iterations in 1420 ms. Result :sat
Minimization took 462 ms.
[2025-06-02 20:33:25] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2025-06-02 20:33:25] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 14 ms returned sat
[2025-06-02 20:33:25] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2025-06-02 20:33:25] [INFO ] Deduced a trap composed of 36 places in 205 ms of which 4 ms to minimize.
[2025-06-02 20:33:26] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:33:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2025-06-02 20:33:26] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 11 ms returned sat
[2025-06-02 20:33:26] [INFO ] [Nat]Absence check using state equation in 310 ms returned sat
[2025-06-02 20:33:26] [INFO ] Deduced a trap composed of 36 places in 181 ms of which 2 ms to minimize.
[2025-06-02 20:33:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2025-06-02 20:33:26] [INFO ] Computed and/alt/rep : 188/493/188 causal constraints (skipped 551 transitions) in 93 ms.
[2025-06-02 20:33:28] [INFO ] Deduced a trap composed of 65 places in 286 ms of which 3 ms to minimize.
[2025-06-02 20:33:28] [INFO ] Deduced a trap composed of 37 places in 302 ms of which 3 ms to minimize.
[2025-06-02 20:33:28] [INFO ] Deduced a trap composed of 60 places in 318 ms of which 3 ms to minimize.
[2025-06-02 20:33:29] [INFO ] Deduced a trap composed of 32 places in 260 ms of which 3 ms to minimize.
[2025-06-02 20:33:29] [INFO ] Deduced a trap composed of 49 places in 249 ms of which 3 ms to minimize.
[2025-06-02 20:33:29] [INFO ] Deduced a trap composed of 65 places in 230 ms of which 3 ms to minimize.
[2025-06-02 20:33:30] [INFO ] Deduced a trap composed of 41 places in 309 ms of which 3 ms to minimize.
[2025-06-02 20:33:30] [INFO ] Deduced a trap composed of 39 places in 327 ms of which 4 ms to minimize.
[2025-06-02 20:33:30] [INFO ] Deduced a trap composed of 46 places in 180 ms of which 2 ms to minimize.
[2025-06-02 20:33:31] [INFO ] Deduced a trap composed of 58 places in 236 ms of which 3 ms to minimize.
[2025-06-02 20:33:31] [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 4
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-02 20:33:31] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-02 20:33:31] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 8 ms returned sat
[2025-06-02 20:33:31] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2025-06-02 20:33:31] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:33:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2025-06-02 20:33:31] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 11 ms returned sat
[2025-06-02 20:33:31] [INFO ] [Nat]Absence check using state equation in 352 ms returned sat
[2025-06-02 20:33:32] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 2 ms to minimize.
[2025-06-02 20:33:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2025-06-02 20:33:32] [INFO ] Computed and/alt/rep : 188/493/188 causal constraints (skipped 551 transitions) in 69 ms.
[2025-06-02 20:33:33] [INFO ] Deduced a trap composed of 43 places in 203 ms of which 4 ms to minimize.
[2025-06-02 20:33:33] [INFO ] Deduced a trap composed of 42 places in 217 ms of which 3 ms to minimize.
[2025-06-02 20:33:33] [INFO ] Deduced a trap composed of 38 places in 147 ms of which 2 ms to minimize.
[2025-06-02 20:33:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 745 ms
[2025-06-02 20:33:33] [INFO ] Added : 59 causal constraints over 12 iterations in 1558 ms. Result :sat
Minimization took 443 ms.
[2025-06-02 20:33:34] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2025-06-02 20:33:34] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 10 ms returned sat
[2025-06-02 20:33:34] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2025-06-02 20:33:34] [INFO ] Computed and/alt/rep : 188/493/188 causal constraints (skipped 551 transitions) in 83 ms.
[2025-06-02 20:33:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:33:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2025-06-02 20:33:35] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 8 ms returned sat
[2025-06-02 20:33:35] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2025-06-02 20:33:35] [INFO ] Computed and/alt/rep : 188/493/188 causal constraints (skipped 551 transitions) in 61 ms.
[2025-06-02 20:33:36] [INFO ] Deduced a trap composed of 42 places in 227 ms of which 4 ms to minimize.
[2025-06-02 20:33:36] [INFO ] Deduced a trap composed of 40 places in 288 ms of which 4 ms to minimize.
[2025-06-02 20:33:37] [INFO ] Deduced a trap composed of 40 places in 278 ms of which 5 ms to minimize.
[2025-06-02 20:33:37] [INFO ] Deduced a trap composed of 38 places in 257 ms of which 2 ms to minimize.
[2025-06-02 20:33:37] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 2 ms to minimize.
[2025-06-02 20:33:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1379 ms
[2025-06-02 20:33:37] [INFO ] Added : 85 causal constraints over 19 iterations in 2299 ms. Result :sat
Minimization took 453 ms.
[2025-06-02 20:33:38] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2025-06-02 20:33:38] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 10 ms returned sat
[2025-06-02 20:33:38] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2025-06-02 20:33:38] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 1 ms to minimize.
[2025-06-02 20:33:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:33:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2025-06-02 20:33:39] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 8 ms returned sat
[2025-06-02 20:33:39] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2025-06-02 20:33:39] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 1 ms to minimize.
[2025-06-02 20:33:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2025-06-02 20:33:39] [INFO ] Computed and/alt/rep : 188/493/188 causal constraints (skipped 551 transitions) in 71 ms.
[2025-06-02 20:33:40] [INFO ] Deduced a trap composed of 42 places in 143 ms of which 2 ms to minimize.
[2025-06-02 20:33:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2025-06-02 20:33:40] [INFO ] Added : 81 causal constraints over 17 iterations in 1184 ms. Result :sat
Minimization took 456 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
FORMULA MedleyA-PT-22-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-22-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-22-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 307 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 307/307 places, 740/740 transitions.
Graph (complete) has 1184 edges and 307 vertex of which 300 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.6 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 300 transition count 683
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 117 place count 247 transition count 674
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 117 place count 247 transition count 670
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 125 place count 243 transition count 670
Discarding 69 places :
Symmetric choice reduction at 2 with 69 rule applications. Total rules 194 place count 174 transition count 584
Iterating global reduction 2 with 69 rules applied. Total rules applied 263 place count 174 transition count 584
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 263 place count 174 transition count 581
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 269 place count 171 transition count 581
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 294 place count 146 transition count 518
Iterating global reduction 2 with 25 rules applied. Total rules applied 319 place count 146 transition count 518
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 330 place count 135 transition count 490
Iterating global reduction 2 with 11 rules applied. Total rules applied 341 place count 135 transition count 490
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 345 place count 131 transition count 478
Iterating global reduction 2 with 4 rules applied. Total rules applied 349 place count 131 transition count 478
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 393 place count 109 transition count 456
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 396 place count 106 transition count 453
Iterating global reduction 2 with 3 rules applied. Total rules applied 399 place count 106 transition count 453
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 409 place count 101 transition count 484
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 2 with 22 rules applied. Total rules applied 431 place count 101 transition count 462
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 433 place count 100 transition count 472
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 439 place count 100 transition count 466
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 445 place count 94 transition count 466
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 461 place count 94 transition count 609
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 3 with 37 rules applied. Total rules applied 498 place count 78 transition count 588
Applied a total of 498 rules in 296 ms. Remains 78 /307 variables (removed 229) and now considering 588/740 (removed 152) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 311 ms. Remains : 78/307 places, 588/740 transitions.
[2025-06-02 20:33:42] [INFO ] Flow matrix only has 480 transitions (discarded 108 similar events)
// Phase 1: matrix 480 rows 78 cols
[2025-06-02 20:33:42] [INFO ] Computed 23 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (192689 resets) in 9175 ms. (108 steps per ms)
FORMULA MedleyA-PT-22-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-22-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-22-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-22-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-22-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (27438 resets) in 1599 ms. (625 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-02 20:33:53] [INFO ] Flatten gal took : 246 ms
[2025-06-02 20:33:53] [INFO ] Flatten gal took : 150 ms
[2025-06-02 20:33:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4039552686629843277.gal : 42 ms
[2025-06-02 20:33:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18201911796116571072.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/ReachabilityCardinality4039552686629843277.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18201911796116571072.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
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 49454 ms.

BK_STOP 1748896433916

--------------------
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="MedleyA-PT-22"
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 MedleyA-PT-22, 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 r139-smll-174876533200034"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-22.tgz
mv MedleyA-PT-22 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 ;