About the Execution of ITS-Tools for DrinkVendingMachine-COL-16
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 426.584 | 23360.00 | 35495.00 | 194.20 | FTTFFFTTFFFTTTFF | normal |
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.r114-smll-177955740400081.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 DrinkVendingMachine-COL-16, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-177955740400081
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.4K Mar 7 09:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Mar 7 09:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 7 09:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 7 09:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Mar 15 09:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 09:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 15 09:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 09:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Mar 7 09:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Mar 7 09:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 7 09:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Mar 7 09:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 09:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 15 09:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 25K 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 DrinkVendingMachine-COL-16-CTLCardinality-2024-00
FORMULA_NAME DrinkVendingMachine-COL-16-CTLCardinality-2024-01
FORMULA_NAME DrinkVendingMachine-COL-16-CTLCardinality-2024-02
FORMULA_NAME DrinkVendingMachine-COL-16-CTLCardinality-2024-03
FORMULA_NAME DrinkVendingMachine-COL-16-CTLCardinality-2024-04
FORMULA_NAME DrinkVendingMachine-COL-16-CTLCardinality-2024-05
FORMULA_NAME DrinkVendingMachine-COL-16-CTLCardinality-2024-06
FORMULA_NAME DrinkVendingMachine-COL-16-CTLCardinality-2024-07
FORMULA_NAME DrinkVendingMachine-COL-16-CTLCardinality-2024-08
FORMULA_NAME DrinkVendingMachine-COL-16-CTLCardinality-2024-09
FORMULA_NAME DrinkVendingMachine-COL-16-CTLCardinality-2024-10
FORMULA_NAME DrinkVendingMachine-COL-16-CTLCardinality-2024-11
FORMULA_NAME DrinkVendingMachine-COL-16-CTLCardinality-2024-12
FORMULA_NAME DrinkVendingMachine-COL-16-CTLCardinality-2024-13
FORMULA_NAME DrinkVendingMachine-COL-16-CTLCardinality-2024-14
FORMULA_NAME DrinkVendingMachine-COL-16-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1779641870407
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DrinkVendingMachine-COL-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202604301425
[2026-05-24 16:57:52] [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-24 16:57:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 16:57:52] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2026-05-24 16:57:53] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-24 16:57:53] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 836 ms
[2026-05-24 16:57:53] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 192 PT places and 4473952.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 24 ms.
[2026-05-24 16:57:53] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 28 arcs in 6 ms.
[2026-05-24 16:57:53] [INFO ] Skeletonized 16 HLPN properties in 4 ms.
Initial state reduction rules removed 3 formulas.
FORMULA DrinkVendingMachine-COL-16-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-16-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-16-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40039 steps (8 resets) in 684 ms. (58 steps per ms) remains 21/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 139 ms. (28 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 90 ms. (43 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 66 ms. (59 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 95 ms. (41 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 72 ms. (54 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 63 ms. (62 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 21/21 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10262547028234895439.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6935024861787747344.kers'
[2026-05-24 16:57:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10262547028234895439.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6935024861787747344.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 7 rows 3 cols 14 entries
Finished phase 1 with 3 SingleSign rule and 0 generalized
[2026-05-24 16:57:54] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6935024861787747344.kers
Total runtime 1 ms.
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
After SMT solving in domain Real declared 6/13 variables, and 3 constraints, problems are : Problem set: 21 solved, 0 unsolved in 219 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/6 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 356ms problems are : Problem set: 21 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 21 atomic propositions for a total of 12 simplifications.
[2026-05-24 16:57:55] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2026-05-24 16:57:55] [INFO ] Flatten gal took : 22 ms
FORMULA DrinkVendingMachine-COL-16-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-16-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-16-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 16:57:55] [INFO ] Flatten gal took : 4 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Quality
Symmetric sort wr.t. initial detected :Quality
Transition elaborate3 : guard parameter $x(Quality:64) in guard (AND (GT $x 47) (LEQ $x 63))introduces in Quality(64) partition with 2 elements
Transition elaborate2 : guard parameter $x(Quality:64) in guard (AND (GT $x 31) (LEQ $x 47))introduces in Quality(64) partition with 2 elements
Transition elaborate1 : guard parameter $x(Quality:64) in guard (AND (GT $x 15) (LEQ $x 31))introduces in Quality(64) partition with 2 elements
Transition elaborate0 : guard parameter $x(Quality:64) in guard (LEQ $x 15)introduces in Quality(64) partition with 2 elements
Sort wr.t. initial and guards Quality has partition 4
Applying symmetric unfolding of partitioned symmetric sort :Quality domain size was 64 reducing to 4 values.
For transition elaborate3:(AND (GT $x 47) (LEQ $x 63)) -> (EQ $x 3)
For transition elaborate2:(AND (GT $x 31) (LEQ $x 47)) -> (EQ $x 2)
For transition elaborate1:(AND (GT $x 15) (LEQ $x 31)) -> (EQ $x 1)
For transition elaborate0:(LEQ $x 15) -> (EQ $x 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Options
Symmetric sort wr.t. initial detected :Options
Symmetric sort wr.t. initial and guards detected :Options
Applying symmetric unfolding of full symmetric sort :Options domain size was 16
Symmetric sort wr.t. initial and guards and successors and join/free detected :Products
Symmetric sort wr.t. initial detected :Products
Symmetric sort wr.t. initial and guards detected :Products
Applying symmetric unfolding of full symmetric sort :Products domain size was 16
[2026-05-24 16:57:55] [INFO ] Unfolded HLPN to a Petri net with 12 places and 10 transitions 34 arcs in 36 ms.
[2026-05-24 16:57:55] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 7 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12765599043655907459.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9454186615095191241.kers'
[2026-05-24 16:57:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12765599043655907459.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9454186615095191241.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 10 rows 6 cols 17 entries
Finished phase 1 with 6 SingleSign rule and 0 generalized
[2026-05-24 16:57:55] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9454186615095191241.kers
Total runtime 1 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 10/22 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/22 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 18 constraints, problems are : Problem set: 0 solved, 6 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 10/22 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/22 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 24 constraints, problems are : Problem set: 0 solved, 6 unsolved in 241 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 556ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 557ms
[2026-05-24 16:57:56] [INFO ] Invariant cache hit.
[2026-05-24 16:57:56] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-24 16:57:56] [INFO ] Invariant cache hit.
[2026-05-24 16:57:56] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 683 ms. Remains : 12/12 places, 10/10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Skipped dead transition search.
[2026-05-24 16:57:56] [INFO ] Invariant cache hit.
[2026-05-24 16:57:56] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-24 16:57:56] [INFO ] Invariant cache hit.
[2026-05-24 16:57:56] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 55 ms. Remains : 12/12 places, 10/10 transitions.
Support contains 12 out of 12 places after structural reductions.
[2026-05-24 16:57:56] [INFO ] Flatten gal took : 5 ms
[2026-05-24 16:57:56] [INFO ] Flatten gal took : 3 ms
[2026-05-24 16:57:56] [INFO ] Input system was already deterministic with 10 transitions.
RANDOM walk for 40028 steps (8 resets) in 346 ms. (115 steps per ms) remains 18/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 63 ms. (62 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 18/18 properties
[2026-05-24 16:57:56] [INFO ] Invariant cache hit.
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 6/6 constraints. Problems are: Problem set: 14 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/6 constraints. Problems are: Problem set: 14 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 10/22 variables, 12/18 constraints. Problems are: Problem set: 14 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/18 constraints. Problems are: Problem set: 14 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 0/22 variables, 0/18 constraints. Problems are: Problem set: 14 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 18 constraints, problems are : Problem set: 14 solved, 4 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 14 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 6/6 constraints. Problems are: Problem set: 14 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/6 constraints. Problems are: Problem set: 14 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 10/22 variables, 12/18 constraints. Problems are: Problem set: 14 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 4/22 constraints. Problems are: Problem set: 14 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 14 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/22 variables, 0/22 constraints. Problems are: Problem set: 14 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 22 constraints, problems are : Problem set: 14 solved, 4 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 4/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 355ms problems are : Problem set: 14 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 6464 steps, including 32 resets, run visited all 4 properties in 72 ms. (steps per millisecond=89 )
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 4 properties in 81 ms.
Successfully simplified 14 atomic propositions for a total of 9 simplifications.
[2026-05-24 16:57:57] [INFO ] Flatten gal took : 4 ms
[2026-05-24 16:57:57] [INFO ] Flatten gal took : 4 ms
[2026-05-24 16:57:57] [INFO ] Input system was already deterministic with 10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Skipped dead transition search.
[2026-05-24 16:57:57] [INFO ] Invariant cache hit.
[2026-05-24 16:57:57] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-24 16:57:57] [INFO ] Invariant cache hit.
[2026-05-24 16:57:57] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 79 ms. Remains : 12/12 places, 10/10 transitions.
[2026-05-24 16:57:57] [INFO ] Flatten gal took : 4 ms
[2026-05-24 16:57:57] [INFO ] Flatten gal took : 4 ms
[2026-05-24 16:57:57] [INFO ] Input system was already deterministic with 10 transitions.
[2026-05-24 16:57:57] [INFO ] Flatten gal took : 3 ms
[2026-05-24 16:57:57] [INFO ] Flatten gal took : 3 ms
[2026-05-24 16:57:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality3171549392111727750.gal : 2 ms
[2026-05-24 16:57:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality8920131064947197488.ctl : 2 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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3171549392111727750.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8920131064947197488.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.41376e+07,0.304346,9232,2,109,5,31517,6,0,69,40755,0
Converting to forward existential form...Done !
original formula: A(E(EF((((ready_0+ready_1)+(ready_2+ready_3))<=theOptions)) U AX(((!((((ready_0+ready_1)+(ready_2+ready_3))>=80)&&(optionSlots>=71)))&&(p...317
=> equivalent forward existential formula: [((Init * !(EG(!(((optionSlots>theOptions) * (!(!(E(TRUE U !(!(EG(!((((ready_0+ready_1)+(ready_2+ready_3))<=40))...740
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,2.90118,51308,1,0,16,92458,34,7,11914,148965,19
FORMULA DrinkVendingMachine-COL-16-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Skipped dead transition search.
[2026-05-24 16:58:00] [INFO ] Invariant cache hit.
[2026-05-24 16:58:00] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-24 16:58:00] [INFO ] Invariant cache hit.
[2026-05-24 16:58:00] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 104 ms. Remains : 12/12 places, 10/10 transitions.
[2026-05-24 16:58:00] [INFO ] Flatten gal took : 3 ms
[2026-05-24 16:58:00] [INFO ] Flatten gal took : 3 ms
[2026-05-24 16:58:00] [INFO ] Input system was already deterministic with 10 transitions.
[2026-05-24 16:58:00] [INFO ] Flatten gal took : 2 ms
[2026-05-24 16:58:00] [INFO ] Flatten gal took : 2 ms
[2026-05-24 16:58:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality15540283002014749852.gal : 1 ms
[2026-05-24 16:58:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality9101468242843210933.ctl : 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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15540283002014749852.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9101468242843210933.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.41376e+07,0.179748,9336,2,109,5,31517,6,0,69,40755,0
Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.180131,9336,1,0,6,31517,7,1,110,40755,1
FORMULA DrinkVendingMachine-COL-16-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Skipped dead transition search.
[2026-05-24 16:58:00] [INFO ] Invariant cache hit.
[2026-05-24 16:58:00] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-24 16:58:00] [INFO ] Invariant cache hit.
[2026-05-24 16:58:00] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 94 ms. Remains : 12/12 places, 10/10 transitions.
[2026-05-24 16:58:00] [INFO ] Flatten gal took : 3 ms
[2026-05-24 16:58:00] [INFO ] Flatten gal took : 3 ms
[2026-05-24 16:58:00] [INFO ] Input system was already deterministic with 10 transitions.
[2026-05-24 16:58:00] [INFO ] Flatten gal took : 3 ms
[2026-05-24 16:58:00] [INFO ] Flatten gal took : 2 ms
[2026-05-24 16:58:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality13203869748548977261.gal : 1 ms
[2026-05-24 16:58:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality15594522606423940894.ctl : 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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13203869748548977261.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15594522606423940894.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.41376e+07,0.284998,9324,2,109,5,31517,6,0,69,40755,0
Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.285442,9324,1,0,6,31517,7,1,110,40755,1
FORMULA DrinkVendingMachine-COL-16-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Skipped dead transition search.
[2026-05-24 16:58:00] [INFO ] Invariant cache hit.
[2026-05-24 16:58:00] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-24 16:58:00] [INFO ] Invariant cache hit.
[2026-05-24 16:58:01] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 79 ms. Remains : 12/12 places, 10/10 transitions.
[2026-05-24 16:58:01] [INFO ] Flatten gal took : 2 ms
[2026-05-24 16:58:01] [INFO ] Flatten gal took : 1 ms
[2026-05-24 16:58:01] [INFO ] Input system was already deterministic with 10 transitions.
[2026-05-24 16:58:01] [INFO ] Flatten gal took : 3 ms
[2026-05-24 16:58:01] [INFO ] Flatten gal took : 2 ms
[2026-05-24 16:58:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality3030289367395080615.gal : 1 ms
[2026-05-24 16:58:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality10965593861988724382.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3030289367395080615.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10965593861988724382.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.41376e+07,0.188208,9328,2,109,5,31517,6,0,69,40755,0
Converting to forward existential form...Done !
original formula: EF(AX(FALSE))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(FALSE))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.191584,9328,1,0,5,31517,9,0,463,40755,2
FORMULA DrinkVendingMachine-COL-16-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Skipped dead transition search.
[2026-05-24 16:58:01] [INFO ] Invariant cache hit.
[2026-05-24 16:58:01] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-24 16:58:01] [INFO ] Invariant cache hit.
[2026-05-24 16:58:01] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 12/12 places, 10/10 transitions.
[2026-05-24 16:58:01] [INFO ] Flatten gal took : 2 ms
[2026-05-24 16:58:01] [INFO ] Flatten gal took : 2 ms
[2026-05-24 16:58:01] [INFO ] Input system was already deterministic with 10 transitions.
[2026-05-24 16:58:01] [INFO ] Flatten gal took : 2 ms
[2026-05-24 16:58:01] [INFO ] Flatten gal took : 1 ms
[2026-05-24 16:58:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality16093981809065769240.gal : 1 ms
[2026-05-24 16:58:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality8205046369450019140.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16093981809065769240.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8205046369450019140.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.41376e+07,0.184624,9332,2,109,5,31517,6,0,69,40755,0
Converting to forward existential form...Done !
original formula: A(EX(A((((((wait_0+wait_1)+(wait_2+wait_3))>=13)&&(((ready_0+ready_1)+(ready_2+ready_3))>optionSlots))&&((productSlots<=27)||(((wait_0+wa...507
=> equivalent forward existential formula: [((Init * !(EG(!(!(((((((wait_0+wait_1)+(wait_2+wait_3))<=productSlots)&&(theOptions>=16))||((theProducts>((read...1241
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 1/0/9
Hit Full ! (commute/partial/dont) 0/0/10
(forward)formula 0,0,6.63052,90180,1,0,16,68595,32,6,32491,90877,14
FORMULA DrinkVendingMachine-COL-16-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 5 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Skipped dead transition search.
[2026-05-24 16:58:08] [INFO ] Invariant cache hit.
[2026-05-24 16:58:08] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-24 16:58:08] [INFO ] Invariant cache hit.
[2026-05-24 16:58:08] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2026-05-24 16:58:08] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_CTL mode , in 1 iterations and 84 ms. Remains : 12/12 places, 10/10 transitions.
[2026-05-24 16:58:08] [INFO ] Flatten gal took : 1 ms
[2026-05-24 16:58:08] [INFO ] Flatten gal took : 1 ms
[2026-05-24 16:58:08] [INFO ] Input system was already deterministic with 10 transitions.
[2026-05-24 16:58:08] [INFO ] Flatten gal took : 1 ms
[2026-05-24 16:58:08] [INFO ] Flatten gal took : 1 ms
[2026-05-24 16:58:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality13673513919938955990.gal : 1 ms
[2026-05-24 16:58:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality14126967058898117391.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13673513919938955990.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14126967058898117391.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.41376e+07,0.185109,9328,2,109,5,31517,6,0,69,40755,0
Converting to forward existential form...Done !
original formula: AG(EF(EG(((((ready_0+ready_1)+(ready_2+ready_3))<=66)&&(optionSlots<=productSlots)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U EG(((((ready_0+ready_1)+(ready_2+ready_3))<=66)&&(optionSlots<=productSlots))))))...164
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.266422,9556,1,0,6,31517,22,0,1127,40755,8
FORMULA DrinkVendingMachine-COL-16-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Skipped dead transition search.
[2026-05-24 16:58:08] [INFO ] Invariant cache hit.
[2026-05-24 16:58:08] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-24 16:58:08] [INFO ] Invariant cache hit.
[2026-05-24 16:58:08] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 69 ms. Remains : 12/12 places, 10/10 transitions.
[2026-05-24 16:58:08] [INFO ] Flatten gal took : 2 ms
[2026-05-24 16:58:08] [INFO ] Flatten gal took : 1 ms
[2026-05-24 16:58:08] [INFO ] Input system was already deterministic with 10 transitions.
[2026-05-24 16:58:08] [INFO ] Flatten gal took : 1 ms
[2026-05-24 16:58:08] [INFO ] Flatten gal took : 14 ms
[2026-05-24 16:58:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality16318177441999951752.gal : 1 ms
[2026-05-24 16:58:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality8961685749577606885.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16318177441999951752.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8961685749577606885.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.41376e+07,0.281181,9320,2,109,5,31517,6,0,69,40755,0
Converting to forward existential form...Done !
original formula: EX(AG((((((wait_0+wait_1)+(wait_2+wait_3))>50)&&(((ready_0+ready_1)+(ready_2+ready_3))>theOptions))&&(((wait_0+wait_1)+(wait_2+wait_3))>o...169
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((((((wait_0+wait_1)+(wait_2+wait_3))>50)&&(((ready_0+ready_1)+(ready_2+ready_3))>theOp...226
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,3.6349,47896,1,0,6,31517,15,0,21340,40755,5
FORMULA DrinkVendingMachine-COL-16-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Skipped dead transition search.
[2026-05-24 16:58:12] [INFO ] Invariant cache hit.
[2026-05-24 16:58:12] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-24 16:58:12] [INFO ] Invariant cache hit.
[2026-05-24 16:58:12] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 12/12 places, 10/10 transitions.
[2026-05-24 16:58:12] [INFO ] Flatten gal took : 1 ms
[2026-05-24 16:58:12] [INFO ] Flatten gal took : 1 ms
[2026-05-24 16:58:12] [INFO ] Input system was already deterministic with 10 transitions.
[2026-05-24 16:58:12] [INFO ] Flatten gal took : 1 ms
[2026-05-24 16:58:12] [INFO ] Flatten gal took : 1 ms
[2026-05-24 16:58:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality11123206503701942829.gal : 0 ms
[2026-05-24 16:58:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality2427099784792488579.ctl : 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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11123206503701942829.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2427099784792488579.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.41376e+07,0.275986,9324,2,109,5,31517,6,0,69,40755,0
Converting to forward existential form...Done !
original formula: AX((((ready_0+ready_1)+(ready_2+ready_3))<=49))
=> equivalent forward existential formula: [(EY(Init) * !((((ready_0+ready_1)+(ready_2+ready_3))<=49)))] = FALSE
(forward)formula 0,1,0.389933,9548,1,0,9,31517,9,2,726,40755,2
FORMULA DrinkVendingMachine-COL-16-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Skipped dead transition search.
[2026-05-24 16:58:12] [INFO ] Invariant cache hit.
[2026-05-24 16:58:12] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-24 16:58:12] [INFO ] Invariant cache hit.
[2026-05-24 16:58:12] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 12/12 places, 10/10 transitions.
[2026-05-24 16:58:12] [INFO ] Flatten gal took : 3 ms
[2026-05-24 16:58:12] [INFO ] Flatten gal took : 2 ms
[2026-05-24 16:58:12] [INFO ] Input system was already deterministic with 10 transitions.
[2026-05-24 16:58:12] [INFO ] Flatten gal took : 1 ms
[2026-05-24 16:58:12] [INFO ] Flatten gal took : 1 ms
[2026-05-24 16:58:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality6193786908427413547.gal : 1 ms
[2026-05-24 16:58:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality12976008179749733597.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6193786908427413547.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12976008179749733597.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.41376e+07,0.259308,9324,2,109,5,31517,6,0,69,40755,0
Converting to forward existential form...Done !
original formula: AX((((ready_0+ready_1)+(ready_2+ready_3))<50))
=> equivalent forward existential formula: [(EY(Init) * !((((ready_0+ready_1)+(ready_2+ready_3))<50)))] = FALSE
(forward)formula 0,1,0.371791,9548,1,0,9,31517,9,2,726,40755,2
FORMULA DrinkVendingMachine-COL-16-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Skipped dead transition search.
[2026-05-24 16:58:13] [INFO ] Invariant cache hit.
[2026-05-24 16:58:13] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-24 16:58:13] [INFO ] Invariant cache hit.
[2026-05-24 16:58:13] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 84 ms. Remains : 12/12 places, 10/10 transitions.
[2026-05-24 16:58:13] [INFO ] Flatten gal took : 2 ms
[2026-05-24 16:58:13] [INFO ] Flatten gal took : 2 ms
[2026-05-24 16:58:13] [INFO ] Input system was already deterministic with 10 transitions.
[2026-05-24 16:58:13] [INFO ] Flatten gal took : 1 ms
[2026-05-24 16:58:13] [INFO ] Flatten gal took : 2 ms
[2026-05-24 16:58:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality11944361945175146756.gal : 1 ms
[2026-05-24 16:58:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality14065585370396461970.ctl : 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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11944361945175146756.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14065585370396461970.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.41376e+07,0.256511,9340,2,109,5,31517,6,0,69,40755,0
Converting to forward existential form...Done !
original formula: EX(EX(((productSlots>12)&&(productSlots<=46))))
=> equivalent forward existential formula: [(EY(EY(Init)) * ((productSlots>12)&&(productSlots<=46)))] != FALSE
(forward)formula 0,0,0.258364,9564,1,0,9,31517,8,1,149,40755,3
FORMULA DrinkVendingMachine-COL-16-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2026-05-24 16:58:13] [INFO ] Flatten gal took : 2 ms
[2026-05-24 16:58:13] [INFO ] Flatten gal took : 2 ms
Total runtime 21101 ms.
BK_STOP 1779641893767
--------------------
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="DrinkVendingMachine-COL-16"
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 DrinkVendingMachine-COL-16, 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 r114-smll-177955740400081"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DrinkVendingMachine-COL-16.tgz
mv DrinkVendingMachine-COL-16 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 '
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 ;
