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-177955740400122.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-PT-02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-177955740400122
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 720K
-rw-r--r-- 1 mcc users 11K Mar 7 07:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Mar 7 07:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Mar 7 07:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 91K Mar 7 07:32 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 5.8K Mar 15 09:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 15 09:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Mar 15 09:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 33K Mar 15 09:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 7 07:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Mar 7 07:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 37K Mar 7 07:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 177K Mar 7 07:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 09:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Mar 15 09:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 51K 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-PT-02-CTLFireability-2024-00
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-2024-01
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-2024-02
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-2024-03
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-2024-04
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-2024-05
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-2024-06
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-2024-07
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-2024-08
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-2024-09
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-2024-10
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-2024-11
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-2024-12
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-2024-13
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-2024-14
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779659811231

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DrinkVendingMachine-PT-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-24 21:56:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 21:56:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 21:56:53] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2026-05-24 21:56:53] [INFO ] Transformed 24 places.
[2026-05-24 21:56:53] [INFO ] Transformed 72 transitions.
[2026-05-24 21:56:53] [INFO ] Parsed PT model containing 24 places and 72 transitions and 440 arcs in 358 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 43 ms.
Initial state reduction rules removed 6 formulas.
[2026-05-24 21:56:53] [INFO ] Reduced 16 identical enabling conditions.
[2026-05-24 21:56:53] [INFO ] Reduced 16 identical enabling conditions.
[2026-05-24 21:56:53] [INFO ] Reduced 4 identical enabling conditions.
[2026-05-24 21:56:53] [INFO ] Reduced 4 identical enabling conditions.
[2026-05-24 21:56:53] [INFO ] Reduced 4 identical enabling conditions.
Ensure Unique test removed 20 transitions
Reduce redundant transitions removed 20 transitions.
FORMULA DrinkVendingMachine-PT-02-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-CTLFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-CTLFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 52/52 transitions.
Applied a total of 0 rules in 19 ms. Remains 24 /24 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Running 36 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-859240870493067722.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11547920558103372537.kers'
[2026-05-24 21:56:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-859240870493067722.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11547920558103372537.kers]
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 52 rows 12 cols 140 entries
Finished phase 1 with 12 SingleSign rule and 0 generalized
[2026-05-24 21:56:54] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11547920558103372537.kers
Total runtime 2 ms.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD31 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 8/8 constraints. Problems are: Problem set: 24 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 24 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 4/24 variables, 4/12 constraints. Problems are: Problem set: 24 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/12 constraints. Problems are: Problem set: 24 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 52/76 variables, 24/36 constraints. Problems are: Problem set: 24 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/36 constraints. Problems are: Problem set: 24 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/76 variables, 0/36 constraints. Problems are: Problem set: 24 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 76/76 variables, and 36 constraints, problems are : Problem set: 24 solved, 12 unsolved in 928 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 12/24 variables, 12/12 constraints. Problems are: Problem set: 24 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/12 constraints. Problems are: Problem set: 24 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 52/76 variables, 24/36 constraints. Problems are: Problem set: 24 solved, 12 unsolved
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 12/48 constraints. Problems are: Problem set: 26 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/48 constraints. Problems are: Problem set: 26 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/76 variables, 0/48 constraints. Problems are: Problem set: 26 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 76/76 variables, and 48 constraints, problems are : Problem set: 26 solved, 10 unsolved in 488 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 12/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1749ms problems are : Problem set: 26 solved, 10 unsolved
Search for dead transitions found 26 dead transitions in 1778ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 26 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13569747880649846625.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3696487830417585226.kers'
[2026-05-24 21:56:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13569747880649846625.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3696487830417585226.kers]
Culling trivial invariants: removing 4 columns.
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 14 columns in 0 ms.
// Phase 1: matrix 26 rows 10 cols 58 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-24 21:56:55] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3696487830417585226.kers
Total runtime 0 ms.
[2026-05-24 21:56:55] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-24 21:56:55] [INFO ] Invariant cache hit.
[2026-05-24 21:56:55] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/24 places, 26/52 transitions.
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 0 rules in 4 ms. Remains 24 /24 variables (removed 0) and now considering 26/26 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2086 ms. Remains : 24/24 places, 26/52 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 26/26 transitions.
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 26/26 (removed 0) transitions.
[2026-05-24 21:56:55] [INFO ] Invariant cache hit.
[2026-05-24 21:56:55] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-24 21:56:55] [INFO ] Invariant cache hit.
[2026-05-24 21:56:56] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2026-05-24 21:56:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/20 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 26/46 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/46 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/50 variables, and 30 constraints, problems are : Problem set: 0 solved, 10 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 10/14 constraints, State Equation: 20/24 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/20 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 26/46 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/50 variables, and 40 constraints, problems are : Problem set: 0 solved, 10 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 10/14 constraints, State Equation: 20/24 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 523ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 524ms
Finished structural reductions in LTL mode , in 1 iterations and 631 ms. Remains : 24/24 places, 26/26 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Support contains 20 out of 20 places after structural reductions.
[2026-05-24 21:56:56] [INFO ] Flatten gal took : 33 ms
[2026-05-24 21:56:56] [INFO ] Flatten gal took : 26 ms
[2026-05-24 21:56:57] [INFO ] Input system was already deterministic with 26 transitions.
Reduction of identical properties reduced properties to check from 43 to 41
RANDOM walk for 40000 steps (8 resets) in 2584 ms. (15 steps per ms) remains 19/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 172 ms. (23 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1315738470901472982.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7907329184919316126.kers'
[2026-05-24 21:56:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1315738470901472982.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7907329184919316126.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 26 rows 10 cols 58 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-24 21:56:58] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7907329184919316126.kers
Total runtime 1 ms.
Problem AtomicPropp4 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 18 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
After SMT solving in domain Real declared 20/46 variables, and 10 constraints, problems are : Problem set: 19 solved, 0 unsolved in 110 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/20 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 132ms problems are : Problem set: 19 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 21 atomic propositions for a total of 10 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA DrinkVendingMachine-PT-02-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 21:56:58] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2026-05-24 21:56:58] [INFO ] Flatten gal took : 8 ms
FORMULA DrinkVendingMachine-PT-02-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 21:56:58] [INFO ] Flatten gal took : 7 ms
[2026-05-24 21:56:58] [INFO ] Input system was already deterministic with 26 transitions.
Support contains 18 out of 20 places (down from 20) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 26/26 (removed 0) transitions.
[2026-05-24 21:56:58] [INFO ] Invariant cache hit.
[2026-05-24 21:56:58] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-24 21:56:58] [INFO ] Invariant cache hit.
[2026-05-24 21:56:58] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2026-05-24 21:56:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/20 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 26/46 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/46 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/46 variables, and 30 constraints, problems are : Problem set: 0 solved, 10 unsolved in 219 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/20 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 26/46 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/46 variables, and 40 constraints, problems are : Problem set: 0 solved, 10 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 449ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 449ms
Finished structural reductions in LTL mode , in 1 iterations and 544 ms. Remains : 20/20 places, 26/26 transitions.
[2026-05-24 21:56:58] [INFO ] Flatten gal took : 12 ms
[2026-05-24 21:56:58] [INFO ] Flatten gal took : 10 ms
[2026-05-24 21:56:58] [INFO ] Input system was already deterministic with 26 transitions.
[2026-05-24 21:56:58] [INFO ] Flatten gal took : 5 ms
[2026-05-24 21:56:58] [INFO ] Flatten gal took : 5 ms
[2026-05-24 21:56:58] [INFO ] Time to serialize gal into /tmp/CTLFireability1069205022022723544.gal : 2 ms
[2026-05-24 21:56:58] [INFO ] Time to serialize properties into /tmp/CTLFireability14775524799541572790.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/CTLFireability1069205022022723544.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14775524799541572790.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,1024,0.023788,3920,2,31,5,328,6,0,109,249,0


