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

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

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

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K 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 52K 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.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 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 121K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K 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 36K 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-10a-CTLCardinality-2023-12
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2023-13
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2023-14
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2023-15
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2025-00
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2025-01
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2025-02
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2025-03
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2025-04
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2025-05
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2025-06
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2025-07
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2025-08
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2025-09
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2025-10
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748926936944

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-10a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-03 05:02:19] [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 05:02:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 05:02:19] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2025-06-03 05:02:19] [INFO ] Transformed 103 places.
[2025-06-03 05:02:19] [INFO ] Transformed 141 transitions.
[2025-06-03 05:02:19] [INFO ] Found NUPN structural information;
[2025-06-03 05:02:19] [INFO ] Parsed PT model containing 103 places and 141 transitions and 453 arcs in 362 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 24 ms.
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 141/141 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 98 transition count 136
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 98 transition count 136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 97 transition count 135
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 97 transition count 135
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 22 place count 97 transition count 125
Applied a total of 22 rules in 80 ms. Remains 97 /103 variables (removed 6) and now considering 125/141 (removed 16) transitions.
// Phase 1: matrix 125 rows 97 cols
[2025-06-03 05:02:20] [INFO ] Computed 2 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:02:20] [INFO ] Implicit Places using invariants in 394 ms returned []
[2025-06-03 05:02:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:02:20] [INFO ] State equation strengthened by 79 read => feed constraints.
[2025-06-03 05:02:20] [INFO ] Implicit Places using invariants and state equation in 377 ms returned [96]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 843 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 96/103 places, 125/141 transitions.
Applied a total of 0 rules in 10 ms. Remains 96 /96 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 976 ms. Remains : 96/103 places, 125/141 transitions.
Support contains 53 out of 96 places after structural reductions.
[2025-06-03 05:02:21] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-03 05:02:21] [INFO ] Flatten gal took : 44 ms
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-03 05:02:21] [INFO ] Flatten gal took : 43 ms
[2025-06-03 05:02:21] [INFO ] Input system was already deterministic with 125 transitions.
Support contains 49 out of 96 places (down from 53) after GAL structural reductions.
RANDOM walk for 18453 steps (168 resets) in 692 ms. (26 steps per ms) remains 0/38 properties
[2025-06-03 05:02:21] [INFO ] Flatten gal took : 11 ms
[2025-06-03 05:02:21] [INFO ] Flatten gal took : 13 ms
[2025-06-03 05:02:21] [INFO ] Input system was already deterministic with 125 transitions.
Computed a total of 12 stabilizing places and 11 stable transitions
Graph (complete) has 235 edges and 96 vertex of which 91 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 125/125 transitions.
Graph (complete) has 235 edges and 96 vertex of which 91 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 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 1 places and 0 transitions.
Graph (complete) has 100 edges and 89 vertex of which 71 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 18 output transitions
Drop transitions (Output transitions of discarded places.) removed 18 transitions
Graph (trivial) has 67 edges and 71 vertex of which 30 / 71 are part of one of the 15 SCC in 2 ms
Free SCC test removed 15 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 56 transition count 92
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 38 place count 47 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 46 transition count 76
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 45 place count 40 transition count 64
Iterating global reduction 3 with 6 rules applied. Total rules applied 51 place count 40 transition count 64
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 57 place count 34 transition count 52
Iterating global reduction 3 with 6 rules applied. Total rules applied 63 place count 34 transition count 52
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 67 place count 30 transition count 44
Iterating global reduction 3 with 4 rules applied. Total rules applied 71 place count 30 transition count 44
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 75 place count 26 transition count 40
Iterating global reduction 3 with 4 rules applied. Total rules applied 79 place count 26 transition count 40
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 26 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 25 transition count 38
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 25 transition count 38
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 86 place count 23 transition count 36
Iterating global reduction 3 with 2 rules applied. Total rules applied 88 place count 23 transition count 36
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 92 place count 19 transition count 32
Applied a total of 92 rules in 46 ms. Remains 19 /96 variables (removed 77) and now considering 32/125 (removed 93) transitions.
[2025-06-03 05:02:22] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
// Phase 1: matrix 28 rows 19 cols
[2025-06-03 05:02:22] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:02:22] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-03 05:02:22] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
[2025-06-03 05:02:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:02:22] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 05:02:22] [INFO ] Redundant transitions in 1 ms returned []
Running 23 sub problems to find dead transitions.
[2025-06-03 05:02:22] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
[2025-06-03 05:02:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 27/40 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 6/46 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 0/46 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/47 variables, and 19 constraints, problems are : Problem set: 0 solved, 23 unsolved in 856 ms.
Refiners :[State Equation: 19/19 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 27/40 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 6/46 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 0/46 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/47 variables, and 42 constraints, problems are : Problem set: 0 solved, 23 unsolved in 678 ms.
Refiners :[State Equation: 19/19 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1567ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 1573ms
Starting structural reductions in SI_CTL mode, iteration 1 : 19/96 places, 32/125 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1702 ms. Remains : 19/96 places, 32/125 transitions.
[2025-06-03 05:02:23] [INFO ] Flatten gal took : 2 ms
[2025-06-03 05:02:23] [INFO ] Flatten gal took : 2 ms
[2025-06-03 05:02:23] [INFO ] Input system was already deterministic with 32 transitions.
[2025-06-03 05:02:23] [INFO ] Flatten gal took : 3 ms
[2025-06-03 05:02:23] [INFO ] Flatten gal took : 2 ms
[2025-06-03 05:02:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality18429760726015304443.gal : 2 ms
[2025-06-03 05:02:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality15061902804004320693.ctl : 8 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/CTLCardinality18429760726015304443.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15061902804004320693.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,33750,0.021014,3624,2,42,5,276,6,0,96,254,0


Converting to forward existential form...Done !
original formula: AG((EF(((p13==0)&&((p84==0)||(p88==1)))) + A((p59==0) U ((p29==0)||(p64==1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(!((E(!(((p29==0)||(p64==1))) U (!((p59==0)) * !(((p29==0)||(p64==1))))) + EG(!(((p29==0)|...229
Reverse transition relation is NOT exact ! Due to transitions t5, t8, t9, t11, t25, t26, t27, t30, t31, Intersection with reachable at each step enabled. ...201
(forward)formula 0,1,0.032697,3880,1,0,57,2062,80,32,511,1992,72
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 125/125 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 90 transition count 119
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 90 transition count 119
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 84 transition count 113
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 84 transition count 113
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 81 transition count 110
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 81 transition count 110
Applied a total of 30 rules in 16 ms. Remains 81 /96 variables (removed 15) and now considering 110/125 (removed 15) transitions.
// Phase 1: matrix 110 rows 81 cols
[2025-06-03 05:02:23] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:02:24] [INFO ] Implicit Places using invariants in 305 ms returned []
[2025-06-03 05:02:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:02:24] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-06-03 05:02:24] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2025-06-03 05:02:24] [INFO ] Invariant cache hit.
[2025-06-03 05:02:24] [INFO ] State equation strengthened by 53 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, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 110/191 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 53/135 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 0/191 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 135 constraints, problems are : Problem set: 0 solved, 109 unsolved in 4792 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 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, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 110/191 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 53/135 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 109/244 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 244 constraints, problems are : Problem set: 0 solved, 109 unsolved in 4507 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9348ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 9351ms
Starting structural reductions in LTL mode, iteration 1 : 81/96 places, 110/125 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10039 ms. Remains : 81/96 places, 110/125 transitions.
[2025-06-03 05:02:33] [INFO ] Flatten gal took : 8 ms
[2025-06-03 05:02:33] [INFO ] Flatten gal took : 8 ms
[2025-06-03 05:02:33] [INFO ] Input system was already deterministic with 110 transitions.
[2025-06-03 05:02:33] [INFO ] Flatten gal took : 7 ms
[2025-06-03 05:02:33] [INFO ] Flatten gal took : 7 ms
[2025-06-03 05:02:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality8013151335993816739.gal : 3 ms
[2025-06-03 05:02:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality14619533007042376802.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/CTLCardinality8013151335993816739.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14619533007042376802.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.15368e+10,2.63022,68880,2,17694,5,416260,6,0,422,251729,0


Converting to forward existential form...Done !
original formula: EF((EF((((p83==0)||(p21==1))||((p62==0)||(p77==1)))) * EX((p64==1))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * E(TRUE U (((p83==0)||(p21==1))||((p62==0)||(p77==1)))))) * (p64==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t22, t26, t28, t30, t32, t34, t36, t39, t91, t95, t98, t99, t100, t101, t102, t103, t104,...285
(forward)formula 0,1,19.2874,405660,1,0,160,2.06256e+06,242,103,2529,2.2866e+06,235
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 125/125 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 88 transition count 117
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 88 transition count 117
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 81 transition count 110
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 81 transition count 110
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 77 transition count 106
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 77 transition count 106
Applied a total of 38 rules in 14 ms. Remains 77 /96 variables (removed 19) and now considering 106/125 (removed 19) transitions.
// Phase 1: matrix 106 rows 77 cols
[2025-06-03 05:02:53] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:02:53] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-03 05:02:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:02:53] [INFO ] State equation strengthened by 51 read => feed constraints.
[2025-06-03 05:02:53] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2025-06-03 05:02:53] [INFO ] Invariant cache hit.
[2025-06-03 05:02:53] [INFO ] State equation strengthened by 51 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 106/183 variables, 77/78 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 51/129 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 0/183 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 129 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3262 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 77/77 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 106/183 variables, 77/78 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 51/129 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 105/234 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/183 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 234 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3819 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 77/77 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7111ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 7117ms
Starting structural reductions in LTL mode, iteration 1 : 77/96 places, 106/125 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7436 ms. Remains : 77/96 places, 106/125 transitions.
[2025-06-03 05:03:00] [INFO ] Flatten gal took : 6 ms
[2025-06-03 05:03:00] [INFO ] Flatten gal took : 20 ms
[2025-06-03 05:03:00] [INFO ] Input system was already deterministic with 106 transitions.
[2025-06-03 05:03:00] [INFO ] Flatten gal took : 15 ms
[2025-06-03 05:03:00] [INFO ] Flatten gal took : 7 ms
[2025-06-03 05:03:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality3659288347931869370.gal : 18 ms
[2025-06-03 05:03:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality10702154069676493847.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/CTLCardinality3659288347931869370.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10702154069676493847.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,9.04371e+09,4.12286,103440,2,25245,5,646111,6,0,403,378432,0


Converting to forward existential form...Done !
original formula: EX(AG((((p53==0)||(p85==1)) + AX((p83==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((((p53==0)||(p85==1)) + !(EX(!((p83==0)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t10, t21, t25, t27, t31, t33, t35, t36, t38, t40, t95, t96, t97, t98, t99, t100, t101, t1...276
(forward)formula 0,0,23.8548,527316,1,0,161,2.80584e+06,235,104,2472,3.07474e+06,228
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 125/125 transitions.
Graph (complete) has 235 edges and 96 vertex of which 93 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 93 transition count 118
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 89 transition count 117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 88 transition count 117
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 14 place count 85 transition count 114
Iterating global reduction 3 with 3 rules applied. Total rules applied 17 place count 85 transition count 114
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 22 place count 85 transition count 114
Applied a total of 22 rules in 25 ms. Remains 85 /96 variables (removed 11) and now considering 114/125 (removed 11) transitions.
[2025-06-03 05:03:24] [INFO ] Flow matrix only has 110 transitions (discarded 4 similar events)
// Phase 1: matrix 110 rows 85 cols
[2025-06-03 05:03:25] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:03:25] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-03 05:03:25] [INFO ] Flow matrix only has 110 transitions (discarded 4 similar events)
[2025-06-03 05:03:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:03:25] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-03 05:03:25] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 05:03:25] [INFO ] Redundant transitions in 3 ms returned []
Running 113 sub problems to find dead transitions.
[2025-06-03 05:03:25] [INFO ] Flow matrix only has 110 transitions (discarded 4 similar events)
[2025-06-03 05:03:25] [INFO ] Invariant cache hit.
[2025-06-03 05:03:25] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 109/194 variables, 85/86 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 56/142 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 1/195 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 143 constraints, problems are : Problem set: 0 solved, 113 unsolved in 7883 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 109/194 variables, 85/86 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 56/142 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 113/255 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 1/195 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 256 constraints, problems are : Problem set: 0 solved, 113 unsolved in 8821 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16722ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 16723ms
Starting structural reductions in SI_CTL mode, iteration 1 : 85/96 places, 114/125 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16980 ms. Remains : 85/96 places, 114/125 transitions.
[2025-06-03 05:03:41] [INFO ] Flatten gal took : 12 ms
[2025-06-03 05:03:41] [INFO ] Flatten gal took : 11 ms
[2025-06-03 05:03:42] [INFO ] Input system was already deterministic with 114 transitions.
[2025-06-03 05:03:42] [INFO ] Flatten gal took : 10 ms
[2025-06-03 05:03:42] [INFO ] Flatten gal took : 10 ms
[2025-06-03 05:03:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality12202181034381935231.gal : 3 ms
[2025-06-03 05:03:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality400829836950766704.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12202181034381935231.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality400829836950766704.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,6.53312e+09,0.735426,18536,2,5586,5,101472,6,0,442,46596,0


Converting to forward existential form...Done !
original formula: E((((!(AG((p14==1))) + (p92==0)) + ((p30==1) + !(E(!(((p63==0)||(p2==1))) U EF((p63==0)))))) + (EF(!(EF(((p41==0)||(p73==1))))) + (AF((((...285
=> equivalent forward existential formula: [(FwdU(Init,(((!(!(E(TRUE U !((p14==1))))) + (p92==0)) + ((p30==1) + !(E(!(((p63==0)||(p2==1))) U E(TRUE U (p63=...379
Reverse transition relation is NOT exact ! Due to transitions t6, t26, t32, t38, t81, t86, t88, t90, t96, t97, t98, t99, t100, t101, t102, t103, t104, t105...274
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,7.3957,175284,1,0,325,975888,271,218,2899,966905,487
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-2025-03 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 : 96/96 places, 125/125 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 89 transition count 118
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 89 transition count 118
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 82 transition count 111
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 82 transition count 111
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 79 transition count 108
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 79 transition count 108
Applied a total of 34 rules in 9 ms. Remains 79 /96 variables (removed 17) and now considering 108/125 (removed 17) transitions.
// Phase 1: matrix 108 rows 79 cols
[2025-06-03 05:03:49] [INFO ] Computed 1 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:03:49] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-06-03 05:03:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:03:49] [INFO ] State equation strengthened by 52 read => feed constraints.
[2025-06-03 05:03:49] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2025-06-03 05:03:49] [INFO ] Invariant cache hit.
[2025-06-03 05:03:49] [INFO ] State equation strengthened by 52 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 108/187 variables, 79/80 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 52/132 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 0/187 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 132 constraints, problems are : Problem set: 0 solved, 107 unsolved in 5857 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 79/79 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 108/187 variables, 79/80 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 52/132 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 107/239 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/187 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 239 constraints, problems are : Problem set: 0 solved, 107 unsolved in 6272 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 79/79 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12152ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 12154ms
Starting structural reductions in LTL mode, iteration 1 : 79/96 places, 108/125 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12441 ms. Remains : 79/96 places, 108/125 transitions.
[2025-06-03 05:04:01] [INFO ] Flatten gal took : 10 ms
[2025-06-03 05:04:01] [INFO ] Flatten gal took : 10 ms
[2025-06-03 05:04:01] [INFO ] Input system was already deterministic with 108 transitions.
[2025-06-03 05:04:02] [INFO ] Flatten gal took : 9 ms
[2025-06-03 05:04:02] [INFO ] Flatten gal took : 10 ms
[2025-06-03 05:04:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality12019902373321497181.gal : 3 ms
[2025-06-03 05:04:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality14322568465067833913.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/CTLCardinality12019902373321497181.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14322568465067833913.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.04488e+10,7.75811,157020,2,47246,5,925870,6,0,413,617659,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-03 05:04:32] [INFO ] Flatten gal took : 5 ms
[2025-06-03 05:04:32] [INFO ] Applying decomposition
[2025-06-03 05:04:32] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10115925438921292699.txt' '-o' '/tmp/graph10115925438921292699.bin' '-w' '/tmp/graph10115925438921292699.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10115925438921292699.bin' '-l' '-1' '-v' '-w' '/tmp/graph10115925438921292699.weights' '-q' '0' '-e' '0.001'
[2025-06-03 05:04:32] [INFO ] Decomposing Gal with order
[2025-06-03 05:04:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 05:04:32] [INFO ] Removed a total of 57 redundant transitions.
[2025-06-03 05:04:32] [INFO ] Flatten gal took : 58 ms
[2025-06-03 05:04:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 10 ms.
[2025-06-03 05:04:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality9363097096630894600.gal : 4 ms
[2025-06-03 05:04:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality12579081095012595011.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/CTLCardinality9363097096630894600.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12579081095012595011.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.04488e+10,0.378799,15600,765,87,20121,1056,200,75643,43,7552,0


Converting to forward existential form...Done !
original formula: E((i7.u12.p57==1) U (AG((!(((i5.u5.p23==1)&&((i10.u18.p89==0)||(i7.u11.p53==1)))) + A(!(((u16.p78==0)||(i2.u2.p16==1))) U ((i10.u18.p88==...374
=> equivalent forward existential formula: ([(FwdU(Init,(i7.u12.p57==1)) * !(E(TRUE U !((!(((i5.u5.p23==1)&&((i10.u18.p89==0)||(i7.u11.p53==1)))) + !((E(!(...577
Reverse transition relation is NOT exact ! Due to transitions t10, t17, t32, t36, t39, t43, t86, t92, i0.u0.t102, i0.u15.t98, i0.u22.t103, i2.t41, i2.t34, ...364
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,0,3.87067,86384,1,0,116732,4134,1157,538457,212,35484,83380
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 125/125 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 87 transition count 116
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 87 transition count 116
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 80 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 80 transition count 109
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 76 transition count 105
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 76 transition count 105
Applied a total of 40 rules in 8 ms. Remains 76 /96 variables (removed 20) and now considering 105/125 (removed 20) transitions.
// Phase 1: matrix 105 rows 76 cols
[2025-06-03 05:04:36] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:04:36] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-03 05:04:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:04:36] [INFO ] State equation strengthened by 51 read => feed constraints.
[2025-06-03 05:04:36] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Running 104 sub problems to find dead transitions.
[2025-06-03 05:04:36] [INFO ] Invariant cache hit.
[2025-06-03 05:04:36] [INFO ] State equation strengthened by 51 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (OVERLAPS) 105/181 variables, 76/77 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 51/128 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 0/181 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 128 constraints, problems are : Problem set: 0 solved, 104 unsolved in 4488 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (OVERLAPS) 105/181 variables, 76/77 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 51/128 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 104/232 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 0/181 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 232 constraints, problems are : Problem set: 0 solved, 104 unsolved in 4799 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9305ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 9306ms
Starting structural reductions in LTL mode, iteration 1 : 76/96 places, 105/125 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9579 ms. Remains : 76/96 places, 105/125 transitions.
[2025-06-03 05:04:45] [INFO ] Flatten gal took : 9 ms
[2025-06-03 05:04:45] [INFO ] Flatten gal took : 8 ms
[2025-06-03 05:04:45] [INFO ] Input system was already deterministic with 105 transitions.
[2025-06-03 05:04:45] [INFO ] Flatten gal took : 8 ms
[2025-06-03 05:04:45] [INFO ] Flatten gal took : 8 ms
[2025-06-03 05:04:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality17870595627320999132.gal : 2 ms
[2025-06-03 05:04:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality4683581953071011958.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/CTLCardinality17870595627320999132.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4683581953071011958.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,8.31835e+09,6.82739,149460,2,37942,5,880888,6,0,398,571510,0


Converting to forward existential form...Done !
original formula: AG(((EX(((p93==0)&&(p17==1))) + EG((p54!=0))) + (EF(((p24==1)&&((p77==0)||(p90==1)))) + ((p87==1) * AX(((p100==0)||(p50==1)))))))
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * !((EX(((p93==0)&&(p17==1))) + EG((p54!=0))))) * !(E(TRUE U ((p24==1)&&((p77==0)||(p90==1)...345
Reverse transition relation is NOT exact ! Due to transitions t1, t20, t26, t28, t30, t32, t34, t35, t37, t39, t41, t94, t95, t96, t97, t98, t99, t100, t10...275
Detected timeout of ITS tools.
[2025-06-03 05:05:15] [INFO ] Flatten gal took : 6 ms
[2025-06-03 05:05:15] [INFO ] Applying decomposition
[2025-06-03 05:05:15] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14635511571502135378.txt' '-o' '/tmp/graph14635511571502135378.bin' '-w' '/tmp/graph14635511571502135378.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14635511571502135378.bin' '-l' '-1' '-v' '-w' '/tmp/graph14635511571502135378.weights' '-q' '0' '-e' '0.001'
[2025-06-03 05:05:15] [INFO ] Decomposing Gal with order
[2025-06-03 05:05:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 05:05:15] [INFO ] Removed a total of 54 redundant transitions.
[2025-06-03 05:05:15] [INFO ] Flatten gal took : 14 ms
[2025-06-03 05:05:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 65 labels/synchronizations in 6 ms.
[2025-06-03 05:05:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality14506304182930157876.gal : 2 ms
[2025-06-03 05:05:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality15842143020968221915.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/CTLCardinality14506304182930157876.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15842143020968221915.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.31835e+09,0.229115,11580,345,104,13498,5627,186,41279,48,27737,0


Converting to forward existential form...Done !
original formula: AG(((EX(((i11.u18.p93==0)&&(i2.u3.p17==1))) + EG((i6.u10.p54!=0))) + (EF(((i3.u4.p24==1)&&((i9.u15.p77==0)||(u17.p90==1)))) + ((u17.p87==...196
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * !((EX(((i11.u18.p93==0)&&(i2.u3.p17==1))) + EG((i6.u10.p54!=0))))) * !(E(TRUE U ((i3.u4.p...432
Reverse transition relation is NOT exact ! Due to transitions t20, t26, t28, t30, t32, t34, t35, u13.t103, i0.u0.t99, i0.u8.t102, i2.u2.t98, i3.u4.t101, i4...358
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,0,0.952159,35900,1,0,47884,5627,1051,198480,253,60899,49991
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 125/125 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 87 transition count 116
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 87 transition count 116
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 79 transition count 108
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 79 transition count 108
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 75 transition count 104
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 75 transition count 104
Applied a total of 42 rules in 7 ms. Remains 75 /96 variables (removed 21) and now considering 104/125 (removed 21) transitions.
// Phase 1: matrix 104 rows 75 cols
[2025-06-03 05:05:16] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:05:17] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-03 05:05:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:05:17] [INFO ] State equation strengthened by 51 read => feed constraints.
[2025-06-03 05:05:17] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2025-06-03 05:05:17] [INFO ] Invariant cache hit.
[2025-06-03 05:05:17] [INFO ] State equation strengthened by 51 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 104/179 variables, 75/76 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 51/127 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 0/179 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 127 constraints, problems are : Problem set: 0 solved, 103 unsolved in 4733 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 104/179 variables, 75/76 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 51/127 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 103/230 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/179 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 230 constraints, problems are : Problem set: 0 solved, 103 unsolved in 5549 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10301ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 10303ms
Starting structural reductions in LTL mode, iteration 1 : 75/96 places, 104/125 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10521 ms. Remains : 75/96 places, 104/125 transitions.
[2025-06-03 05:05:27] [INFO ] Flatten gal took : 7 ms
[2025-06-03 05:05:27] [INFO ] Flatten gal took : 7 ms
[2025-06-03 05:05:27] [INFO ] Input system was already deterministic with 104 transitions.
[2025-06-03 05:05:27] [INFO ] Flatten gal took : 7 ms
[2025-06-03 05:05:27] [INFO ] Flatten gal took : 7 ms
[2025-06-03 05:05:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality13948728345455307181.gal : 1 ms
[2025-06-03 05:05:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality13869479545901774307.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/CTLCardinality13948728345455307181.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13869479545901774307.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,7.61686e+09,3.07648,64356,2,15892,5,405648,6,0,393,220389,0


Converting to forward existential form...Done !
original formula: AX(AX(EF((p84==1))))
=> equivalent forward existential formula: [(EY(EY(Init)) * !(E(TRUE U (p84==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t23, t25, t27, t29, t31, t33, t34, t36, t38, t40, t93, t94, t95, t96, t97, t98, t99, t100, t1...270
(forward)formula 0,1,16.2643,299480,1,0,150,1.46624e+06,229,99,2379,1.56046e+06,220
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 125/125 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 87 transition count 116
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 87 transition count 116
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 79 transition count 108
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 79 transition count 108
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 75 transition count 104
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 75 transition count 104
Applied a total of 42 rules in 10 ms. Remains 75 /96 variables (removed 21) and now considering 104/125 (removed 21) transitions.
[2025-06-03 05:05:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:05:44] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-03 05:05:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:05:44] [INFO ] State equation strengthened by 51 read => feed constraints.
[2025-06-03 05:05:44] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2025-06-03 05:05:44] [INFO ] Invariant cache hit.
[2025-06-03 05:05:44] [INFO ] State equation strengthened by 51 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 104/179 variables, 75/76 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 51/127 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 0/179 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 127 constraints, problems are : Problem set: 0 solved, 103 unsolved in 4041 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 104/179 variables, 75/76 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 51/127 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 103/230 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/179 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 230 constraints, problems are : Problem set: 0 solved, 103 unsolved in 5358 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9425ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 9426ms
Starting structural reductions in LTL mode, iteration 1 : 75/96 places, 104/125 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9724 ms. Remains : 75/96 places, 104/125 transitions.
[2025-06-03 05:05:53] [INFO ] Flatten gal took : 7 ms
[2025-06-03 05:05:53] [INFO ] Flatten gal took : 7 ms
[2025-06-03 05:05:53] [INFO ] Input system was already deterministic with 104 transitions.
[2025-06-03 05:05:53] [INFO ] Flatten gal took : 12 ms
[2025-06-03 05:05:53] [INFO ] Flatten gal took : 7 ms
[2025-06-03 05:05:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality902890245315656472.gal : 2 ms
[2025-06-03 05:05:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality1515400008105026062.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/CTLCardinality902890245315656472.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1515400008105026062.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.61686e+09,2.70682,64348,2,15892,5,405648,6,0,393,220389,0


Converting to forward existential form...Done !
original formula: AX(AG((p14==0)))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !((p14==0)))] = FALSE
(forward)formula 0,0,4.23234,67804,1,0,10,416261,10,2,816,246610,4
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 125/125 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 88 transition count 117
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 88 transition count 117
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 81 transition count 110
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 81 transition count 110
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 78 transition count 107
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 78 transition count 107
Applied a total of 36 rules in 3 ms. Remains 78 /96 variables (removed 18) and now considering 107/125 (removed 18) transitions.
// Phase 1: matrix 107 rows 78 cols
[2025-06-03 05:05:58] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:05:58] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-03 05:05:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:05:58] [INFO ] State equation strengthened by 52 read => feed constraints.
[2025-06-03 05:05:58] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2025-06-03 05:05:58] [INFO ] Invariant cache hit.
[2025-06-03 05:05:58] [INFO ] State equation strengthened by 52 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (OVERLAPS) 107/185 variables, 78/79 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 52/131 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 0/185 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 131 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4716 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 78/78 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (OVERLAPS) 107/185 variables, 78/79 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 52/131 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 106/237 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/185 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 237 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4583 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 78/78 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9311ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 9312ms
Starting structural reductions in LTL mode, iteration 1 : 78/96 places, 107/125 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9522 ms. Remains : 78/96 places, 107/125 transitions.
[2025-06-03 05:06:07] [INFO ] Flatten gal took : 5 ms
[2025-06-03 05:06:07] [INFO ] Flatten gal took : 4 ms
[2025-06-03 05:06:07] [INFO ] Input system was already deterministic with 107 transitions.
[2025-06-03 05:06:07] [INFO ] Flatten gal took : 7 ms
[2025-06-03 05:06:07] [INFO ] Flatten gal took : 8 ms
[2025-06-03 05:06:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality13209555163718168177.gal : 2 ms
[2025-06-03 05:06:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality4932924642263815671.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/CTLCardinality13209555163718168177.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4932924642263815671.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,9.19287e+09,2.27035,56248,2,13769,5,348704,6,0,407,185585,0


Converting to forward existential form...Done !
original formula: EX(AG(AF((p11==0))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(!(EG(!((p11==0))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t24, t26, t28, t30, t34, t35, t37, t39, t41, t95, t96, t97, t98, t99, t100, t101, t102, t103,...273
(forward)formula 0,0,17.3758,392204,1,0,278,2.14324e+06,242,161,2497,1.98413e+06,404
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 125/125 transitions.
Graph (complete) has 235 edges and 96 vertex of which 92 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 101 edges and 90 vertex of which 74 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Graph (trivial) has 79 edges and 74 vertex of which 38 / 74 are part of one of the 19 SCC in 1 ms
Free SCC test removed 19 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 55 transition count 93
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 45 place count 44 transition count 74
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 52 place count 37 transition count 60
Iterating global reduction 2 with 7 rules applied. Total rules applied 59 place count 37 transition count 60
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 65 place count 31 transition count 48
Iterating global reduction 2 with 6 rules applied. Total rules applied 71 place count 31 transition count 48
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 77 place count 25 transition count 36
Iterating global reduction 2 with 6 rules applied. Total rules applied 83 place count 25 transition count 36
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 89 place count 19 transition count 30
Iterating global reduction 2 with 6 rules applied. Total rules applied 95 place count 19 transition count 30
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 96 place count 19 transition count 29
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 97 place count 19 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 98 place count 18 transition count 28
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 102 place count 14 transition count 24
Applied a total of 102 rules in 14 ms. Remains 14 /96 variables (removed 82) and now considering 24/125 (removed 101) transitions.
[2025-06-03 05:06:25] [INFO ] Flow matrix only has 18 transitions (discarded 6 similar events)
// Phase 1: matrix 18 rows 14 cols
[2025-06-03 05:06:25] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:06:25] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-03 05:06:25] [INFO ] Flow matrix only has 18 transitions (discarded 6 similar events)
[2025-06-03 05:06:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:06:25] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 05:06:25] [INFO ] Redundant transitions in 1 ms returned []
Running 16 sub problems to find dead transitions.
[2025-06-03 05:06:25] [INFO ] Flow matrix only has 18 transitions (discarded 6 similar events)
[2025-06-03 05:06:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 17/27 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 4/31 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/32 variables, and 14 constraints, problems are : Problem set: 0 solved, 16 unsolved in 314 ms.
Refiners :[State Equation: 14/14 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 17/27 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 4/31 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 0/31 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/32 variables, and 30 constraints, problems are : Problem set: 0 solved, 16 unsolved in 365 ms.
Refiners :[State Equation: 14/14 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 696ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 696ms
Starting structural reductions in SI_CTL mode, iteration 1 : 14/96 places, 24/125 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 772 ms. Remains : 14/96 places, 24/125 transitions.
[2025-06-03 05:06:25] [INFO ] Flatten gal took : 2 ms
[2025-06-03 05:06:25] [INFO ] Flatten gal took : 1 ms
[2025-06-03 05:06:25] [INFO ] Input system was already deterministic with 24 transitions.
[2025-06-03 05:06:25] [INFO ] Flatten gal took : 1 ms
[2025-06-03 05:06:25] [INFO ] Flatten gal took : 1 ms
[2025-06-03 05:06:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality6095739469819100534.gal : 1 ms
[2025-06-03 05:06:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality5702141021779795470.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/CTLCardinality6095739469819100534.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5702141021779795470.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,4320,0.007565,3708,2,31,5,169,6,0,66,149,0


Converting to forward existential form...Done !
original formula: !(E(!(AG(((p21==1)||(p15==1)))) U AF((p63==1))))
=> equivalent forward existential formula: [(FwdU(Init,!(!(E(TRUE U !(((p21==1)||(p15==1))))))) * !(EG(!((p63==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t5, t21, t22, t23, Intersection with reachable at each step enabled. (destroyed/reve...186
(forward)formula 0,0,0.046772,4988,1,0,181,5636,72,100,404,9247,216
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 125/125 transitions.
Graph (complete) has 235 edges and 96 vertex of which 91 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
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 91 transition count 110
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 81 transition count 110
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 29 place count 73 transition count 102
Iterating global reduction 2 with 8 rules applied. Total rules applied 37 place count 73 transition count 102
Applied a total of 37 rules in 11 ms. Remains 73 /96 variables (removed 23) and now considering 102/125 (removed 23) transitions.
// Phase 1: matrix 102 rows 73 cols
[2025-06-03 05:06:25] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:06:26] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-06-03 05:06:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:06:26] [INFO ] State equation strengthened by 51 read => feed constraints.
[2025-06-03 05:06:26] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 05:06:26] [INFO ] Redundant transitions in 2 ms returned []
Running 101 sub problems to find dead transitions.
[2025-06-03 05:06:26] [INFO ] Invariant cache hit.
[2025-06-03 05:06:26] [INFO ] State equation strengthened by 51 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 102/175 variables, 73/74 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 51/125 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 0/175 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 125 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4782 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 73/73 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 102/175 variables, 73/74 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 51/125 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 101/226 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/175 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 226 constraints, problems are : Problem set: 0 solved, 101 unsolved in 5463 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 73/73 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10256ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 10256ms
Starting structural reductions in SI_CTL mode, iteration 1 : 73/96 places, 102/125 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10532 ms. Remains : 73/96 places, 102/125 transitions.
[2025-06-03 05:06:36] [INFO ] Flatten gal took : 6 ms
[2025-06-03 05:06:36] [INFO ] Flatten gal took : 5 ms
[2025-06-03 05:06:36] [INFO ] Input system was already deterministic with 102 transitions.
[2025-06-03 05:06:36] [INFO ] Flatten gal took : 10 ms
[2025-06-03 05:06:36] [INFO ] Flatten gal took : 7 ms
[2025-06-03 05:06:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality500294299534880266.gal : 1 ms
[2025-06-03 05:06:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality6991635461473383756.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/CTLCardinality500294299534880266.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6991635461473383756.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.41592e+09,0.906804,22152,2,7414,5,123898,6,0,384,61320,0


Converting to forward existential form...Done !
original formula: EG(((p40==0)||(p20==1)))
=> equivalent forward existential formula: [FwdG(Init,((p40==0)||(p20==1)))] != FALSE
Hit Full ! (commute/partial/dont) 99/0/3
(forward)formula 0,1,3.13372,74676,1,0,11,345263,19,4,1866,287318,10
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-2023-12 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 : 96/96 places, 125/125 transitions.
Graph (complete) has 235 edges and 96 vertex of which 91 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 1 places and 0 transitions.
Graph (complete) has 100 edges and 89 vertex of which 71 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 18 output transitions
Drop transitions (Output transitions of discarded places.) removed 18 transitions
Graph (trivial) has 74 edges and 71 vertex of which 36 / 71 are part of one of the 18 SCC in 0 ms
Free SCC test removed 18 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 53 transition count 92
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 41 place count 44 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 43 transition count 73
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 50 place count 35 transition count 57
Iterating global reduction 3 with 8 rules applied. Total rules applied 58 place count 35 transition count 57
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 65 place count 28 transition count 43
Iterating global reduction 3 with 7 rules applied. Total rules applied 72 place count 28 transition count 43
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 78 place count 22 transition count 31
Iterating global reduction 3 with 6 rules applied. Total rules applied 84 place count 22 transition count 31
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 90 place count 16 transition count 25
Iterating global reduction 3 with 6 rules applied. Total rules applied 96 place count 16 transition count 25
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 16 transition count 24
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 99 place count 15 transition count 23
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 103 place count 11 transition count 19
Applied a total of 103 rules in 10 ms. Remains 11 /96 variables (removed 85) and now considering 19/125 (removed 106) transitions.
[2025-06-03 05:06:39] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
// Phase 1: matrix 15 rows 11 cols
[2025-06-03 05:06:39] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:06:39] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-03 05:06:39] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
[2025-06-03 05:06:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:06:39] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 05:06:39] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2025-06-03 05:06:39] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
[2025-06-03 05:06:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 14/21 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 4/25 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/26 variables, and 11 constraints, problems are : Problem set: 0 solved, 12 unsolved in 257 ms.
Refiners :[State Equation: 11/11 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 14/21 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 4/25 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/26 variables, and 23 constraints, problems are : Problem set: 0 solved, 12 unsolved in 244 ms.
Refiners :[State Equation: 11/11 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 504ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 504ms
Starting structural reductions in SI_CTL mode, iteration 1 : 11/96 places, 19/125 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 585 ms. Remains : 11/96 places, 19/125 transitions.
[2025-06-03 05:06:40] [INFO ] Flatten gal took : 9 ms
[2025-06-03 05:06:40] [INFO ] Flatten gal took : 1 ms
[2025-06-03 05:06:40] [INFO ] Input system was already deterministic with 19 transitions.
[2025-06-03 05:06:40] [INFO ] Flatten gal took : 1 ms
[2025-06-03 05:06:40] [INFO ] Flatten gal took : 1 ms
[2025-06-03 05:06:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality6694722365735730532.gal : 0 ms
[2025-06-03 05:06:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality18009317705322876203.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/CTLCardinality6694722365735730532.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18009317705322876203.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,2320,0.007512,3748,2,38,5,278,6,0,54,302,0


Converting to forward existential form...Done !
original formula: AF(EG(((p15==1)&&((p33==0)||(p78==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(((p15==1)&&((p33==0)||(p78==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t7, t16, t18, Intersection with reachable at each step enabled. (destroyed/reverse/i...181
(forward)formula 0,0,0.034262,4516,1,0,86,3704,59,70,292,6504,99
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 125/125 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 88 transition count 117
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 88 transition count 117
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 81 transition count 110
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 81 transition count 110
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 78 transition count 107
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 78 transition count 107
Applied a total of 36 rules in 4 ms. Remains 78 /96 variables (removed 18) and now considering 107/125 (removed 18) transitions.
// Phase 1: matrix 107 rows 78 cols
[2025-06-03 05:06:40] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:06:40] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-06-03 05:06:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:06:40] [INFO ] State equation strengthened by 52 read => feed constraints.
[2025-06-03 05:06:40] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2025-06-03 05:06:40] [INFO ] Invariant cache hit.
[2025-06-03 05:06:40] [INFO ] State equation strengthened by 52 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (OVERLAPS) 107/185 variables, 78/79 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 52/131 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 0/185 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 131 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4451 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 78/78 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (OVERLAPS) 107/185 variables, 78/79 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 52/131 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 106/237 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/185 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 237 constraints, problems are : Problem set: 0 solved, 106 unsolved in 3919 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 78/78 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8382ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 8383ms
Starting structural reductions in LTL mode, iteration 1 : 78/96 places, 107/125 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8695 ms. Remains : 78/96 places, 107/125 transitions.
[2025-06-03 05:06:49] [INFO ] Flatten gal took : 4 ms
[2025-06-03 05:06:49] [INFO ] Flatten gal took : 3 ms
[2025-06-03 05:06:49] [INFO ] Input system was already deterministic with 107 transitions.
[2025-06-03 05:06:49] [INFO ] Flatten gal took : 3 ms
[2025-06-03 05:06:49] [INFO ] Flatten gal took : 2 ms
[2025-06-03 05:06:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality17575098537149595717.gal : 1 ms
[2025-06-03 05:06:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality12520649639509123144.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/CTLCardinality17575098537149595717.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12520649639509123144.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,9.19287e+09,1.07938,32528,2,7534,5,207307,6,0,407,91006,0


Converting to forward existential form...Done !
original formula: AG(((p6==1) + (AX((p86==1)) * A(((p41==0)||(p14==1)) U (p6==0)))))
=> equivalent forward existential formula: ([(EY((FwdU(Init,TRUE) * !((p6==1)))) * !((p86==1)))] = FALSE * ([(FwdU((FwdU(Init,TRUE) * !((p6==1))),!((p6==0)...270
Hit Full ! (commute/partial/dont) 104/0/3
(forward)formula 0,0,3.53877,79972,1,0,18,382106,33,9,1888,350644,14
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 125/125 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 88 transition count 117
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 88 transition count 117
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 81 transition count 110
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 81 transition count 110
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 77 transition count 106
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 77 transition count 106
Applied a total of 38 rules in 7 ms. Remains 77 /96 variables (removed 19) and now considering 106/125 (removed 19) transitions.
// Phase 1: matrix 106 rows 77 cols
[2025-06-03 05:06:52] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:06:52] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-03 05:06:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:06:52] [INFO ] State equation strengthened by 52 read => feed constraints.
[2025-06-03 05:06:52] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2025-06-03 05:06:52] [INFO ] Invariant cache hit.
[2025-06-03 05:06:52] [INFO ] State equation strengthened by 52 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 106/183 variables, 77/78 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 52/130 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 0/183 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 130 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3767 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 77/77 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 106/183 variables, 77/78 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 52/130 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 105/235 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/183 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 235 constraints, problems are : Problem set: 0 solved, 105 unsolved in 5732 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 77/77 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9521ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 9522ms
Starting structural reductions in LTL mode, iteration 1 : 77/96 places, 106/125 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9767 ms. Remains : 77/96 places, 106/125 transitions.
[2025-06-03 05:07:02] [INFO ] Flatten gal took : 3 ms
[2025-06-03 05:07:02] [INFO ] Flatten gal took : 3 ms
[2025-06-03 05:07:02] [INFO ] Input system was already deterministic with 106 transitions.
[2025-06-03 05:07:02] [INFO ] Flatten gal took : 3 ms
[2025-06-03 05:07:02] [INFO ] Flatten gal took : 3 ms
[2025-06-03 05:07:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality5525853600011549512.gal : 1 ms
[2025-06-03 05:07:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality11899130677661173435.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/CTLCardinality5525853600011549512.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11899130677661173435.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,8.86886e+09,1.44421,38640,2,9948,5,242469,6,0,403,114034,0


Converting to forward existential form...Done !
original formula: (AG(((p62==0)||(p24==1))) * AX(FALSE))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(((p62==0)||(p24==1))))] = FALSE * [(EY(Init) * !(FALSE))] = FALSE)
(forward)formula 0,0,1.44754,38640,1,0,6,242469,7,1,537,114034,1
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-03 05:07:03] [INFO ] Flatten gal took : 4 ms
[2025-06-03 05:07:03] [INFO ] Flatten gal took : 3 ms
Total runtime 284553 ms.

BK_STOP 1748927223980

--------------------
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-10a"
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-10a, 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-174854064600673"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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