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.r026-smll-171620167300225.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 AutonomousCar-PT-01b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167300225
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.1K 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.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 12 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 12 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 12 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 31K May 18 16:42 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 AutonomousCar-PT-01b-CTLCardinality-2024-00
FORMULA_NAME AutonomousCar-PT-01b-CTLCardinality-2024-01
FORMULA_NAME AutonomousCar-PT-01b-CTLCardinality-2024-02
FORMULA_NAME AutonomousCar-PT-01b-CTLCardinality-2024-03
FORMULA_NAME AutonomousCar-PT-01b-CTLCardinality-2024-04
FORMULA_NAME AutonomousCar-PT-01b-CTLCardinality-2024-05
FORMULA_NAME AutonomousCar-PT-01b-CTLCardinality-2024-06
FORMULA_NAME AutonomousCar-PT-01b-CTLCardinality-2024-07
FORMULA_NAME AutonomousCar-PT-01b-CTLCardinality-2024-08
FORMULA_NAME AutonomousCar-PT-01b-CTLCardinality-2024-09
FORMULA_NAME AutonomousCar-PT-01b-CTLCardinality-2024-10
FORMULA_NAME AutonomousCar-PT-01b-CTLCardinality-2024-11
FORMULA_NAME AutonomousCar-PT-01b-CTLCardinality-2023-12
FORMULA_NAME AutonomousCar-PT-01b-CTLCardinality-2023-13
FORMULA_NAME AutonomousCar-PT-01b-CTLCardinality-2023-14
FORMULA_NAME AutonomousCar-PT-01b-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716319535013

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-01b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-21 19:25:37] [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-21 19:25:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:25:38] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2024-05-21 19:25:38] [INFO ] Transformed 119 places.
[2024-05-21 19:25:38] [INFO ] Transformed 132 transitions.
[2024-05-21 19:25:38] [INFO ] Found NUPN structural information;
[2024-05-21 19:25:38] [INFO ] Parsed PT model containing 119 places and 132 transitions and 339 arcs in 471 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 41 ms.
FORMULA AutonomousCar-PT-01b-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 81 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 132/132 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 118 transition count 131
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 118 transition count 131
Applied a total of 2 rules in 51 ms. Remains 118 /119 variables (removed 1) and now considering 131/132 (removed 1) transitions.
// Phase 1: matrix 131 rows 118 cols
[2024-05-21 19:25:38] [INFO ] Computed 6 invariants in 29 ms
[2024-05-21 19:25:38] [INFO ] Implicit Places using invariants in 372 ms returned []
[2024-05-21 19:25:38] [INFO ] Invariant cache hit.
[2024-05-21 19:25:38] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 648 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-05-21 19:25:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-21 19:25:40] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 30 ms to minimize.
[2024-05-21 19:25:40] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 4 ms to minimize.
[2024-05-21 19:25:40] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 2 ms to minimize.
[2024-05-21 19:25:41] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 2 ms to minimize.
[2024-05-21 19:25:41] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 3 ms to minimize.
[2024-05-21 19:25:41] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 2 ms to minimize.
[2024-05-21 19:25:41] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 3 ms to minimize.
[2024-05-21 19:25:41] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 2 ms to minimize.
[2024-05-21 19:25:41] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-05-21 19:25:41] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 5 ms to minimize.
[2024-05-21 19:25:41] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-21 19:25:42] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-21 19:25:42] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-21 19:25:42] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-21 19:25:42] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-21 19:25:43] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 4 ms to minimize.
[2024-05-21 19:25:43] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-21 19:25:44] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 130 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD122 is UNSAT
At refinement iteration 7 (OVERLAPS) 131/249 variables, 118/142 constraints. Problems are: Problem set: 2 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 0/142 constraints. Problems are: Problem set: 2 solved, 128 unsolved
At refinement iteration 9 (OVERLAPS) 0/249 variables, 0/142 constraints. Problems are: Problem set: 2 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 142 constraints, problems are : Problem set: 2 solved, 128 unsolved in 8458 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 2 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 2/118 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 18/24 constraints. Problems are: Problem set: 2 solved, 128 unsolved
[2024-05-21 19:25:48] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 1/25 constraints. Problems are: Problem set: 2 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/25 constraints. Problems are: Problem set: 2 solved, 128 unsolved
At refinement iteration 5 (OVERLAPS) 131/249 variables, 118/143 constraints. Problems are: Problem set: 2 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 128/271 constraints. Problems are: Problem set: 2 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/271 constraints. Problems are: Problem set: 2 solved, 128 unsolved
[2024-05-21 19:25:52] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/249 variables, 1/272 constraints. Problems are: Problem set: 2 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 0/272 constraints. Problems are: Problem set: 2 solved, 128 unsolved
At refinement iteration 10 (OVERLAPS) 0/249 variables, 0/272 constraints. Problems are: Problem set: 2 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 272 constraints, problems are : Problem set: 2 solved, 128 unsolved in 10610 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 128/130 constraints, Known Traps: 20/20 constraints]
After SMT, in 19195ms problems are : Problem set: 2 solved, 128 unsolved
Search for dead transitions found 2 dead transitions in 19225ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 118/119 places, 129/132 transitions.
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 0 rules in 5 ms. Remains 118 /118 variables (removed 0) and now considering 129/129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 20008 ms. Remains : 118/119 places, 129/132 transitions.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Support contains 80 out of 117 places after structural reductions.
[2024-05-21 19:25:58] [INFO ] Flatten gal took : 58 ms
[2024-05-21 19:25:58] [INFO ] Flatten gal took : 23 ms
[2024-05-21 19:25:58] [INFO ] Input system was already deterministic with 129 transitions.
Support contains 76 out of 117 places (down from 80) after GAL structural reductions.
RANDOM walk for 40000 steps (12 resets) in 2262 ms. (17 steps per ms) remains 1/64 properties
BEST_FIRST walk for 24629 steps (12 resets) in 139 ms. (175 steps per ms) remains 0/1 properties
[2024-05-21 19:25:59] [INFO ] Flatten gal took : 11 ms
[2024-05-21 19:25:59] [INFO ] Flatten gal took : 11 ms
[2024-05-21 19:25:59] [INFO ] Input system was already deterministic with 129 transitions.
Computed a total of 30 stabilizing places and 30 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 129/129 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 105 transition count 117
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 105 transition count 117
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 105 transition count 113
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 103 transition count 111
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 103 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 102 transition count 110
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 102 transition count 110
Applied a total of 34 rules in 23 ms. Remains 102 /117 variables (removed 15) and now considering 110/129 (removed 19) transitions.
// Phase 1: matrix 110 rows 102 cols
[2024-05-21 19:25:59] [INFO ] Computed 6 invariants in 5 ms
[2024-05-21 19:25:59] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 19:25:59] [INFO ] Invariant cache hit.
[2024-05-21 19:25:59] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2024-05-21 19:25:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-21 19:26:00] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-21 19:26:00] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 2 ms to minimize.
[2024-05-21 19:26:00] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-21 19:26:00] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-21 19:26:00] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 2 ms to minimize.
[2024-05-21 19:26:00] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-21 19:26:01] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-21 19:26:01] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-21 19:26:01] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-21 19:26:01] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 1 ms to minimize.
[2024-05-21 19:26:01] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-21 19:26:01] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-21 19:26:01] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 2 ms to minimize.
[2024-05-21 19:26:01] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 2 ms to minimize.
[2024-05-21 19:26:01] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-21 19:26:01] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-21 19:26:02] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
[2024-05-21 19:26:02] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/212 variables, 102/126 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/212 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 126 constraints, problems are : Problem set: 0 solved, 109 unsolved in 5122 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-21 19:26:05] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 2 ms to minimize.
[2024-05-21 19:26:06] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 110/212 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 109/237 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-21 19:26:08] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/212 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/212 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 238 constraints, problems are : Problem set: 0 solved, 109 unsolved in 7739 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 21/21 constraints]
After SMT, in 12884ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 12891ms
Starting structural reductions in LTL mode, iteration 1 : 102/117 places, 110/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13071 ms. Remains : 102/117 places, 110/129 transitions.
[2024-05-21 19:26:12] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:26:12] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:26:12] [INFO ] Input system was already deterministic with 110 transitions.
[2024-05-21 19:26:12] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:26:12] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:26:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality13930979826870503631.gal : 4 ms
[2024-05-21 19:26:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality894915293079794975.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13930979826870503631.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality894915293079794975.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,76370,0.057864,4712,2,1228,5,5122,6,0,520,3823,0


Converting to forward existential form...Done !
original formula: A(EG(((p52==0)||(p95==1))) U (AG(!((EX(((p64==0)||(p67==1))) * !(((p48==0)||(p24==1)))))) + ((!(((EX(((p69==0)||(p58==1))) * AX(((p57==0)...356
=> equivalent forward existential formula: [((Init * !(EG(!((!(E(TRUE U !(!((EX(((p64==0)||(p67==1))) * !(((p48==0)||(p24==1)))))))) + ((!(((EX(((p69==0)||...1274
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t34, t39, t41, t57, t63, t64, t67, t68, t70, t84, t91, t93, t98, Interse...246
Using saturation style SCC detection
(forward)formula 0,1,5.56471,158684,1,0,1422,1.05166e+06,270,700,3215,954163,1663
FORMULA AutonomousCar-PT-01b-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 129/129 transitions.
Graph (trivial) has 108 edges and 117 vertex of which 4 / 117 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 114 transition count 71
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 67 rules applied. Total rules applied 123 place count 59 transition count 59
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 130 place count 53 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 131 place count 52 transition count 58
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 131 place count 52 transition count 53
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 141 place count 47 transition count 53
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 152 place count 36 transition count 42
Iterating global reduction 4 with 11 rules applied. Total rules applied 163 place count 36 transition count 42
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 167 place count 36 transition count 38
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 167 place count 36 transition count 36
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 171 place count 34 transition count 36
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 173 place count 32 transition count 34
Iterating global reduction 5 with 2 rules applied. Total rules applied 175 place count 32 transition count 34
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 5 with 2 rules applied. Total rules applied 177 place count 32 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 178 place count 31 transition count 32
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 192 place count 24 transition count 25
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 193 place count 23 transition count 23
Iterating global reduction 7 with 1 rules applied. Total rules applied 194 place count 23 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 195 place count 23 transition count 22
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 197 place count 21 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 198 place count 20 transition count 20
Applied a total of 198 rules in 43 ms. Remains 20 /117 variables (removed 97) and now considering 20/129 (removed 109) transitions.
// Phase 1: matrix 20 rows 20 cols
[2024-05-21 19:26:18] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 19:26:18] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-21 19:26:18] [INFO ] Invariant cache hit.
[2024-05-21 19:26:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:26:18] [INFO ] Implicit Places using invariants and state equation in 57 ms returned [12, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 93 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 18/117 places, 20/129 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 18 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 17 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 17 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 16 transition count 18
Applied a total of 4 rules in 5 ms. Remains 16 /18 variables (removed 2) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 16 cols
[2024-05-21 19:26:18] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:26:18] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-21 19:26:18] [INFO ] Invariant cache hit.
[2024-05-21 19:26:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:26:18] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 16/117 places, 18/129 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 229 ms. Remains : 16/117 places, 18/129 transitions.
[2024-05-21 19:26:18] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:26:18] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:26:18] [INFO ] Input system was already deterministic with 18 transitions.
RANDOM walk for 606 steps (92 resets) in 10 ms. (55 steps per ms) remains 0/1 properties
FORMULA AutonomousCar-PT-01b-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-21 19:26:18] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:26:18] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:26:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11226862072506837785.gal : 1 ms
[2024-05-21 19:26:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality898486427301194409.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11226862072506837785.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality898486427301194409.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality898486427301194409.prop.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 129/129 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 100 transition count 112
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 100 transition count 112
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 100 transition count 108
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 96 transition count 104
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 96 transition count 104
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 95 transition count 103
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 95 transition count 103
Applied a total of 48 rules in 34 ms. Remains 95 /117 variables (removed 22) and now considering 103/129 (removed 26) transitions.
// Phase 1: matrix 103 rows 95 cols
[2024-05-21 19:26:18] [INFO ] Computed 6 invariants in 5 ms
[2024-05-21 19:26:18] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 19:26:18] [INFO ] Invariant cache hit.
[2024-05-21 19:26:19] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-05-21 19:26:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-21 19:26:20] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 2 ms to minimize.
[2024-05-21 19:26:20] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 2 ms to minimize.
[2024-05-21 19:26:20] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 2 ms to minimize.
[2024-05-21 19:26:20] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
[2024-05-21 19:26:20] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-21 19:26:20] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 2 ms to minimize.
[2024-05-21 19:26:20] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2024-05-21 19:26:20] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 2 ms to minimize.
[2024-05-21 19:26:20] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 2 ms to minimize.
[2024-05-21 19:26:20] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 3 ms to minimize.
[2024-05-21 19:26:20] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 2 ms to minimize.
[2024-05-21 19:26:21] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-21 19:26:21] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-21 19:26:21] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 2 ms to minimize.
[2024-05-21 19:26:21] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 2 ms to minimize.
[2024-05-21 19:26:21] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 13 ms to minimize.
[2024-05-21 19:26:21] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 2 ms to minimize.
[2024-05-21 19:26:21] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 2 ms to minimize.
[2024-05-21 19:26:22] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-21 19:26:22] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 103/198 variables, 95/121 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 121 constraints, problems are : Problem set: 0 solved, 102 unsolved in 6345 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 103/198 variables, 95/121 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 102/223 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-21 19:26:27] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 224 constraints, problems are : Problem set: 0 solved, 102 unsolved in 4905 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 21/21 constraints]
After SMT, in 11277ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 11280ms
Starting structural reductions in LTL mode, iteration 1 : 95/117 places, 103/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11533 ms. Remains : 95/117 places, 103/129 transitions.
[2024-05-21 19:26:30] [INFO ] Flatten gal took : 10 ms
[2024-05-21 19:26:30] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:26:30] [INFO ] Input system was already deterministic with 103 transitions.
[2024-05-21 19:26:30] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:26:30] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:26:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality3877509841055477105.gal : 3 ms
[2024-05-21 19:26:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality14587769413995455456.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/CTLCardinality3877509841055477105.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14587769413995455456.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,68642,0.0618,4740,2,1084,5,4589,6,0,485,3857,0


Converting to forward existential form...Done !
original formula: A(EX(((p27==0)||(p18==1))) U !(AX(!(AG(((p105==0)||(p107==1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(!(EX(!(!(!(E(TRUE U !(((p105==0)||(p107==1)))))))))))))) * !(E(!(!(!(EX(!(!(!(E(TRUE U !(((p1...287
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t57, t58, t61, t62, t64, t78, t85, t87, t92, t100, I...252
Using saturation style SCC detection
(forward)formula 0,1,3.67252,116324,1,0,817,793335,237,471,2993,608883,862
FORMULA AutonomousCar-PT-01b-CTLCardinality-2024-02 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 : 117/117 places, 129/129 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 101 transition count 113
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 101 transition count 113
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 36 place count 101 transition count 109
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 99 transition count 107
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 99 transition count 107
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 98 transition count 106
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 98 transition count 106
Applied a total of 42 rules in 8 ms. Remains 98 /117 variables (removed 19) and now considering 106/129 (removed 23) transitions.
// Phase 1: matrix 106 rows 98 cols
[2024-05-21 19:26:34] [INFO ] Computed 6 invariants in 0 ms
[2024-05-21 19:26:34] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 19:26:34] [INFO ] Invariant cache hit.
[2024-05-21 19:26:34] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-05-21 19:26:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-21 19:26:35] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-05-21 19:26:35] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 3 ms to minimize.
[2024-05-21 19:26:35] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2024-05-21 19:26:35] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-21 19:26:35] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-21 19:26:35] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 2 ms to minimize.
[2024-05-21 19:26:35] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 2 ms to minimize.
[2024-05-21 19:26:35] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 2 ms to minimize.
[2024-05-21 19:26:35] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 3 ms to minimize.
[2024-05-21 19:26:35] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-05-21 19:26:35] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 2 ms to minimize.
[2024-05-21 19:26:35] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 2 ms to minimize.
[2024-05-21 19:26:36] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 2 ms to minimize.
[2024-05-21 19:26:36] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 2 ms to minimize.
[2024-05-21 19:26:36] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 2 ms to minimize.
[2024-05-21 19:26:36] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 2 ms to minimize.
[2024-05-21 19:26:36] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-21 19:26:36] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/204 variables, 98/122 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-21 19:26:38] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 2 ms to minimize.
[2024-05-21 19:26:38] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/204 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 124 constraints, problems are : Problem set: 0 solved, 105 unsolved in 6730 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 106/204 variables, 98/124 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 105/229 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-21 19:26:42] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 2 ms to minimize.
[2024-05-21 19:26:42] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/204 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 231 constraints, problems are : Problem set: 0 solved, 105 unsolved in 5691 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 22/22 constraints]
After SMT, in 12438ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 12440ms
Starting structural reductions in LTL mode, iteration 1 : 98/117 places, 106/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12583 ms. Remains : 98/117 places, 106/129 transitions.
[2024-05-21 19:26:46] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:26:46] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:26:46] [INFO ] Input system was already deterministic with 106 transitions.
[2024-05-21 19:26:46] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:26:46] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:26:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality551423611149750320.gal : 2 ms
[2024-05-21 19:26:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality16337682793207510923.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/CTLCardinality551423611149750320.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16337682793207510923.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,73884,0.04258,4768,2,1179,5,4818,6,0,500,4158,0


Converting to forward existential form...Done !
original formula: E((E((p87==1) U (((EX((p19==0)) + AF((p105==0))) + ((E((p62==1) U (p46==1)) * EF(((p64==0)||(p14==1)))) + (p58==0))) + (p114==1))) * (((p...209
=> equivalent forward existential formula: [FwdG(FwdU(Init,(E((p87==1) U (((EX((p19==0)) + !(EG(!((p105==0))))) + ((E((p62==1) U (p46==1)) * E(TRUE U ((p64...277
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t25, t29, t33, t36, t37, t38, t59, t60, t63, t64, t66, t69, t80, t87, t89, t94...267
Hit Full ! (commute/partial/dont) 104/0/2
(forward)formula 0,1,2.6665,87448,1,0,905,482348,268,492,3099,510432,1075
FORMULA AutonomousCar-PT-01b-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 129/129 transitions.
Graph (trivial) has 107 edges and 117 vertex of which 2 / 117 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 115 transition count 70
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 69 rules applied. Total rules applied 127 place count 58 transition count 58
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 133 place count 52 transition count 58
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 133 place count 52 transition count 53
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 143 place count 47 transition count 53
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 154 place count 36 transition count 42
Iterating global reduction 3 with 11 rules applied. Total rules applied 165 place count 36 transition count 42
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 169 place count 36 transition count 38
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 169 place count 36 transition count 36
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 173 place count 34 transition count 36
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 175 place count 32 transition count 34
Iterating global reduction 4 with 2 rules applied. Total rules applied 177 place count 32 transition count 34
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 4 with 2 rules applied. Total rules applied 179 place count 32 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 180 place count 31 transition count 32
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 194 place count 24 transition count 25
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 195 place count 23 transition count 23
Iterating global reduction 6 with 1 rules applied. Total rules applied 196 place count 23 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 197 place count 23 transition count 22
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 199 place count 21 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 200 place count 20 transition count 20
Applied a total of 200 rules in 18 ms. Remains 20 /117 variables (removed 97) and now considering 20/129 (removed 109) transitions.
// Phase 1: matrix 20 rows 20 cols
[2024-05-21 19:26:49] [INFO ] Computed 5 invariants in 0 ms
[2024-05-21 19:26:49] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-21 19:26:49] [INFO ] Invariant cache hit.
[2024-05-21 19:26:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:26:49] [INFO ] Implicit Places using invariants and state equation in 40 ms returned [12, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 71 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 18/117 places, 20/129 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 18 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 17 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 17 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 16 transition count 18
Applied a total of 4 rules in 2 ms. Remains 16 /18 variables (removed 2) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 16 cols
[2024-05-21 19:26:49] [INFO ] Computed 3 invariants in 0 ms
[2024-05-21 19:26:49] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-21 19:26:49] [INFO ] Invariant cache hit.
[2024-05-21 19:26:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:26:49] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 16/117 places, 18/129 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 148 ms. Remains : 16/117 places, 18/129 transitions.
[2024-05-21 19:26:49] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:26:49] [INFO ] Flatten gal took : 1 ms
[2024-05-21 19:26:49] [INFO ] Input system was already deterministic with 18 transitions.
[2024-05-21 19:26:49] [INFO ] Flatten gal took : 1 ms
[2024-05-21 19:26:49] [INFO ] Flatten gal took : 1 ms
[2024-05-21 19:26:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality2150928085677420209.gal : 0 ms
[2024-05-21 19:26:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality11617844038413837589.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/CTLCardinality2150928085677420209.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11617844038413837589.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,112,0.004369,3412,2,39,5,184,6,0,81,141,0


Converting to forward existential form...Done !
original formula: EG(EF((p99==1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (p99==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t7, t16, Intersection with reachable at each step enabled. (destroyed/reverse/inters...176
(forward)formula 0,1,0.014314,3728,1,0,84,1854,62,56,498,2192,89
FORMULA AutonomousCar-PT-01b-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 129/129 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 103 transition count 115
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 103 transition count 115
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 101 transition count 113
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 101 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 100 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 100 transition count 112
Applied a total of 34 rules in 6 ms. Remains 100 /117 variables (removed 17) and now considering 112/129 (removed 17) transitions.
// Phase 1: matrix 112 rows 100 cols
[2024-05-21 19:26:49] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 19:26:49] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 19:26:49] [INFO ] Invariant cache hit.
[2024-05-21 19:26:49] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2024-05-21 19:26:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-21 19:26:50] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-05-21 19:26:50] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2024-05-21 19:26:50] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 2 ms to minimize.
[2024-05-21 19:26:50] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-05-21 19:26:51] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 2 ms to minimize.
[2024-05-21 19:26:51] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-05-21 19:26:51] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 2 ms to minimize.
[2024-05-21 19:26:51] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 2 ms to minimize.
[2024-05-21 19:26:51] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 2 ms to minimize.
[2024-05-21 19:26:51] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 2 ms to minimize.
[2024-05-21 19:26:51] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-21 19:26:51] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 2 ms to minimize.
[2024-05-21 19:26:51] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-21 19:26:51] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-21 19:26:52] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 2 ms to minimize.
[2024-05-21 19:26:52] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2024-05-21 19:26:52] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 2 ms to minimize.
[2024-05-21 19:26:52] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 2 ms to minimize.
[2024-05-21 19:26:52] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 2 ms to minimize.
[2024-05-21 19:26:52] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-21 19:26:52] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2024-05-21 19:26:52] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
[2024-05-21 19:26:52] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-21 19:26:53] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (OVERLAPS) 112/212 variables, 100/130 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 0/212 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 130 constraints, problems are : Problem set: 0 solved, 111 unsolved in 6690 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 24/30 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/212 variables, 100/130 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 111/241 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-21 19:26:58] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 0/212 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 242 constraints, problems are : Problem set: 0 solved, 111 unsolved in 6150 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 25/25 constraints]
After SMT, in 12859ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 12861ms
Starting structural reductions in LTL mode, iteration 1 : 100/117 places, 112/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13017 ms. Remains : 100/117 places, 112/129 transitions.
[2024-05-21 19:27:02] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:27:02] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:27:02] [INFO ] Input system was already deterministic with 112 transitions.
[2024-05-21 19:27:02] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:27:02] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:27:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality17272265204914537900.gal : 2 ms
[2024-05-21 19:27:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality5675012054852935502.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/CTLCardinality17272265204914537900.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5675012054852935502.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,77412,0.046801,4828,2,1223,5,5180,6,0,514,4213,0


Converting to forward existential form...Done !
original formula: AG(AX((((p46==1)||(p104==1)) + (EF((((p55==0)&&(p52==1))||(p117==0))) + (((p5==0)&&(p3==1))&&((p64==0)&&(p94==1)))))))
=> equivalent forward existential formula: [(((EY(FwdU(Init,TRUE)) * !(((p46==1)||(p104==1)))) * !((((p5==0)&&(p3==1))&&((p64==0)&&(p94==1))))) * !(E(TRUE ...202
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t25, t29, t33, t36, t38, t39, t53, t60, t61, t64, t65, t67, t79, t80, t87, t89...288
(forward)formula 0,1,0.507539,19204,1,0,185,77908,245,100,2987,57830,234
FORMULA AutonomousCar-PT-01b-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 129/129 transitions.
Graph (trivial) has 87 edges and 117 vertex of which 2 / 117 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 115 transition count 87
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 46 rules applied. Total rules applied 87 place count 75 transition count 81
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 92 place count 70 transition count 81
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 92 place count 70 transition count 73
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 108 place count 62 transition count 73
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 119 place count 51 transition count 62
Iterating global reduction 3 with 11 rules applied. Total rules applied 130 place count 51 transition count 62
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 135 place count 51 transition count 57
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 135 place count 51 transition count 55
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 139 place count 49 transition count 55
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 141 place count 47 transition count 53
Iterating global reduction 4 with 2 rules applied. Total rules applied 143 place count 47 transition count 53
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 155 place count 41 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 157 place count 41 transition count 45
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 158 place count 41 transition count 45
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 160 place count 39 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 161 place count 38 transition count 43
Applied a total of 161 rules in 37 ms. Remains 38 /117 variables (removed 79) and now considering 43/129 (removed 86) transitions.
// Phase 1: matrix 43 rows 38 cols
[2024-05-21 19:27:03] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 19:27:03] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 19:27:03] [INFO ] Invariant cache hit.
[2024-05-21 19:27:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:27:03] [INFO ] Implicit Places using invariants and state equation in 74 ms returned [30, 37]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 122 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 36/117 places, 43/129 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 36 transition count 42
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 35 transition count 42
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 4 place count 34 transition count 41
Applied a total of 4 rules in 6 ms. Remains 34 /36 variables (removed 2) and now considering 41/43 (removed 2) transitions.
// Phase 1: matrix 41 rows 34 cols
[2024-05-21 19:27:03] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 19:27:03] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 19:27:03] [INFO ] Invariant cache hit.
[2024-05-21 19:27:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:27:03] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 34/117 places, 41/129 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 264 ms. Remains : 34/117 places, 41/129 transitions.
[2024-05-21 19:27:03] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:27:03] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:27:03] [INFO ] Input system was already deterministic with 41 transitions.
[2024-05-21 19:27:03] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:27:03] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:27:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality185106894131764568.gal : 1 ms
[2024-05-21 19:27:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality12151740754447265995.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/CTLCardinality185106894131764568.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12151740754447265995.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,504,0.013905,3552,2,124,5,500,6,0,175,406,0


Converting to forward existential form...Done !
original formula: E((p61==1) U E((EF(((p72==0)||(p84==1))) + !((((p38==1)&&(p99==0))||(!((p57==0)||(p81==1)))))) U EG(((((p17!=1)||(p69==1))||((p76==0)||(p...177
=> equivalent forward existential formula: [FwdG(FwdU(FwdU(Init,(p61==1)),(E(TRUE U ((p72==0)||(p84==1))) + !((((p38==1)&&(p99==0))||(!((p57==0)||(p81==1))...228
Hit Full ! (commute/partial/dont) 38/0/3
Reverse transition relation is NOT exact ! Due to transitions t2, t7, t12, t14, t15, t27, t31, t37, t39, t40, Intersection with reachable at each step ena...208
Hit Full ! (commute/partial/dont) 29/0/12
(forward)formula 0,1,0.081173,4924,1,0,102,6730,122,43,1179,8216,125
FORMULA AutonomousCar-PT-01b-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 129/129 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 106 transition count 118
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 106 transition count 118
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 106 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 105 transition count 113
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 105 transition count 113
Applied a total of 28 rules in 7 ms. Remains 105 /117 variables (removed 12) and now considering 113/129 (removed 16) transitions.
// Phase 1: matrix 113 rows 105 cols
[2024-05-21 19:27:03] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 19:27:03] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 19:27:03] [INFO ] Invariant cache hit.
[2024-05-21 19:27:03] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2024-05-21 19:27:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-21 19:27:04] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-05-21 19:27:04] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
[2024-05-21 19:27:05] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2024-05-21 19:27:05] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
[2024-05-21 19:27:05] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-05-21 19:27:05] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
[2024-05-21 19:27:05] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-05-21 19:27:05] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 2 ms to minimize.
[2024-05-21 19:27:05] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 2 ms to minimize.
[2024-05-21 19:27:05] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 2 ms to minimize.
[2024-05-21 19:27:05] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-21 19:27:05] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 2 ms to minimize.
[2024-05-21 19:27:05] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 2 ms to minimize.
[2024-05-21 19:27:06] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 2 ms to minimize.
[2024-05-21 19:27:06] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 2 ms to minimize.
[2024-05-21 19:27:06] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 2 ms to minimize.
[2024-05-21 19:27:06] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-21 19:27:06] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-05-21 19:27:06] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-21 19:27:06] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 4 ms to minimize.
[2024-05-21 19:27:06] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-21 19:27:08] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-21 19:27:08] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 113/218 variables, 105/134 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 0/218 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 134 constraints, problems are : Problem set: 0 solved, 112 unsolved in 7466 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 113/218 variables, 105/134 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 112/246 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (OVERLAPS) 0/218 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 246 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4402 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 23/23 constraints]
After SMT, in 11891ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 11895ms
Starting structural reductions in LTL mode, iteration 1 : 105/117 places, 113/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12122 ms. Remains : 105/117 places, 113/129 transitions.
[2024-05-21 19:27:15] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:27:15] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:27:15] [INFO ] Input system was already deterministic with 113 transitions.
[2024-05-21 19:27:15] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:27:15] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:27:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality5805864184132519825.gal : 1 ms
[2024-05-21 19:27:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality1054808584765253232.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/CTLCardinality5805864184132519825.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1054808584765253232.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,88052,0.046953,4800,2,1172,5,5148,6,0,535,4105,0


Converting to forward existential form...Done !
original formula: (EG(E(((EF(((p38==0)||(p54==1))) + (p64==0)) + (p32==1)) U ((A((p7!=1) U ((p6==0)||(p96==1))) * AF(((p21==0)||(p95==1)))) * (AG(((p45==0)...337
=> equivalent forward existential formula: ([FwdG(Init,E(((E(TRUE U ((p38==0)||(p54==1))) + (p64==0)) + (p32==1)) U ((!((E(!(((p6==0)||(p96==1))) U (!((p7!...669
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t18, t26, t34, t37, t38, t39, t63, t64, t67, t68, t70, t73, t84, t91, t94, t95, t96...268
(forward)formula 0,1,5.96471,188208,1,0,1363,1.2271e+06,277,725,3124,1.14242e+06,1396
FORMULA AutonomousCar-PT-01b-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 129/129 transitions.
Graph (trivial) has 103 edges and 117 vertex of which 4 / 117 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 114 transition count 72
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 64 rules applied. Total rules applied 119 place count 60 transition count 62
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 125 place count 55 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 126 place count 54 transition count 61
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 126 place count 54 transition count 55
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 138 place count 48 transition count 55
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 147 place count 39 transition count 46
Iterating global reduction 4 with 9 rules applied. Total rules applied 156 place count 39 transition count 46
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 160 place count 39 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 160 place count 39 transition count 41
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 162 place count 38 transition count 41
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 164 place count 36 transition count 39
Iterating global reduction 5 with 2 rules applied. Total rules applied 166 place count 36 transition count 39
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 5 with 2 rules applied. Total rules applied 168 place count 36 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 169 place count 35 transition count 37
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 183 place count 28 transition count 30
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 184 place count 28 transition count 29
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 186 place count 26 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 187 place count 25 transition count 27
Applied a total of 187 rules in 18 ms. Remains 25 /117 variables (removed 92) and now considering 27/129 (removed 102) transitions.
// Phase 1: matrix 27 rows 25 cols
[2024-05-21 19:27:21] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 19:27:21] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-21 19:27:21] [INFO ] Invariant cache hit.
[2024-05-21 19:27:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:27:21] [INFO ] Implicit Places using invariants and state equation in 38 ms returned [19, 24]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 71 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 23/117 places, 27/129 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 22 transition count 26
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 22 transition count 25
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 21 transition count 25
Applied a total of 4 rules in 4 ms. Remains 21 /23 variables (removed 2) and now considering 25/27 (removed 2) transitions.
// Phase 1: matrix 25 rows 21 cols
[2024-05-21 19:27:21] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 19:27:21] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-21 19:27:21] [INFO ] Invariant cache hit.
[2024-05-21 19:27:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:27:21] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 21/117 places, 25/129 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 161 ms. Remains : 21/117 places, 25/129 transitions.
[2024-05-21 19:27:21] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:27:21] [INFO ] Flatten gal took : 1 ms
[2024-05-21 19:27:21] [INFO ] Input system was already deterministic with 25 transitions.
[2024-05-21 19:27:21] [INFO ] Flatten gal took : 1 ms
[2024-05-21 19:27:21] [INFO ] Flatten gal took : 1 ms
[2024-05-21 19:27:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality9182813209192549516.gal : 0 ms
[2024-05-21 19:27:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality8501224538654492049.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/CTLCardinality9182813209192549516.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8501224538654492049.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,181,0.006274,3464,2,98,5,467,6,0,107,440,0


Converting to forward existential form...Done !
original formula: E((p49!=1) U EG((EF((p70==1)) * EF((p38==0)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,(p49!=1)),(E(TRUE U (p70==1)) * E(TRUE U (p38==0))))] != FALSE
Hit Full ! (commute/partial/dont) 23/0/2
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t4, t5, t7, t9, t10, t16, t18, t23, Intersection with reachable at each step ena...208
(forward)formula 0,1,0.037597,4572,1,0,142,6497,84,79,686,7951,133
FORMULA AutonomousCar-PT-01b-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 129/129 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 101 transition count 113
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 101 transition count 113
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 36 place count 101 transition count 109
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 99 transition count 107
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 99 transition count 107
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 98 transition count 106
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 98 transition count 106
Applied a total of 42 rules in 7 ms. Remains 98 /117 variables (removed 19) and now considering 106/129 (removed 23) transitions.
// Phase 1: matrix 106 rows 98 cols
[2024-05-21 19:27:21] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 19:27:21] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-21 19:27:21] [INFO ] Invariant cache hit.
[2024-05-21 19:27:22] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-05-21 19:27:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-21 19:27:22] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 2 ms to minimize.
[2024-05-21 19:27:22] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-21 19:27:23] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-21 19:27:23] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
[2024-05-21 19:27:23] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 2 ms to minimize.
[2024-05-21 19:27:23] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 2 ms to minimize.
[2024-05-21 19:27:23] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-21 19:27:23] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 2 ms to minimize.
[2024-05-21 19:27:23] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
[2024-05-21 19:27:23] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-21 19:27:23] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 2 ms to minimize.
[2024-05-21 19:27:23] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 2 ms to minimize.
[2024-05-21 19:27:23] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 2 ms to minimize.
[2024-05-21 19:27:23] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 2 ms to minimize.
[2024-05-21 19:27:24] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 2 ms to minimize.
[2024-05-21 19:27:24] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 2 ms to minimize.
[2024-05-21 19:27:24] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 2 ms to minimize.
[2024-05-21 19:27:24] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 2 ms to minimize.
[2024-05-21 19:27:24] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-21 19:27:24] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-21 19:27:24] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/204 variables, 98/125 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/204 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 125 constraints, problems are : Problem set: 0 solved, 105 unsolved in 5994 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 106/204 variables, 98/125 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 105/230 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/204 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 230 constraints, problems are : Problem set: 0 solved, 105 unsolved in 4169 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 21/21 constraints]
After SMT, in 10184ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 10186ms
Starting structural reductions in LTL mode, iteration 1 : 98/117 places, 106/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10348 ms. Remains : 98/117 places, 106/129 transitions.
[2024-05-21 19:27:32] [INFO ] Flatten gal took : 12 ms
[2024-05-21 19:27:32] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:27:32] [INFO ] Input system was already deterministic with 106 transitions.
[2024-05-21 19:27:32] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:27:32] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:27:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality15890449191258309918.gal : 1 ms
[2024-05-21 19:27:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality17974197897793607770.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/CTLCardinality15890449191258309918.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17974197897793607770.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,68004,0.040764,4760,2,1132,5,4791,6,0,500,3797,0


Converting to forward existential form...Done !
original formula: EG(EX(AX((E(((p71==0)||(p82==1)) U ((p46==0)||(p19==1))) + ((p68==0)&&((p35==0)||(p19==1)))))))
=> equivalent forward existential formula: [FwdG(Init,EX(!(EX(!((E(((p71==0)||(p82==1)) U ((p46==0)||(p19==1))) + ((p68==0)&&((p35==0)||(p19==1)))))))))] !...162
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t33, t38, t39, t60, t61, t64, t65, t67, t70, t81, t88, t90, t95, t103, I...252
(forward)formula 0,1,1.47599,47416,1,0,563,200588,239,332,2791,271300,539
FORMULA AutonomousCar-PT-01b-CTLCardinality-2024-09 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 : 117/117 places, 129/129 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 100 transition count 112
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 100 transition count 112
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 100 transition count 108
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 96 transition count 104
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 96 transition count 104
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 95 transition count 103
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 95 transition count 103
Applied a total of 48 rules in 6 ms. Remains 95 /117 variables (removed 22) and now considering 103/129 (removed 26) transitions.
// Phase 1: matrix 103 rows 95 cols
[2024-05-21 19:27:33] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 19:27:33] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 19:27:33] [INFO ] Invariant cache hit.
[2024-05-21 19:27:33] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-05-21 19:27:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-21 19:27:34] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2024-05-21 19:27:34] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
[2024-05-21 19:27:34] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-05-21 19:27:35] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
[2024-05-21 19:27:35] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 2 ms to minimize.
[2024-05-21 19:27:35] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 2 ms to minimize.
[2024-05-21 19:27:35] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
[2024-05-21 19:27:35] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 2 ms to minimize.
[2024-05-21 19:27:35] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 2 ms to minimize.
[2024-05-21 19:27:35] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 2 ms to minimize.
[2024-05-21 19:27:35] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 2 ms to minimize.
[2024-05-21 19:27:35] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-21 19:27:35] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 2 ms to minimize.
[2024-05-21 19:27:35] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 2 ms to minimize.
[2024-05-21 19:27:36] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-21 19:27:36] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-21 19:27:37] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 2 ms to minimize.
[2024-05-21 19:27:37] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 103/198 variables, 95/119 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-21 19:27:40] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/198 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 0/198 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 120 constraints, problems are : Problem set: 0 solved, 102 unsolved in 8208 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 103/198 variables, 95/120 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 102/222 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-21 19:27:43] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 223 constraints, problems are : Problem set: 0 solved, 102 unsolved in 5197 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 20/20 constraints]
After SMT, in 13416ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 13417ms
Starting structural reductions in LTL mode, iteration 1 : 95/117 places, 103/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13559 ms. Remains : 95/117 places, 103/129 transitions.
[2024-05-21 19:27:47] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:27:47] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:27:47] [INFO ] Input system was already deterministic with 103 transitions.
[2024-05-21 19:27:47] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:27:47] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:27:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality10590366449733654466.gal : 2 ms
[2024-05-21 19:27:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality656486096153501677.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/CTLCardinality10590366449733654466.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality656486096153501677.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,66576,0.06849,4748,2,1150,5,4711,6,0,485,3956,0


Converting to forward existential form...Done !
original formula: AG((((p25==0)||(p41==1)) + EF(EX(AX((p39==1))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(((p25==0)||(p41==1)))) * !(E(TRUE U EX(!(EX(!((p39==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t57, t58, t61, t63, t64, t65, t78, t85, t87, t100, I...252
(forward)formula 0,0,1.29806,37520,1,0,208,216151,230,119,2782,153634,258
FORMULA AutonomousCar-PT-01b-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 129/129 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 99 transition count 111
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 99 transition count 111
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 99 transition count 107
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 95 transition count 103
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 95 transition count 103
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 94 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 94 transition count 102
Applied a total of 50 rules in 3 ms. Remains 94 /117 variables (removed 23) and now considering 102/129 (removed 27) transitions.
// Phase 1: matrix 102 rows 94 cols
[2024-05-21 19:27:48] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 19:27:48] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 19:27:48] [INFO ] Invariant cache hit.
[2024-05-21 19:27:48] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-05-21 19:27:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-21 19:27:49] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 3 ms to minimize.
[2024-05-21 19:27:49] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-05-21 19:27:49] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 2 ms to minimize.
[2024-05-21 19:27:50] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 3 ms to minimize.
[2024-05-21 19:27:50] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-05-21 19:27:50] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 2 ms to minimize.
[2024-05-21 19:27:50] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 2 ms to minimize.
[2024-05-21 19:27:50] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
[2024-05-21 19:27:50] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 2 ms to minimize.
[2024-05-21 19:27:50] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 2 ms to minimize.
[2024-05-21 19:27:50] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 2 ms to minimize.
[2024-05-21 19:27:50] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
[2024-05-21 19:27:50] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
[2024-05-21 19:27:50] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-21 19:27:51] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-21 19:27:51] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-21 19:27:51] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-05-21 19:27:51] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-21 19:27:51] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/196 variables, 94/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 119 constraints, problems are : Problem set: 0 solved, 101 unsolved in 5719 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-21 19:27:55] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/196 variables, 94/120 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 101/221 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-21 19:27:56] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 222 constraints, problems are : Problem set: 0 solved, 101 unsolved in 5252 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 21/21 constraints]
After SMT, in 10981ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 10983ms
Starting structural reductions in LTL mode, iteration 1 : 94/117 places, 102/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11112 ms. Remains : 94/117 places, 102/129 transitions.
[2024-05-21 19:27:59] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:27:59] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:27:59] [INFO ] Input system was already deterministic with 102 transitions.
[2024-05-21 19:27:59] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:27:59] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:27:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality15759886412600491555.gal : 2 ms
[2024-05-21 19:27:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality5289774723291948142.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/CTLCardinality15759886412600491555.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5289774723291948142.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,65988,0.062043,4484,2,1074,5,4446,6,0,480,3733,0


Converting to forward existential form...Done !
original formula: EG(EX(TRUE))
=> equivalent forward existential formula: [FwdG(Init,EX(TRUE))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t57, t58, t61, t62, t64, t77, t84, t86, t91, t99, In...251
(forward)formula 0,1,1.52197,45412,1,0,551,189836,225,323,2685,260067,519
FORMULA AutonomousCar-PT-01b-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 129/129 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 102 transition count 114
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 102 transition count 114
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 102 transition count 110
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 99 transition count 107
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 99 transition count 107
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 98 transition count 106
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 98 transition count 106
Applied a total of 42 rules in 3 ms. Remains 98 /117 variables (removed 19) and now considering 106/129 (removed 23) transitions.
// Phase 1: matrix 106 rows 98 cols
[2024-05-21 19:28:01] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 19:28:01] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 19:28:01] [INFO ] Invariant cache hit.
[2024-05-21 19:28:01] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-05-21 19:28:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-21 19:28:02] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 2 ms to minimize.
[2024-05-21 19:28:02] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 2 ms to minimize.
[2024-05-21 19:28:02] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
[2024-05-21 19:28:02] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
[2024-05-21 19:28:02] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 2 ms to minimize.
[2024-05-21 19:28:02] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 2 ms to minimize.
[2024-05-21 19:28:02] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 2 ms to minimize.
[2024-05-21 19:28:03] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 2 ms to minimize.
[2024-05-21 19:28:03] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 2 ms to minimize.
[2024-05-21 19:28:03] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2024-05-21 19:28:03] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 2 ms to minimize.
[2024-05-21 19:28:03] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-05-21 19:28:03] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 2 ms to minimize.
[2024-05-21 19:28:03] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-21 19:28:03] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 2 ms to minimize.
[2024-05-21 19:28:04] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/204 variables, 98/120 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/204 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 120 constraints, problems are : Problem set: 0 solved, 105 unsolved in 5397 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 106/204 variables, 98/120 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 105/225 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-21 19:28:09] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/204 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 0/204 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 226 constraints, problems are : Problem set: 0 solved, 105 unsolved in 6389 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 17/17 constraints]
After SMT, in 11799ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 11801ms
Starting structural reductions in LTL mode, iteration 1 : 98/117 places, 106/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11955 ms. Remains : 98/117 places, 106/129 transitions.
[2024-05-21 19:28:13] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:28:13] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:28:13] [INFO ] Input system was already deterministic with 106 transitions.
[2024-05-21 19:28:13] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:28:13] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:28:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality17238451893693386591.gal : 2 ms
[2024-05-21 19:28:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality14058016189728752124.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/CTLCardinality17238451893693386591.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14058016189728752124.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,71510,0.062609,4764,2,1124,5,4793,6,0,500,3884,0


Converting to forward existential form...Done !
original formula: (EX(EG((p86==1))) + EF(((AG((p40==0)) * EX((p21==1))) * ((p30==0) * AG(E((p70==0) U (p48==0)))))))
=> equivalent forward existential formula: ([FwdG(EY(Init),(p86==1))] != FALSE + [(((FwdU(Init,TRUE) * (!(E(TRUE U !((p40==0)))) * EX((p21==1)))) * (p30==0...210
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t34, t39, t40, t60, t61, t64, t65, t67, t81, t88, t90, t95, t103, Inters...247
(forward)formula 0,1,1.18864,36412,1,0,280,182941,250,119,2939,161559,340
FORMULA AutonomousCar-PT-01b-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 129/129 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 99 transition count 111
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 99 transition count 111
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 99 transition count 107
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 95 transition count 103
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 95 transition count 103
Applied a total of 48 rules in 3 ms. Remains 95 /117 variables (removed 22) and now considering 103/129 (removed 26) transitions.
// Phase 1: matrix 103 rows 95 cols
[2024-05-21 19:28:14] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 19:28:14] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 19:28:14] [INFO ] Invariant cache hit.
[2024-05-21 19:28:14] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-05-21 19:28:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-21 19:28:15] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
[2024-05-21 19:28:15] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
[2024-05-21 19:28:15] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-05-21 19:28:15] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 2 ms to minimize.
[2024-05-21 19:28:15] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
[2024-05-21 19:28:16] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 2 ms to minimize.
[2024-05-21 19:28:16] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 2 ms to minimize.
[2024-05-21 19:28:16] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 2 ms to minimize.
[2024-05-21 19:28:16] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 2 ms to minimize.
[2024-05-21 19:28:16] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 2 ms to minimize.
[2024-05-21 19:28:16] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-21 19:28:16] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-21 19:28:16] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2024-05-21 19:28:16] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-21 19:28:16] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-21 19:28:17] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 2 ms to minimize.
[2024-05-21 19:28:18] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 2 ms to minimize.
[2024-05-21 19:28:18] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-21 19:28:18] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 103/198 variables, 95/120 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 0/198 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 120 constraints, problems are : Problem set: 0 solved, 102 unsolved in 6956 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 103/198 variables, 95/120 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 102/222 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 222 constraints, problems are : Problem set: 0 solved, 102 unsolved in 4137 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 19/19 constraints]
After SMT, in 11104ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 11107ms
Starting structural reductions in LTL mode, iteration 1 : 95/117 places, 103/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11246 ms. Remains : 95/117 places, 103/129 transitions.
[2024-05-21 19:28:25] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:28:25] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:28:25] [INFO ] Input system was already deterministic with 103 transitions.
[2024-05-21 19:28:25] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:28:25] [INFO ] Flatten gal took : 10 ms
[2024-05-21 19:28:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality13484862666281306774.gal : 1 ms
[2024-05-21 19:28:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality429120528221578870.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/CTLCardinality13484862666281306774.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality429120528221578870.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,67878,0.05672,4476,2,989,5,4218,6,0,485,3251,0


Converting to forward existential form...Done !
original formula: AX(A(!(((!(((p102==0)||(p28==1))||(p107==1)))&&((p117==0)||(p102==1)))) U (p90!=0)))
=> equivalent forward existential formula: ([(FwdU(EY(Init),!((p90!=0))) * (!(!(((!(((p102==0)||(p28==1))||(p107==1)))&&((p117==0)||(p102==1))))) * !((p90!...210
Hit Full ! (commute/partial/dont) 101/0/2
(forward)formula 0,0,0.612365,18320,1,0,91,73788,20,4,2266,58468,88
FORMULA AutonomousCar-PT-01b-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 129/129 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 100 transition count 112
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 100 transition count 112
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 100 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 97 transition count 105
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 97 transition count 105
Applied a total of 44 rules in 4 ms. Remains 97 /117 variables (removed 20) and now considering 105/129 (removed 24) transitions.
// Phase 1: matrix 105 rows 97 cols
[2024-05-21 19:28:26] [INFO ] Computed 6 invariants in 2 ms
[2024-05-21 19:28:26] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 19:28:26] [INFO ] Invariant cache hit.
[2024-05-21 19:28:26] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Running 104 sub problems to find dead transitions.
[2024-05-21 19:28:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-21 19:28:27] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 2 ms to minimize.
[2024-05-21 19:28:27] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 3 ms to minimize.
[2024-05-21 19:28:27] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-21 19:28:27] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 2 ms to minimize.
[2024-05-21 19:28:28] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 3 ms to minimize.
[2024-05-21 19:28:28] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2024-05-21 19:28:28] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 2 ms to minimize.
[2024-05-21 19:28:28] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 2 ms to minimize.
[2024-05-21 19:28:28] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
[2024-05-21 19:28:28] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-21 19:28:28] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 2 ms to minimize.
[2024-05-21 19:28:28] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 2 ms to minimize.
[2024-05-21 19:28:28] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 2 ms to minimize.
[2024-05-21 19:28:28] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 2 ms to minimize.
[2024-05-21 19:28:28] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-21 19:28:29] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 2 ms to minimize.
[2024-05-21 19:28:29] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-21 19:28:30] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 2 ms to minimize.
[2024-05-21 19:28:30] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-21 19:28:31] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 105/202 variables, 97/123 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-21 19:28:33] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/202 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 11 (OVERLAPS) 0/202 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 124 constraints, problems are : Problem set: 0 solved, 104 unsolved in 8917 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 105/202 variables, 97/124 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 104/228 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-21 19:28:37] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (OVERLAPS) 0/202 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 229 constraints, problems are : Problem set: 0 solved, 104 unsolved in 5418 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 22/22 constraints]
After SMT, in 14350ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 14352ms
Starting structural reductions in LTL mode, iteration 1 : 97/117 places, 105/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14535 ms. Remains : 97/117 places, 105/129 transitions.
[2024-05-21 19:28:41] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:28:41] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:28:41] [INFO ] Input system was already deterministic with 105 transitions.
[2024-05-21 19:28:41] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:28:41] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:28:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality4267246130987545800.gal : 1 ms
[2024-05-21 19:28:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality9063858443301635806.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/CTLCardinality4267246130987545800.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9063858443301635806.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,70440,0.043925,4756,2,1148,5,4658,6,0,495,3914,0


Converting to forward existential form...Done !
original formula: EX((EG((AF(((p22==0)||(p90==1))) + EG(((p33==0)||(p101==1))))) * ((p55==0)||(p36==1))))
=> equivalent forward existential formula: [FwdG((EY(Init) * ((p55==0)||(p36==1))),(!(EG(!(((p22==0)||(p90==1))))) + EG(((p33==0)||(p101==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t25, t33, t36, t37, t38, t58, t59, t62, t64, t65, t66, t79, t86, t88, t102, I...252
(forward)formula 0,1,3.25832,106244,1,0,902,691527,241,406,2935,631251,1039
FORMULA AutonomousCar-PT-01b-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-21 19:28:44] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:28:44] [INFO ] Flatten gal took : 4 ms
Total runtime 186889 ms.

BK_STOP 1716319724464

--------------------
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="AutonomousCar-PT-01b"
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 AutonomousCar-PT-01b, 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 r026-smll-171620167300225"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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