Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 17K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748727221107

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-001
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-05-31 21:33:42] [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]
[2025-05-31 21:33:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 21:33:42] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2025-05-31 21:33:42] [INFO ] Transformed 57 places.
[2025-05-31 21:33:42] [INFO ] Transformed 48 transitions.
[2025-05-31 21:33:42] [INFO ] Parsed PT model containing 57 places and 48 transitions and 135 arcs in 135 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Initial state reduction rules removed 2 formulas.
FORMULA DoubleExponent-PT-001-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 48/48 transitions.
Applied a total of 0 rules in 7 ms. Remains 57 /57 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 57 cols
[2025-05-31 21:33:42] [INFO ] Computed 9 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:33:42] [INFO ] Implicit Places using invariants in 179 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 211 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 56/57 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 56 /56 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 235 ms. Remains : 56/57 places, 48/48 transitions.
Support contains 47 out of 56 places after structural reductions.
[2025-05-31 21:33:42] [INFO ] Flatten gal took : 20 ms
[2025-05-31 21:33:42] [INFO ] Flatten gal took : 8 ms
[2025-05-31 21:33:42] [INFO ] Input system was already deterministic with 48 transitions.
RANDOM walk for 40000 steps (1308 resets) in 1248 ms. (32 steps per ms) remains 10/54 properties
BEST_FIRST walk for 40000 steps (1153 resets) in 382 ms. (104 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1134 resets) in 179 ms. (222 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1140 resets) in 162 ms. (245 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1119 resets) in 175 ms. (227 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1212 resets) in 191 ms. (208 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1144 resets) in 187 ms. (212 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1143 resets) in 168 ms. (236 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1141 resets) in 173 ms. (229 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1136 resets) in 146 ms. (272 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1125 resets) in 163 ms. (243 steps per ms) remains 10/10 properties
// Phase 1: matrix 48 rows 56 cols
[2025-05-31 21:33:44] [INFO ] Computed 8 invariants in 6 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp48 is UNSAT
At refinement iteration 1 (OVERLAPS) 37/51 variables, 4/4 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/4 constraints. Problems are: Problem set: 6 solved, 4 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 3 (OVERLAPS) 5/56 variables, 4/8 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 48/104 variables, 56/64 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/64 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/104 variables, 0/64 constraints. Problems are: Problem set: 7 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 64 constraints, problems are : Problem set: 7 solved, 3 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 3 unsolved
Problem AtomicPropp46 is UNSAT
At refinement iteration 1 (OVERLAPS) 41/46 variables, 2/2 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/50 variables, 2/4 constraints. Problems are: Problem set: 8 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:33:44] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/5 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/5 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 6/56 variables, 4/9 constraints. Problems are: Problem set: 8 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:33:44] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:33:44] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:33:44] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 3/12 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 48/104 variables, 56/68 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 2/70 constraints. Problems are: Problem set: 8 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:33:44] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 1/71 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/104 variables, 0/71 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/104 variables, 0/71 constraints. Problems are: Problem set: 8 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 71 constraints, problems are : Problem set: 8 solved, 2 unsolved in 467 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 2/10 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 672ms problems are : Problem set: 8 solved, 2 unsolved
Parikh walk visited 0 properties in 130 ms.
Support contains 3 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 48/48 transitions.
Graph (complete) has 84 edges and 56 vertex of which 53 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 53 transition count 35
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 40 transition count 35
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 27 place count 40 transition count 33
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 31 place count 38 transition count 33
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 57 place count 25 transition count 20
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 60 place count 25 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 24 transition count 19
Applied a total of 61 rules in 21 ms. Remains 24 /56 variables (removed 32) and now considering 19/48 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 24/56 places, 19/48 transitions.
RANDOM walk for 7482 steps (995 resets) in 76 ms. (97 steps per ms) remains 0/2 properties
Successfully simplified 8 atomic propositions for a total of 14 simplifications.
FORMULA DoubleExponent-PT-001-CTLCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-31 21:33:45] [INFO ] Flatten gal took : 8 ms
[2025-05-31 21:33:45] [INFO ] Flatten gal took : 5 ms
[2025-05-31 21:33:45] [INFO ] Input system was already deterministic with 48 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 84 edges and 56 vertex of which 50 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 56/56 places, 48/48 transitions.
Graph (complete) has 84 edges and 56 vertex of which 52 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 51 transition count 38
Reduce places removed 9 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 12 rules applied. Total rules applied 22 place count 42 transition count 35
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 25 place count 39 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 25 place count 39 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 38 transition count 34
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 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 41 place count 31 transition count 27
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 31 transition count 27
Applied a total of 42 rules in 8 ms. Remains 31 /56 variables (removed 25) and now considering 27/48 (removed 21) transitions.
// Phase 1: matrix 27 rows 31 cols
[2025-05-31 21:33:45] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:33:45] [INFO ] Implicit Places using invariants in 27 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 30/56 places, 27/48 transitions.
Graph (complete) has 61 edges and 30 vertex of which 29 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 28 transition count 25
Applied a total of 3 rules in 2 ms. Remains 28 /30 variables (removed 2) and now considering 25/27 (removed 2) transitions.
// Phase 1: matrix 25 rows 28 cols
[2025-05-31 21:33:45] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:33:45] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-05-31 21:33:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:33:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 21:33:45] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 28/56 places, 25/48 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 102 ms. Remains : 28/56 places, 25/48 transitions.
[2025-05-31 21:33:45] [INFO ] Flatten gal took : 2 ms
[2025-05-31 21:33:45] [INFO ] Flatten gal took : 2 ms
[2025-05-31 21:33:45] [INFO ] Input system was already deterministic with 25 transitions.
[2025-05-31 21:33:45] [INFO ] Flatten gal took : 2 ms
[2025-05-31 21:33:45] [INFO ] Flatten gal took : 2 ms
[2025-05-31 21:33:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality2877008458072525222.gal : 1 ms
[2025-05-31 21:33:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality16788903607599408278.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2877008458072525222.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16788903607599408278.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,85,0.015944,3872,2,198,5,883,6,0,140,805,0


Converting to forward existential form...Done !
original formula: EG(AF(((p9<1)||((p28<1)&&(p18>p3)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((p9<1)||((p28<1)&&(p18>p3)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t9, t11, t15, t18, t19, t22, t23, t24, Intersection with reachable at each step enabled....202
(forward)formula 0,0,0.04149,5280,1,0,164,7386,75,71,837,7054,162
FORMULA DoubleExponent-PT-001-CTLCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 48/48 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 53 transition count 48
Applied a total of 3 rules in 1 ms. Remains 53 /56 variables (removed 3) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 53 cols
[2025-05-31 21:33:45] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:33:45] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-05-31 21:33:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:33:45] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Running 47 sub problems to find dead transitions.
[2025-05-31 21:33:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:33:45] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:33:45] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 48/100 variables, 52/59 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:33:46] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:33:46] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 1/101 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (OVERLAPS) 0/101 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 62 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1759 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 48/100 variables, 52/61 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 45/106 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:33:47] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:33:48] [INFO ] Deduced a trap along path composed of 13 places in 37 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/100 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (OVERLAPS) 1/101 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/101 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/101 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 14 (OVERLAPS) 0/101 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 111 constraints, problems are : Problem set: 0 solved, 47 unsolved in 4702 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 6472ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 6472ms
Starting structural reductions in LTL mode, iteration 1 : 53/56 places, 48/48 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6560 ms. Remains : 53/56 places, 48/48 transitions.
[2025-05-31 21:33:51] [INFO ] Flatten gal took : 9 ms
[2025-05-31 21:33:51] [INFO ] Flatten gal took : 3 ms
[2025-05-31 21:33:51] [INFO ] Input system was already deterministic with 48 transitions.
[2025-05-31 21:33:51] [INFO ] Flatten gal took : 3 ms
[2025-05-31 21:33:51] [INFO ] Flatten gal took : 10 ms
[2025-05-31 21:33:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality13005022887940002580.gal : 1 ms
[2025-05-31 21:33:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality7261526447976642939.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13005022887940002580.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7261526447976642939.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,149,0.014726,4388,2,571,5,2121,6,0,259,1551,0


Converting to forward existential form...Done !
original formula: EG(A((EX(TRUE) * ((EX((p21<=p24)) + EX((p33>p15))) + (EF((p1<=p57)) * (p20>=1)))) U ((A(E((p17<=0) U (p23>=1)) U (p45>=1)) + (p17<=0)) + ...192
=> equivalent forward existential formula: [FwdG(Init,!((E(!(((!((E(!((p45>=1)) U (!(E((p17<=0) U (p23>=1))) * !((p45>=1)))) + EG(!((p45>=1))))) + (p17<=0)...581
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t12, t17, t23, t30, t36, t45, t47, Intersection with reachable at each step enabled...203
(forward)formula 0,1,0.169105,12452,1,0,458,45207,138,237,1652,35798,589
FORMULA DoubleExponent-PT-001-CTLCardinality-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 56/56 places, 48/48 transitions.
Graph (complete) has 84 edges and 56 vertex of which 52 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 52 transition count 37
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 41 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 40 transition count 36
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 25 place count 40 transition count 34
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 29 place count 38 transition count 34
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 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 43 place count 31 transition count 27
Applied a total of 43 rules in 14 ms. Remains 31 /56 variables (removed 25) and now considering 27/48 (removed 21) transitions.
// Phase 1: matrix 27 rows 31 cols
[2025-05-31 21:33:52] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:33:52] [INFO ] Implicit Places using invariants in 33 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 30/56 places, 27/48 transitions.
Graph (complete) has 63 edges and 30 vertex of which 29 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 28 transition count 25
Applied a total of 3 rules in 2 ms. Remains 28 /30 variables (removed 2) and now considering 25/27 (removed 2) transitions.
// Phase 1: matrix 25 rows 28 cols
[2025-05-31 21:33:52] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:33:52] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-05-31 21:33:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:33:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 21:33:52] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 28/56 places, 25/48 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 114 ms. Remains : 28/56 places, 25/48 transitions.
[2025-05-31 21:33:52] [INFO ] Flatten gal took : 2 ms
[2025-05-31 21:33:52] [INFO ] Flatten gal took : 3 ms
[2025-05-31 21:33:52] [INFO ] Input system was already deterministic with 25 transitions.
[2025-05-31 21:33:52] [INFO ] Flatten gal took : 2 ms
[2025-05-31 21:33:52] [INFO ] Flatten gal took : 1 ms
[2025-05-31 21:33:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality4161169222791759030.gal : 0 ms
[2025-05-31 21:33:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality6471343521211500440.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4161169222791759030.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6471343521211500440.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,84,0.007349,3956,2,221,5,927,6,0,141,855,0


Converting to forward existential form...Done !
original formula: EG(AF(((p7<=p20)&&(p1>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((p7<=p20)&&(p1>=1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t8, t10, t14, t15, t19, t20, t24, Intersection with reachable at each step enabled. ...201
dead was empty
(forward)formula 0,0,0.036206,5620,1,0,154,8384,72,63,836,7859,175
FORMULA DoubleExponent-PT-001-CTLCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 56/56 places, 48/48 transitions.
Graph (complete) has 84 edges and 56 vertex of which 52 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 51 transition count 37
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 41 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 40 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 23 place count 40 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 39 transition count 35
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 33 place count 35 transition count 31
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 35 transition count 31
Applied a total of 34 rules in 6 ms. Remains 35 /56 variables (removed 21) and now considering 31/48 (removed 17) transitions.
// Phase 1: matrix 31 rows 35 cols
[2025-05-31 21:33:52] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:33:52] [INFO ] Implicit Places using invariants in 36 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 34/56 places, 31/48 transitions.
Graph (complete) has 65 edges and 34 vertex of which 33 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 32 transition count 29
Applied a total of 3 rules in 3 ms. Remains 32 /34 variables (removed 2) and now considering 29/31 (removed 2) transitions.
// Phase 1: matrix 29 rows 32 cols
[2025-05-31 21:33:52] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:33:52] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-05-31 21:33:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:33:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 21:33:52] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 32/56 places, 29/48 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 125 ms. Remains : 32/56 places, 29/48 transitions.
[2025-05-31 21:33:52] [INFO ] Flatten gal took : 3 ms
[2025-05-31 21:33:52] [INFO ] Flatten gal took : 2 ms
[2025-05-31 21:33:52] [INFO ] Input system was already deterministic with 29 transitions.
[2025-05-31 21:33:52] [INFO ] Flatten gal took : 1 ms
[2025-05-31 21:33:52] [INFO ] Flatten gal took : 2 ms
[2025-05-31 21:33:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality5748988040828268992.gal : 1 ms
[2025-05-31 21:33:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality6835075896540679149.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5748988040828268992.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6835075896540679149.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,97,0.008018,4008,2,258,5,1022,6,0,159,900,0


Converting to forward existential form...Done !
original formula: EG(((p36<=0) + (!(E(!(((p5<=p3)||(p33>=1))) U (p39>p11))) * (p38>p31))))
=> equivalent forward existential formula: [FwdG(Init,((p36<=0) + (!(E(!(((p5<=p3)||(p33>=1))) U (p39>p11))) * (p38>p31))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, t13, t16, t18, t21, t23, t24, t26, t28, Intersection with reachable at each step enabled...203
(forward)formula 0,1,0.038602,5544,1,0,175,7705,86,80,957,7819,178
FORMULA DoubleExponent-PT-001-CTLCardinality-2025-04 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 : 56/56 places, 48/48 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 53 transition count 48
Applied a total of 3 rules in 1 ms. Remains 53 /56 variables (removed 3) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 53 cols
[2025-05-31 21:33:52] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:33:52] [INFO ] Implicit Places using invariants in 27 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/56 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 51 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 47
Applied a total of 2 rules in 4 ms. Remains 51 /52 variables (removed 1) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 51 cols
[2025-05-31 21:33:52] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:33:52] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-05-31 21:33:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:33:52] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 51/56 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 107 ms. Remains : 51/56 places, 47/48 transitions.
[2025-05-31 21:33:52] [INFO ] Flatten gal took : 2 ms
[2025-05-31 21:33:52] [INFO ] Flatten gal took : 2 ms
[2025-05-31 21:33:52] [INFO ] Input system was already deterministic with 47 transitions.
[2025-05-31 21:33:52] [INFO ] Flatten gal took : 3 ms
[2025-05-31 21:33:52] [INFO ] Flatten gal took : 2 ms
[2025-05-31 21:33:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality8014360304619194367.gal : 0 ms
[2025-05-31 21:33:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality7289324645600085853.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8014360304619194367.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7289324645600085853.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,149,0.013435,4356,2,499,5,1956,6,0,249,1531,0


Converting to forward existential form...Done !
original formula: EX((AF(EX(EG((p29>=1)))) * ((p16<1)||(p55<=1))))
=> equivalent forward existential formula: [((EY(Init) * ((p16<1)||(p55<=1))) * !(EG(!(EX(EG((p29>=1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t12, t17, t23, t29, t30, t36, t44, t46, Intersection with reachable at each step enabled...203
(forward)formula 0,0,0.091201,8708,1,0,201,22308,120,59,1457,17504,225
FORMULA DoubleExponent-PT-001-CTLCardinality-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 56/56 places, 48/48 transitions.
Graph (complete) has 84 edges and 56 vertex of which 52 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 51 transition count 35
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 39 transition count 35
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 25 place count 39 transition count 32
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 31 place count 36 transition count 32
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 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 45 place count 29 transition count 25
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 28 transition count 24
Applied a total of 46 rules in 11 ms. Remains 28 /56 variables (removed 28) and now considering 24/48 (removed 24) transitions.
// Phase 1: matrix 24 rows 28 cols
[2025-05-31 21:33:52] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:33:52] [INFO ] Implicit Places using invariants in 27 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 27/56 places, 24/48 transitions.
Graph (complete) has 53 edges and 27 vertex of which 26 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 25 transition count 22
Applied a total of 3 rules in 2 ms. Remains 25 /27 variables (removed 2) and now considering 22/24 (removed 2) transitions.
// Phase 1: matrix 22 rows 25 cols
[2025-05-31 21:33:52] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:33:52] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-05-31 21:33:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:33:52] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 25/56 places, 22/48 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 98 ms. Remains : 25/56 places, 22/48 transitions.
[2025-05-31 21:33:52] [INFO ] Flatten gal took : 2 ms
[2025-05-31 21:33:52] [INFO ] Flatten gal took : 1 ms
[2025-05-31 21:33:52] [INFO ] Input system was already deterministic with 22 transitions.
[2025-05-31 21:33:52] [INFO ] Flatten gal took : 1 ms
[2025-05-31 21:33:52] [INFO ] Flatten gal took : 1 ms
[2025-05-31 21:33:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality10496616591962202113.gal : 0 ms
[2025-05-31 21:33:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality14288103218361387346.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10496616591962202113.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14288103218361387346.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,82,0.007741,3892,2,183,5,810,6,0,125,673,0


Converting to forward existential form...Done !
original formula: EG((p45<=p32))
=> equivalent forward existential formula: [FwdG(Init,(p45<=p32))] != FALSE
Hit Full ! (commute/partial/dont) 18/0/4
(forward)formula 0,1,0.022873,4788,1,0,58,4783,18,4,618,3959,55
FORMULA DoubleExponent-PT-001-CTLCardinality-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 48/48 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 53 transition count 48
Applied a total of 3 rules in 2 ms. Remains 53 /56 variables (removed 3) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 53 cols
[2025-05-31 21:33:52] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:33:52] [INFO ] Implicit Places using invariants in 30 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/56 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 51 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 47
Applied a total of 2 rules in 1 ms. Remains 51 /52 variables (removed 1) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 51 cols
[2025-05-31 21:33:52] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:33:52] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-05-31 21:33:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:33:52] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 51/56 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 107 ms. Remains : 51/56 places, 47/48 transitions.
[2025-05-31 21:33:52] [INFO ] Flatten gal took : 3 ms
[2025-05-31 21:33:52] [INFO ] Flatten gal took : 3 ms
[2025-05-31 21:33:52] [INFO ] Input system was already deterministic with 47 transitions.
[2025-05-31 21:33:52] [INFO ] Flatten gal took : 3 ms
[2025-05-31 21:33:52] [INFO ] Flatten gal took : 2 ms
[2025-05-31 21:33:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality14054730169995711609.gal : 1 ms
[2025-05-31 21:33:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality11197413630229608436.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14054730169995711609.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11197413630229608436.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,149,0.012525,4224,2,528,5,1898,6,0,249,1420,0


Converting to forward existential form...Done !
original formula: EG(E((EX(TRUE) + EX(E((p17<=0) U (p52<=p44)))) U A(!(((p14<1)||(p3>1))) U (p56>=1))))
=> equivalent forward existential formula: [FwdG(Init,E((EX(TRUE) + EX(E((p17<=0) U (p52<=p44)))) U !((E(!((p56>=1)) U (!(!(((p14<1)||(p3>1)))) * !((p56>=1...191
Reverse transition relation is NOT exact ! Due to transitions t7, t12, t17, t23, t29, t30, t36, t44, t46, Intersection with reachable at each step enabled...203
(forward)formula 0,1,0.096995,8960,1,0,249,22601,128,119,1500,20329,307
FORMULA DoubleExponent-PT-001-CTLCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 48/48 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 52 transition count 48
Applied a total of 4 rules in 3 ms. Remains 52 /56 variables (removed 4) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 52 cols
[2025-05-31 21:33:52] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:33:52] [INFO ] Implicit Places using invariants in 32 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/56 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 50 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 47
Applied a total of 2 rules in 2 ms. Remains 50 /51 variables (removed 1) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 50 cols
[2025-05-31 21:33:52] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:33:53] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-05-31 21:33:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:33:53] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/56 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 116 ms. Remains : 50/56 places, 47/48 transitions.
[2025-05-31 21:33:53] [INFO ] Flatten gal took : 4 ms
[2025-05-31 21:33:53] [INFO ] Flatten gal took : 4 ms
[2025-05-31 21:33:53] [INFO ] Input system was already deterministic with 47 transitions.
[2025-05-31 21:33:53] [INFO ] Flatten gal took : 2 ms
[2025-05-31 21:33:53] [INFO ] Flatten gal took : 2 ms
[2025-05-31 21:33:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality3832596546012942441.gal : 1 ms
[2025-05-31 21:33:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality5059715163622320441.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3832596546012942441.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5059715163622320441.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,149,0.013205,4220,2,415,5,1755,6,0,248,1481,0


Converting to forward existential form...Done !
original formula: AX(((p23<=0) * AX(AX(!(A((p49<=0) U (p38>=1)))))))
=> equivalent forward existential formula: ([(EY(Init) * !((p23<=0)))] = FALSE * [((EY(EY(EY(Init))) * !(EG(!((p38>=1))))) * !(E(!((p38>=1)) U (!((p49<=0))...183
Reverse transition relation is NOT exact ! Due to transitions t7, t12, t17, t23, t29, t30, t36, t44, t46, Intersection with reachable at each step enabled...203
(forward)formula 0,1,0.108118,9852,1,0,361,29502,122,163,1402,24781,451
FORMULA DoubleExponent-PT-001-CTLCardinality-2025-08 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 : 56/56 places, 48/48 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 53 transition count 48
Applied a total of 3 rules in 1 ms. Remains 53 /56 variables (removed 3) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 53 cols
[2025-05-31 21:33:53] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:33:53] [INFO ] Implicit Places using invariants in 29 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/56 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 51 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 47
Applied a total of 2 rules in 1 ms. Remains 51 /52 variables (removed 1) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 51 cols
[2025-05-31 21:33:53] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:33:53] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-05-31 21:33:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:33:53] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 51/56 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 131 ms. Remains : 51/56 places, 47/48 transitions.
[2025-05-31 21:33:53] [INFO ] Flatten gal took : 2 ms
[2025-05-31 21:33:53] [INFO ] Flatten gal took : 3 ms
[2025-05-31 21:33:53] [INFO ] Input system was already deterministic with 47 transitions.
[2025-05-31 21:33:53] [INFO ] Flatten gal took : 3 ms
[2025-05-31 21:33:53] [INFO ] Flatten gal took : 2 ms
[2025-05-31 21:33:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality10872591968535524324.gal : 1 ms
[2025-05-31 21:33:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality10573988189733374665.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10872591968535524324.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10573988189733374665.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,149,0.015408,4224,2,556,5,1872,6,0,249,1358,0


Converting to forward existential form...Done !
original formula: EG(((E((AF((p12>p5)) + AG(((p8<=p1)||(p16>=1)))) U (p6>=1)) + EX(TRUE)) + AX(((p51>p57)||(p17>p46)))))
=> equivalent forward existential formula: [FwdG(Init,((E((!(EG(!((p12>p5)))) + !(E(TRUE U !(((p8<=p1)||(p16>=1)))))) U (p6>=1)) + EX(TRUE)) + !(EX(!(((p51...187
Reverse transition relation is NOT exact ! Due to transitions t7, t12, t17, t23, t29, t30, t36, t44, t46, Intersection with reachable at each step enabled...203
(forward)formula 0,1,0.148792,11264,1,0,378,36671,130,169,1587,30087,441
FORMULA DoubleExponent-PT-001-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 48/48 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 53 transition count 48
Applied a total of 3 rules in 2 ms. Remains 53 /56 variables (removed 3) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 53 cols
[2025-05-31 21:33:53] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:33:53] [INFO ] Implicit Places using invariants in 36 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/56 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 51 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 47
Applied a total of 2 rules in 2 ms. Remains 51 /52 variables (removed 1) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 51 cols
[2025-05-31 21:33:53] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:33:53] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-05-31 21:33:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:33:53] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 51/56 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 112 ms. Remains : 51/56 places, 47/48 transitions.
[2025-05-31 21:33:53] [INFO ] Flatten gal took : 3 ms
[2025-05-31 21:33:53] [INFO ] Flatten gal took : 2 ms
[2025-05-31 21:33:53] [INFO ] Input system was already deterministic with 47 transitions.
[2025-05-31 21:33:53] [INFO ] Flatten gal took : 2 ms
[2025-05-31 21:33:53] [INFO ] Flatten gal took : 2 ms
[2025-05-31 21:33:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality2008855633042668590.gal : 0 ms
[2025-05-31 21:33:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality15579152117418322410.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2008855633042668590.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15579152117418322410.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,149,0.013874,4316,2,528,5,1898,6,0,249,1420,0


Converting to forward existential form...Done !
original formula: (EG(((E(AX(EG((p53<=0))) U ((EX((p38>=1)) * (p56<=1)) * ((p31>=1)&&((p32<=p33)||(p23<=p14))))) + (p21>=1)) + (p36<1))) + EG(AG(((E(((p27<...230
=> equivalent forward existential formula: ([FwdG(Init,((E(!(EX(!(EG((p53<=0))))) U ((EX((p38>=1)) * (p56<=1)) * ((p31>=1)&&((p32<=p33)||(p23<=p14))))) + (...309
Reverse transition relation is NOT exact ! Due to transitions t7, t12, t17, t23, t29, t30, t36, t44, t46, Intersection with reachable at each step enabled...203
(forward)formula 0,1,0.131807,10332,1,0,404,31959,126,204,1429,29947,435
FORMULA DoubleExponent-PT-001-CTLCardinality-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 48/48 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 52 transition count 48
Applied a total of 4 rules in 1 ms. Remains 52 /56 variables (removed 4) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 52 cols
[2025-05-31 21:33:53] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:33:53] [INFO ] Implicit Places using invariants in 28 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/56 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 50 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 47
Applied a total of 2 rules in 2 ms. Remains 50 /51 variables (removed 1) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 50 cols
[2025-05-31 21:33:53] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:33:53] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-05-31 21:33:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:33:53] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/56 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 109 ms. Remains : 50/56 places, 47/48 transitions.
[2025-05-31 21:33:53] [INFO ] Flatten gal took : 2 ms
[2025-05-31 21:33:53] [INFO ] Flatten gal took : 2 ms
[2025-05-31 21:33:53] [INFO ] Input system was already deterministic with 47 transitions.
[2025-05-31 21:33:53] [INFO ] Flatten gal took : 2 ms
[2025-05-31 21:33:53] [INFO ] Flatten gal took : 2 ms
[2025-05-31 21:33:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality12112389384050389225.gal : 0 ms
[2025-05-31 21:33:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality1140209203240556191.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12112389384050389225.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1140209203240556191.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,149,0.014348,4224,2,415,5,1755,6,0,248,1481,0


Converting to forward existential form...Done !
original formula: AF(EX(EG((p40<1))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(EG((p40<1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t12, t17, t23, t29, t30, t36, t44, t46, Intersection with reachable at each step enabled...203
(forward)formula 0,1,0.102699,9344,1,0,289,28264,118,120,1397,23779,343
FORMULA DoubleExponent-PT-001-CTLCardinality-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 56/56 places, 48/48 transitions.
Graph (complete) has 84 edges and 56 vertex of which 54 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 53 transition count 36
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 42 transition count 36
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 23 place count 42 transition count 33
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 29 place count 39 transition count 33
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 45 place count 31 transition count 25
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 30 transition count 24
Applied a total of 46 rules in 10 ms. Remains 30 /56 variables (removed 26) and now considering 24/48 (removed 24) transitions.
// Phase 1: matrix 24 rows 30 cols
[2025-05-31 21:33:54] [INFO ] Computed 6 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:33:54] [INFO ] Implicit Places using invariants in 26 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 29/56 places, 24/48 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 28 transition count 23
Applied a total of 2 rules in 2 ms. Remains 28 /29 variables (removed 1) and now considering 23/24 (removed 1) transitions.
// Phase 1: matrix 23 rows 28 cols
[2025-05-31 21:33:54] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:33:54] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-05-31 21:33:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:33:54] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 28/56 places, 23/48 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 94 ms. Remains : 28/56 places, 23/48 transitions.
[2025-05-31 21:33:54] [INFO ] Flatten gal took : 1 ms
[2025-05-31 21:33:54] [INFO ] Flatten gal took : 2 ms
[2025-05-31 21:33:54] [INFO ] Input system was already deterministic with 23 transitions.
[2025-05-31 21:33:54] [INFO ] Flatten gal took : 1 ms
[2025-05-31 21:33:54] [INFO ] Flatten gal took : 1 ms
[2025-05-31 21:33:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality18058549533306957572.gal : 0 ms
[2025-05-31 21:33:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality14812064974313342976.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18058549533306957572.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14812064974313342976.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,81,0.006234,3924,2,215,5,849,6,0,132,611,0


Converting to forward existential form...Done !
original formula: EG(((p25>p53) + EF((p56>=1))))
=> equivalent forward existential formula: [FwdG(Init,((p25>p53) + E(TRUE U (p56>=1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t13, t16, t17, t19, t22, Intersection with reachable at each step enabled. (destroye...192
(forward)formula 0,1,0.026729,5076,1,0,105,5642,71,32,853,4774,114
FORMULA DoubleExponent-PT-001-CTLCardinality-2023-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 : 56/56 places, 48/48 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 52 transition count 48
Applied a total of 4 rules in 2 ms. Remains 52 /56 variables (removed 4) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 52 cols
[2025-05-31 21:33:54] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:33:54] [INFO ] Implicit Places using invariants in 31 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/56 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 50 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 47
Applied a total of 2 rules in 8 ms. Remains 50 /51 variables (removed 1) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 50 cols
[2025-05-31 21:33:54] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:33:54] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-05-31 21:33:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:33:54] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/56 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 110 ms. Remains : 50/56 places, 47/48 transitions.
[2025-05-31 21:33:54] [INFO ] Flatten gal took : 2 ms
[2025-05-31 21:33:54] [INFO ] Flatten gal took : 2 ms
[2025-05-31 21:33:54] [INFO ] Input system was already deterministic with 47 transitions.
[2025-05-31 21:33:54] [INFO ] Flatten gal took : 1 ms
[2025-05-31 21:33:54] [INFO ] Flatten gal took : 1 ms
[2025-05-31 21:33:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality7133241377882849117.gal : 0 ms
[2025-05-31 21:33:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality11249134300021959908.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7133241377882849117.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11249134300021959908.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,149,0.012816,4224,2,415,5,1755,6,0,248,1481,0


Converting to forward existential form...Done !
original formula: AX(AX(EF((p8>0))))
=> equivalent forward existential formula: [(EY(EY(Init)) * !(E(TRUE U (p8>0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t12, t17, t23, t29, t30, t36, t44, t46, Intersection with reachable at each step enabled...203
(forward)formula 0,1,0.063969,6912,1,0,106,14468,115,62,1431,8912,129
FORMULA DoubleExponent-PT-001-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2025-05-31 21:33:54] [INFO ] Flatten gal took : 6 ms
[2025-05-31 21:33:54] [INFO ] Flatten gal took : 5 ms
Total runtime 12063 ms.

BK_STOP 1748727234405

--------------------
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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="DoubleExponent-PT-001"
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-5832"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-001, 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 r072-tall-174860067500457"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-001.tgz
mv DoubleExponent-PT-001 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;