Converting to forward existential form...Done !
original formula: EX(((AG((((((((wait_6>=1)&&(theProducts_1>=1))&&(theOptions_1>=2))||(((wait_5>=1)&&(theProducts_1>=1))&&((theOptions_1>=1)&&(theOptions_2...1602
=> equivalent forward existential formula: (([(EY(Init) * !(E(TRUE U !((((((((wait_6>=1)&&(theProducts_1>=1))&&(theOptions_1>=2))||(((wait_5>=1)&&(theProdu...1719
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.063379,4520,1,0,12,1266,23,4,677,1012,12
FORMULA DrinkVendingMachine-PT-02-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 16 transition count 24
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 10 place count 16 transition count 20
Applied a total of 10 rules in 17 ms. Remains 16 /20 variables (removed 4) and now considering 20/26 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10851456146576091430.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7610067595752353919.kers'
[2026-05-24 21:56:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10851456146576091430.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7610067595752353919.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 20 rows 8 cols 32 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-24 21:56:58] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7610067595752353919.kers
Total runtime 0 ms.
[2026-05-24 21:56:59] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-24 21:56:59] [INFO ] Invariant cache hit.
[2026-05-24 21:56:59] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2026-05-24 21:56:59] [INFO ] Redundant transitions in 1 ms returned []
Running 8 sub problems to find dead transitions.
[2026-05-24 21:56:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 8/16 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 20/36 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/36 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 24 constraints, problems are : Problem set: 0 solved, 8 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 8/16 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 20/36 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/36 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 32 constraints, problems are : Problem set: 0 solved, 8 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 327ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 327ms
Starting structural reductions in SI_CTL mode, iteration 1 : 16/20 places, 20/26 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 432 ms. Remains : 16/20 places, 20/26 transitions.
[2026-05-24 21:56:59] [INFO ] Flatten gal took : 3 ms
[2026-05-24 21:56:59] [INFO ] Flatten gal took : 2 ms
[2026-05-24 21:56:59] [INFO ] Input system was already deterministic with 20 transitions.
[2026-05-24 21:56:59] [INFO ] Flatten gal took : 2 ms
[2026-05-24 21:56:59] [INFO ] Flatten gal took : 3 ms
[2026-05-24 21:56:59] [INFO ] Time to serialize gal into /tmp/CTLFireability8542116996865710755.gal : 2 ms
[2026-05-24 21:56:59] [INFO ] Time to serialize properties into /tmp/CTLFireability3645565702904624448.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/CTLFireability8542116996865710755.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3645565702904624448.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,256,0.005912,3888,2,25,5,212,6,0,87,149,0


Converting to forward existential form...Done !
original formula: AF(EG((((productSlots_1<1)&&(productSlots_2<1))&&(((((ready_4>=1)||(ready_6>=1))||((ready_1>=1)||(ready_3>=1)))||(((ready_2>=1)||(ready_5...310
=> equivalent forward existential formula: [FwdG(Init,!(EG((((productSlots_1<1)&&(productSlots_2<1))&&(((((ready_4>=1)||(ready_6>=1))||((ready_1>=1)||(read...355
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.015058,4208,1,0,6,740,20,1,432,466,8
FORMULA DrinkVendingMachine-PT-02-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 26/26 (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-1915169672414318538.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16844293039976011833.kers'
[2026-05-24 21:56:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1915169672414318538.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16844293039976011833.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 26 rows 10 cols 58 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-24 21:56:59] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16844293039976011833.kers
Total runtime 1 ms.
[2026-05-24 21:56:59] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-24 21:56:59] [INFO ] Invariant cache hit.
[2026-05-24 21:56:59] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2026-05-24 21:56:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/20 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 26/46 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/46 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/46 variables, and 30 constraints, problems are : Problem set: 0 solved, 10 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/20 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 26/46 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/46 variables, and 40 constraints, problems are : Problem set: 0 solved, 10 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 414ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 415ms
Finished structural reductions in LTL mode , in 1 iterations and 497 ms. Remains : 20/20 places, 26/26 transitions.
[2026-05-24 21:56:59] [INFO ] Flatten gal took : 3 ms
[2026-05-24 21:56:59] [INFO ] Flatten gal took : 4 ms
[2026-05-24 21:56:59] [INFO ] Input system was already deterministic with 26 transitions.
[2026-05-24 21:56:59] [INFO ] Flatten gal took : 4 ms
[2026-05-24 21:56:59] [INFO ] Flatten gal took : 5 ms
[2026-05-24 21:56:59] [INFO ] Time to serialize gal into /tmp/CTLFireability12221061944995406705.gal : 1 ms
[2026-05-24 21:56:59] [INFO ] Time to serialize properties into /tmp/CTLFireability12728169230772863692.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/CTLFireability12221061944995406705.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12728169230772863692.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,1024,0.009431,4012,2,31,5,328,6,0,109,249,0


Converting to forward existential form...Done !
original formula: AX(!(A((((((((((wait_6>=1)&&(theProducts_1>=1))&&(theOptions_1>=2))||(((wait_5>=1)&&(theProducts_1>=1))&&((theOptions_1>=1)&&(theOptions_...1514
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(((((wait_2>=1)&&(theProducts_2>=1))||((wait_2>=1)&&(theProducts_1>=1)))||(((wait_1>=1)&&(th...1875
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 6/10/20
(forward)formula 0,0,0.050169,4608,1,0,10,2724,24,4,748,2537,10
FORMULA DrinkVendingMachine-PT-02-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 21 rules applied. Total rules applied 21 place count 6 transition count 19
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 29 place count 6 transition count 11
Applied a total of 29 rules in 4 ms. Remains 6 /20 variables (removed 14) and now considering 11/26 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15168547883129731147.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7141046398315709233.kers'
[2026-05-24 21:57:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15168547883129731147.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7141046398315709233.kers]
Normalized transition count is 10 out of 11 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 10 rows 3 cols 15 entries
Finished phase 1 with 3 SingleSign rule and 0 generalized
[2026-05-24 21:57:00] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7141046398315709233.kers
Total runtime 0 ms.
[2026-05-24 21:57:00] [INFO ] Implicit Places using invariants in 25 ms returned []
[2026-05-24 21:57:00] [INFO ] Invariant cache hit.
[2026-05-24 21:57:00] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2026-05-24 21:57:00] [INFO ] Redundant transitions in 24 ms returned [0, 4, 6, 7]
Found 4 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 4 transitions
Redundant transitions reduction (with SMT) removed 4 transitions.
Running 3 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-1461987944762065380.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8832507401753851258.kers'
[2026-05-24 21:57:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1461987944762065380.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8832507401753851258.kers]
Normalized transition count is 6 out of 7 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 6 rows 3 cols 6 entries
Finished phase 1 with 3 SingleSign rule and 0 generalized
[2026-05-24 21:57:00] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8832507401753851258.kers
Total runtime 0 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/13 variables, and 12 constraints, problems are : Problem set: 0 solved, 3 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 118ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 118ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6/20 places, 7/26 transitions.
Applied a total of 0 rules in 2 ms. Remains 6 /6 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 208 ms. Remains : 6/20 places, 7/26 transitions.
[2026-05-24 21:57:00] [INFO ] Flatten gal took : 1 ms
[2026-05-24 21:57:00] [INFO ] Flatten gal took : 1 ms
[2026-05-24 21:57:00] [INFO ] Input system was already deterministic with 7 transitions.
[2026-05-24 21:57:00] [INFO ] Flatten gal took : 1 ms
[2026-05-24 21:57:00] [INFO ] Flatten gal took : 1 ms
[2026-05-24 21:57:00] [INFO ] Time to serialize gal into /tmp/CTLFireability8463340383429605765.gal : 0 ms
[2026-05-24 21:57:00] [INFO ] Time to serialize properties into /tmp/CTLFireability7136746912449076476.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/CTLFireability8463340383429605765.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7136746912449076476.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,8,0.002679,3756,2,10,5,38,5,0,32,22,0


Converting to forward existential form...Done !
original formula: AF((((wait_4<1)||(theProducts_1<1))||(theOptions_2<1)))
=> equivalent forward existential formula: [FwdG(Init,!((((wait_4<1)||(theProducts_1<1))||(theOptions_2<1))))] = FALSE
Hit Full ! (commute/partial/dont) 0/12/7
(forward)formula 0,0,0.004376,4040,1,0,5,87,19,0,147,41,8
FORMULA DrinkVendingMachine-PT-02-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 26/26 (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-16512588537327195646.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16888612298804461049.kers'
[2026-05-24 21:57:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16512588537327195646.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16888612298804461049.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 26 rows 10 cols 58 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-24 21:57:00] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16888612298804461049.kers
Total runtime 0 ms.
[2026-05-24 21:57:00] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-24 21:57:00] [INFO ] Invariant cache hit.
[2026-05-24 21:57:00] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2026-05-24 21:57:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/20 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 26/46 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/46 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/46 variables, and 30 constraints, problems are : Problem set: 0 solved, 10 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/20 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 26/46 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/46 variables, and 40 constraints, problems are : Problem set: 0 solved, 10 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 413ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 413ms
Finished structural reductions in LTL mode , in 1 iterations and 522 ms. Remains : 20/20 places, 26/26 transitions.
[2026-05-24 21:57:00] [INFO ] Flatten gal took : 3 ms
[2026-05-24 21:57:00] [INFO ] Flatten gal took : 3 ms
[2026-05-24 21:57:00] [INFO ] Input system was already deterministic with 26 transitions.
[2026-05-24 21:57:00] [INFO ] Flatten gal took : 3 ms
[2026-05-24 21:57:00] [INFO ] Flatten gal took : 3 ms
[2026-05-24 21:57:00] [INFO ] Time to serialize gal into /tmp/CTLFireability14949408973181924655.gal : 1 ms
[2026-05-24 21:57:00] [INFO ] Time to serialize properties into /tmp/CTLFireability15830586340576211139.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/CTLFireability14949408973181924655.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15830586340576211139.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,1024,0.007648,4016,2,31,5,328,6,0,109,249,0


Converting to forward existential form...Done !
original formula: EX(AF(((((wait_6<1)||(theProducts_2<1))||((theOptions_1<1)||(theOptions_2<1))) + AX(FALSE))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(((((wait_6<1)||(theProducts_2<1))||((theOptions_1<1)||(theOptions_2<1))) + !(EX(!(FALSE)))))...168
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,1,0.014768,4284,1,0,10,960,17,3,625,637,7
FORMULA DrinkVendingMachine-PT-02-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 26/26 (removed 0) transitions.
[2026-05-24 21:57:00] [INFO ] Invariant cache hit.
[2026-05-24 21:57:00] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-24 21:57:00] [INFO ] Invariant cache hit.
[2026-05-24 21:57:00] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 20/20 places, 26/26 transitions.
[2026-05-24 21:57:00] [INFO ] Flatten gal took : 3 ms
[2026-05-24 21:57:00] [INFO ] Flatten gal took : 2 ms
[2026-05-24 21:57:00] [INFO ] Input system was already deterministic with 26 transitions.
[2026-05-24 21:57:00] [INFO ] Flatten gal took : 2 ms
[2026-05-24 21:57:00] [INFO ] Flatten gal took : 3 ms
[2026-05-24 21:57:00] [INFO ] Time to serialize gal into /tmp/CTLFireability4072118992778529636.gal : 1 ms
[2026-05-24 21:57:00] [INFO ] Time to serialize properties into /tmp/CTLFireability9739155620161383667.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/CTLFireability4072118992778529636.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9739155620161383667.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,1024,0.008494,4012,2,31,5,328,6,0,109,249,0


Converting to forward existential form...Done !
original formula: (EG(AF(AX(FALSE))) + AG((((((theProducts_1>=1)&&(theOptions_1>=1))&&(theOptions_2>=2))||(productSlots_2>=1))||((((theProducts_1>=1)&&(the...319
=> equivalent forward existential formula: [(FwdU((Init * !(EG(!(EG(!(!(EX(!(FALSE))))))))),TRUE) * !((((((theProducts_1>=1)&&(theOptions_1>=1))&&(theOptio...388
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.016874,4284,1,0,8,748,23,3,639,474,8
FORMULA DrinkVendingMachine-PT-02-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

[2026-05-24 21:57:00] [INFO ] Flatten gal took : 3 ms
[2026-05-24 21:57:00] [INFO ] Flatten gal took : 3 ms
Total runtime 7707 ms.

BK_STOP 1779659821021

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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-PT-02"
export BK_EXAMINATION="CTLFireability"
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-PT-02, examination is CTLFireability"
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-177955740400122"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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