Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K 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 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 39K 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 MedleyA-PT-13-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-13-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-13-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-13-CTLCardinality-2024-15
FORMULA_NAME MedleyA-PT-13-CTLCardinality-2025-00
FORMULA_NAME MedleyA-PT-13-CTLCardinality-2025-01
FORMULA_NAME MedleyA-PT-13-CTLCardinality-2025-02
FORMULA_NAME MedleyA-PT-13-CTLCardinality-2025-03
FORMULA_NAME MedleyA-PT-13-CTLCardinality-2025-04
FORMULA_NAME MedleyA-PT-13-CTLCardinality-2025-05
FORMULA_NAME MedleyA-PT-13-CTLCardinality-2025-06
FORMULA_NAME MedleyA-PT-13-CTLCardinality-2025-07
FORMULA_NAME MedleyA-PT-13-CTLCardinality-2025-08
FORMULA_NAME MedleyA-PT-13-CTLCardinality-2025-09
FORMULA_NAME MedleyA-PT-13-CTLCardinality-2025-10
FORMULA_NAME MedleyA-PT-13-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748866312265

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-02 12:11:54] [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-06-02 12:11:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 12:11:55] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2025-06-02 12:11:55] [INFO ] Transformed 173 places.
[2025-06-02 12:11:55] [INFO ] Transformed 159 transitions.
[2025-06-02 12:11:55] [INFO ] Found NUPN structural information;
[2025-06-02 12:11:55] [INFO ] Parsed PT model containing 173 places and 159 transitions and 401 arcs in 346 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 28 ms.
FORMULA MedleyA-PT-13-CTLCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-13-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 67 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 159/159 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 168 transition count 159
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 12 place count 161 transition count 152
Iterating global reduction 1 with 7 rules applied. Total rules applied 19 place count 161 transition count 152
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 159 transition count 150
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 159 transition count 150
Applied a total of 23 rules in 80 ms. Remains 159 /173 variables (removed 14) and now considering 150/159 (removed 9) transitions.
// Phase 1: matrix 150 rows 159 cols
[2025-06-02 12:11:55] [INFO ] Computed 16 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:11:56] [INFO ] Implicit Places using invariants in 549 ms returned [36, 41]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 621 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 157/173 places, 150/159 transitions.
Applied a total of 0 rules in 13 ms. Remains 157 /157 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 745 ms. Remains : 157/173 places, 150/159 transitions.
Support contains 67 out of 157 places after structural reductions.
[2025-06-02 12:11:56] [INFO ] Flatten gal took : 90 ms
[2025-06-02 12:11:56] [INFO ] Flatten gal took : 32 ms
[2025-06-02 12:11:56] [INFO ] Input system was already deterministic with 150 transitions.
Support contains 57 out of 157 places (down from 67) after GAL structural reductions.
RANDOM walk for 40000 steps (1156 resets) in 2298 ms. (17 steps per ms) remains 4/37 properties
BEST_FIRST walk for 40003 steps (265 resets) in 385 ms. (103 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (284 resets) in 203 ms. (196 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (287 resets) in 114 ms. (347 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (248 resets) in 177 ms. (224 steps per ms) remains 1/4 properties
// Phase 1: matrix 150 rows 157 cols
[2025-06-02 12:11:57] [INFO ] Computed 14 invariants in 9 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/52 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/101 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 56/157 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 150/307 variables, 157/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/307 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 171 constraints, problems are : Problem set: 0 solved, 1 unsolved in 297 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/52 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/101 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:11:58] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 56/157 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 150/307 variables, 157/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/307 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/307 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 173 constraints, problems are : Problem set: 0 solved, 1 unsolved in 492 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 826ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 215 steps, including 6 resets, run visited all 1 properties in 4 ms. (steps per millisecond=53 )
Parikh walk visited 1 properties in 14 ms.
[2025-06-02 12:11:58] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-02 12:11:58] [INFO ] Flatten gal took : 23 ms
FORMULA MedleyA-PT-13-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 12:11:58] [INFO ] Flatten gal took : 20 ms
[2025-06-02 12:11:58] [INFO ] Input system was already deterministic with 150 transitions.
Support contains 54 out of 157 places (down from 57) after GAL structural reductions.
Computed a total of 13 stabilizing places and 13 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 157/157 places, 150/150 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 156 transition count 121
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 30 rules applied. Total rules applied 58 place count 128 transition count 119
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 60 place count 127 transition count 118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 61 place count 126 transition count 118
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 26 Pre rules applied. Total rules applied 61 place count 126 transition count 92
Deduced a syphon composed of 26 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 53 rules applied. Total rules applied 114 place count 99 transition count 92
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 116 place count 98 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 117 place count 97 transition count 91
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 129 place count 85 transition count 79
Iterating global reduction 6 with 12 rules applied. Total rules applied 141 place count 85 transition count 79
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 141 place count 85 transition count 74
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 151 place count 80 transition count 74
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 193 place count 59 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 194 place count 58 transition count 52
Applied a total of 194 rules in 100 ms. Remains 58 /157 variables (removed 99) and now considering 52/150 (removed 98) transitions.
// Phase 1: matrix 52 rows 58 cols
[2025-06-02 12:11:58] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:11:59] [INFO ] Implicit Places using invariants in 115 ms returned [0, 14, 27, 31, 35]
[2025-06-02 12:11:59] [INFO ] Actually due to overlaps returned [0, 31, 14, 35]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 117 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 54/157 places, 52/150 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 54 transition count 51
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 53 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 52 transition count 50
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 4 place count 52 transition count 47
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 10 place count 49 transition count 47
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 3 with 2 rules applied. Total rules applied 12 place count 48 transition count 46
Applied a total of 12 rules in 14 ms. Remains 48 /54 variables (removed 6) and now considering 46/52 (removed 6) transitions.
// Phase 1: matrix 46 rows 48 cols
[2025-06-02 12:11:59] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:11:59] [INFO ] Implicit Places using invariants in 85 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 89 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 47/157 places, 46/150 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 46 transition count 45
Applied a total of 2 rules in 6 ms. Remains 46 /47 variables (removed 1) and now considering 45/46 (removed 1) transitions.
// Phase 1: matrix 45 rows 46 cols
[2025-06-02 12:11:59] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:11:59] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-06-02 12:11:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:11:59] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 46/157 places, 45/150 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 543 ms. Remains : 46/157 places, 45/150 transitions.
[2025-06-02 12:11:59] [INFO ] Flatten gal took : 6 ms
[2025-06-02 12:11:59] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:11:59] [INFO ] Input system was already deterministic with 45 transitions.
[2025-06-02 12:11:59] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:11:59] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:11:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality12705570661982500237.gal : 2 ms
[2025-06-02 12:11:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality12561148517901229339.ctl : 4 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/CTLCardinality12705570661982500237.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12561148517901229339.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,2440,0.029062,4056,2,127,5,903,6,0,232,813,0


Converting to forward existential form...Done !
original formula: !(E(A(AF(((p35==0)||(p77==1))) U (p68==1)) U (p137==1)))
=> equivalent forward existential formula: [(FwdU(Init,!((E(!((p68==1)) U (!(!(EG(!(((p35==0)||(p77==1)))))) * !((p68==1)))) + EG(!((p68==1)))))) * (p137==...167
Reverse transition relation is NOT exact ! Due to transitions t9, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...163
(forward)formula 0,1,0.255861,11480,1,0,279,44549,122,138,1333,46552,385
FORMULA MedleyA-PT-13-CTLCardinality-2025-00 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 : 157/157 places, 150/150 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 148 transition count 141
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 148 transition count 141
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 146 transition count 139
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 146 transition count 139
Applied a total of 22 rules in 16 ms. Remains 146 /157 variables (removed 11) and now considering 139/150 (removed 11) transitions.
// Phase 1: matrix 139 rows 146 cols
[2025-06-02 12:11:59] [INFO ] Computed 14 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:11:59] [INFO ] Implicit Places using invariants in 151 ms returned []
[2025-06-02 12:11:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:12:00] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2025-06-02 12:12:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:12:03] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:12:03] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:12:03] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:12:03] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:12:04] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:12:04] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:12:04] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:12:04] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:12:04] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:12:05] [INFO ] Deduced a trap composed of 72 places in 114 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:12:05] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:12:05] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:12:05] [INFO ] Deduced a trap composed of 78 places in 118 ms of which 15 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:12:06] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:12:07] [INFO ] Deduced a trap composed of 70 places in 98 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 139/285 variables, 146/175 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (OVERLAPS) 0/285 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 175 constraints, problems are : Problem set: 0 solved, 138 unsolved in 15147 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 15/29 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (OVERLAPS) 139/285 variables, 146/175 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 138/313 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:12:18] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:12:18] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:12:19] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:12:19] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:12:20] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:12:20] [INFO ] Deduced a trap composed of 76 places in 123 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:12:20] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 7/320 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:12:21] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:12:23] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 11 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:12:26] [INFO ] Deduced a trap along path composed of 12 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:12:27] [INFO ] Deduced a trap along path composed of 11 places in 74 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:12:27] [INFO ] Deduced a trap along path composed of 16 places in 40 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:12:28] [INFO ] Deduced a trap along path composed of 9 places in 79 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/285 variables, 4/326 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 285/285 variables, and 326 constraints, problems are : Problem set: 0 solved, 138 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 45214ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 45218ms
Starting structural reductions in LTL mode, iteration 1 : 146/157 places, 139/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45648 ms. Remains : 146/157 places, 139/150 transitions.
[2025-06-02 12:12:45] [INFO ] Flatten gal took : 12 ms
[2025-06-02 12:12:45] [INFO ] Flatten gal took : 12 ms
[2025-06-02 12:12:45] [INFO ] Input system was already deterministic with 139 transitions.
[2025-06-02 12:12:45] [INFO ] Flatten gal took : 13 ms
[2025-06-02 12:12:45] [INFO ] Flatten gal took : 12 ms
[2025-06-02 12:12:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality1517315331214694880.gal : 5 ms
[2025-06-02 12:12:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality16090126258428312965.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/CTLCardinality1517315331214694880.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16090126258428312965.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,4.18332e+06,0.435743,12708,2,4671,5,26065,6,0,725,45997,0


Converting to forward existential form...Done !
original formula: E(AG(E(!((((p154==0)||(p137==1))&&(p3==0))) U EG((p24==1)))) U (A(AX((((p75==0)||(p159==1))||(p147==0))) U EX(!(((p87==0)||(p157==1))))) ...213
=> equivalent forward existential formula: ([((FwdU(Init,!(E(TRUE U !(E(!((((p154==0)||(p137==1))&&(p3==0))) U EG((p24==1))))))) * !(EG(!(EX(!(((p87==0)||(...521
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t13, t17, t19, t21, t36, t38, t43, t46, t51, t53, t57, t58, t61, t67, t69, t74, t76, ...275
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-06-02 12:13:15] [INFO ] Flatten gal took : 10 ms
[2025-06-02 12:13:15] [INFO ] Applying decomposition
[2025-06-02 12:13:15] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5494870294069909352.txt' '-o' '/tmp/graph5494870294069909352.bin' '-w' '/tmp/graph5494870294069909352.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5494870294069909352.bin' '-l' '-1' '-v' '-w' '/tmp/graph5494870294069909352.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:13:15] [INFO ] Decomposing Gal with order
[2025-06-02 12:13:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:13:15] [INFO ] Removed a total of 21 redundant transitions.
[2025-06-02 12:13:15] [INFO ] Flatten gal took : 67 ms
[2025-06-02 12:13:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2025-06-02 12:13:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality17137044643591454955.gal : 9 ms
[2025-06-02 12:13:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality15380256270617783468.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/CTLCardinality17137044643591454955.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15380256270617783468.ctl'

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 -...264
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,4.18332e+06,0.103023,6828,654,52,5573,256,429,8587,64,513,0


Converting to forward existential form...Done !
original formula: E(AG(E(!((((i1.u49.p154==0)||(i8.i1.u48.p137==1))&&(i9.i0.u0.p3==0))) U EG((i3.u10.p24==1)))) U (A(AX((((i6.u28.p75==0)||(i10.u54.p159==1...313
=> equivalent forward existential formula: ([((FwdU(Init,!(E(TRUE U !(E(!((((i1.u49.p154==0)||(i8.i1.u48.p137==1))&&(i9.i0.u0.p3==0))) U EG((i3.u10.p24==1)...710
Reverse transition relation is NOT exact ! Due to transitions t3, t21, t38, t81, i1.u49.t17, i1.u49.t19, i2.i0.t78, i2.i1.u19.t67, i3.u10.t74, i3.u10.t76, ...413
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,7.00651,194988,1,0,376964,749,2718,513103,326,2208,596467
FORMULA MedleyA-PT-13-CTLCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 150/150 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 142 transition count 135
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 142 transition count 135
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 140 transition count 133
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 140 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 139 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 139 transition count 132
Applied a total of 36 rules in 23 ms. Remains 139 /157 variables (removed 18) and now considering 132/150 (removed 18) transitions.
// Phase 1: matrix 132 rows 139 cols
[2025-06-02 12:13:23] [INFO ] Computed 14 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:13:23] [INFO ] Implicit Places using invariants in 127 ms returned []
[2025-06-02 12:13:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:13:23] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Running 131 sub problems to find dead transitions.
[2025-06-02 12:13:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:13:25] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:13:26] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:13:26] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 20 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:13:26] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 132/271 variables, 139/157 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:13:30] [INFO ] Deduced a trap along path composed of 8 places in 60 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:13:31] [INFO ] Deduced a trap along path composed of 9 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 0/271 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 159 constraints, problems are : Problem set: 0 solved, 131 unsolved in 12875 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/271 variables, 139/157 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 131/288 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:13:38] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:13:38] [INFO ] Deduced a trap composed of 63 places in 130 ms of which 18 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:13:40] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:13:41] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:13:49] [INFO ] Deduced a trap along path composed of 12 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:14:01] [INFO ] Deduced a trap along path composed of 11 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/271 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 271/271 variables, and 296 constraints, problems are : Problem set: 0 solved, 131 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 42935ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 42943ms
Starting structural reductions in LTL mode, iteration 1 : 139/157 places, 132/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43318 ms. Remains : 139/157 places, 132/150 transitions.
[2025-06-02 12:14:06] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:14:06] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:14:06] [INFO ] Input system was already deterministic with 132 transitions.
[2025-06-02 12:14:06] [INFO ] Flatten gal took : 6 ms
[2025-06-02 12:14:06] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:14:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality713332080401889030.gal : 2 ms
[2025-06-02 12:14:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality3133627928839885158.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/CTLCardinality713332080401889030.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3133627928839885158.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 -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.31837e+06,0.195754,9732,2,2148,5,19161,6,0,690,29724,0


Converting to forward existential form...Done !
original formula: EX(AF(AG(EX(EG(((p86==0)||(p8==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(!(E(TRUE U !(EX(EG(((p86==0)||(p8==1)))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t19, t34, t36, t43, t48, t54, t57, t60, t61, t63, t73, t76, t86, Intersection with reach...231
Detected timeout of ITS tools.
[2025-06-02 12:14:36] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:14:36] [INFO ] Applying decomposition
[2025-06-02 12:14:36] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16291792675621498358.txt' '-o' '/tmp/graph16291792675621498358.bin' '-w' '/tmp/graph16291792675621498358.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16291792675621498358.bin' '-l' '-1' '-v' '-w' '/tmp/graph16291792675621498358.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:14:36] [INFO ] Decomposing Gal with order
[2025-06-02 12:14:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:14:36] [INFO ] Removed a total of 23 redundant transitions.
[2025-06-02 12:14:36] [INFO ] Flatten gal took : 16 ms
[2025-06-02 12:14:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-02 12:14:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality11884388068947298677.gal : 5 ms
[2025-06-02 12:14:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality15223867812575713587.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/CTLCardinality11884388068947298677.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15223867812575713587.ctl'

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 -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.31837e+06,0.060589,5620,402,28,3179,217,417,3858,52,359,0


Converting to forward existential form...Done !
original formula: EX(AF(AG(EX(EG(((i6.i1.u27.p86==0)||(i0.u3.p8==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(!(E(TRUE U !(EX(EG(((i6.i1.u27.p86==0)||(i0.u3.p8==1)))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t19, t36, i2.i0.t76, i2.i1.u28.t48, i4.i0.u1.t86, i5.i0.t73, i5.i1.u18.t63, i6.i0.t61, i6...324
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,0,2.50399,73076,1,0,145618,507,2332,162726,233,1194,238434
FORMULA MedleyA-PT-13-CTLCardinality-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 157/157 places, 150/150 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 156 transition count 120
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 60 place count 127 transition count 118
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 63 place count 126 transition count 116
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 65 place count 124 transition count 116
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 65 place count 124 transition count 92
Deduced a syphon composed of 24 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 49 rules applied. Total rules applied 114 place count 99 transition count 92
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 116 place count 98 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 117 place count 97 transition count 91
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 128 place count 86 transition count 80
Iterating global reduction 6 with 11 rules applied. Total rules applied 139 place count 86 transition count 80
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 139 place count 86 transition count 75
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 149 place count 81 transition count 75
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 187 place count 62 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 188 place count 61 transition count 55
Applied a total of 188 rules in 24 ms. Remains 61 /157 variables (removed 96) and now considering 55/150 (removed 95) transitions.
// Phase 1: matrix 55 rows 61 cols
[2025-06-02 12:14:39] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:14:39] [INFO ] Implicit Places using invariants in 125 ms returned [0, 31, 35, 39]
[2025-06-02 12:14:39] [INFO ] Actually due to overlaps returned [0, 35, 39]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 127 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 58/157 places, 55/150 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 58 transition count 54
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 57 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 56 transition count 53
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 4 place count 56 transition count 50
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 10 place count 53 transition count 50
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 3 with 2 rules applied. Total rules applied 12 place count 52 transition count 49
Applied a total of 12 rules in 7 ms. Remains 52 /58 variables (removed 6) and now considering 49/55 (removed 6) transitions.
// Phase 1: matrix 49 rows 52 cols
[2025-06-02 12:14:39] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:14:39] [INFO ] Implicit Places using invariants in 51 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 51/157 places, 49/150 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 51 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 50 transition count 48
Applied a total of 2 rules in 4 ms. Remains 50 /51 variables (removed 1) and now considering 48/49 (removed 1) transitions.
// Phase 1: matrix 48 rows 50 cols
[2025-06-02 12:14:39] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:14:39] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-02 12:14:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:14:39] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 50/157 places, 48/150 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 371 ms. Remains : 50/157 places, 48/150 transitions.
[2025-06-02 12:14:39] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:14:39] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:14:39] [INFO ] Input system was already deterministic with 48 transitions.
[2025-06-02 12:14:39] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:14:39] [INFO ] Flatten gal took : 3 ms
[2025-06-02 12:14:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality2599982498718608026.gal : 1 ms
[2025-06-02 12:14:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality14415764846034132921.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/CTLCardinality2599982498718608026.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14415764846034132921.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,3528,0.023628,4164,2,170,5,1529,6,0,250,1677,0


Converting to forward existential form...Done !
original formula: EF(!(E(!(AF(((p67==0)||(p62==1)))) U ((p35==0)||(p59==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(!(EG(!(((p67==0)||(p62==1)))))) U ((p35==0)||(p59==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...163
(forward)formula 0,1,0.089311,5700,1,0,121,8643,121,68,1447,8547,182
FORMULA MedleyA-PT-13-CTLCardinality-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 150/150 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 146 transition count 139
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 146 transition count 139
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 145 transition count 138
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 145 transition count 138
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 144 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 144 transition count 137
Applied a total of 26 rules in 14 ms. Remains 144 /157 variables (removed 13) and now considering 137/150 (removed 13) transitions.
// Phase 1: matrix 137 rows 144 cols
[2025-06-02 12:14:39] [INFO ] Computed 14 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:14:39] [INFO ] Implicit Places using invariants in 176 ms returned []
[2025-06-02 12:14:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:14:40] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2025-06-02 12:14:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 136 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:14:43] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:14:43] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:14:43] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:14:43] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:14:43] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:14:43] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:14:44] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:14:44] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 24 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/281 variables, 144/166 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (OVERLAPS) 0/281 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 166 constraints, problems are : Problem set: 0 solved, 136 unsolved in 13431 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/281 variables, 144/166 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 136/302 constraints. Problems are: Problem set: 0 solved, 136 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:14:57] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:14:57] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:14:58] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 16 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 136 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:15:01] [INFO ] Deduced a trap along path composed of 11 places in 102 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:15:01] [INFO ] Deduced a trap along path composed of 9 places in 86 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:15:01] [INFO ] Deduced a trap along path composed of 12 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 3/308 constraints. Problems are: Problem set: 0 solved, 136 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:15:10] [INFO ] Deduced a trap along path composed of 9 places in 61 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 136 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 281/281 variables, and 309 constraints, problems are : Problem set: 0 solved, 136 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 43471ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 43474ms
Starting structural reductions in LTL mode, iteration 1 : 144/157 places, 137/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43922 ms. Remains : 144/157 places, 137/150 transitions.
[2025-06-02 12:15:23] [INFO ] Flatten gal took : 8 ms
[2025-06-02 12:15:23] [INFO ] Flatten gal took : 8 ms
[2025-06-02 12:15:23] [INFO ] Input system was already deterministic with 137 transitions.
[2025-06-02 12:15:23] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:15:23] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:15:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality5668504882103843555.gal : 3 ms
[2025-06-02 12:15:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality2752895850958714086.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/CTLCardinality5668504882103843555.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2752895850958714086.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,3.86312e+06,0.392622,11548,2,3204,5,24074,6,0,715,38766,0


Converting to forward existential form...Done !
original formula: A(A(EG(AG(EX(TRUE))) U EG(AX((p5==0)))) U !(E(AF(((p37!=0)||(!((p106==0)||(p83==1))))) U A(AX((p147==0)) U EX(((p3==0)||(p55==1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(!(EG(!(((p37!=0)||(!((p106==0)||(p83==1))))))) U !((E(!(EX(((p3==0)||(p55==1)))) U (!(!(EX(...761
Reverse transition relation is NOT exact ! Due to transitions t3, t18, t20, t35, t37, t42, t45, t50, t51, t56, t59, t62, t63, t65, t67, t71, t74, t79, t80,...272
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-06-02 12:15:53] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:15:53] [INFO ] Applying decomposition
[2025-06-02 12:15:53] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4543866702770893838.txt' '-o' '/tmp/graph4543866702770893838.bin' '-w' '/tmp/graph4543866702770893838.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4543866702770893838.bin' '-l' '-1' '-v' '-w' '/tmp/graph4543866702770893838.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:15:53] [INFO ] Decomposing Gal with order
[2025-06-02 12:15:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:15:53] [INFO ] Removed a total of 20 redundant transitions.
[2025-06-02 12:15:53] [INFO ] Flatten gal took : 14 ms
[2025-06-02 12:15:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-02 12:15:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality7315490602144485243.gal : 5 ms
[2025-06-02 12:15:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality18364463858156994086.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/CTLCardinality7315490602144485243.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18364463858156994086.ctl'

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 -...263
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,3.86312e+06,0.076592,5480,348,38,2875,229,454,3276,59,562,0


Converting to forward existential form...Done !
original formula: A(A(EG(AG(EX(TRUE))) U EG(AX((i0.u2.p5==0)))) U !(E(AF(((i2.i1.u13.p37!=0)||(!((i7.i1.u34.p106==0)||(i6.i1.u28.p83==1))))) U A(AX((i3.u53...211
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(!(EG(!(((i2.i1.u13.p37!=0)||(!((i7.i1.u34.p106==0)||(i6.i1.u28.p83==1))))))) U !((E(!(EX(((...1034
Reverse transition relation is NOT exact ! Due to transitions t3, t20, t37, t51, t74, t80, t114, i1.u1.t87, i1.u1.t91, i2.i1.t71, i2.i1.u8.t79, i2.i2.u20.t...391
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,2.92584,95848,1,0,183364,653,2628,241098,287,1690,308609
FORMULA MedleyA-PT-13-CTLCardinality-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 157/157 places, 150/150 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 156 transition count 124
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 27 rules applied. Total rules applied 52 place count 131 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 130 transition count 122
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 53 place count 130 transition count 94
Deduced a syphon composed of 28 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 57 rules applied. Total rules applied 110 place count 101 transition count 94
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 112 place count 100 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 113 place count 99 transition count 93
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 122 place count 90 transition count 84
Iterating global reduction 5 with 9 rules applied. Total rules applied 131 place count 90 transition count 84
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 131 place count 90 transition count 82
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 135 place count 88 transition count 82
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 136 place count 87 transition count 81
Iterating global reduction 5 with 1 rules applied. Total rules applied 137 place count 87 transition count 81
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 179 place count 66 transition count 60
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 180 place count 65 transition count 59
Applied a total of 180 rules in 26 ms. Remains 65 /157 variables (removed 92) and now considering 59/150 (removed 91) transitions.
// Phase 1: matrix 59 rows 65 cols
[2025-06-02 12:15:56] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:15:56] [INFO ] Implicit Places using invariants in 82 ms returned [0, 15, 27, 36]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 83 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 61/157 places, 59/150 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 58
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 60 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 59 transition count 57
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4 place count 59 transition count 56
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 6 place count 58 transition count 56
Applied a total of 6 rules in 9 ms. Remains 58 /61 variables (removed 3) and now considering 56/59 (removed 3) transitions.
// Phase 1: matrix 56 rows 58 cols
[2025-06-02 12:15:56] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:15:56] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-02 12:15:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:15:57] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 58/157 places, 56/150 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 326 ms. Remains : 58/157 places, 56/150 transitions.
[2025-06-02 12:15:57] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:15:57] [INFO ] Flatten gal took : 3 ms
[2025-06-02 12:15:57] [INFO ] Input system was already deterministic with 56 transitions.
[2025-06-02 12:15:57] [INFO ] Flatten gal took : 3 ms
[2025-06-02 12:15:57] [INFO ] Flatten gal took : 3 ms
[2025-06-02 12:15:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality8455019587895023083.gal : 1 ms
[2025-06-02 12:15:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality172802829269949372.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/CTLCardinality8455019587895023083.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality172802829269949372.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 -...282
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,7944,0.026751,4076,2,280,5,1308,6,0,290,863,0


Converting to forward existential form...Done !
original formula: AF((EG((p165==1)) * A(EG(!(((p144==0)||(p131==1)))) U !(((((p151!=0)||((p133==0)&&(p101==1)))||((p165==0)||(p18==1)))||(p85==1))))))
=> equivalent forward existential formula: [FwdG(Init,!((EG((p165==1)) * !((E(!(!(((((p151!=0)||((p133==0)&&(p101==1)))||((p165==0)||(p18==1)))||(p85==1)))...374
Reverse transition relation is NOT exact ! Due to transitions t4, t8, t12, t17, t26, Intersection with reachable at each step enabled. (destroyed/reverse/...182
(forward)formula 0,0,1.59955,45572,1,0,728,275435,149,371,1677,261823,887
FORMULA MedleyA-PT-13-CTLCardinality-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 150/150 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 142 transition count 135
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 142 transition count 135
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 141 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 141 transition count 134
Applied a total of 32 rules in 5 ms. Remains 141 /157 variables (removed 16) and now considering 134/150 (removed 16) transitions.
// Phase 1: matrix 134 rows 141 cols
[2025-06-02 12:15:58] [INFO ] Computed 14 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:15:58] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-06-02 12:15:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:15:58] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 133 sub problems to find dead transitions.
[2025-06-02 12:15:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:16:02] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:16:02] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:16:02] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 22 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:16:03] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 134/275 variables, 141/159 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:16:10] [INFO ] Deduced a trap along path composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/275 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/275 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 11 (OVERLAPS) 0/275 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 160 constraints, problems are : Problem set: 0 solved, 133 unsolved in 17458 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 134/275 variables, 141/159 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 133/292 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:16:18] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:16:18] [INFO ] Deduced a trap composed of 65 places in 109 ms of which 18 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:16:22] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 12 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/275 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:16:25] [INFO ] Deduced a trap along path composed of 9 places in 85 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:16:25] [INFO ] Deduced a trap along path composed of 14 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:16:27] [INFO ] Deduced a trap along path composed of 22 places in 51 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/275 variables, 3/299 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/275 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 13 (OVERLAPS) 0/275 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 275/275 variables, and 299 constraints, problems are : Problem set: 0 solved, 133 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 47490ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 47494ms
Starting structural reductions in LTL mode, iteration 1 : 141/157 places, 134/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47834 ms. Remains : 141/157 places, 134/150 transitions.
[2025-06-02 12:16:46] [INFO ] Flatten gal took : 8 ms
[2025-06-02 12:16:46] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:16:46] [INFO ] Input system was already deterministic with 134 transitions.
[2025-06-02 12:16:46] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:16:46] [INFO ] Flatten gal took : 6 ms
[2025-06-02 12:16:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality1211972535067289114.gal : 2 ms
[2025-06-02 12:16:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality5289890289645145457.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/CTLCardinality1211972535067289114.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5289890289645145457.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,2.37925e+06,0.282608,9996,2,2222,5,19597,6,0,700,30600,0


Converting to forward existential form...Done !
original formula: E(!(EG(A(!(((p141==0)||(p112==1))) U ((p56==1)||(p152==0))))) U !(((EG((p68==0)) + (p47==1)) + AF(EX(((p166==0)||(p140==1)))))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,!(EG(!((E(!(((p56==1)||(p152==0))) U (!(!(((p141==0)||(p112==1)))) * !(((p56==1)||(p152==0)))))...264
Reverse transition relation is NOT exact ! Due to transitions t3, t19, t34, t36, t43, t48, t54, t57, t64, t74, t77, t87, Intersection with reachable at ea...221
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-06-02 12:17:16] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:17:16] [INFO ] Applying decomposition
[2025-06-02 12:17:16] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13738874683512471663.txt' '-o' '/tmp/graph13738874683512471663.bin' '-w' '/tmp/graph13738874683512471663.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13738874683512471663.bin' '-l' '-1' '-v' '-w' '/tmp/graph13738874683512471663.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:17:16] [INFO ] Decomposing Gal with order
[2025-06-02 12:17:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:17:16] [INFO ] Removed a total of 25 redundant transitions.
[2025-06-02 12:17:16] [INFO ] Flatten gal took : 12 ms
[2025-06-02 12:17:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-02 12:17:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality7983548472171526451.gal : 4 ms
[2025-06-02 12:17:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality15293071790293542994.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/CTLCardinality7983548472171526451.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15293071790293542994.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.37925e+06,0.060736,5516,348,25,3207,207,394,3232,54,354,0


Converting to forward existential form...Done !
original formula: E(!(EG(A(!(((i10.i1.u50.p141==0)||(i6.u18.p112==1))) U ((i6.u18.p56==1)||(i4.i0.u53.p152==0))))) U !(((EG((i7.u21.p68==0)) + (i9.u14.p47=...214
=> equivalent forward existential formula: [FwdG((FwdU(Init,!(EG(!((E(!(((i6.u18.p56==1)||(i4.i0.u53.p152==0))) U (!(!(((i10.i1.u50.p141==0)||(i6.u18.p112=...366
Reverse transition relation is NOT exact ! Due to transitions t3, t19, t36, t74, i2.u1.t87, i3.i0.t77, i3.i1.u30.t48, i6.u20.t64, i7.t54, i7.u25.t57, i8.i1...277
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,2.18927,76392,1,0,157863,306,2439,191826,255,559,252284
FORMULA MedleyA-PT-13-CTLCardinality-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 157/157 places, 150/150 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 156 transition count 121
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 30 rules applied. Total rules applied 58 place count 128 transition count 119
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 127 transition count 119
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 59 place count 127 transition count 92
Deduced a syphon composed of 27 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 114 place count 99 transition count 92
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 116 place count 98 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 117 place count 97 transition count 91
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 128 place count 86 transition count 80
Iterating global reduction 5 with 11 rules applied. Total rules applied 139 place count 86 transition count 80
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 139 place count 86 transition count 76
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 147 place count 82 transition count 76
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 185 place count 63 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 186 place count 62 transition count 56
Applied a total of 186 rules in 42 ms. Remains 62 /157 variables (removed 95) and now considering 56/150 (removed 94) transitions.
// Phase 1: matrix 56 rows 62 cols
[2025-06-02 12:17:18] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:17:19] [INFO ] Implicit Places using invariants in 106 ms returned [0, 14, 32, 36]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 118 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 58/157 places, 56/150 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 58 transition count 54
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 56 transition count 54
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 56 transition count 50
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 52 transition count 50
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 2 with 2 rules applied. Total rules applied 14 place count 51 transition count 49
Applied a total of 14 rules in 6 ms. Remains 51 /58 variables (removed 7) and now considering 49/56 (removed 7) transitions.
// Phase 1: matrix 49 rows 51 cols
[2025-06-02 12:17:19] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:17:19] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-02 12:17:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:17:19] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 51/157 places, 49/150 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 358 ms. Remains : 51/157 places, 49/150 transitions.
[2025-06-02 12:17:19] [INFO ] Flatten gal took : 2 ms
[2025-06-02 12:17:19] [INFO ] Flatten gal took : 2 ms
[2025-06-02 12:17:19] [INFO ] Input system was already deterministic with 49 transitions.
[2025-06-02 12:17:19] [INFO ] Flatten gal took : 2 ms
[2025-06-02 12:17:19] [INFO ] Flatten gal took : 2 ms
[2025-06-02 12:17:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality7199861326323265308.gal : 0 ms
[2025-06-02 12:17:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality11610571796952822598.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/CTLCardinality7199861326323265308.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11610571796952822598.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,3108,0.016024,4160,2,192,5,1476,6,0,256,1374,0


Converting to forward existential form...Done !
original formula: EF(((AF(((p140==0)&&(p131==1))) + EF((p25==1))) * (((p89==1)||(p134==0))||(p63==1))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * (((p89==1)||(p134==0))||(p63==1))) * !(EG(!(((p140==0)&&(p131==1))))))] != FALSE + [(FwdU(...237
Reverse transition relation is NOT exact ! Due to transitions t11, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,1,0.288569,13760,1,0,219,60434,120,111,1479,56270,279
FORMULA MedleyA-PT-13-CTLCardinality-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 150/150 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 142 transition count 135
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 142 transition count 135
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 140 transition count 133
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 140 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 139 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 139 transition count 132
Applied a total of 36 rules in 8 ms. Remains 139 /157 variables (removed 18) and now considering 132/150 (removed 18) transitions.
// Phase 1: matrix 132 rows 139 cols
[2025-06-02 12:17:19] [INFO ] Computed 14 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:17:19] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-06-02 12:17:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:17:19] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Running 131 sub problems to find dead transitions.
[2025-06-02 12:17:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:22] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:22] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:22] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:23] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 132/271 variables, 139/157 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:27] [INFO ] Deduced a trap along path composed of 8 places in 65 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:28] [INFO ] Deduced a trap along path composed of 9 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 0/271 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 159 constraints, problems are : Problem set: 0 solved, 131 unsolved in 14554 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/271 variables, 139/157 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 131/288 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:36] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:36] [INFO ] Deduced a trap composed of 63 places in 114 ms of which 19 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:39] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:39] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:48] [INFO ] Deduced a trap along path composed of 12 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:18:00] [INFO ] Deduced a trap along path composed of 11 places in 39 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/271 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 271/271 variables, and 296 constraints, problems are : Problem set: 0 solved, 131 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 44581ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 44582ms
Starting structural reductions in LTL mode, iteration 1 : 139/157 places, 132/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44831 ms. Remains : 139/157 places, 132/150 transitions.
[2025-06-02 12:18:04] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:18:04] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:18:04] [INFO ] Input system was already deterministic with 132 transitions.
[2025-06-02 12:18:04] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:18:04] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:18:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality16672619498860185297.gal : 1 ms
[2025-06-02 12:18:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality2300703230561661471.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/CTLCardinality16672619498860185297.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2300703230561661471.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,2.31837e+06,0.194667,9824,2,2148,5,19161,6,0,690,29724,0


Converting to forward existential form...Done !
original formula: AG(!(A((((p94==1)||(p17==0))&&(((p152==1)||(p71==0))||(p149==1))) U !(AX((p36==0))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(!(!(EX(!((p36==0))))))))) * !(E(!(!(!(EX(!((p36==0)))))) U (!((((p94==1)||(p17==0))&...232
Reverse transition relation is NOT exact ! Due to transitions t3, t19, t34, t36, t43, t48, t54, t57, t60, t61, t63, t73, t76, t86, Intersection with reach...231
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-06-02 12:18:34] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:18:34] [INFO ] Applying decomposition
[2025-06-02 12:18:34] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6546162387248225903.txt' '-o' '/tmp/graph6546162387248225903.bin' '-w' '/tmp/graph6546162387248225903.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6546162387248225903.bin' '-l' '-1' '-v' '-w' '/tmp/graph6546162387248225903.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:18:34] [INFO ] Decomposing Gal with order
[2025-06-02 12:18:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:18:34] [INFO ] Removed a total of 23 redundant transitions.
[2025-06-02 12:18:34] [INFO ] Flatten gal took : 11 ms
[2025-06-02 12:18:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-02 12:18:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality12989147027894049479.gal : 3 ms
[2025-06-02 12:18:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality8240907044541258680.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/CTLCardinality12989147027894049479.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8240907044541258680.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.31837e+06,0.058272,5428,335,30,2888,188,412,3324,52,387,0


Converting to forward existential form...Done !
original formula: AG(!(A((((i4.i1.u13.p94==1)||(i5.i0.u5.p17==0))&&(((i3.u52.p152==1)||(i6.i0.u23.p71==0))||(i10.u51.p149==1))) U !(AX((i2.i0.u7.p36==0))))...157
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(!(!(EX(!((i2.i0.u7.p36==0))))))))) * !(E(!(!(!(EX(!((i2.i0.u7.p36==0)))))) U (!((((i...303
Reverse transition relation is NOT exact ! Due to transitions t3, t19, t76, i1.u1.t86, i2.t73, i2.i2.u20.t63, i4.i1.u38.t34, i6.i0.t61, i6.i0.u22.t60, i6.i...318
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,1.76513,60724,1,0,116721,347,2016,162018,228,710,192154
FORMULA MedleyA-PT-13-CTLCardinality-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 150/150 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 144 transition count 137
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 144 transition count 137
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 142 transition count 135
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 142 transition count 135
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 141 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 141 transition count 134
Applied a total of 32 rules in 6 ms. Remains 141 /157 variables (removed 16) and now considering 134/150 (removed 16) transitions.
// Phase 1: matrix 134 rows 141 cols
[2025-06-02 12:18:36] [INFO ] Computed 14 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:18:36] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-06-02 12:18:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:18:36] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Running 133 sub problems to find dead transitions.
[2025-06-02 12:18:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:18:39] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:18:39] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:18:40] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 21 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 134/275 variables, 141/158 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (OVERLAPS) 0/275 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 158 constraints, problems are : Problem set: 0 solved, 133 unsolved in 12221 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 134/275 variables, 141/158 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 133/291 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:18:52] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:18:52] [INFO ] Deduced a trap composed of 62 places in 108 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:18:52] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:18:53] [INFO ] Deduced a trap composed of 69 places in 124 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:18:53] [INFO ] Deduced a trap composed of 64 places in 111 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:18:53] [INFO ] Deduced a trap composed of 55 places in 114 ms of which 14 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 6/297 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:18:56] [INFO ] Deduced a trap along path composed of 9 places in 76 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:18:57] [INFO ] Deduced a trap along path composed of 13 places in 44 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:18:58] [INFO ] Deduced a trap along path composed of 10 places in 47 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:00] [INFO ] Deduced a trap along path composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 4/301 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/275 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 11 (OVERLAPS) 0/275 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 275/275 variables, and 301 constraints, problems are : Problem set: 0 solved, 133 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 42253ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 42255ms
Starting structural reductions in LTL mode, iteration 1 : 141/157 places, 134/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42525 ms. Remains : 141/157 places, 134/150 transitions.
[2025-06-02 12:19:18] [INFO ] Flatten gal took : 3 ms
[2025-06-02 12:19:18] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:19:18] [INFO ] Input system was already deterministic with 134 transitions.
[2025-06-02 12:19:18] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:19:18] [INFO ] Flatten gal took : 3 ms
[2025-06-02 12:19:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality11635713680938068323.gal : 1 ms
[2025-06-02 12:19:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality12275843860421503331.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/CTLCardinality11635713680938068323.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12275843860421503331.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,2.84235e+06,0.221776,10496,2,2464,5,20860,6,0,700,33863,0


Converting to forward existential form...Done !
original formula: EX(AX(EF(((((p142==0)&&(p143==1))&&((p107==0)&&(p83==1)))&&((p153==0)||(p30==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(E(TRUE U ((((p142==0)&&(p143==1))&&((p107==0)&&(p83==1)))&&((p153==0)||(p30==1))))))))] != F...159
Reverse transition relation is NOT exact ! Due to transitions t3, t14, t20, t35, t37, t44, t49, t55, t58, t61, t62, t64, t66, t71, t75, t78, t88, Intersec...246
(forward)formula 0,1,5.13523,136128,1,0,291,800529,289,154,3955,617303,336
FORMULA MedleyA-PT-13-CTLCardinality-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 157/157 places, 150/150 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 156 transition count 120
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 60 place count 127 transition count 118
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 62 place count 126 transition count 117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 63 place count 125 transition count 117
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 26 Pre rules applied. Total rules applied 63 place count 125 transition count 91
Deduced a syphon composed of 26 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 53 rules applied. Total rules applied 116 place count 98 transition count 91
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 118 place count 97 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 119 place count 96 transition count 90
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 131 place count 84 transition count 78
Iterating global reduction 6 with 12 rules applied. Total rules applied 143 place count 84 transition count 78
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 143 place count 84 transition count 73
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 153 place count 79 transition count 73
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 191 place count 60 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 192 place count 59 transition count 53
Applied a total of 192 rules in 20 ms. Remains 59 /157 variables (removed 98) and now considering 53/150 (removed 97) transitions.
// Phase 1: matrix 53 rows 59 cols
[2025-06-02 12:19:24] [INFO ] Computed 12 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:19:24] [INFO ] Implicit Places using invariants in 73 ms returned [0, 28, 32, 36]
[2025-06-02 12:19:24] [INFO ] Actually due to overlaps returned [0, 32, 36]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 75 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 56/157 places, 53/150 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 56 transition count 51
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 54 transition count 51
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 54 transition count 48
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 10 place count 51 transition count 48
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 2 with 2 rules applied. Total rules applied 12 place count 50 transition count 47
Applied a total of 12 rules in 6 ms. Remains 50 /56 variables (removed 6) and now considering 47/53 (removed 6) transitions.
// Phase 1: matrix 47 rows 50 cols
[2025-06-02 12:19:24] [INFO ] Computed 9 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:19:24] [INFO ] Implicit Places using invariants in 47 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 61 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 49/157 places, 47/150 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 49 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 48 transition count 46
Applied a total of 2 rules in 2 ms. Remains 48 /49 variables (removed 1) and now considering 46/47 (removed 1) transitions.
// Phase 1: matrix 46 rows 48 cols
[2025-06-02 12:19:24] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:19:24] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-02 12:19:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:19:24] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 48/157 places, 46/150 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 298 ms. Remains : 48/157 places, 46/150 transitions.
[2025-06-02 12:19:24] [INFO ] Flatten gal took : 2 ms
[2025-06-02 12:19:24] [INFO ] Flatten gal took : 1 ms
[2025-06-02 12:19:24] [INFO ] Input system was already deterministic with 46 transitions.
[2025-06-02 12:19:24] [INFO ] Flatten gal took : 2 ms
[2025-06-02 12:19:24] [INFO ] Flatten gal took : 2 ms
[2025-06-02 12:19:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality8856993276907407624.gal : 0 ms
[2025-06-02 12:19:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality10998659617565316408.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/CTLCardinality8856993276907407624.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10998659617565316408.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,3132,0.015876,4140,2,184,5,1142,6,0,240,1054,0


Converting to forward existential form...Done !
original formula: EF(EG(((p68==1)&&((p134==0)||(p59==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((p68==1)&&((p134==0)||(p59==1))))] != FALSE
Hit Full ! (commute/partial/dont) 39/7/7
(forward)formula 0,0,0.038293,4780,1,0,8,5241,19,2,1194,2766,8
FORMULA MedleyA-PT-13-CTLCardinality-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 157/157 places, 150/150 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 156 transition count 119
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 62 place count 126 transition count 117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 125 transition count 117
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 63 place count 125 transition count 89
Deduced a syphon composed of 28 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 57 rules applied. Total rules applied 120 place count 96 transition count 89
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 122 place count 95 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 123 place count 94 transition count 88
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 134 place count 83 transition count 77
Iterating global reduction 5 with 11 rules applied. Total rules applied 145 place count 83 transition count 77
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 145 place count 83 transition count 73
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 153 place count 79 transition count 73
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 154 place count 78 transition count 72
Iterating global reduction 5 with 1 rules applied. Total rules applied 155 place count 78 transition count 72
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 199 place count 56 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 200 place count 55 transition count 49
Applied a total of 200 rules in 17 ms. Remains 55 /157 variables (removed 102) and now considering 49/150 (removed 101) transitions.
// Phase 1: matrix 49 rows 55 cols
[2025-06-02 12:19:24] [INFO ] Computed 12 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:19:24] [INFO ] Implicit Places using invariants in 68 ms returned [0, 13, 23, 27, 32]
[2025-06-02 12:19:24] [INFO ] Actually due to overlaps returned [0, 27, 13, 32]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 81 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 51/157 places, 49/150 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 51 transition count 47
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 49 transition count 47
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 49 transition count 44
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 10 place count 46 transition count 44
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 2 with 2 rules applied. Total rules applied 12 place count 45 transition count 43
Applied a total of 12 rules in 3 ms. Remains 45 /51 variables (removed 6) and now considering 43/49 (removed 6) transitions.
// Phase 1: matrix 43 rows 45 cols
[2025-06-02 12:19:24] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:19:24] [INFO ] Implicit Places using invariants in 47 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 44/157 places, 43/150 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 44 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 43 transition count 42
Applied a total of 2 rules in 2 ms. Remains 43 /44 variables (removed 1) and now considering 42/43 (removed 1) transitions.
// Phase 1: matrix 42 rows 43 cols
[2025-06-02 12:19:24] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:19:24] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-02 12:19:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:19:24] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 43/157 places, 42/150 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 283 ms. Remains : 43/157 places, 42/150 transitions.
[2025-06-02 12:19:24] [INFO ] Flatten gal took : 2 ms
[2025-06-02 12:19:24] [INFO ] Flatten gal took : 1 ms
[2025-06-02 12:19:24] [INFO ] Input system was already deterministic with 42 transitions.
[2025-06-02 12:19:24] [INFO ] Flatten gal took : 2 ms
[2025-06-02 12:19:24] [INFO ] Flatten gal took : 2 ms
[2025-06-02 12:19:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality885389081673756985.gal : 1 ms
[2025-06-02 12:19:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality5104199536795024361.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/CTLCardinality885389081673756985.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5104199536795024361.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 -...282
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,1936,0.013698,4036,2,124,5,993,6,0,217,1095,0


Converting to forward existential form...Done !
original formula: EG(((p107==0)||(p139==1)))
=> equivalent forward existential formula: [FwdG(Init,((p107==0)||(p139==1)))] != FALSE
Hit Full ! (commute/partial/dont) 37/0/5
(forward)formula 0,1,0.037309,4676,1,0,9,4193,19,4,1022,3822,8
FORMULA MedleyA-PT-13-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 150/150 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 142 transition count 135
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 142 transition count 135
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 140 transition count 133
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 140 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 139 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 139 transition count 132
Applied a total of 36 rules in 6 ms. Remains 139 /157 variables (removed 18) and now considering 132/150 (removed 18) transitions.
// Phase 1: matrix 132 rows 139 cols
[2025-06-02 12:19:24] [INFO ] Computed 14 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:19:24] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-06-02 12:19:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:19:25] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Running 131 sub problems to find dead transitions.
[2025-06-02 12:19:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:27] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:27] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:28] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 20 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:28] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 132/271 variables, 139/157 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:31] [INFO ] Deduced a trap along path composed of 8 places in 43 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:32] [INFO ] Deduced a trap along path composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 0/271 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 159 constraints, problems are : Problem set: 0 solved, 131 unsolved in 12352 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/271 variables, 139/157 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 131/288 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:39] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:40] [INFO ] Deduced a trap composed of 63 places in 112 ms of which 17 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:42] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:42] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:49] [INFO ] Deduced a trap along path composed of 12 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:20:01] [INFO ] Deduced a trap along path composed of 11 places in 46 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/271 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 271/271 variables, and 296 constraints, problems are : Problem set: 0 solved, 131 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 42374ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 42374ms
Starting structural reductions in LTL mode, iteration 1 : 139/157 places, 132/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42673 ms. Remains : 139/157 places, 132/150 transitions.
[2025-06-02 12:20:07] [INFO ] Flatten gal took : 6 ms
[2025-06-02 12:20:07] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:20:07] [INFO ] Input system was already deterministic with 132 transitions.
[2025-06-02 12:20:07] [INFO ] Flatten gal took : 6 ms
[2025-06-02 12:20:07] [INFO ] Flatten gal took : 6 ms
[2025-06-02 12:20:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality7732685657774583152.gal : 1 ms
[2025-06-02 12:20:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality12989976994686281744.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/CTLCardinality7732685657774583152.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12989976994686281744.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,2.31837e+06,0.185423,9820,2,2148,5,19161,6,0,690,29724,0


Converting to forward existential form...Done !
original formula: AF(EG(EX(EG((p166==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(EX(EG((p166==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t19, t34, t36, t43, t48, t54, t57, t60, t61, t63, t73, t76, t86, Intersection with reach...231
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-06-02 12:20:37] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:20:37] [INFO ] Applying decomposition
[2025-06-02 12:20:37] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17431511562045612542.txt' '-o' '/tmp/graph17431511562045612542.bin' '-w' '/tmp/graph17431511562045612542.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17431511562045612542.bin' '-l' '-1' '-v' '-w' '/tmp/graph17431511562045612542.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:20:37] [INFO ] Decomposing Gal with order
[2025-06-02 12:20:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:20:37] [INFO ] Removed a total of 23 redundant transitions.
[2025-06-02 12:20:37] [INFO ] Flatten gal took : 11 ms
[2025-06-02 12:20:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-02 12:20:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality16379378492231518641.gal : 3 ms
[2025-06-02 12:20:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality16910883513865259968.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/CTLCardinality16379378492231518641.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16910883513865259968.ctl'

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 -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.31837e+06,0.05701,5392,336,25,2587,191,423,3591,50,347,0


Converting to forward existential form...Done !
original formula: AF(EG(EX(EG((i9.u56.p166==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(EX(EG((i9.u56.p166==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t19, i1.u0.t86, i3.t73, i3.i1.t76, i3.i2.u18.t63, i5.i0.t61, i5.i0.u20.t60, i5.i1.t54, i5...321
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,1.85805,51856,1,0,90581,355,2433,134505,234,685,141956
FORMULA MedleyA-PT-13-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 12:20:39] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:20:39] [INFO ] Flatten gal took : 4 ms
Total runtime 524581 ms.

BK_STOP 1748866839540

--------------------
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="MedleyA-PT-13"
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 MedleyA-PT-13, 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 r128-smll-174876524100193"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-13.tgz
mv MedleyA-PT-13 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 ;