Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r162-smll-177961107700129.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is IOTPpurchase-PT-C12M10P15D17, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-177961107700129
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.7K Mar 7 17:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 7 17:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Mar 7 17:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 7 17:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Mar 15 11:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 11:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 11:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 11:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 7 17:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Mar 7 17:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 7 17:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Mar 7 17:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 15 11:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 15 11:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rwxr-xr-x 1 mcc users 60K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-2024-00
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-2024-01
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-2024-02
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-2024-03
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-2024-04
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-2024-05
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-2024-06
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-2024-07
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-2024-08
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-2024-09
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-2024-10
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-2024-11
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-2024-12
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-2024-13
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-2024-14
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779729032406

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IOTPpurchase-PT-C12M10P15D17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-25 17:10:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 17:10:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 17:10:35] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2026-05-25 17:10:35] [INFO ] Transformed 111 places.
[2026-05-25 17:10:35] [INFO ] Transformed 45 transitions.
[2026-05-25 17:10:35] [INFO ] Parsed PT model containing 111 places and 45 transitions and 224 arcs in 360 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 30 ms.
Support contains 84 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 100 transition count 45
Applied a total of 11 rules in 43 ms. Remains 100 /111 variables (removed 11) and now considering 45/45 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7002867537906974358.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18440854709462932720.kers'
[2026-05-25 17:10:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7002867537906974358.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18440854709462932720.kers]
Culling duplicate invariants (modulo rational): removing 40 columns.
Culled 40 columns in 0 ms.
// Phase 1: matrix 45 rows 60 cols 120 entries
Finished phase 1 with 35 SingleSign rule and 9 generalized
[2026-05-25 17:10:35] [INFO ] Computed 56 invariants in 1 ms
Computed 56 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-18440854709462932720.kers
Total runtime 2 ms.
[2026-05-25 17:10:35] [INFO ] Implicit Places using invariants in 495 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 565 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/111 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 643 ms. Remains : 99/111 places, 45/45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1254989923110263239.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15702328762973747247.kers'
[2026-05-25 17:10:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1254989923110263239.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15702328762973747247.kers]
Culling duplicate invariants (modulo rational): removing 40 columns.
Culled 40 columns in 0 ms.
// Phase 1: matrix 45 rows 59 cols 118 entries
Finished phase 1 with 36 SingleSign rule and 8 generalized
[2026-05-25 17:10:35] [INFO ] Computed 55 invariants in 0 ms
Computed 55 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15702328762973747247.kers
Total runtime 1 ms.
[2026-05-25 17:10:36] [INFO ] Implicit Places using invariants in 168 ms returned []
[2026-05-25 17:10:36] [INFO ] Invariant cache hit.
[2026-05-25 17:10:36] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2026-05-25 17:10:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 35/51 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/144 variables, 99/154 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/144 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 154 constraints, problems are : Problem set: 0 solved, 44 unsolved in 3215 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 35/51 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/144 variables, 99/154 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 44/198 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/144 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 198 constraints, problems are : Problem set: 0 solved, 44 unsolved in 3565 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6836ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 6877ms
Finished structural reductions in LTL mode , in 1 iterations and 7312 ms. Remains : 99/99 places, 45/45 transitions.
Support contains 84 out of 99 places after structural reductions.
[2026-05-25 17:10:43] [INFO ] Flatten gal took : 58 ms
[2026-05-25 17:10:43] [INFO ] Flatten gal took : 22 ms
[2026-05-25 17:10:43] [INFO ] Input system was already deterministic with 45 transitions.
RANDOM walk for 40000 steps (8 resets) in 2729 ms. (14 steps per ms) remains 49/90 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 76 ms. (51 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 47/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 36 ms. (108 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 44 ms. (88 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 46/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 46/46 properties
[2026-05-25 17:10:45] [INFO ] Invariant cache hit.
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp89 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 3/3 constraints. Problems are: Problem set: 5 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 5/8 constraints. Problems are: Problem set: 5 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 5 solved, 41 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp84 is UNSAT
Problem AtomicPropp88 is UNSAT
At refinement iteration 3 (OVERLAPS) 26/72 variables, 14/22 constraints. Problems are: Problem set: 23 solved, 23 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp73 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 8/30 constraints. Problems are: Problem set: 29 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/30 constraints. Problems are: Problem set: 29 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 2/74 variables, 2/32 constraints. Problems are: Problem set: 29 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/32 constraints. Problems are: Problem set: 29 solved, 17 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
At refinement iteration 8 (OVERLAPS) 22/96 variables, 20/52 constraints. Problems are: Problem set: 34 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 0/52 constraints. Problems are: Problem set: 34 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 1/97 variables, 1/53 constraints. Problems are: Problem set: 34 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/97 variables, 0/53 constraints. Problems are: Problem set: 34 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 2/99 variables, 2/55 constraints. Problems are: Problem set: 34 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/99 variables, 0/55 constraints. Problems are: Problem set: 34 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 45/144 variables, 99/154 constraints. Problems are: Problem set: 34 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/144 variables, 0/154 constraints. Problems are: Problem set: 34 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 0/144 variables, 0/154 constraints. Problems are: Problem set: 34 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 154 constraints, problems are : Problem set: 34 solved, 12 unsolved in 1400 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 34 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 34 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 33/46 variables, 7/7 constraints. Problems are: Problem set: 34 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 4/11 constraints. Problems are: Problem set: 34 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/11 constraints. Problems are: Problem set: 34 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 8/54 variables, 8/19 constraints. Problems are: Problem set: 34 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/19 constraints. Problems are: Problem set: 34 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 32/86 variables, 24/43 constraints. Problems are: Problem set: 34 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/43 constraints. Problems are: Problem set: 34 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 5/91 variables, 5/48 constraints. Problems are: Problem set: 34 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 0/48 constraints. Problems are: Problem set: 34 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 7/98 variables, 6/54 constraints. Problems are: Problem set: 34 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 0/54 constraints. Problems are: Problem set: 34 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 1/99 variables, 1/55 constraints. Problems are: Problem set: 34 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/99 variables, 0/55 constraints. Problems are: Problem set: 34 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 45/144 variables, 99/154 constraints. Problems are: Problem set: 34 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/144 variables, 12/166 constraints. Problems are: Problem set: 34 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/144 variables, 0/166 constraints. Problems are: Problem set: 34 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 0/144 variables, 0/166 constraints. Problems are: Problem set: 34 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 166 constraints, problems are : Problem set: 34 solved, 12 unsolved in 1369 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 12/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2789ms problems are : Problem set: 34 solved, 12 unsolved
Finished Parikh walk after 239 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=239 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 12 properties in 4655 ms.
Successfully simplified 34 atomic propositions for a total of 16 simplifications.
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 17:10:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-25 17:10:52] [INFO ] Flatten gal took : 10 ms
[2026-05-25 17:10:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 17:10:52] [INFO ] Flatten gal took : 9 ms
[2026-05-25 17:10:52] [INFO ] Input system was already deterministic with 45 transitions.
Support contains 55 out of 99 places (down from 61) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 45/45 transitions.
Ensure Unique test removed 27 places
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 66 transition count 38
Reduce places removed 11 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 19 rules applied. Total rules applied 32 place count 55 transition count 30
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 40 place count 47 transition count 30
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 40 place count 47 transition count 19
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 68 place count 30 transition count 19
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 68 place count 30 transition count 16
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 74 place count 27 transition count 16
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 95 place count 14 transition count 8
Discarding 3 places :
Implicit places reduction removed 3 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 99 place count 11 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 100 place count 10 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 100 place count 10 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 102 place count 9 transition count 6
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Application raised an uncaught exception Index 15 out of bounds for length 5
java.lang.IndexOutOfBoundsException: Index 15 out of bounds for length 5
at java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:100)
at java.base/jdk.internal.util.Preconditions.outOfBoundsCheckIndex(Preconditions.java:106)
at java.base/jdk.internal.util.Preconditions.checkIndex(Preconditions.java:302)
at java.base/java.util.Objects.checkIndex(Objects.java:385)
at java.base/java.util.ArrayList.get(ArrayList.java:427)
at fr.lip6.move.gal.structural.StructuralReduction.ensureUnique(StructuralReduction.java:964)
at fr.lip6.move.gal.structural.StructuralReduction.ruleReducePlaces(StructuralReduction.java:1124)
at fr.lip6.move.gal.structural.StructuralReduction.reduce(StructuralReduction.java:252)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:598)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:740)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
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:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Total runtime 18171 ms.

BK_STOP 1779729052956

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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="IOTPpurchase-PT-C12M10P15D17"
export BK_EXAMINATION="CTLCardinality"
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-5973"
echo " Executing tool itstools"
echo " Input is IOTPpurchase-PT-C12M10P15D17, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r162-smll-177961107700129"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/IOTPpurchase-PT-C12M10P15D17.tgz
mv IOTPpurchase-PT-C12M10P15D17 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;