Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524200269.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 itstools
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 r128-smll-174876524200269
=====================================================================

--------------------
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 1748897846128

Invoking MCC driver with
BK_TOOL=itstools
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 202505121319
[2025-06-02 20:57:28] [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:57:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 20:57:29] [INFO ] Load time of PNML (sax parser for PT used): 266 ms
[2025-06-02 20:57:29] [INFO ] Transformed 307 places.
[2025-06-02 20:57:29] [INFO ] Transformed 740 transitions.
[2025-06-02 20:57:29] [INFO ] Found NUPN structural information;
[2025-06-02 20:57:29] [INFO ] Parsed PT model containing 307 places and 740 transitions and 3829 arcs in 507 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 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:57:29] [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 (289 resets) in 145 ms. (68 steps per ms)
FORMULA MedleyA-PT-22-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-22-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-22-UpperBounds-06 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-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-22-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80007 steps (481 resets) in 359 ms. (222 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:57:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:57:30] [INFO ] [Real]Absence check using 10 positive place invariants in 27 ms returned sat
[2025-06-02 20:57:30] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 17 ms returned sat
[2025-06-02 20:57:31] [INFO ] [Real]Absence check using state equation in 651 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:32] [INFO ] Deduced a trap composed of 20 places in 395 ms of which 42 ms to minimize.
[2025-06-02 20:57:32] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:57:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 25 ms returned sat
[2025-06-02 20:57:32] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 14 ms returned sat
[2025-06-02 20:57:32] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2025-06-02 20:57:33] [INFO ] Computed and/alt/rep : 188/493/188 causal constraints (skipped 551 transitions) in 154 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:34] [INFO ] Deduced a trap composed of 32 places in 512 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:35] [INFO ] Deduced a trap composed of 33 places in 486 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:35] [INFO ] Deduced a trap composed of 33 places in 347 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:36] [INFO ] Deduced a trap composed of 28 places in 320 ms of which 34 ms to minimize.
[2025-06-02 20:57:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2125 ms
[2025-06-02 20:57:36] [INFO ] Added : 85 causal constraints over 18 iterations in 3806 ms. Result :sat
Minimization took 454 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:57:37] [INFO ] [Real]Absence check using 10 positive place invariants in 18 ms returned sat
[2025-06-02 20:57:37] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 13 ms returned sat
[2025-06-02 20:57:37] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2025-06-02 20:57:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:57:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 20 ms returned sat
[2025-06-02 20:57:37] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 15 ms returned sat
[2025-06-02 20:57:38] [INFO ] [Nat]Absence check using state equation in 400 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:38] [INFO ] Deduced a trap composed of 34 places in 478 ms of which 55 ms to minimize.
[2025-06-02 20:57:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 570 ms
[2025-06-02 20:57:39] [INFO ] Computed and/alt/rep : 188/493/188 causal constraints (skipped 551 transitions) in 121 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:40] [INFO ] Deduced a trap composed of 33 places in 466 ms of which 51 ms to minimize.
[2025-06-02 20:57:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 585 ms
[2025-06-02 20:57:40] [INFO ] Added : 80 causal constraints over 17 iterations in 1970 ms. Result :sat
Minimization took 519 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:57:41] [INFO ] [Real]Absence check using 10 positive place invariants in 18 ms returned sat
[2025-06-02 20:57:41] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 13 ms returned sat
[2025-06-02 20:57:42] [INFO ] [Real]Absence check using state equation in 453 ms returned sat
[2025-06-02 20:57:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:57:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned sat
[2025-06-02 20:57:42] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 11 ms returned sat
[2025-06-02 20:57:42] [INFO ] [Nat]Absence check using state equation in 400 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:43] [INFO ] Deduced a trap composed of 21 places in 486 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:43] [INFO ] Deduced a trap composed of 34 places in 588 ms of which 71 ms to minimize.
[2025-06-02 20:57:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1193 ms
[2025-06-02 20:57:43] [INFO ] Computed and/alt/rep : 188/493/188 causal constraints (skipped 551 transitions) in 106 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:45] [INFO ] Deduced a trap composed of 33 places in 211 ms of which 30 ms to minimize.
[2025-06-02 20:57:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 341 ms
[2025-06-02 20:57:45] [INFO ] Added : 96 causal constraints over 21 iterations in 2123 ms. Result :sat
Minimization took 502 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:57:46] [INFO ] [Real]Absence check using 10 positive place invariants in 17 ms returned sat
[2025-06-02 20:57:46] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 15 ms returned sat
[2025-06-02 20:57:47] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2025-06-02 20:57:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:57:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2025-06-02 20:57:47] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 12 ms returned sat
[2025-06-02 20:57:47] [INFO ] [Nat]Absence check using state equation in 379 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:48] [INFO ] Deduced a trap composed of 34 places in 502 ms of which 58 ms to minimize.
[2025-06-02 20:57:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 588 ms
[2025-06-02 20:57:48] [INFO ] Computed and/alt/rep : 188/493/188 causal constraints (skipped 551 transitions) in 93 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:50] [INFO ] Deduced a trap composed of 32 places in 523 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:50] [INFO ] Deduced a trap composed of 27 places in 454 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:51] [INFO ] Deduced a trap composed of 33 places in 445 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:51] [INFO ] Deduced a trap composed of 33 places in 524 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:52] [INFO ] Deduced a trap composed of 33 places in 310 ms of which 26 ms to minimize.
[2025-06-02 20:57:52] [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 3
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.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1131)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
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
[2025-06-02 20:57:52] [INFO ] [Real]Absence check using 10 positive place invariants in 17 ms returned sat
[2025-06-02 20:57:52] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 13 ms returned sat
[2025-06-02 20:57:52] [INFO ] [Real]Absence check using state equation in 384 ms returned sat
[2025-06-02 20:57:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:57:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned sat
[2025-06-02 20:57:52] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 14 ms returned sat
[2025-06-02 20:57:53] [INFO ] [Nat]Absence check using state equation in 400 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:54] [INFO ] Deduced a trap composed of 34 places in 573 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:54] [INFO ] Deduced a trap composed of 34 places in 496 ms of which 56 ms to minimize.
[2025-06-02 20:57:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1189 ms
[2025-06-02 20:57:54] [INFO ] Computed and/alt/rep : 188/493/188 causal constraints (skipped 551 transitions) in 89 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:56] [INFO ] Deduced a trap composed of 21 places in 426 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:56] [INFO ] Deduced a trap composed of 32 places in 279 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:56] [INFO ] Deduced a trap composed of 33 places in 179 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:57] [INFO ] Deduced a trap composed of 33 places in 198 ms of which 21 ms to minimize.
[2025-06-02 20:57:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1367 ms
[2025-06-02 20:57:57] [INFO ] Added : 81 causal constraints over 17 iterations in 2793 ms. Result :sat
Minimization took 452 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:57:57] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-02 20:57:57] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 8 ms returned sat
[2025-06-02 20:57:58] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:58] [INFO ] Deduced a trap composed of 20 places in 367 ms of which 30 ms to minimize.
[2025-06-02 20:57:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:57:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2025-06-02 20:57:58] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 10 ms returned sat
[2025-06-02 20:57:59] [INFO ] [Nat]Absence check using state equation in 296 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:59] [INFO ] Deduced a trap composed of 34 places in 208 ms of which 29 ms to minimize.
[2025-06-02 20:57:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
[2025-06-02 20:57:59] [INFO ] Computed and/alt/rep : 188/493/188 causal constraints (skipped 551 transitions) in 81 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:58:01] [INFO ] Deduced a trap composed of 32 places in 491 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:58:01] [INFO ] Deduced a trap composed of 33 places in 392 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:58:01] [INFO ] Deduced a trap composed of 33 places in 294 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:58:02] [INFO ] Deduced a trap composed of 33 places in 242 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:58:02] [INFO ] Deduced a trap composed of 33 places in 257 ms of which 35 ms to minimize.
[2025-06-02 20:58:02] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2055 ms
[2025-06-02 20:58:03] [INFO ] Added : 99 causal constraints over 22 iterations in 3668 ms. Result :sat
Minimization took 503 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:58:03] [INFO ] [Real]Absence check using 10 positive place invariants in 17 ms returned sat
[2025-06-02 20:58:03] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 17 ms returned sat
[2025-06-02 20:58:04] [INFO ] [Real]Absence check using state equation in 366 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:58:04] [INFO ] Deduced a trap composed of 34 places in 244 ms of which 34 ms to minimize.
[2025-06-02 20:58:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:58:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned sat
[2025-06-02 20:58:04] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 14 ms returned sat
[2025-06-02 20:58:05] [INFO ] [Nat]Absence check using state equation in 390 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:58:05] [INFO ] Deduced a trap composed of 20 places in 278 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:58:05] [INFO ] Deduced a trap composed of 34 places in 482 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:58:06] [INFO ] Deduced a trap composed of 34 places in 262 ms of which 34 ms to minimize.
[2025-06-02 20:58:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1169 ms
[2025-06-02 20:58:06] [INFO ] Computed and/alt/rep : 188/493/188 causal constraints (skipped 551 transitions) in 76 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:58:08] [INFO ] Deduced a trap composed of 32 places in 326 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:58:08] [INFO ] Deduced a trap composed of 33 places in 219 ms of which 30 ms to minimize.
[2025-06-02 20:58:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 760 ms
[2025-06-02 20:58:08] [INFO ] Added : 100 causal constraints over 22 iterations in 2621 ms. Result :sat
Minimization took 509 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:58:09] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2025-06-02 20:58:09] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 13 ms returned sat
[2025-06-02 20:58:09] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:58:10] [INFO ] Deduced a trap composed of 26 places in 520 ms of which 67 ms to minimize.
[2025-06-02 20:58:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:58:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2025-06-02 20:58:10] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 14 ms returned sat
[2025-06-02 20:58:11] [INFO ] [Nat]Absence check using state equation in 375 ms returned sat
[2025-06-02 20:58:11] [INFO ] Computed and/alt/rep : 188/493/188 causal constraints (skipped 551 transitions) in 81 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:58:13] [INFO ] Deduced a trap composed of 32 places in 458 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:58:13] [INFO ] Deduced a trap composed of 33 places in 243 ms of which 33 ms to minimize.
[2025-06-02 20:58:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 957 ms
[2025-06-02 20:58:13] [INFO ] Added : 89 causal constraints over 21 iterations in 2830 ms. Result :sat
Minimization took 504 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]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Support contains 8 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.9 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 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 300 transition count 684
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 114 place count 248 transition count 676
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 114 place count 248 transition count 672
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 122 place count 244 transition count 672
Discarding 67 places :
Symmetric choice reduction at 2 with 67 rule applications. Total rules 189 place count 177 transition count 590
Iterating global reduction 2 with 67 rules applied. Total rules applied 256 place count 177 transition count 590
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 256 place count 177 transition count 587
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 262 place count 174 transition count 587
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 285 place count 151 transition count 533
Iterating global reduction 2 with 23 rules applied. Total rules applied 308 place count 151 transition count 533
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 316 place count 143 transition count 513
Iterating global reduction 2 with 8 rules applied. Total rules applied 324 place count 143 transition count 513
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 327 place count 140 transition count 504
Iterating global reduction 2 with 3 rules applied. Total rules applied 330 place count 140 transition count 504
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 374 place count 118 transition count 482
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 377 place count 115 transition count 479
Iterating global reduction 2 with 3 rules applied. Total rules applied 380 place count 115 transition count 479
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 390 place count 110 transition count 514
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 2 with 27 rules applied. Total rules applied 417 place count 110 transition count 487
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 419 place count 109 transition count 497
Free-agglomeration rule applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 426 place count 109 transition count 490
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 433 place count 102 transition count 490
Free-agglomeration rule (complex) applied 17 times with reduction of 8 identical transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 450 place count 102 transition count 695
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 3 with 38 rules applied. Total rules applied 488 place count 85 transition count 674
Applied a total of 488 rules in 468 ms. Remains 85 /307 variables (removed 222) and now considering 674/740 (removed 66) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 486 ms. Remains : 85/307 places, 674/740 transitions.
[2025-06-02 20:58:14] [INFO ] Flow matrix only has 566 transitions (discarded 108 similar events)
// Phase 1: matrix 566 rows 85 cols
[2025-06-02 20:58:14] [INFO ] Computed 23 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (192148 resets) in 10542 ms. (94 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-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-22-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-22-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-22-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-22-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (27544 resets) in 1707 ms. (585 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 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:58:27] [INFO ] Flatten gal took : 267 ms
[2025-06-02 20:58:27] [INFO ] Flatten gal took : 161 ms
[2025-06-02 20:58:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9257168294065647120.gal : 79 ms
[2025-06-02 20:58:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9560310532868712718.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9257168294065647120.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9560310532868712718.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 59407 ms.

BK_STOP 1748897908263

--------------------
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="MedleyA-PT-22"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
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 r128-smll-174876524200269"
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 ;