fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r058-smll-174854064500641
Last Updated
June 24, 2025

About the Execution of ITS-Tools for DiscoveryGPU-PT-08a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 91365.00 0.00 0.00 TTFFTFTTFTFFFTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r058-smll-174854064500641.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 DiscoveryGPU-PT-08a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854064500641
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K 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.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K 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.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 28K 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 DiscoveryGPU-PT-08a-CTLCardinality-2023-12
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2023-13
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2023-14
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2023-15
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2025-00
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2025-01
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2025-02
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2025-03
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2025-04
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2025-05
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2025-06
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2025-07
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2025-08
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2025-09
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2025-10
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748917404228

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-08a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-03 02:23:26] [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-03 02:23:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 02:23:27] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2025-06-03 02:23:27] [INFO ] Transformed 83 places.
[2025-06-03 02:23:27] [INFO ] Transformed 113 transitions.
[2025-06-03 02:23:27] [INFO ] Found NUPN structural information;
[2025-06-03 02:23:27] [INFO ] Parsed PT model containing 83 places and 113 transitions and 363 arcs in 334 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 40 ms.
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 113/113 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 81 transition count 111
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 81 transition count 111
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 12 place count 81 transition count 103
Applied a total of 12 rules in 53 ms. Remains 81 /83 variables (removed 2) and now considering 103/113 (removed 10) transitions.
// Phase 1: matrix 103 rows 81 cols
[2025-06-03 02:23:27] [INFO ] Computed 2 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:23:27] [INFO ] Implicit Places using invariants in 429 ms returned []
[2025-06-03 02:23:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:23:28] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-06-03 02:23:28] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 840 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2025-06-03 02:23:28] [INFO ] Invariant cache hit.
[2025-06-03 02:23:28] [INFO ] State equation strengthened by 64 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 103/184 variables, 81/83 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 64/147 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 0/184 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 147 constraints, problems are : Problem set: 0 solved, 102 unsolved in 6333 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 103/184 variables, 81/83 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 64/147 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 102/249 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 0/184 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 249 constraints, problems are : Problem set: 0 solved, 102 unsolved in 5891 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12317ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 12344ms
Starting structural reductions in LTL mode, iteration 1 : 81/83 places, 103/113 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13277 ms. Remains : 81/83 places, 103/113 transitions.
Support contains 54 out of 81 places after structural reductions.
[2025-06-03 02:23:41] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-03 02:23:41] [INFO ] Flatten gal took : 60 ms
[2025-06-03 02:23:41] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-03 02:23:41] [INFO ] Flatten gal took : 25 ms
[2025-06-03 02:23:41] [INFO ] Input system was already deterministic with 103 transitions.
Support contains 47 out of 81 places (down from 54) after GAL structural reductions.
RANDOM walk for 40000 steps (464 resets) in 1553 ms. (25 steps per ms) remains 2/43 properties
BEST_FIRST walk for 40003 steps (9 resets) in 378 ms. (105 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (63 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
[2025-06-03 02:23:41] [INFO ] Invariant cache hit.
[2025-06-03 02:23:41] [INFO ] State equation strengthened by 64 read => feed constraints.
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) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 29/39 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 11/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 33/72 variables, 12/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 12/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 21/93 variables, 11/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/93 variables, 8/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/93 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/107 variables, 7/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/107 variables, 7/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/107 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 21/128 variables, 7/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/128 variables, 7/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/128 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 16/144 variables, 6/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/144 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/144 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 10/154 variables, 5/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/154 variables, 5/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/154 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 10/164 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/164 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 10/174 variables, 5/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/174 variables, 5/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/174 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 10/184 variables, 5/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/184 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/184 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 147 constraints, problems are : Problem set: 0 solved, 1 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 64/64 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) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 29/39 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 11/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/72 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/72 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp41 is UNSAT
After SMT solving in domain Int declared 93/184 variables, and 71 constraints, problems are : Problem set: 1 solved, 0 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 41/81 constraints, ReadFeed: 27/64 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 254ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-03 02:23:42] [INFO ] Flatten gal took : 9 ms
[2025-06-03 02:23:42] [INFO ] Flatten gal took : 10 ms
[2025-06-03 02:23:42] [INFO ] Input system was already deterministic with 103 transitions.
Computed a total of 11 stabilizing places and 9 stable transitions
Graph (complete) has 226 edges and 81 vertex of which 75 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 103/103 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 75 transition count 97
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 75 transition count 97
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 70 transition count 92
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 70 transition count 92
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 67 transition count 89
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 67 transition count 89
Applied a total of 28 rules in 9 ms. Remains 67 /81 variables (removed 14) and now considering 89/103 (removed 14) transitions.
// Phase 1: matrix 89 rows 67 cols
[2025-06-03 02:23:42] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:23:42] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-03 02:23:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:23:42] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-03 02:23:42] [INFO ] Implicit Places using invariants and state equation in 141 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 204 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/81 places, 89/103 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 89/89 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 215 ms. Remains : 66/81 places, 89/103 transitions.
[2025-06-03 02:23:42] [INFO ] Flatten gal took : 6 ms
[2025-06-03 02:23:42] [INFO ] Flatten gal took : 6 ms
[2025-06-03 02:23:42] [INFO ] Input system was already deterministic with 89 transitions.
[2025-06-03 02:23:42] [INFO ] Flatten gal took : 6 ms
[2025-06-03 02:23:42] [INFO ] Flatten gal took : 5 ms
[2025-06-03 02:23:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality1156684293508260786.gal : 4 ms
[2025-06-03 02:23:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality1153793145963769346.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/CTLCardinality1156684293508260786.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1153793145963769346.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,1.27654e+08,0.494722,16876,2,4781,5,79835,6,0,344,52752,0


Converting to forward existential form...Done !
original formula: E((AF(((p64==0)||(p27==1))) * AX((AX(E(((p75==0)||(p34==1)) U (p29==0))) + (p5==0)))) U (AG((AF(((p52==0)||(p76==1))) + (EF(((p49==0)||(p...262
=> equivalent forward existential formula: ([(FwdU(Init,(!(EG(!(((p64==0)||(p27==1))))) * !(EX(!((!(EX(!(E(((p75==0)||(p34==1)) U (p29==0))))) + (p5==0))))...490
Reverse transition relation is NOT exact ! Due to transitions t15, t18, t22, t28, t31, t33, t35, t71, t73, t76, t80, t81, t82, t83, t84, t85, t86, t87, t88...255
(forward)formula 0,1,23.9329,541832,1,0,605,2.60865e+06,224,351,2107,3.82094e+06,730
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 103/103 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 75 transition count 97
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 75 transition count 97
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 69 transition count 91
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 69 transition count 91
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 65 transition count 87
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 65 transition count 87
Applied a total of 32 rules in 11 ms. Remains 65 /81 variables (removed 16) and now considering 87/103 (removed 16) transitions.
// Phase 1: matrix 87 rows 65 cols
[2025-06-03 02:24:06] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:24:06] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-03 02:24:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:24:06] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-03 02:24:06] [INFO ] Implicit Places using invariants and state equation in 187 ms returned [64]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 269 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/81 places, 87/103 transitions.
Applied a total of 0 rules in 5 ms. Remains 64 /64 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 286 ms. Remains : 64/81 places, 87/103 transitions.
[2025-06-03 02:24:06] [INFO ] Flatten gal took : 10 ms
[2025-06-03 02:24:06] [INFO ] Flatten gal took : 9 ms
[2025-06-03 02:24:06] [INFO ] Input system was already deterministic with 87 transitions.
[2025-06-03 02:24:06] [INFO ] Flatten gal took : 9 ms
[2025-06-03 02:24:06] [INFO ] Flatten gal took : 9 ms
[2025-06-03 02:24:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality17194050390821754388.gal : 3 ms
[2025-06-03 02:24:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality12414110050082360356.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/CTLCardinality17194050390821754388.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12414110050082360356.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,1.07909e+08,0.27504,12324,2,2639,5,57611,6,0,333,28983,0


Converting to forward existential form...Done !
original formula: AG(AF(((EX((p71==1)) + !(A((p75==1) U (p72==1)))) + ((p25==0)||(p66==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((EX((p71==1)) + !(!((E(!((p72==1)) U (!((p75==1)) * !((p72==1)))) + EG(!((p72==1)))))))...190
Reverse transition relation is NOT exact ! Due to transitions t22, t24, t26, t28, t29, t31, t33, t77, t78, t79, t80, t81, t82, t83, t84, t85, t86, Interse...245
(forward)formula 0,1,7.35083,182048,1,0,476,1.05664e+06,207,263,1962,1.27495e+06,591
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 103/103 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 76 transition count 98
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 76 transition count 98
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 71 transition count 93
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 71 transition count 93
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 68 transition count 90
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 68 transition count 90
Applied a total of 26 rules in 16 ms. Remains 68 /81 variables (removed 13) and now considering 90/103 (removed 13) transitions.
// Phase 1: matrix 90 rows 68 cols
[2025-06-03 02:24:14] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:24:14] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-06-03 02:24:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:24:14] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-03 02:24:14] [INFO ] Implicit Places using invariants and state equation in 247 ms returned [67]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 334 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 67/81 places, 90/103 transitions.
Applied a total of 0 rules in 5 ms. Remains 67 /67 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 356 ms. Remains : 67/81 places, 90/103 transitions.
[2025-06-03 02:24:14] [INFO ] Flatten gal took : 10 ms
[2025-06-03 02:24:14] [INFO ] Flatten gal took : 10 ms
[2025-06-03 02:24:14] [INFO ] Input system was already deterministic with 90 transitions.
[2025-06-03 02:24:14] [INFO ] Flatten gal took : 9 ms
[2025-06-03 02:24:14] [INFO ] Flatten gal took : 9 ms
[2025-06-03 02:24:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality15314543604237720165.gal : 3 ms
[2025-06-03 02:24:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality10667024668463172494.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/CTLCardinality15314543604237720165.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10667024668463172494.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,1.2663e+08,0.184362,10432,2,1966,5,43838,6,0,347,21121,0


Converting to forward existential form...Done !
original formula: EX(E(((p1==1)||(p51==0)) U !(EF(((p47==1)||(p30==1))))))
=> equivalent forward existential formula: [(FwdU(EY(Init),((p1==1)||(p51==0))) * !(E(TRUE U ((p47==1)||(p30==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t21, t25, t27, t30, t32, t34, t79, t80, t81, t82, t83, t84, t85, t86, t87, t88, t89, Interse...245
Hit Full ! (commute/partial/dont) 86/0/4
(forward)formula 0,1,1.40069,39136,1,0,130,191217,208,85,2179,175888,194
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 103/103 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 75 transition count 97
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 75 transition count 97
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 69 transition count 91
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 69 transition count 91
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 66 transition count 88
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 66 transition count 88
Applied a total of 30 rules in 15 ms. Remains 66 /81 variables (removed 15) and now considering 88/103 (removed 15) transitions.
// Phase 1: matrix 88 rows 66 cols
[2025-06-03 02:24:16] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:24:16] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-03 02:24:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:24:16] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-03 02:24:16] [INFO ] Implicit Places using invariants and state equation in 240 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 334 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 65/81 places, 88/103 transitions.
Applied a total of 0 rules in 3 ms. Remains 65 /65 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 352 ms. Remains : 65/81 places, 88/103 transitions.
[2025-06-03 02:24:16] [INFO ] Flatten gal took : 9 ms
[2025-06-03 02:24:16] [INFO ] Flatten gal took : 13 ms
[2025-06-03 02:24:16] [INFO ] Input system was already deterministic with 88 transitions.
[2025-06-03 02:24:16] [INFO ] Flatten gal took : 11 ms
[2025-06-03 02:24:16] [INFO ] Flatten gal took : 5 ms
[2025-06-03 02:24:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality10654275209010108460.gal : 2 ms
[2025-06-03 02:24:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality14992996034414569494.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/CTLCardinality10654275209010108460.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14992996034414569494.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,1.16537e+08,0.372913,11440,2,2392,5,50903,6,0,338,26272,0


Converting to forward existential form...Done !
original formula: AG(EX((AX(((p7==0)||(p19==1))) * ((((p4==0)||(p70!=1))||((p38!=1)||(p3!=0)))||((p71!=0)&&(p75!=1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((!(EX(!(((p7==0)||(p19==1))))) * ((((p4==0)||(p70!=1))||((p38!=1)||(p3!=0)))||((p71!=0)...180
Reverse transition relation is NOT exact ! Due to transitions t14, t17, t23, t25, t27, t30, t32, t34, t78, t79, t80, t81, t82, t83, t84, t85, t86, t87, In...250
(forward)formula 0,0,1.67368,43556,1,0,136,221430,194,87,1939,259427,188
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 103/103 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 76 transition count 98
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 76 transition count 98
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 71 transition count 93
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 71 transition count 93
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 67 transition count 89
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 67 transition count 89
Applied a total of 28 rules in 13 ms. Remains 67 /81 variables (removed 14) and now considering 89/103 (removed 14) transitions.
// Phase 1: matrix 89 rows 67 cols
[2025-06-03 02:24:18] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:24:18] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-06-03 02:24:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:24:18] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-03 02:24:18] [INFO ] Implicit Places using invariants and state equation in 230 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 324 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/81 places, 89/103 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 89/89 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 339 ms. Remains : 66/81 places, 89/103 transitions.
[2025-06-03 02:24:18] [INFO ] Flatten gal took : 7 ms
[2025-06-03 02:24:18] [INFO ] Flatten gal took : 8 ms
[2025-06-03 02:24:18] [INFO ] Input system was already deterministic with 89 transitions.
[2025-06-03 02:24:18] [INFO ] Flatten gal took : 8 ms
[2025-06-03 02:24:18] [INFO ] Flatten gal took : 8 ms
[2025-06-03 02:24:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality4451161899919590303.gal : 2 ms
[2025-06-03 02:24:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality13465231568417463323.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/CTLCardinality4451161899919590303.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13465231568417463323.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,1.23003e+08,0.467771,12676,2,2795,5,55253,6,0,343,33393,0


Converting to forward existential form...Done !
original formula: EF((EG(AX((p75!=0))) * (AG((p14!=1)) + ((AF((p1==1)) * (p58!=0)) * (p32!=1)))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * EG(!(EX(!((p75!=0)))))) * !(E(TRUE U !((p14!=1)))))] != FALSE + [((((FwdU(Init,TRUE) * EG(...231
Reverse transition relation is NOT exact ! Due to transitions t21, t23, t27, t30, t32, t34, t71, t73, t79, t80, t81, t82, t83, t84, t85, t86, t87, t88, In...250
Using saturation style SCC detection
(forward)formula 0,1,2.53403,61428,1,0,138,312024,210,91,2174,309291,205
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 103/103 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 75 transition count 97
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 75 transition count 97
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 69 transition count 91
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 69 transition count 91
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 67 transition count 89
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 67 transition count 89
Applied a total of 28 rules in 5 ms. Remains 67 /81 variables (removed 14) and now considering 89/103 (removed 14) transitions.
// Phase 1: matrix 89 rows 67 cols
[2025-06-03 02:24:21] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:24:21] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-03 02:24:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:24:21] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-03 02:24:21] [INFO ] Implicit Places using invariants and state equation in 138 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 190 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/81 places, 89/103 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 89/89 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 197 ms. Remains : 66/81 places, 89/103 transitions.
[2025-06-03 02:24:21] [INFO ] Flatten gal took : 5 ms
[2025-06-03 02:24:21] [INFO ] Flatten gal took : 5 ms
[2025-06-03 02:24:21] [INFO ] Input system was already deterministic with 89 transitions.
[2025-06-03 02:24:21] [INFO ] Flatten gal took : 4 ms
[2025-06-03 02:24:21] [INFO ] Flatten gal took : 4 ms
[2025-06-03 02:24:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality9292178675326067958.gal : 1 ms
[2025-06-03 02:24:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality2678021997023480241.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/CTLCardinality9292178675326067958.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2678021997023480241.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,1.24936e+08,0.298016,13368,2,3100,5,61590,6,0,343,36748,0


Converting to forward existential form...Done !
original formula: AG(EX((((AG(((p34!=0)&&(p78!=1))) + (p53==0)) + ((p73==1) + ((EX((p25==0)) * (p59==0)) * ((p49==1)&&(p10==1))))) + ((!(A(((p61==0)||(p26=...198
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((((!(E(TRUE U !(((p34!=0)&&(p78!=1))))) + (p53==0)) + ((p73==1) + ((EX((p25==0)) * (p59...309
Reverse transition relation is NOT exact ! Due to transitions t1, t7, t18, t26, t28, t30, t31, t33, t79, t80, t81, t82, t83, t84, t85, t86, t87, t88, Inte...248
(forward)formula 0,0,10.5778,261624,1,0,572,1.42467e+06,219,307,2103,1.90751e+06,685
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 81/81 places, 103/103 transitions.
Graph (complete) has 226 edges and 81 vertex of which 76 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 81 edges and 73 vertex of which 61 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Graph (trivial) has 62 edges and 61 vertex of which 32 / 61 are part of one of the 16 SCC in 2 ms
Free SCC test removed 16 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 45 transition count 78
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 35 place count 38 transition count 62
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 40 place count 33 transition count 52
Iterating global reduction 2 with 5 rules applied. Total rules applied 45 place count 33 transition count 52
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 50 place count 28 transition count 42
Iterating global reduction 2 with 5 rules applied. Total rules applied 55 place count 28 transition count 42
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 25 transition count 36
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 25 transition count 36
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 64 place count 22 transition count 33
Iterating global reduction 2 with 3 rules applied. Total rules applied 67 place count 22 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 22 transition count 32
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 70 place count 21 transition count 31
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 75 place count 16 transition count 26
Applied a total of 75 rules in 54 ms. Remains 16 /81 variables (removed 65) and now considering 26/103 (removed 77) transitions.
[2025-06-03 02:24:32] [INFO ] Flow matrix only has 19 transitions (discarded 7 similar events)
// Phase 1: matrix 19 rows 16 cols
[2025-06-03 02:24:32] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:24:32] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-03 02:24:32] [INFO ] Flow matrix only has 19 transitions (discarded 7 similar events)
[2025-06-03 02:24:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:24:32] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:24:32] [INFO ] Redundant transitions in 1 ms returned []
Running 16 sub problems to find dead transitions.
[2025-06-03 02:24:32] [INFO ] Flow matrix only has 19 transitions (discarded 7 similar events)
[2025-06-03 02:24:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 18/29 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 5/34 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 0/34 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/35 variables, and 16 constraints, problems are : Problem set: 0 solved, 16 unsolved in 468 ms.
Refiners :[State Equation: 16/16 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 18/29 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 16/27 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 5/34 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 0/34 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 34/35 variables, and 32 constraints, problems are : Problem set: 0 solved, 16 unsolved in 255 ms.
Refiners :[State Equation: 16/16 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 749ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 750ms
Starting structural reductions in SI_CTL mode, iteration 1 : 16/81 places, 26/103 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 888 ms. Remains : 16/81 places, 26/103 transitions.
[2025-06-03 02:24:33] [INFO ] Flatten gal took : 3 ms
[2025-06-03 02:24:33] [INFO ] Flatten gal took : 1 ms
[2025-06-03 02:24:33] [INFO ] Input system was already deterministic with 26 transitions.
[2025-06-03 02:24:33] [INFO ] Flatten gal took : 1 ms
[2025-06-03 02:24:33] [INFO ] Flatten gal took : 1 ms
[2025-06-03 02:24:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality6042875348611676812.gal : 0 ms
[2025-06-03 02:24:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality2108795687846271077.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/CTLCardinality6042875348611676812.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2108795687846271077.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,5940,0.006732,3780,2,67,5,343,6,0,75,313,0


Converting to forward existential form...Done !
original formula: E(EG(AF((((p67==0)||(p42==1))&&((p21==0)||(p43==1))))) U AG(AF(EG((p77==1)))))
=> equivalent forward existential formula: [(FwdU(Init,EG(!(EG(!((((p67==0)||(p42==1))&&((p21==0)||(p43==1)))))))) * !(E(TRUE U !(!(EG(!(EG((p77==1))))))))...166
Reverse transition relation is NOT exact ! Due to transitions t2, t19, t20, t21, t22, t24, t25, Intersection with reachable at each step enabled. (destroy...193
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.055365,5828,1,0,211,11947,77,137,443,15991,229
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 103/103 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 75 transition count 97
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 75 transition count 97
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 69 transition count 91
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 69 transition count 91
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 65 transition count 87
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 65 transition count 87
Applied a total of 32 rules in 4 ms. Remains 65 /81 variables (removed 16) and now considering 87/103 (removed 16) transitions.
// Phase 1: matrix 87 rows 65 cols
[2025-06-03 02:24:33] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:24:33] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-03 02:24:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:24:33] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-03 02:24:33] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 86 sub problems to find dead transitions.
[2025-06-03 02:24:33] [INFO ] Invariant cache hit.
[2025-06-03 02:24:33] [INFO ] State equation strengthened by 58 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 87/152 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 58/125 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 0/152 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 125 constraints, problems are : Problem set: 0 solved, 86 unsolved in 3125 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 87/152 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 58/125 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 86/211 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 0/152 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 211 constraints, problems are : Problem set: 0 solved, 86 unsolved in 4347 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7499ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 7501ms
Starting structural reductions in LTL mode, iteration 1 : 65/81 places, 87/103 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7684 ms. Remains : 65/81 places, 87/103 transitions.
[2025-06-03 02:24:40] [INFO ] Flatten gal took : 4 ms
[2025-06-03 02:24:40] [INFO ] Flatten gal took : 4 ms
[2025-06-03 02:24:40] [INFO ] Input system was already deterministic with 87 transitions.
[2025-06-03 02:24:40] [INFO ] Flatten gal took : 4 ms
[2025-06-03 02:24:40] [INFO ] Flatten gal took : 4 ms
[2025-06-03 02:24:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality17825745311332112274.gal : 1 ms
[2025-06-03 02:24:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality8702002397647824808.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/CTLCardinality17825745311332112274.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8702002397647824808.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,1.12853e+08,0.54431,15488,2,2168,5,76458,6,0,336,44787,0


Converting to forward existential form...Done !
original formula: EF((AF(((p54==1) * EX((p82==1)))) * ((AG(EF(((p27==1)&&((p73==0)||(p12==1))))) + AF(((p54==0)||(p12==1)))) + (p57==1))))
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * !(EG(!(((p54==1) * EX((p82==1))))))) * !(E(TRUE U !(E(TRUE U ((p27==1)&&((p73==0)||(p12==...362
Reverse transition relation is NOT exact ! Due to transitions t1, t17, t23, t25, t29, t30, t32, t34, t72, t74, t78, t79, t80, t81, t82, t83, t84, t85, t86,...254
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,9.2815,228156,1,0,615,1.29874e+06,211,382,2125,1.57239e+06,674
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 81/81 places, 103/103 transitions.
Graph (complete) has 226 edges and 81 vertex of which 76 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 81 edges and 73 vertex of which 59 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 14 output transitions
Drop transitions (Output transitions of discarded places.) removed 14 transitions
Graph (trivial) has 55 edges and 59 vertex of which 24 / 59 are part of one of the 12 SCC in 0 ms
Free SCC test removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 47 transition count 75
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 33 place count 39 transition count 63
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 36 place count 36 transition count 57
Iterating global reduction 2 with 3 rules applied. Total rules applied 39 place count 36 transition count 57
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 35 transition count 55
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 35 transition count 55
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 34 transition count 53
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 34 transition count 53
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 33 transition count 52
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 33 transition count 52
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 33 transition count 50
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 2 with 1 rules applied. Total rules applied 48 place count 33 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 49 place count 32 transition count 49
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 4 with 7 rules applied. Total rules applied 56 place count 25 transition count 42
Applied a total of 56 rules in 15 ms. Remains 25 /81 variables (removed 56) and now considering 42/103 (removed 61) transitions.
[2025-06-03 02:24:50] [INFO ] Flow matrix only has 34 transitions (discarded 8 similar events)
// Phase 1: matrix 34 rows 25 cols
[2025-06-03 02:24:50] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:24:50] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-06-03 02:24:50] [INFO ] Flow matrix only has 34 transitions (discarded 8 similar events)
[2025-06-03 02:24:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:24:50] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:24:50] [INFO ] Redundant transitions in 0 ms returned []
Running 28 sub problems to find dead transitions.
[2025-06-03 02:24:50] [INFO ] Flow matrix only has 34 transitions (discarded 8 similar events)
[2025-06-03 02:24:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 33/51 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 7/58 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 0/58 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 58/59 variables, and 25 constraints, problems are : Problem set: 0 solved, 28 unsolved in 658 ms.
Refiners :[State Equation: 25/25 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 33/51 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 28/46 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 7/58 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 0/58 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 58/59 variables, and 53 constraints, problems are : Problem set: 0 solved, 28 unsolved in 517 ms.
Refiners :[State Equation: 25/25 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1181ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 1182ms
Starting structural reductions in SI_CTL mode, iteration 1 : 25/81 places, 42/103 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1260 ms. Remains : 25/81 places, 42/103 transitions.
[2025-06-03 02:24:51] [INFO ] Flatten gal took : 3 ms
[2025-06-03 02:24:51] [INFO ] Flatten gal took : 2 ms
[2025-06-03 02:24:51] [INFO ] Input system was already deterministic with 42 transitions.
[2025-06-03 02:24:51] [INFO ] Flatten gal took : 2 ms
[2025-06-03 02:24:51] [INFO ] Flatten gal took : 3 ms
[2025-06-03 02:24:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality5597202999392452361.gal : 1 ms
[2025-06-03 02:24:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality3157401304800070386.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/CTLCardinality5597202999392452361.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3157401304800070386.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,81000,0.009144,3980,2,55,5,256,6,0,119,209,0


Converting to forward existential form...Done !
original formula: EF(AG((EF(!(E(((p61==0)||(p34==1)) U ((p14==0)||(p25==1))))) + A((p76!=1) U (p4==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((E(TRUE U !(E(((p61==0)||(p34==1)) U ((p14==0)||(p25==1))))) + !((E(!((p4==1)) ...218
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t10, t11, t13, t17, t37, t38, t39, t40, t41, Intersection with reachable at each ste...213
(forward)formula 0,0,0.108416,6156,1,0,237,14025,112,131,677,18855,283
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 103/103 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 74 transition count 96
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 74 transition count 96
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 67 transition count 89
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 67 transition count 89
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 62 transition count 84
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 62 transition count 84
Applied a total of 38 rules in 6 ms. Remains 62 /81 variables (removed 19) and now considering 84/103 (removed 19) transitions.
// Phase 1: matrix 84 rows 62 cols
[2025-06-03 02:24:51] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:24:51] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-03 02:24:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:24:51] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-03 02:24:51] [INFO ] Implicit Places using invariants and state equation in 242 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 318 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/81 places, 84/103 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 326 ms. Remains : 61/81 places, 84/103 transitions.
[2025-06-03 02:24:51] [INFO ] Flatten gal took : 7 ms
[2025-06-03 02:24:51] [INFO ] Flatten gal took : 6 ms
[2025-06-03 02:24:51] [INFO ] Input system was already deterministic with 84 transitions.
[2025-06-03 02:24:51] [INFO ] Flatten gal took : 6 ms
[2025-06-03 02:24:52] [INFO ] Flatten gal took : 6 ms
[2025-06-03 02:24:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality9548438346032655715.gal : 2 ms
[2025-06-03 02:24:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality8414403242447007320.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/CTLCardinality9548438346032655715.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8414403242447007320.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,9.0964e+07,0.604263,16208,2,3855,5,82469,6,0,319,45632,0


Converting to forward existential form...Done !
original formula: AF(AX(EX(EG(((p20!=0)&&(p77!=1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(EX(EG(((p20!=0)&&(p77!=1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t19, t21, t23, t25, t27, t28, t30, t32, t75, t76, t77, t78, t79, t80, t81, t82, t83, Interse...245
(forward)formula 0,1,2.53548,58036,1,0,223,278612,194,129,1883,358867,317
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 103/103 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 74 transition count 96
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 74 transition count 96
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 67 transition count 89
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 67 transition count 89
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 62 transition count 84
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 62 transition count 84
Applied a total of 38 rules in 3 ms. Remains 62 /81 variables (removed 19) and now considering 84/103 (removed 19) transitions.
[2025-06-03 02:24:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:24:54] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-03 02:24:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:24:54] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-03 02:24:54] [INFO ] Implicit Places using invariants and state equation in 135 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 188 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/81 places, 84/103 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 192 ms. Remains : 61/81 places, 84/103 transitions.
[2025-06-03 02:24:54] [INFO ] Flatten gal took : 3 ms
[2025-06-03 02:24:54] [INFO ] Flatten gal took : 3 ms
[2025-06-03 02:24:54] [INFO ] Input system was already deterministic with 84 transitions.
[2025-06-03 02:24:54] [INFO ] Flatten gal took : 4 ms
[2025-06-03 02:24:54] [INFO ] Flatten gal took : 3 ms
[2025-06-03 02:24:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality7682882001003755626.gal : 1 ms
[2025-06-03 02:24:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality8413451937229501406.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/CTLCardinality7682882001003755626.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8413451937229501406.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,9.0964e+07,0.475058,16356,2,3855,5,82469,6,0,319,45632,0


Converting to forward existential form...Done !
original formula: AX(AG((p66==1)))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !((p66==1)))] = FALSE
(forward)formula 0,0,0.735297,16740,1,0,11,82588,10,2,657,45746,4
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-03 02:24:55] [INFO ] Flatten gal took : 5 ms
[2025-06-03 02:24:55] [INFO ] Flatten gal took : 4 ms
Total runtime 88715 ms.

BK_STOP 1748917495593

--------------------
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="DiscoveryGPU-PT-08a"
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 DiscoveryGPU-PT-08a, 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 r058-smll-174854064500641"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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