Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r356-tall-171683760500185.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is ShieldIIPt-PT-001B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760500185
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 23 07:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 20:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 12 20:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 20:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 12 20:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 17K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716924248232

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-001B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-28 19:24:09] [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]
[2024-05-28 19:24:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 19:24:09] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2024-05-28 19:24:09] [INFO ] Transformed 73 places.
[2024-05-28 19:24:09] [INFO ] Transformed 68 transitions.
[2024-05-28 19:24:09] [INFO ] Found NUPN structural information;
[2024-05-28 19:24:09] [INFO ] Parsed PT model containing 73 places and 68 transitions and 168 arcs in 143 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Support contains 61 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Applied a total of 0 rules in 14 ms. Remains 73 /73 variables (removed 0) and now considering 68/68 (removed 0) transitions.
// Phase 1: matrix 68 rows 73 cols
[2024-05-28 19:24:09] [INFO ] Computed 10 invariants in 11 ms
[2024-05-28 19:24:09] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-28 19:24:09] [INFO ] Invariant cache hit.
[2024-05-28 19:24:09] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Running 67 sub problems to find dead transitions.
[2024-05-28 19:24:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-05-28 19:24:10] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 17 ms to minimize.
[2024-05-28 19:24:10] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:24:10] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-05-28 19:24:10] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:24:10] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-28 19:24:10] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:24:10] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-05-28 19:24:10] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-28 19:24:10] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
[2024-05-28 19:24:10] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
[2024-05-28 19:24:10] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-05-28 19:24:10] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-28 19:24:11] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:24:11] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:24:11] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-05-28 19:24:11] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
[2024-05-28 19:24:11] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-28 19:24:11] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 18/101 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-05-28 19:24:11] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:24:11] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (OVERLAPS) 68/141 variables, 73/176 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-05-28 19:24:11] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-05-28 19:24:12] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 2 ms to minimize.
[2024-05-28 19:24:12] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-05-28 19:24:12] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/141 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/141 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 12 (OVERLAPS) 0/141 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 180 constraints, problems are : Problem set: 0 solved, 67 unsolved in 2927 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 24/107 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-05-28 19:24:13] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (OVERLAPS) 68/141 variables, 73/181 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 67/248 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-05-28 19:24:13] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-05-28 19:24:14] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/141 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 12 (OVERLAPS) 0/141 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 250 constraints, problems are : Problem set: 0 solved, 67 unsolved in 2593 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 27/27 constraints]
After SMT, in 5574ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 5587ms
Finished structural reductions in LTL mode , in 1 iterations and 5962 ms. Remains : 73/73 places, 68/68 transitions.
Support contains 61 out of 73 places after structural reductions.
[2024-05-28 19:24:15] [INFO ] Flatten gal took : 21 ms
[2024-05-28 19:24:15] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldIIPt-PT-001B-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 19:24:15] [INFO ] Flatten gal took : 7 ms
[2024-05-28 19:24:15] [INFO ] Input system was already deterministic with 68 transitions.
Support contains 59 out of 73 places (down from 61) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 58 to 57
RANDOM walk for 30638 steps (7 resets) in 710 ms. (43 steps per ms) remains 0/57 properties
[2024-05-28 19:24:16] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:24:16] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:24:16] [INFO ] Input system was already deterministic with 68 transitions.
Computed a total of 20 stabilizing places and 20 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 72 transition count 50
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 36 place count 55 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 54 transition count 48
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 37 place count 54 transition count 43
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 47 place count 49 transition count 43
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 53 place count 43 transition count 37
Iterating global reduction 3 with 6 rules applied. Total rules applied 59 place count 43 transition count 37
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 59 place count 43 transition count 35
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 63 place count 41 transition count 35
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 85 place count 30 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 86 place count 29 transition count 23
Applied a total of 86 rules in 24 ms. Remains 29 /73 variables (removed 44) and now considering 23/68 (removed 45) transitions.
// Phase 1: matrix 23 rows 29 cols
[2024-05-28 19:24:16] [INFO ] Computed 10 invariants in 0 ms
[2024-05-28 19:24:16] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-28 19:24:16] [INFO ] Invariant cache hit.
[2024-05-28 19:24:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-28 19:24:16] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-05-28 19:24:16] [INFO ] Redundant transitions in 0 ms returned []
Running 21 sub problems to find dead transitions.
[2024-05-28 19:24:16] [INFO ] Invariant cache hit.
[2024-05-28 19:24:16] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-28 19:24:16] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-28 19:24:16] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 23/52 variables, 29/41 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 43 constraints, problems are : Problem set: 0 solved, 21 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 29/29 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 2/29 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 23/52 variables, 29/41 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 21/64 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/52 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 0/52 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 64 constraints, problems are : Problem set: 0 solved, 21 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 29/29 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 2/2 constraints]
After SMT, in 439ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 441ms
Starting structural reductions in SI_CTL mode, iteration 1 : 29/73 places, 23/68 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 537 ms. Remains : 29/73 places, 23/68 transitions.
[2024-05-28 19:24:16] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:24:16] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:24:16] [INFO ] Input system was already deterministic with 23 transitions.
[2024-05-28 19:24:16] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:24:16] [INFO ] Flatten gal took : 1 ms
[2024-05-28 19:24:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality1002373328994319156.gal : 2 ms
[2024-05-28 19:24:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality3816973305004534567.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1002373328994319156.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3816973305004534567.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,11019,0.024152,4244,2,128,5,3302,6,0,138,5015,0


Converting to forward existential form...Done !
original formula: AG(EF(EG((((p38==0)||(p12==1))||(p25==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U EG((((p38==0)||(p12==1))||(p25==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t11, t13, t15, t17, Intersection with reachable at each step enabled. (destroyed...191
(forward)formula 0,1,0.320419,19716,1,0,331,84772,73,163,829,137494,349
FORMULA ShieldIIPt-PT-001B-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 63 transition count 58
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 63 transition count 58
Applied a total of 20 rules in 8 ms. Remains 63 /73 variables (removed 10) and now considering 58/68 (removed 10) transitions.
// Phase 1: matrix 58 rows 63 cols
[2024-05-28 19:24:17] [INFO ] Computed 10 invariants in 4 ms
[2024-05-28 19:24:17] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-28 19:24:17] [INFO ] Invariant cache hit.
[2024-05-28 19:24:17] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Running 57 sub problems to find dead transitions.
[2024-05-28 19:24:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-28 19:24:17] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:24:17] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:24:17] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 1 ms to minimize.
[2024-05-28 19:24:17] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-28 19:24:17] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:24:17] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:24:17] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-28 19:24:17] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-28 19:24:17] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 58/121 variables, 63/82 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 0/121 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 82 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1116 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (OVERLAPS) 58/121 variables, 63/82 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 57/139 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-28 19:24:18] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-28 19:24:18] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 2 ms to minimize.
[2024-05-28 19:24:18] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:24:18] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 4/143 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (OVERLAPS) 0/121 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 143 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1105 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 13/13 constraints]
After SMT, in 2232ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 2233ms
Starting structural reductions in LTL mode, iteration 1 : 63/73 places, 58/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2343 ms. Remains : 63/73 places, 58/68 transitions.
[2024-05-28 19:24:19] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:24:19] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:24:19] [INFO ] Input system was already deterministic with 58 transitions.
[2024-05-28 19:24:19] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:24:19] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:24:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality618404935268550683.gal : 1 ms
[2024-05-28 19:24:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality5200243569868107514.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality618404935268550683.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5200243569868107514.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,1.531e+06,0.116401,9280,2,717,5,19070,6,0,312,39314,0


Converting to forward existential form...Done !
original formula: EG((AF((EG((p43==0)) + A((((p14==1)||(p50==0))||(p32==1)) U (p66==1)))) * AF((EX(((p29==0)||(p62==1))) * AX(EG((p50==1)))))))
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!((EG((p43==0)) + !((E(!((p66==1)) U (!((((p14==1)||(p50==0))||(p32==1))) * !((p66==1)))) + EG(...249
Reverse transition relation is NOT exact ! Due to transitions t4, t8, t13, t17, t22, t26, t30, t35, t37, t38, t39, t40, t41, t42, t44, t45, t46, t48, Inte...248
(forward)formula 0,0,1.95642,74864,1,0,374,362296,150,176,1780,435150,425
FORMULA ShieldIIPt-PT-001B-CTLCardinality-2024-01 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 : 73/73 places, 68/68 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 63 transition count 58
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 63 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 62 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 61 transition count 56
Applied a total of 24 rules in 15 ms. Remains 61 /73 variables (removed 12) and now considering 56/68 (removed 12) transitions.
// Phase 1: matrix 56 rows 61 cols
[2024-05-28 19:24:21] [INFO ] Computed 10 invariants in 2 ms
[2024-05-28 19:24:21] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-28 19:24:21] [INFO ] Invariant cache hit.
[2024-05-28 19:24:21] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Running 55 sub problems to find dead transitions.
[2024-05-28 19:24:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 19:24:21] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-28 19:24:21] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:24:21] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 0 ms to minimize.
[2024-05-28 19:24:21] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:24:21] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-05-28 19:24:21] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:24:21] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 19:24:22] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 56/117 variables, 61/79 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 19:24:22] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 80 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1167 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 19:24:22] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-28 19:24:22] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 56/117 variables, 61/82 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 55/137 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 19:24:23] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 19:24:23] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:24:23] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (OVERLAPS) 0/117 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 140 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1529 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 14/14 constraints]
After SMT, in 2707ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 2708ms
Starting structural reductions in LTL mode, iteration 1 : 61/73 places, 56/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2802 ms. Remains : 61/73 places, 56/68 transitions.
[2024-05-28 19:24:24] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:24:24] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:24:24] [INFO ] Input system was already deterministic with 56 transitions.
[2024-05-28 19:24:24] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:24:24] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:24:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality737853741703912637.gal : 1 ms
[2024-05-28 19:24:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality15652996479102391351.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality737853741703912637.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15652996479102391351.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.42432e+06,0.100436,8472,2,632,5,16443,6,0,302,31178,0


Converting to forward existential form...Done !
original formula: (EX((p53==0)) * EF(EG(((p49==0)&&(p45==1)))))
=> equivalent forward existential formula: [FwdG(FwdU((Init * EX((p53==0))),TRUE),((p49==0)&&(p45==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t8, t13, t17, t18, t23, t27, t32, t33, t36, t37, t38, t39, t40, t42, t43, t44, Intersect...243
Hit Full ! (commute/partial/dont) 51/5/5
(forward)formula 0,1,0.263281,13752,1,0,146,37362,139,61,1791,62222,147
FORMULA ShieldIIPt-PT-001B-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 68 transition count 63
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 68 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 67 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 67 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 66 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 66 transition count 61
Applied a total of 14 rules in 6 ms. Remains 66 /73 variables (removed 7) and now considering 61/68 (removed 7) transitions.
// Phase 1: matrix 61 rows 66 cols
[2024-05-28 19:24:24] [INFO ] Computed 10 invariants in 2 ms
[2024-05-28 19:24:24] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-28 19:24:24] [INFO ] Invariant cache hit.
[2024-05-28 19:24:24] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-28 19:24:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 19:24:24] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 8 ms to minimize.
[2024-05-28 19:24:24] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-28 19:24:24] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
[2024-05-28 19:24:24] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-28 19:24:25] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:24:25] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:24:25] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:24:25] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 2 ms to minimize.
[2024-05-28 19:24:25] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-05-28 19:24:25] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:24:25] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:24:25] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-28 19:24:25] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 61/127 variables, 66/89 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 19:24:25] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 19:24:25] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/127 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 19:24:26] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/127 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 92 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1927 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 19:24:26] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 61/127 variables, 66/93 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 60/153 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 19:24:27] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-05-28 19:24:27] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 19:24:27] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 19:24:27] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-28 19:24:27] [INFO ] Deduced a trap composed of 21 places in 18 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/127 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 158 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2127 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 22/22 constraints]
After SMT, in 4062ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4063ms
Starting structural reductions in LTL mode, iteration 1 : 66/73 places, 61/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4149 ms. Remains : 66/73 places, 61/68 transitions.
[2024-05-28 19:24:28] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:24:28] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:24:28] [INFO ] Input system was already deterministic with 61 transitions.
[2024-05-28 19:24:28] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:24:28] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:24:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality14115514331257081645.gal : 1 ms
[2024-05-28 19:24:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality11536478110146685998.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14115514331257081645.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11536478110146685998.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.10407e+06,0.226674,13264,2,1231,5,30584,6,0,327,64330,0


Converting to forward existential form...Done !
original formula: (!(A((AX(((p19==0)||(p67==1))) + (p4==1)) U !(((p26==0)||(p42==1))))) * (!(A((((((p61==0)||(p70==1))&&(p47==1))||(p69==1))||((p71==0)||(p...239
=> equivalent forward existential formula: (([(((FwdU((Init * !(!((E(!(!(((p26==0)||(p42==1)))) U (!((!(EX(!(((p19==0)||(p67==1))))) + (p4==1))) * !(!(((p2...819
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t9, t11, t15, t16, t20, t22, t23, t27, t31, t33, t37, t38, t41, t42, t43, t44, t45, t...267
(forward)formula 0,0,2.64363,91200,1,0,780,503212,165,374,1814,712709,814
FORMULA ShieldIIPt-PT-001B-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 63 transition count 58
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 63 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 62 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 61 transition count 56
Applied a total of 24 rules in 10 ms. Remains 61 /73 variables (removed 12) and now considering 56/68 (removed 12) transitions.
// Phase 1: matrix 56 rows 61 cols
[2024-05-28 19:24:31] [INFO ] Computed 10 invariants in 8 ms
[2024-05-28 19:24:31] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-28 19:24:31] [INFO ] Invariant cache hit.
[2024-05-28 19:24:31] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Running 55 sub problems to find dead transitions.
[2024-05-28 19:24:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 19:24:31] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:24:31] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:24:31] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:24:31] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:24:31] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:24:31] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 19:24:32] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 56/117 variables, 61/78 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 19:24:32] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 79 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1126 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (OVERLAPS) 56/117 variables, 61/79 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 55/134 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 19:24:32] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:24:33] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 136 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1113 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 10/10 constraints]
After SMT, in 2245ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 2246ms
Starting structural reductions in LTL mode, iteration 1 : 61/73 places, 56/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2349 ms. Remains : 61/73 places, 56/68 transitions.
[2024-05-28 19:24:33] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:24:33] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:24:33] [INFO ] Input system was already deterministic with 56 transitions.
[2024-05-28 19:24:33] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:24:33] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:24:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality18385541908831515678.gal : 1 ms
[2024-05-28 19:24:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality13207774425535185985.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18385541908831515678.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13207774425535185985.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.42399e+06,0.088649,7688,2,557,5,14767,6,0,302,27380,0


Converting to forward existential form...Done !
original formula: EX((AG(EX(((p30==0)||(p56==1)))) * (AX((p6!=1)) + (AX(AG(((p16==0)&&(p11==1)))) * EX(AF((p20==0)))))))
=> equivalent forward existential formula: ([((EY(Init) * !(E(TRUE U !(EX(((p30==0)||(p56==1))))))) * !(EX(!((p6!=1)))))] != FALSE + [(EY(((EY(Init) * !(E(...276
Reverse transition relation is NOT exact ! Due to transitions t4, t8, t13, t17, t22, t26, t31, t34, t36, t37, t38, t39, t40, t42, t43, t44, Intersection w...238
(forward)formula 0,0,3.3424,120468,1,0,760,630729,145,370,1733,883956,836
FORMULA ShieldIIPt-PT-001B-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 72 transition count 56
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 61 transition count 56
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 22 place count 61 transition count 50
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 34 place count 55 transition count 50
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 38 place count 51 transition count 46
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 51 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 44 place count 51 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 45 place count 50 transition count 44
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 45 place count 50 transition count 42
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 49 place count 48 transition count 42
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 67 place count 39 transition count 33
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 68 place count 39 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 69 place count 38 transition count 32
Applied a total of 69 rules in 19 ms. Remains 38 /73 variables (removed 35) and now considering 32/68 (removed 36) transitions.
// Phase 1: matrix 32 rows 38 cols
[2024-05-28 19:24:37] [INFO ] Computed 10 invariants in 0 ms
[2024-05-28 19:24:37] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-28 19:24:37] [INFO ] Invariant cache hit.
[2024-05-28 19:24:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:24:37] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-05-28 19:24:37] [INFO ] Redundant transitions in 0 ms returned []
Running 31 sub problems to find dead transitions.
[2024-05-28 19:24:37] [INFO ] Invariant cache hit.
[2024-05-28 19:24:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 1/38 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-28 19:24:37] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-28 19:24:37] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 19:24:37] [INFO ] Deduced a trap composed of 10 places in 13 ms of which 1 ms to minimize.
[2024-05-28 19:24:37] [INFO ] Deduced a trap composed of 9 places in 13 ms of which 1 ms to minimize.
[2024-05-28 19:24:37] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:24:37] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 1 ms to minimize.
[2024-05-28 19:24:37] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-28 19:24:37] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:24:37] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-28 19:24:37] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:24:37] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 32/70 variables, 38/59 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (OVERLAPS) 0/70 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 70/70 variables, and 60 constraints, problems are : Problem set: 0 solved, 31 unsolved in 675 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 38/38 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 1/38 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (OVERLAPS) 32/70 variables, 38/59 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 31/91 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (OVERLAPS) 0/70 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 70/70 variables, and 91 constraints, problems are : Problem set: 0 solved, 31 unsolved in 335 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 38/38 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 11/11 constraints]
After SMT, in 1014ms problems are : Problem set: 0 solved, 31 unsolved
Search for dead transitions found 0 dead transitions in 1015ms
Starting structural reductions in SI_CTL mode, iteration 1 : 38/73 places, 32/68 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1100 ms. Remains : 38/73 places, 32/68 transitions.
[2024-05-28 19:24:38] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:24:38] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:24:38] [INFO ] Input system was already deterministic with 32 transitions.
[2024-05-28 19:24:38] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:24:38] [INFO ] Flatten gal took : 1 ms
[2024-05-28 19:24:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality4846206388301174162.gal : 1 ms
[2024-05-28 19:24:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality4146111220549597933.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4846206388301174162.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4146111220549597933.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,14402,0.045743,5692,2,381,5,7965,6,0,184,14289,0


Converting to forward existential form...Done !
original formula: EF(((AG(((p48==0)||(p8==0))) * A(E((EG((p37==1)) + (p51!=1)) U AF((p43==0))) U ((p57==0)||(p53==1)))) * ((AG(((p11==1)||(p8==1))) + (p52=...196
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * (!(E(TRUE U !(((p48==0)||(p8==0))))) * !((E(!(((p57==0)||(p53==1))) U (!(E((EG((p37==1)) ...787
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t5, t6, t8, t10, t11, t12, t18, t20, t22, t24, Intersection with reachable at each s...215
(forward)formula 0,1,0.759629,33612,1,0,773,173033,112,375,1096,232039,844
FORMULA ShieldIIPt-PT-001B-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 62 transition count 57
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 62 transition count 57
Applied a total of 22 rules in 2 ms. Remains 62 /73 variables (removed 11) and now considering 57/68 (removed 11) transitions.
// Phase 1: matrix 57 rows 62 cols
[2024-05-28 19:24:39] [INFO ] Computed 10 invariants in 1 ms
[2024-05-28 19:24:39] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-28 19:24:39] [INFO ] Invariant cache hit.
[2024-05-28 19:24:39] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Running 56 sub problems to find dead transitions.
[2024-05-28 19:24:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 19:24:39] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:24:39] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-28 19:24:39] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:24:39] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-05-28 19:24:39] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:24:39] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-28 19:24:39] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 57/119 variables, 62/79 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 0/119 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 79 constraints, problems are : Problem set: 0 solved, 56 unsolved in 940 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 19:24:40] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-28 19:24:40] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:24:40] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 19:24:40] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 57/119 variables, 62/83 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 56/139 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 19:24:40] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:24:40] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-28 19:24:40] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-28 19:24:40] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 4/143 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 10 (OVERLAPS) 0/119 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 143 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1424 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 15/15 constraints]
After SMT, in 2370ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 2371ms
Starting structural reductions in LTL mode, iteration 1 : 62/73 places, 57/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2452 ms. Remains : 62/73 places, 57/68 transitions.
[2024-05-28 19:24:41] [INFO ] Flatten gal took : 7 ms
[2024-05-28 19:24:41] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:24:41] [INFO ] Input system was already deterministic with 57 transitions.
[2024-05-28 19:24:41] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:24:41] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:24:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality9846001207947806126.gal : 1 ms
[2024-05-28 19:24:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality841545790713212489.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9846001207947806126.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality841545790713212489.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,1.3643e+06,0.105455,8220,2,695,5,15870,6,0,307,31203,0


Converting to forward existential form...Done !
original formula: EG(EF(EX(((p33==0)&&(p32==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U EX(((p33==0)&&(p32==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t8, t13, t17, t22, t26, t30, t34, t37, t38, t39, t40, t41, t43, t44, t45, t47, Intersect...243
(forward)formula 0,1,1.90803,72460,1,0,397,297275,141,286,1750,514995,390
FORMULA ShieldIIPt-PT-001B-CTLCardinality-2024-06 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 : 73/73 places, 68/68 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 66 transition count 61
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 66 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 65 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 65 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 64 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 64 transition count 59
Applied a total of 18 rules in 7 ms. Remains 64 /73 variables (removed 9) and now considering 59/68 (removed 9) transitions.
// Phase 1: matrix 59 rows 64 cols
[2024-05-28 19:24:43] [INFO ] Computed 10 invariants in 0 ms
[2024-05-28 19:24:43] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-28 19:24:43] [INFO ] Invariant cache hit.
[2024-05-28 19:24:43] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2024-05-28 19:24:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 19:24:43] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:24:43] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-28 19:24:43] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:24:43] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-28 19:24:43] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:24:43] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-28 19:24:43] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-05-28 19:24:44] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:24:44] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:24:44] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 59/123 variables, 64/84 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 0/123 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 84 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1066 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 59/123 variables, 64/84 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 58/142 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 19:24:44] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:24:45] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:24:45] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 19:24:45] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 19:24:45] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:24:45] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (OVERLAPS) 0/123 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 148 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1901 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 16/16 constraints]
After SMT, in 2972ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 2972ms
Starting structural reductions in LTL mode, iteration 1 : 64/73 places, 59/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3048 ms. Remains : 64/73 places, 59/68 transitions.
[2024-05-28 19:24:46] [INFO ] Flatten gal took : 7 ms
[2024-05-28 19:24:46] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:24:46] [INFO ] Input system was already deterministic with 59 transitions.
[2024-05-28 19:24:46] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:24:46] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:24:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality3676072227380229647.gal : 1 ms
[2024-05-28 19:24:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality11528896873190357936.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3676072227380229647.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11528896873190357936.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.08635e+06,0.17881,11400,2,970,5,26023,6,0,317,52537,0


Converting to forward existential form...Done !
original formula: (EG((p29==0)) + (AG(EX(EF((p27==0)))) * (A(((p65==1) + A(((p17==0)||(p0==1)) U ((p63==0)||(p8==1)))) U AF(((p5==0)||(p41==1)))) + !(E((((...204
=> equivalent forward existential formula: ([(FwdU((Init * !(EG((p29==0)))),TRUE) * !(EX(E(TRUE U (p27==0)))))] = FALSE * [(FwdU(FwdU(((Init * !(EG((p29==0...474
Reverse transition relation is NOT exact ! Due to transitions t4, t9, t10, t12, t15, t19, t24, t28, t30, t33, t35, t36, t38, t39, t40, t41, t42, t43, t45, ...263
(forward)formula 0,1,2.32067,89284,1,0,725,470772,171,339,1822,680060,785
FORMULA ShieldIIPt-PT-001B-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 62 transition count 57
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 61 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 60 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 60 transition count 55
Applied a total of 26 rules in 16 ms. Remains 60 /73 variables (removed 13) and now considering 55/68 (removed 13) transitions.
// Phase 1: matrix 55 rows 60 cols
[2024-05-28 19:24:48] [INFO ] Computed 10 invariants in 1 ms
[2024-05-28 19:24:48] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-28 19:24:48] [INFO ] Invariant cache hit.
[2024-05-28 19:24:48] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Running 54 sub problems to find dead transitions.
[2024-05-28 19:24:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 19:24:49] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:24:49] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:24:49] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-05-28 19:24:49] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:24:49] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 19:24:49] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 19:24:49] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 55/115 variables, 60/77 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 0/115 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 115/115 variables, and 77 constraints, problems are : Problem set: 0 solved, 54 unsolved in 995 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 55/115 variables, 60/77 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 54/131 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 19:24:50] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-28 19:24:50] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:24:50] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 19:24:50] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 5 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/115 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 19:24:51] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/115 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/115 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 19:24:51] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/115 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/115 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 14 (OVERLAPS) 0/115 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 115/115 variables, and 137 constraints, problems are : Problem set: 0 solved, 54 unsolved in 2280 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 13/13 constraints]
After SMT, in 3281ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 3283ms
Starting structural reductions in LTL mode, iteration 1 : 60/73 places, 55/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3384 ms. Remains : 60/73 places, 55/68 transitions.
[2024-05-28 19:24:52] [INFO ] Flatten gal took : 7 ms
[2024-05-28 19:24:52] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:24:52] [INFO ] Input system was already deterministic with 55 transitions.
[2024-05-28 19:24:52] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:24:52] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:24:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality9131212205184778539.gal : 1 ms
[2024-05-28 19:24:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality2247790800224080358.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9131212205184778539.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2247790800224080358.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.2467e+06,0.08573,7412,2,540,5,13903,6,0,297,25628,0


Converting to forward existential form...Done !
original formula: (EG(EF(AX(FALSE))) * AF((p55==1)))
=> equivalent forward existential formula: ([(Init * !(EG(E(TRUE U !(EX(!(FALSE)))))))] = FALSE * [FwdG(Init,!((p55==1)))] = FALSE)
Hit Full ! (commute/partial/dont) 53/0/2
(forward)formula 0,0,0.150893,8468,1,0,30,19996,20,3,1385,25628,28
FORMULA ShieldIIPt-PT-001B-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 72 transition count 52
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 32 place count 57 transition count 50
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 35 place count 56 transition count 48
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 37 place count 54 transition count 48
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 37 place count 54 transition count 42
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 49 place count 48 transition count 42
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 57 place count 40 transition count 34
Iterating global reduction 4 with 8 rules applied. Total rules applied 65 place count 40 transition count 34
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 65 place count 40 transition count 32
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 69 place count 38 transition count 32
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 95 place count 25 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 96 place count 24 transition count 18
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 98 place count 22 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 98 place count 22 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 100 place count 21 transition count 17
Applied a total of 100 rules in 18 ms. Remains 21 /73 variables (removed 52) and now considering 17/68 (removed 51) transitions.
// Phase 1: matrix 17 rows 21 cols
[2024-05-28 19:24:52] [INFO ] Computed 8 invariants in 1 ms
[2024-05-28 19:24:52] [INFO ] Implicit Places using invariants in 29 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 20/73 places, 17/68 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 19 transition count 16
Applied a total of 2 rules in 1 ms. Remains 19 /20 variables (removed 1) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 19 cols
[2024-05-28 19:24:52] [INFO ] Computed 7 invariants in 0 ms
[2024-05-28 19:24:52] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-28 19:24:52] [INFO ] Invariant cache hit.
[2024-05-28 19:24:52] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 19/73 places, 16/68 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 103 ms. Remains : 19/73 places, 16/68 transitions.
[2024-05-28 19:24:52] [INFO ] Flatten gal took : 1 ms
[2024-05-28 19:24:52] [INFO ] Flatten gal took : 0 ms
[2024-05-28 19:24:52] [INFO ] Input system was already deterministic with 16 transitions.
[2024-05-28 19:24:52] [INFO ] Flatten gal took : 1 ms
[2024-05-28 19:24:52] [INFO ] Flatten gal took : 1 ms
[2024-05-28 19:24:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality13045215471045720233.gal : 0 ms
[2024-05-28 19:24:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality3261611588043935998.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13045215471045720233.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3261611588043935998.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,768,0.005918,3404,2,38,5,1005,6,0,95,1285,0


Converting to forward existential form...Done !
original formula: AG(EF(((p68==0)&&(p47==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((p68==0)&&(p47==1)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.009087,3720,1,0,8,1005,14,3,423,1285,5
FORMULA ShieldIIPt-PT-001B-CTLCardinality-2024-09 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 : 73/73 places, 68/68 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 64 transition count 59
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 63 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 62 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 62 transition count 57
Applied a total of 22 rules in 2 ms. Remains 62 /73 variables (removed 11) and now considering 57/68 (removed 11) transitions.
// Phase 1: matrix 57 rows 62 cols
[2024-05-28 19:24:52] [INFO ] Computed 10 invariants in 0 ms
[2024-05-28 19:24:52] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-28 19:24:52] [INFO ] Invariant cache hit.
[2024-05-28 19:24:52] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Running 56 sub problems to find dead transitions.
[2024-05-28 19:24:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 19:24:52] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-28 19:24:52] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:24:52] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 0 ms to minimize.
[2024-05-28 19:24:52] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-28 19:24:52] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-28 19:24:53] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:24:53] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 0 ms to minimize.
[2024-05-28 19:24:53] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:24:53] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 57/119 variables, 62/81 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 19:24:53] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/119 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/119 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 82 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1228 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 57/119 variables, 62/82 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 56/138 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 19:24:54] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:24:54] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:24:54] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 19:24:54] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 19:24:55] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/119 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 11 (OVERLAPS) 0/119 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 143 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1963 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 15/15 constraints]
After SMT, in 3197ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 3198ms
Starting structural reductions in LTL mode, iteration 1 : 62/73 places, 57/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3283 ms. Remains : 62/73 places, 57/68 transitions.
[2024-05-28 19:24:55] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:24:55] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:24:55] [INFO ] Input system was already deterministic with 57 transitions.
[2024-05-28 19:24:55] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:24:55] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:24:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality15611187448449659030.gal : 2 ms
[2024-05-28 19:24:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality1130187870452778596.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15611187448449659030.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1130187870452778596.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.63409e+06,0.111428,8744,2,627,5,18277,6,0,307,34643,0


Converting to forward existential form...Done !
original formula: AX((EF(EX(((p41==0)||(p24==1)))) * AF(EG(((p51==0)||(p4==1))))))
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U EX(((p41==0)||(p24==1))))))] = FALSE * [FwdG(EY(Init),!(EG(((p51==0)||(p4==1)))))] = FA...159
Reverse transition relation is NOT exact ! Due to transitions t4, t8, t13, t18, t20, t23, t29, t33, t34, t37, t38, t39, t40, t41, t43, t44, t45, Intersect...243
(forward)formula 0,1,3.37751,124400,1,0,853,668687,146,413,1746,1.023e+06,913
FORMULA ShieldIIPt-PT-001B-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 65 transition count 60
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 65 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 64 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 64 transition count 59
Applied a total of 18 rules in 4 ms. Remains 64 /73 variables (removed 9) and now considering 59/68 (removed 9) transitions.
// Phase 1: matrix 59 rows 64 cols
[2024-05-28 19:24:59] [INFO ] Computed 10 invariants in 1 ms
[2024-05-28 19:24:59] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-28 19:24:59] [INFO ] Invariant cache hit.
[2024-05-28 19:24:59] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2024-05-28 19:24:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 19:24:59] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:24:59] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:24:59] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 1 ms to minimize.
[2024-05-28 19:24:59] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:24:59] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:24:59] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
[2024-05-28 19:24:59] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
[2024-05-28 19:24:59] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 0 ms to minimize.
[2024-05-28 19:24:59] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-28 19:24:59] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2024-05-28 19:24:59] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:24:59] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:24:59] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 59/123 variables, 64/87 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 0/123 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 87 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1133 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 19:25:00] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:25:00] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 1 ms to minimize.
[2024-05-28 19:25:00] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 59/123 variables, 64/90 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 58/148 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 0/123 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 148 constraints, problems are : Problem set: 0 solved, 58 unsolved in 984 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 16/16 constraints]
After SMT, in 2124ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 2124ms
Starting structural reductions in LTL mode, iteration 1 : 64/73 places, 59/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2204 ms. Remains : 64/73 places, 59/68 transitions.
[2024-05-28 19:25:01] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:25:01] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:25:01] [INFO ] Input system was already deterministic with 59 transitions.
[2024-05-28 19:25:01] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:25:01] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:25:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality5038622567437119480.gal : 1 ms
[2024-05-28 19:25:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality9386988388938426059.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5038622567437119480.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9386988388938426059.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.66208e+06,0.153566,10880,2,837,5,24093,6,0,317,50609,0


Converting to forward existential form...Done !
original formula: E((AG(!(((p57==0)||(p9==1)))) + !(AF(((p45==0)||(p46==1))))) U A((AF((((!((p11==0)||(p60==1)))&&(p36==0))&&((p50==0)||(p16==1)))) * AF(((...286
=> equivalent forward existential formula: [((FwdU(Init,(!(E(TRUE U !(!(((p57==0)||(p9==1)))))) + !(!(EG(!(((p45==0)||(p46==1)))))))) * !(EG(!(!(EX(!(((((p...624
Reverse transition relation is NOT exact ! Due to transitions t4, t8, t14, t20, t21, t24, t28, t31, t32, t35, t36, t38, t39, t40, t41, t42, t43, t45, t46, ...258
Using saturation style SCC detection
(forward)formula 0,0,8.8849,281748,1,0,1650,1.49564e+06,174,847,1902,2.29606e+06,1914
FORMULA ShieldIIPt-PT-001B-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 63 transition count 58
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 63 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 62 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 61 transition count 56
Applied a total of 24 rules in 8 ms. Remains 61 /73 variables (removed 12) and now considering 56/68 (removed 12) transitions.
// Phase 1: matrix 56 rows 61 cols
[2024-05-28 19:25:10] [INFO ] Computed 10 invariants in 1 ms
[2024-05-28 19:25:10] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-28 19:25:10] [INFO ] Invariant cache hit.
[2024-05-28 19:25:10] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 55 sub problems to find dead transitions.
[2024-05-28 19:25:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 19:25:10] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:25:10] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-28 19:25:10] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2024-05-28 19:25:10] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:25:10] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-28 19:25:10] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (OVERLAPS) 56/117 variables, 61/77 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 19:25:11] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:25:11] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 0/117 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 79 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1065 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (OVERLAPS) 56/117 variables, 61/79 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 55/134 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 19:25:11] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:25:11] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-28 19:25:12] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 19:25:12] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (OVERLAPS) 0/117 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 138 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1256 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 12/12 constraints]
After SMT, in 2332ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 2333ms
Starting structural reductions in LTL mode, iteration 1 : 61/73 places, 56/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2421 ms. Remains : 61/73 places, 56/68 transitions.
[2024-05-28 19:25:12] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:25:12] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:25:12] [INFO ] Input system was already deterministic with 56 transitions.
[2024-05-28 19:25:12] [INFO ] Flatten gal took : 1 ms
[2024-05-28 19:25:12] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:25:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality10588923627363684240.gal : 1 ms
[2024-05-28 19:25:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality17453717205798969558.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10588923627363684240.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17453717205798969558.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.42189e+06,0.119104,9004,2,735,5,18741,6,0,302,36772,0


Converting to forward existential form...Done !
original formula: EG(EX(AX(((p22==1)&&(p70==1)))))
=> equivalent forward existential formula: [FwdG(Init,EX(!(EX(!(((p22==1)&&(p70==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t9, t11, t14, t18, t23, t27, t32, t33, t36, t37, t38, t39, t40, t42, t43, t44, Intersect...243
(forward)formula 0,0,0.217253,10588,1,0,150,29743,135,63,1666,42321,145
FORMULA ShieldIIPt-PT-001B-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 73 transition count 55
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 17 rules applied. Total rules applied 30 place count 60 transition count 51
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 33 place count 57 transition count 51
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 33 place count 57 transition count 47
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 41 place count 53 transition count 47
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 44 place count 50 transition count 44
Iterating global reduction 3 with 3 rules applied. Total rules applied 47 place count 50 transition count 44
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 47 place count 50 transition count 43
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 49 place count 49 transition count 43
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 73 place count 37 transition count 31
Applied a total of 73 rules in 12 ms. Remains 37 /73 variables (removed 36) and now considering 31/68 (removed 37) transitions.
// Phase 1: matrix 31 rows 37 cols
[2024-05-28 19:25:13] [INFO ] Computed 10 invariants in 1 ms
[2024-05-28 19:25:13] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-28 19:25:13] [INFO ] Invariant cache hit.
[2024-05-28 19:25:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:25:13] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-05-28 19:25:13] [INFO ] Redundant transitions in 1 ms returned []
Running 30 sub problems to find dead transitions.
[2024-05-28 19:25:13] [INFO ] Invariant cache hit.
[2024-05-28 19:25:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 1/37 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-28 19:25:13] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-28 19:25:13] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:25:13] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:25:13] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 31/68 variables, 37/51 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/68 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 68/68 variables, and 52 constraints, problems are : Problem set: 0 solved, 30 unsolved in 396 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 37/37 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 1/37 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 31/68 variables, 37/51 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 30/82 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-28 19:25:13] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/68 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 0/68 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 68/68 variables, and 83 constraints, problems are : Problem set: 0 solved, 30 unsolved in 397 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 37/37 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 5/5 constraints]
After SMT, in 797ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 797ms
Starting structural reductions in SI_CTL mode, iteration 1 : 37/73 places, 31/68 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 876 ms. Remains : 37/73 places, 31/68 transitions.
[2024-05-28 19:25:14] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:25:14] [INFO ] Flatten gal took : 1 ms
[2024-05-28 19:25:14] [INFO ] Input system was already deterministic with 31 transitions.
[2024-05-28 19:25:14] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:25:14] [INFO ] Flatten gal took : 1 ms
[2024-05-28 19:25:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality5180919958524660931.gal : 0 ms
[2024-05-28 19:25:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality2334900840237939096.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5180919958524660931.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2334900840237939096.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,34679,0.050783,5952,2,328,5,8738,6,0,179,17117,0


Converting to forward existential form...Done !
original formula: EG(((AF(((p8==0)||(p2==1))) + AG((((p35==0)||(p1==0)) + !(A(((p14==0)||(p36==1)) U ((p19==0)||(p51==1))))))) + ((AF(EG((p67==1))) * ((p59...227
=> equivalent forward existential formula: [FwdG(Init,((!(EG(!(((p8==0)||(p2==1))))) + !(E(TRUE U !((((p35==0)||(p1==0)) + !(!((E(!(((p19==0)||(p51==1))) U...408
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t6, t7, t8, t10, t17, t21, t23, t26, Intersection with reachable at each step en...209
(forward)formula 0,1,1.56425,63232,1,0,999,284251,121,484,1122,468873,1173
FORMULA ShieldIIPt-PT-001B-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 72 transition count 53
Reduce places removed 14 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 16 rules applied. Total rules applied 30 place count 58 transition count 51
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 56 transition count 51
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 32 place count 56 transition count 47
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 40 place count 52 transition count 47
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 46 place count 46 transition count 41
Iterating global reduction 3 with 6 rules applied. Total rules applied 52 place count 46 transition count 41
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 52 place count 46 transition count 38
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 58 place count 43 transition count 38
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 74 place count 35 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 34 transition count 29
Applied a total of 75 rules in 13 ms. Remains 34 /73 variables (removed 39) and now considering 29/68 (removed 39) transitions.
// Phase 1: matrix 29 rows 34 cols
[2024-05-28 19:25:15] [INFO ] Computed 10 invariants in 0 ms
[2024-05-28 19:25:15] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-28 19:25:15] [INFO ] Invariant cache hit.
[2024-05-28 19:25:15] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2024-05-28 19:25:15] [INFO ] Redundant transitions in 0 ms returned []
Running 28 sub problems to find dead transitions.
[2024-05-28 19:25:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/34 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-05-28 19:25:15] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-28 19:25:15] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-05-28 19:25:15] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-05-28 19:25:15] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 29/63 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 48 constraints, problems are : Problem set: 0 solved, 28 unsolved in 364 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 1/34 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 29/63 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 28/76 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/63 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-05-28 19:25:16] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/63 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/63 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (OVERLAPS) 0/63 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/63 variables, and 77 constraints, problems are : Problem set: 0 solved, 28 unsolved in 400 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 5/5 constraints]
After SMT, in 767ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 767ms
Starting structural reductions in SI_CTL mode, iteration 1 : 34/73 places, 29/68 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 853 ms. Remains : 34/73 places, 29/68 transitions.
[2024-05-28 19:25:16] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:25:16] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:25:16] [INFO ] Input system was already deterministic with 29 transitions.
[2024-05-28 19:25:16] [INFO ] Flatten gal took : 1 ms
[2024-05-28 19:25:16] [INFO ] Flatten gal took : 1 ms
[2024-05-28 19:25:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality1252892616474580571.gal : 0 ms
[2024-05-28 19:25:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality10470566418327502840.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1252892616474580571.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10470566418327502840.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,27652,0.028409,4884,2,191,5,5601,6,0,167,9392,0


Converting to forward existential form...Done !
original formula: EG(EF((!(A(((p28==0)||(p8==1)) U ((p25==0)||(p12==1)))) + !(E(((p33==0)||(p16==1)) U (p43==0))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (!(!((E(!(((p25==0)||(p12==1))) U (!(((p28==0)||(p8==1))) * !(((p25==0)||(p12==1))))) + EG(!...234
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t12, t13, t15, t17, t19, t21, t23, Intersection with reachable at each step enabled....202
(forward)formula 0,1,0.389808,22348,1,0,483,95943,97,213,1055,158705,570
FORMULA ShieldIIPt-PT-001B-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-28 19:25:16] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:25:16] [INFO ] Flatten gal took : 2 ms
Total runtime 67461 ms.

BK_STOP 1716924316926

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="ShieldIIPt-PT-001B"
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-5568"
echo " Executing tool itstools"
echo " Input is ShieldIIPt-PT-001B, 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 r356-tall-171683760500185"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-001B.tgz
mv ShieldIIPt-PT-001B 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;