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.r004-smll-171620118300337.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 Anderson-PT-07, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r004-smll-171620118300337
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 920K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K 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.8K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 15:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 12 15:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 15:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 12 15:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 461K 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 Anderson-PT-07-CTLCardinality-2024-00
FORMULA_NAME Anderson-PT-07-CTLCardinality-2024-01
FORMULA_NAME Anderson-PT-07-CTLCardinality-2024-02
FORMULA_NAME Anderson-PT-07-CTLCardinality-2024-03
FORMULA_NAME Anderson-PT-07-CTLCardinality-2024-04
FORMULA_NAME Anderson-PT-07-CTLCardinality-2024-05
FORMULA_NAME Anderson-PT-07-CTLCardinality-2024-06
FORMULA_NAME Anderson-PT-07-CTLCardinality-2024-07
FORMULA_NAME Anderson-PT-07-CTLCardinality-2024-08
FORMULA_NAME Anderson-PT-07-CTLCardinality-2024-09
FORMULA_NAME Anderson-PT-07-CTLCardinality-2024-10
FORMULA_NAME Anderson-PT-07-CTLCardinality-2024-11
FORMULA_NAME Anderson-PT-07-CTLCardinality-2023-12
FORMULA_NAME Anderson-PT-07-CTLCardinality-2023-13
FORMULA_NAME Anderson-PT-07-CTLCardinality-2023-14
FORMULA_NAME Anderson-PT-07-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716425636120

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-23 00:53:58] [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-23 00:53:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 00:53:59] [INFO ] Load time of PNML (sax parser for PT used): 486 ms
[2024-05-23 00:53:59] [INFO ] Transformed 309 places.
[2024-05-23 00:53:59] [INFO ] Transformed 917 transitions.
[2024-05-23 00:53:59] [INFO ] Found NUPN structural information;
[2024-05-23 00:53:59] [INFO ] Parsed PT model containing 309 places and 917 transitions and 3500 arcs in 752 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 34 ms.
FORMULA Anderson-PT-07-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 86 out of 309 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 917/917 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 257 transition count 493
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 257 transition count 493
Applied a total of 104 rules in 130 ms. Remains 257 /309 variables (removed 52) and now considering 493/917 (removed 424) transitions.
// Phase 1: matrix 493 rows 257 cols
[2024-05-23 00:53:59] [INFO ] Computed 17 invariants in 97 ms
[2024-05-23 00:54:00] [INFO ] Implicit Places using invariants in 1021 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1101 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 256/309 places, 493/917 transitions.
Applied a total of 0 rules in 15 ms. Remains 256 /256 variables (removed 0) and now considering 493/493 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1287 ms. Remains : 256/309 places, 493/917 transitions.
Support contains 86 out of 256 places after structural reductions.
[2024-05-23 00:54:01] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2024-05-23 00:54:01] [INFO ] Flatten gal took : 157 ms
FORMULA Anderson-PT-07-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-07-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-07-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-07-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 00:54:01] [INFO ] Flatten gal took : 85 ms
[2024-05-23 00:54:01] [INFO ] Input system was already deterministic with 493 transitions.
Support contains 60 out of 256 places (down from 86) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2773 ms. (14 steps per ms) remains 5/40 properties
BEST_FIRST walk for 40003 steps (8 resets) in 302 ms. (132 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 181 ms. (219 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 150 ms. (264 steps per ms) remains 1/1 properties
// Phase 1: matrix 493 rows 256 cols
[2024-05-23 00:54:02] [INFO ] Computed 16 invariants in 8 ms
[2024-05-23 00:54:02] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 69/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 42/113 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 129/242 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/256 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 493/749 variables, 256/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/749 variables, 42/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/749 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/749 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 749/749 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 550 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 256/256 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 69/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 42/113 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 129/242 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/256 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 493/749 variables, 256/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/749 variables, 42/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/749 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/749 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/749 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 749/749 variables, and 315 constraints, problems are : Problem set: 0 solved, 1 unsolved in 547 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 256/256 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1146ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 50 ms.
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 493/493 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 256 transition count 444
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 207 transition count 444
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 98 place count 207 transition count 404
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 178 place count 167 transition count 404
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 208 place count 137 transition count 242
Iterating global reduction 2 with 30 rules applied. Total rules applied 238 place count 137 transition count 242
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 242 place count 135 transition count 240
Applied a total of 242 rules in 81 ms. Remains 135 /256 variables (removed 121) and now considering 240/493 (removed 253) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 135/256 places, 240/493 transitions.
RANDOM walk for 40000 steps (8 resets) in 305 ms. (130 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 108 ms. (366 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 38587 steps, run visited all 1 properties in 228 ms. (steps per millisecond=169 )
Probabilistic random walk after 38587 steps, saw 25340 distinct states, run finished after 237 ms. (steps per millisecond=162 ) properties seen :1
[2024-05-23 00:54:04] [INFO ] Flatten gal took : 60 ms
[2024-05-23 00:54:04] [INFO ] Flatten gal took : 64 ms
[2024-05-23 00:54:04] [INFO ] Input system was already deterministic with 493 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 493/493 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 224 transition count 329
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 224 transition count 329
Applied a total of 64 rules in 14 ms. Remains 224 /256 variables (removed 32) and now considering 329/493 (removed 164) transitions.
// Phase 1: matrix 329 rows 224 cols
[2024-05-23 00:54:04] [INFO ] Computed 16 invariants in 6 ms
[2024-05-23 00:54:05] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-05-23 00:54:05] [INFO ] Invariant cache hit.
[2024-05-23 00:54:05] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-23 00:54:06] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1126 ms to find 0 implicit places.
Running 322 sub problems to find dead transitions.
[2024-05-23 00:54:06] [INFO ] Invariant cache hit.
[2024-05-23 00:54:06] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-05-23 00:54:11] [INFO ] Deduced a trap composed of 69 places in 494 ms of which 28 ms to minimize.
[2024-05-23 00:54:12] [INFO ] Deduced a trap composed of 138 places in 246 ms of which 5 ms to minimize.
[2024-05-23 00:54:13] [INFO ] Deduced a trap composed of 131 places in 296 ms of which 5 ms to minimize.
[2024-05-23 00:54:13] [INFO ] Deduced a trap composed of 131 places in 205 ms of which 4 ms to minimize.
[2024-05-23 00:54:13] [INFO ] Deduced a trap composed of 136 places in 215 ms of which 4 ms to minimize.
[2024-05-23 00:54:13] [INFO ] Deduced a trap composed of 113 places in 198 ms of which 5 ms to minimize.
[2024-05-23 00:54:13] [INFO ] Deduced a trap composed of 129 places in 197 ms of which 5 ms to minimize.
[2024-05-23 00:54:14] [INFO ] Deduced a trap composed of 54 places in 277 ms of which 6 ms to minimize.
[2024-05-23 00:54:14] [INFO ] Deduced a trap composed of 82 places in 271 ms of which 4 ms to minimize.
[2024-05-23 00:54:14] [INFO ] Deduced a trap composed of 86 places in 198 ms of which 4 ms to minimize.
[2024-05-23 00:54:15] [INFO ] Deduced a trap composed of 99 places in 269 ms of which 5 ms to minimize.
[2024-05-23 00:54:15] [INFO ] Deduced a trap composed of 46 places in 189 ms of which 4 ms to minimize.
[2024-05-23 00:54:15] [INFO ] Deduced a trap composed of 143 places in 255 ms of which 4 ms to minimize.
[2024-05-23 00:54:16] [INFO ] Deduced a trap composed of 151 places in 243 ms of which 5 ms to minimize.
[2024-05-23 00:54:16] [INFO ] Deduced a trap composed of 82 places in 262 ms of which 4 ms to minimize.
[2024-05-23 00:54:16] [INFO ] Deduced a trap composed of 96 places in 128 ms of which 2 ms to minimize.
[2024-05-23 00:54:16] [INFO ] Deduced a trap composed of 91 places in 205 ms of which 3 ms to minimize.
[2024-05-23 00:54:17] [INFO ] Deduced a trap composed of 95 places in 182 ms of which 6 ms to minimize.
[2024-05-23 00:54:17] [INFO ] Deduced a trap composed of 89 places in 240 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 19/34 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-05-23 00:54:18] [INFO ] Deduced a trap composed of 71 places in 119 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-05-23 00:54:24] [INFO ] Deduced a trap composed of 83 places in 180 ms of which 3 ms to minimize.
[2024-05-23 00:54:25] [INFO ] Deduced a trap composed of 97 places in 157 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (OVERLAPS) 1/224 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-05-23 00:54:33] [INFO ] Deduced a trap composed of 65 places in 203 ms of which 3 ms to minimize.
[2024-05-23 00:54:34] [INFO ] Deduced a trap composed of 69 places in 168 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-05-23 00:54:36] [INFO ] Deduced a trap composed of 162 places in 189 ms of which 3 ms to minimize.
[2024-05-23 00:54:36] [INFO ] Deduced a trap composed of 129 places in 257 ms of which 4 ms to minimize.
SMT process timed out in 30457ms, After SMT, problems are : Problem set: 0 solved, 322 unsolved
Search for dead transitions found 0 dead transitions in 30474ms
Starting structural reductions in LTL mode, iteration 1 : 224/256 places, 329/493 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31622 ms. Remains : 224/256 places, 329/493 transitions.
[2024-05-23 00:54:36] [INFO ] Flatten gal took : 19 ms
[2024-05-23 00:54:36] [INFO ] Flatten gal took : 23 ms
[2024-05-23 00:54:36] [INFO ] Input system was already deterministic with 329 transitions.
[2024-05-23 00:54:36] [INFO ] Flatten gal took : 18 ms
[2024-05-23 00:54:36] [INFO ] Flatten gal took : 18 ms
[2024-05-23 00:54:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality15422690026863261020.gal : 19 ms
[2024-05-23 00:54:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality13913814965187556625.ctl : 3 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/CTLCardinality15422690026863261020.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13913814965187556625.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.48907e+07,9.13886,194944,2,72164,5,616978,6,0,1228,512584,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-23 00:55:06] [INFO ] Flatten gal took : 28 ms
[2024-05-23 00:55:06] [INFO ] Applying decomposition
[2024-05-23 00:55:06] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13728684633586324986.txt' '-o' '/tmp/graph13728684633586324986.bin' '-w' '/tmp/graph13728684633586324986.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13728684633586324986.bin' '-l' '-1' '-v' '-w' '/tmp/graph13728684633586324986.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:55:07] [INFO ] Decomposing Gal with order
[2024-05-23 00:55:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:55:07] [INFO ] Removed a total of 498 redundant transitions.
[2024-05-23 00:55:07] [INFO ] Flatten gal took : 242 ms
[2024-05-23 00:55:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 20 ms.
[2024-05-23 00:55:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality6888993120447884532.gal : 23 ms
[2024-05-23 00:55:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality13211094388907988990.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/CTLCardinality6888993120447884532.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13211094388907988990.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.48907e+07,4.3532,90576,17153,25,183670,208,839,90301,36,352,0


Converting to forward existential form...Done !
original formula: EF(EX(AF((i4.u90.cs_4_5==1))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(EG(!((i4.u90.cs_4_5==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t280, t281, t282, t284, t285, t286, t287, t288, t289, t290, t291, t292, t293, t294, t295, t29...459
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,1,27.6107,675824,1,0,1.21885e+06,235,4162,908582,173,1136,7333614
FORMULA Anderson-PT-07-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 493/493 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 226 transition count 343
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 226 transition count 343
Applied a total of 60 rules in 14 ms. Remains 226 /256 variables (removed 30) and now considering 343/493 (removed 150) transitions.
// Phase 1: matrix 343 rows 226 cols
[2024-05-23 00:55:35] [INFO ] Computed 16 invariants in 14 ms
[2024-05-23 00:55:35] [INFO ] Implicit Places using invariants in 460 ms returned []
[2024-05-23 00:55:35] [INFO ] Invariant cache hit.
[2024-05-23 00:55:36] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-23 00:55:36] [INFO ] Implicit Places using invariants and state equation in 890 ms returned []
Implicit Place search using SMT with State Equation took 1352 ms to find 0 implicit places.
Running 336 sub problems to find dead transitions.
[2024-05-23 00:55:36] [INFO ] Invariant cache hit.
[2024-05-23 00:55:36] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-23 00:55:41] [INFO ] Deduced a trap composed of 78 places in 142 ms of which 4 ms to minimize.
[2024-05-23 00:55:41] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 2 ms to minimize.
[2024-05-23 00:55:41] [INFO ] Deduced a trap composed of 85 places in 172 ms of which 3 ms to minimize.
[2024-05-23 00:55:41] [INFO ] Deduced a trap composed of 60 places in 138 ms of which 3 ms to minimize.
[2024-05-23 00:55:41] [INFO ] Deduced a trap composed of 105 places in 207 ms of which 4 ms to minimize.
[2024-05-23 00:55:42] [INFO ] Deduced a trap composed of 115 places in 157 ms of which 3 ms to minimize.
[2024-05-23 00:55:42] [INFO ] Deduced a trap composed of 87 places in 203 ms of which 4 ms to minimize.
[2024-05-23 00:55:42] [INFO ] Deduced a trap composed of 117 places in 205 ms of which 4 ms to minimize.
[2024-05-23 00:55:42] [INFO ] Deduced a trap composed of 96 places in 240 ms of which 4 ms to minimize.
[2024-05-23 00:55:43] [INFO ] Deduced a trap composed of 85 places in 241 ms of which 4 ms to minimize.
[2024-05-23 00:55:43] [INFO ] Deduced a trap composed of 74 places in 165 ms of which 2 ms to minimize.
[2024-05-23 00:55:43] [INFO ] Deduced a trap composed of 86 places in 245 ms of which 5 ms to minimize.
[2024-05-23 00:55:43] [INFO ] Deduced a trap composed of 127 places in 134 ms of which 3 ms to minimize.
[2024-05-23 00:55:44] [INFO ] Deduced a trap composed of 106 places in 184 ms of which 2 ms to minimize.
[2024-05-23 00:55:44] [INFO ] Deduced a trap composed of 69 places in 206 ms of which 4 ms to minimize.
[2024-05-23 00:55:44] [INFO ] Deduced a trap composed of 137 places in 189 ms of which 4 ms to minimize.
[2024-05-23 00:55:45] [INFO ] Deduced a trap composed of 89 places in 262 ms of which 7 ms to minimize.
[2024-05-23 00:55:45] [INFO ] Deduced a trap composed of 77 places in 223 ms of which 4 ms to minimize.
[2024-05-23 00:55:45] [INFO ] Deduced a trap composed of 90 places in 249 ms of which 4 ms to minimize.
[2024-05-23 00:55:46] [INFO ] Deduced a trap composed of 124 places in 166 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-23 00:55:47] [INFO ] Deduced a trap composed of 101 places in 210 ms of which 4 ms to minimize.
[2024-05-23 00:55:49] [INFO ] Deduced a trap composed of 140 places in 282 ms of which 4 ms to minimize.
[2024-05-23 00:55:49] [INFO ] Deduced a trap composed of 77 places in 191 ms of which 3 ms to minimize.
[2024-05-23 00:55:49] [INFO ] Deduced a trap composed of 74 places in 184 ms of which 3 ms to minimize.
[2024-05-23 00:55:50] [INFO ] Deduced a trap composed of 106 places in 201 ms of which 3 ms to minimize.
[2024-05-23 00:55:50] [INFO ] Deduced a trap composed of 62 places in 207 ms of which 3 ms to minimize.
[2024-05-23 00:55:50] [INFO ] Deduced a trap composed of 82 places in 216 ms of which 4 ms to minimize.
[2024-05-23 00:55:50] [INFO ] Deduced a trap composed of 94 places in 216 ms of which 5 ms to minimize.
[2024-05-23 00:55:51] [INFO ] Deduced a trap composed of 97 places in 217 ms of which 4 ms to minimize.
[2024-05-23 00:55:51] [INFO ] Deduced a trap composed of 81 places in 212 ms of which 4 ms to minimize.
[2024-05-23 00:55:51] [INFO ] Deduced a trap composed of 64 places in 210 ms of which 3 ms to minimize.
[2024-05-23 00:55:51] [INFO ] Deduced a trap composed of 128 places in 138 ms of which 2 ms to minimize.
[2024-05-23 00:55:52] [INFO ] Deduced a trap composed of 62 places in 270 ms of which 4 ms to minimize.
[2024-05-23 00:55:52] [INFO ] Deduced a trap composed of 69 places in 168 ms of which 3 ms to minimize.
[2024-05-23 00:55:52] [INFO ] Deduced a trap composed of 96 places in 213 ms of which 3 ms to minimize.
[2024-05-23 00:55:52] [INFO ] Deduced a trap composed of 114 places in 270 ms of which 5 ms to minimize.
[2024-05-23 00:55:53] [INFO ] Deduced a trap composed of 93 places in 164 ms of which 2 ms to minimize.
[2024-05-23 00:55:53] [INFO ] Deduced a trap composed of 123 places in 263 ms of which 4 ms to minimize.
[2024-05-23 00:55:53] [INFO ] Deduced a trap composed of 112 places in 184 ms of which 3 ms to minimize.
[2024-05-23 00:55:53] [INFO ] Deduced a trap composed of 82 places in 270 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-23 00:55:57] [INFO ] Deduced a trap composed of 107 places in 214 ms of which 4 ms to minimize.
[2024-05-23 00:55:57] [INFO ] Deduced a trap composed of 89 places in 214 ms of which 4 ms to minimize.
[2024-05-23 00:55:57] [INFO ] Deduced a trap composed of 91 places in 211 ms of which 4 ms to minimize.
[2024-05-23 00:55:59] [INFO ] Deduced a trap composed of 86 places in 255 ms of which 4 ms to minimize.
[2024-05-23 00:55:59] [INFO ] Deduced a trap composed of 120 places in 154 ms of which 3 ms to minimize.
[2024-05-23 00:55:59] [INFO ] Deduced a trap composed of 73 places in 241 ms of which 4 ms to minimize.
[2024-05-23 00:56:00] [INFO ] Deduced a trap composed of 134 places in 153 ms of which 2 ms to minimize.
[2024-05-23 00:56:00] [INFO ] Deduced a trap composed of 74 places in 156 ms of which 3 ms to minimize.
[2024-05-23 00:56:00] [INFO ] Deduced a trap composed of 120 places in 248 ms of which 4 ms to minimize.
[2024-05-23 00:56:00] [INFO ] Deduced a trap composed of 93 places in 162 ms of which 4 ms to minimize.
[2024-05-23 00:56:01] [INFO ] Deduced a trap composed of 76 places in 207 ms of which 4 ms to minimize.
[2024-05-23 00:56:01] [INFO ] Deduced a trap composed of 56 places in 213 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 12/68 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-23 00:56:02] [INFO ] Deduced a trap composed of 73 places in 302 ms of which 4 ms to minimize.
[2024-05-23 00:56:03] [INFO ] Deduced a trap composed of 90 places in 212 ms of which 4 ms to minimize.
[2024-05-23 00:56:03] [INFO ] Deduced a trap composed of 85 places in 214 ms of which 4 ms to minimize.
[2024-05-23 00:56:03] [INFO ] Deduced a trap composed of 88 places in 263 ms of which 4 ms to minimize.
[2024-05-23 00:56:03] [INFO ] Deduced a trap composed of 58 places in 279 ms of which 4 ms to minimize.
[2024-05-23 00:56:04] [INFO ] Deduced a trap composed of 86 places in 260 ms of which 3 ms to minimize.
[2024-05-23 00:56:04] [INFO ] Deduced a trap composed of 81 places in 209 ms of which 4 ms to minimize.
[2024-05-23 00:56:04] [INFO ] Deduced a trap composed of 67 places in 271 ms of which 5 ms to minimize.
[2024-05-23 00:56:04] [INFO ] Deduced a trap composed of 86 places in 211 ms of which 4 ms to minimize.
[2024-05-23 00:56:05] [INFO ] Deduced a trap composed of 49 places in 205 ms of which 4 ms to minimize.
[2024-05-23 00:56:05] [INFO ] Deduced a trap composed of 100 places in 148 ms of which 3 ms to minimize.
[2024-05-23 00:56:05] [INFO ] Deduced a trap composed of 77 places in 172 ms of which 3 ms to minimize.
[2024-05-23 00:56:06] [INFO ] Deduced a trap composed of 76 places in 164 ms of which 3 ms to minimize.
[2024-05-23 00:56:06] [INFO ] Deduced a trap composed of 141 places in 199 ms of which 3 ms to minimize.
[2024-05-23 00:56:06] [INFO ] Deduced a trap composed of 123 places in 139 ms of which 3 ms to minimize.
[2024-05-23 00:56:06] [INFO ] Deduced a trap composed of 140 places in 134 ms of which 3 ms to minimize.
[2024-05-23 00:56:07] [INFO ] Deduced a trap composed of 86 places in 213 ms of which 3 ms to minimize.
SMT process timed out in 30231ms, After SMT, problems are : Problem set: 0 solved, 336 unsolved
Search for dead transitions found 0 dead transitions in 30241ms
Starting structural reductions in LTL mode, iteration 1 : 226/256 places, 343/493 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31609 ms. Remains : 226/256 places, 343/493 transitions.
[2024-05-23 00:56:07] [INFO ] Flatten gal took : 29 ms
[2024-05-23 00:56:07] [INFO ] Flatten gal took : 24 ms
[2024-05-23 00:56:07] [INFO ] Input system was already deterministic with 343 transitions.
[2024-05-23 00:56:07] [INFO ] Flatten gal took : 24 ms
[2024-05-23 00:56:07] [INFO ] Flatten gal took : 24 ms
[2024-05-23 00:56:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality3642489863581914255.gal : 7 ms
[2024-05-23 00:56:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality13018681471354924565.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3642489863581914255.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13018681471354924565.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.65241e+07,13.1623,318704,2,103628,5,934718,6,0,1250,945790,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-23 00:56:37] [INFO ] Flatten gal took : 21 ms
[2024-05-23 00:56:37] [INFO ] Applying decomposition
[2024-05-23 00:56:37] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13445888151849546506.txt' '-o' '/tmp/graph13445888151849546506.bin' '-w' '/tmp/graph13445888151849546506.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13445888151849546506.bin' '-l' '-1' '-v' '-w' '/tmp/graph13445888151849546506.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:56:37] [INFO ] Decomposing Gal with order
[2024-05-23 00:56:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:56:37] [INFO ] Removed a total of 538 redundant transitions.
[2024-05-23 00:56:37] [INFO ] Flatten gal took : 41 ms
[2024-05-23 00:56:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 17 ms.
[2024-05-23 00:56:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality7334290253793800294.gal : 16 ms
[2024-05-23 00:56:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality3103813791046968126.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/CTLCardinality7334290253793800294.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3103813791046968126.ctl'

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 -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.65241e+07,3.23517,81104,12648,26,163216,206,867,90298,39,369,0


Converting to forward existential form...Done !
original formula: EX(AG((AG(((i2.u17.ncs_3_2!=1)||(i5.u79.p3_6_1!=0))) + EF(((i1.u39.p1_2_0==0)||(i5.u90.cs_5_1==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((!(E(TRUE U !(((i2.u17.ncs_3_2!=1)||(i5.u79.p3_6_1!=0))))) + E(TRUE U ((i1.u39.p1_2_0=...195
Reverse transition relation is NOT exact ! Due to transitions t294, t295, t296, t297, t298, t299, t300, t301, t302, t303, t304, t305, t306, t307, t308, t30...685
(forward)formula 0,1,21.65,518700,1,0,989831,254,4741,803869,192,1090,5453925
FORMULA Anderson-PT-07-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 493/493 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 226 transition count 343
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 226 transition count 343
Applied a total of 60 rules in 12 ms. Remains 226 /256 variables (removed 30) and now considering 343/493 (removed 150) transitions.
// Phase 1: matrix 343 rows 226 cols
[2024-05-23 00:56:59] [INFO ] Computed 16 invariants in 4 ms
[2024-05-23 00:56:59] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-23 00:56:59] [INFO ] Invariant cache hit.
[2024-05-23 00:56:59] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-23 00:57:00] [INFO ] Implicit Places using invariants and state equation in 698 ms returned []
Implicit Place search using SMT with State Equation took 910 ms to find 0 implicit places.
Running 336 sub problems to find dead transitions.
[2024-05-23 00:57:00] [INFO ] Invariant cache hit.
[2024-05-23 00:57:00] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-23 00:57:04] [INFO ] Deduced a trap composed of 65 places in 280 ms of which 4 ms to minimize.
[2024-05-23 00:57:04] [INFO ] Deduced a trap composed of 136 places in 189 ms of which 3 ms to minimize.
[2024-05-23 00:57:06] [INFO ] Deduced a trap composed of 104 places in 146 ms of which 2 ms to minimize.
[2024-05-23 00:57:06] [INFO ] Deduced a trap composed of 51 places in 154 ms of which 3 ms to minimize.
[2024-05-23 00:57:06] [INFO ] Deduced a trap composed of 113 places in 141 ms of which 2 ms to minimize.
[2024-05-23 00:57:07] [INFO ] Deduced a trap composed of 144 places in 255 ms of which 4 ms to minimize.
[2024-05-23 00:57:07] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-23 00:57:08] [INFO ] Deduced a trap composed of 104 places in 133 ms of which 2 ms to minimize.
[2024-05-23 00:57:09] [INFO ] Deduced a trap composed of 85 places in 204 ms of which 3 ms to minimize.
[2024-05-23 00:57:09] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 2 ms to minimize.
[2024-05-23 00:57:09] [INFO ] Deduced a trap composed of 65 places in 131 ms of which 2 ms to minimize.
[2024-05-23 00:57:10] [INFO ] Deduced a trap composed of 73 places in 160 ms of which 3 ms to minimize.
[2024-05-23 00:57:10] [INFO ] Deduced a trap composed of 97 places in 202 ms of which 3 ms to minimize.
[2024-05-23 00:57:11] [INFO ] Deduced a trap composed of 81 places in 163 ms of which 3 ms to minimize.
[2024-05-23 00:57:11] [INFO ] Deduced a trap composed of 78 places in 139 ms of which 3 ms to minimize.
[2024-05-23 00:57:11] [INFO ] Deduced a trap composed of 86 places in 142 ms of which 2 ms to minimize.
[2024-05-23 00:57:11] [INFO ] Deduced a trap composed of 123 places in 136 ms of which 3 ms to minimize.
[2024-05-23 00:57:11] [INFO ] Deduced a trap composed of 108 places in 190 ms of which 2 ms to minimize.
[2024-05-23 00:57:12] [INFO ] Deduced a trap composed of 91 places in 204 ms of which 3 ms to minimize.
[2024-05-23 00:57:12] [INFO ] Deduced a trap composed of 80 places in 151 ms of which 5 ms to minimize.
[2024-05-23 00:57:12] [INFO ] Deduced a trap composed of 131 places in 165 ms of which 3 ms to minimize.
[2024-05-23 00:57:13] [INFO ] Deduced a trap composed of 79 places in 249 ms of which 3 ms to minimize.
[2024-05-23 00:57:13] [INFO ] Deduced a trap composed of 80 places in 249 ms of which 4 ms to minimize.
[2024-05-23 00:57:13] [INFO ] Deduced a trap composed of 128 places in 206 ms of which 3 ms to minimize.
[2024-05-23 00:57:13] [INFO ] Deduced a trap composed of 94 places in 267 ms of which 4 ms to minimize.
[2024-05-23 00:57:14] [INFO ] Deduced a trap composed of 85 places in 175 ms of which 4 ms to minimize.
[2024-05-23 00:57:14] [INFO ] Deduced a trap composed of 81 places in 250 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-23 00:57:18] [INFO ] Deduced a trap composed of 111 places in 201 ms of which 2 ms to minimize.
[2024-05-23 00:57:18] [INFO ] Deduced a trap composed of 75 places in 159 ms of which 3 ms to minimize.
[2024-05-23 00:57:18] [INFO ] Deduced a trap composed of 54 places in 132 ms of which 2 ms to minimize.
[2024-05-23 00:57:18] [INFO ] Deduced a trap composed of 79 places in 208 ms of which 4 ms to minimize.
[2024-05-23 00:57:19] [INFO ] Deduced a trap composed of 126 places in 131 ms of which 5 ms to minimize.
[2024-05-23 00:57:19] [INFO ] Deduced a trap composed of 103 places in 130 ms of which 2 ms to minimize.
[2024-05-23 00:57:19] [INFO ] Deduced a trap composed of 95 places in 182 ms of which 3 ms to minimize.
[2024-05-23 00:57:19] [INFO ] Deduced a trap composed of 95 places in 127 ms of which 3 ms to minimize.
[2024-05-23 00:57:19] [INFO ] Deduced a trap composed of 96 places in 130 ms of which 2 ms to minimize.
[2024-05-23 00:57:20] [INFO ] Deduced a trap composed of 92 places in 203 ms of which 4 ms to minimize.
[2024-05-23 00:57:20] [INFO ] Deduced a trap composed of 91 places in 204 ms of which 4 ms to minimize.
[2024-05-23 00:57:20] [INFO ] Deduced a trap composed of 89 places in 205 ms of which 4 ms to minimize.
[2024-05-23 00:57:20] [INFO ] Deduced a trap composed of 90 places in 264 ms of which 4 ms to minimize.
[2024-05-23 00:57:20] [INFO ] Deduced a trap composed of 88 places in 130 ms of which 2 ms to minimize.
[2024-05-23 00:57:21] [INFO ] Deduced a trap composed of 84 places in 206 ms of which 4 ms to minimize.
[2024-05-23 00:57:21] [INFO ] Deduced a trap composed of 103 places in 203 ms of which 4 ms to minimize.
[2024-05-23 00:57:21] [INFO ] Deduced a trap composed of 85 places in 248 ms of which 4 ms to minimize.
[2024-05-23 00:57:23] [INFO ] Deduced a trap composed of 128 places in 194 ms of which 3 ms to minimize.
[2024-05-23 00:57:23] [INFO ] Deduced a trap composed of 151 places in 192 ms of which 3 ms to minimize.
[2024-05-23 00:57:23] [INFO ] Deduced a trap composed of 117 places in 187 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-23 00:57:25] [INFO ] Deduced a trap composed of 116 places in 202 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-23 00:57:29] [INFO ] Deduced a trap composed of 135 places in 252 ms of which 4 ms to minimize.
[2024-05-23 00:57:29] [INFO ] Deduced a trap composed of 70 places in 182 ms of which 2 ms to minimize.
[2024-05-23 00:57:30] [INFO ] Deduced a trap composed of 59 places in 161 ms of which 3 ms to minimize.
[2024-05-23 00:57:30] [INFO ] Deduced a trap composed of 74 places in 257 ms of which 4 ms to minimize.
[2024-05-23 00:57:30] [INFO ] Deduced a trap composed of 109 places in 178 ms of which 3 ms to minimize.
SMT process timed out in 30300ms, After SMT, problems are : Problem set: 0 solved, 336 unsolved
Search for dead transitions found 0 dead transitions in 30305ms
Starting structural reductions in LTL mode, iteration 1 : 226/256 places, 343/493 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31229 ms. Remains : 226/256 places, 343/493 transitions.
[2024-05-23 00:57:30] [INFO ] Flatten gal took : 18 ms
[2024-05-23 00:57:30] [INFO ] Flatten gal took : 21 ms
[2024-05-23 00:57:30] [INFO ] Input system was already deterministic with 343 transitions.
[2024-05-23 00:57:30] [INFO ] Flatten gal took : 19 ms
[2024-05-23 00:57:30] [INFO ] Flatten gal took : 18 ms
[2024-05-23 00:57:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality9281913720076936492.gal : 4 ms
[2024-05-23 00:57:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality8942347366750351714.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/CTLCardinality9281913720076936492.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8942347366750351714.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.66064e+07,14.6695,343564,2,105346,5,1.02943e+06,6,0,1250,1.04275e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-23 00:58:00] [INFO ] Flatten gal took : 20 ms
[2024-05-23 00:58:00] [INFO ] Applying decomposition
[2024-05-23 00:58:00] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6030357940188950697.txt' '-o' '/tmp/graph6030357940188950697.bin' '-w' '/tmp/graph6030357940188950697.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6030357940188950697.bin' '-l' '-1' '-v' '-w' '/tmp/graph6030357940188950697.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:58:00] [INFO ] Decomposing Gal with order
[2024-05-23 00:58:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:58:01] [INFO ] Removed a total of 544 redundant transitions.
[2024-05-23 00:58:01] [INFO ] Flatten gal took : 54 ms
[2024-05-23 00:58:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 15 ms.
[2024-05-23 00:58:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality10704772740007061063.gal : 15 ms
[2024-05-23 00:58:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality13592213915143008363.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10704772740007061063.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13592213915143008363.ctl'

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 -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.66064e+07,17.1706,248352,20167,26,507423,254,937,393991,39,492,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 256/256 places, 493/493 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 256 transition count 444
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 207 transition count 444
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 98 place count 207 transition count 403
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 180 place count 166 transition count 403
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 212 place count 134 transition count 239
Iterating global reduction 2 with 32 rules applied. Total rules applied 244 place count 134 transition count 239
Applied a total of 244 rules in 56 ms. Remains 134 /256 variables (removed 122) and now considering 239/493 (removed 254) transitions.
// Phase 1: matrix 239 rows 134 cols
[2024-05-23 00:58:31] [INFO ] Computed 16 invariants in 4 ms
[2024-05-23 00:58:31] [INFO ] Implicit Places using invariants in 730 ms returned []
[2024-05-23 00:58:31] [INFO ] Invariant cache hit.
[2024-05-23 00:58:32] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-23 00:58:32] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 1153 ms to find 0 implicit places.
[2024-05-23 00:58:32] [INFO ] Redundant transitions in 19 ms returned []
Running 232 sub problems to find dead transitions.
[2024-05-23 00:58:32] [INFO ] Invariant cache hit.
[2024-05-23 00:58:32] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 1/134 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-23 00:58:36] [INFO ] Deduced a trap composed of 57 places in 99 ms of which 2 ms to minimize.
[2024-05-23 00:58:37] [INFO ] Deduced a trap composed of 52 places in 115 ms of which 3 ms to minimize.
[2024-05-23 00:58:37] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 2 ms to minimize.
[2024-05-23 00:58:37] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 2 ms to minimize.
[2024-05-23 00:58:37] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 2 ms to minimize.
[2024-05-23 00:58:37] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 2 ms to minimize.
[2024-05-23 00:58:37] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 2 ms to minimize.
[2024-05-23 00:58:37] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 2 ms to minimize.
[2024-05-23 00:58:37] [INFO ] Deduced a trap composed of 52 places in 106 ms of which 2 ms to minimize.
[2024-05-23 00:58:37] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 2 ms to minimize.
[2024-05-23 00:58:38] [INFO ] Deduced a trap composed of 54 places in 108 ms of which 3 ms to minimize.
[2024-05-23 00:58:38] [INFO ] Deduced a trap composed of 52 places in 103 ms of which 1 ms to minimize.
[2024-05-23 00:58:38] [INFO ] Deduced a trap composed of 57 places in 117 ms of which 2 ms to minimize.
[2024-05-23 00:58:38] [INFO ] Deduced a trap composed of 63 places in 116 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-23 00:58:39] [INFO ] Deduced a trap composed of 50 places in 130 ms of which 3 ms to minimize.
[2024-05-23 00:58:39] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 2 ms to minimize.
[2024-05-23 00:58:39] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 5 ms to minimize.
[2024-05-23 00:58:40] [INFO ] Deduced a trap composed of 51 places in 112 ms of which 3 ms to minimize.
[2024-05-23 00:58:40] [INFO ] Deduced a trap composed of 62 places in 132 ms of which 3 ms to minimize.
[2024-05-23 00:58:40] [INFO ] Deduced a trap composed of 65 places in 171 ms of which 3 ms to minimize.
[2024-05-23 00:58:40] [INFO ] Deduced a trap composed of 66 places in 109 ms of which 2 ms to minimize.
[2024-05-23 00:58:40] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 2 ms to minimize.
[2024-05-23 00:58:40] [INFO ] Deduced a trap composed of 53 places in 149 ms of which 3 ms to minimize.
[2024-05-23 00:58:40] [INFO ] Deduced a trap composed of 34 places in 170 ms of which 3 ms to minimize.
[2024-05-23 00:58:41] [INFO ] Deduced a trap composed of 39 places in 163 ms of which 3 ms to minimize.
[2024-05-23 00:58:41] [INFO ] Deduced a trap composed of 44 places in 174 ms of which 3 ms to minimize.
[2024-05-23 00:58:41] [INFO ] Deduced a trap composed of 59 places in 177 ms of which 3 ms to minimize.
[2024-05-23 00:58:41] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 2 ms to minimize.
[2024-05-23 00:58:41] [INFO ] Deduced a trap composed of 36 places in 172 ms of which 3 ms to minimize.
[2024-05-23 00:58:42] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 2 ms to minimize.
[2024-05-23 00:58:42] [INFO ] Deduced a trap composed of 55 places in 168 ms of which 3 ms to minimize.
[2024-05-23 00:58:42] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2024-05-23 00:58:42] [INFO ] Deduced a trap composed of 36 places in 170 ms of which 3 ms to minimize.
[2024-05-23 00:58:42] [INFO ] Deduced a trap composed of 52 places in 171 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-23 00:58:44] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 2 ms to minimize.
[2024-05-23 00:58:44] [INFO ] Deduced a trap composed of 53 places in 161 ms of which 3 ms to minimize.
[2024-05-23 00:58:44] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (OVERLAPS) 239/373 variables, 134/187 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 42/229 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/373 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 11 (OVERLAPS) 0/373 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 229 constraints, problems are : Problem set: 0 solved, 232 unsolved in 23143 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 134/134 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (OVERLAPS) 1/134 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-23 00:59:16] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 134/373 variables, and 54 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/134 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/232 constraints, Known Traps: 38/38 constraints]
After SMT, in 53384ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 53389ms
Starting structural reductions in SI_CTL mode, iteration 1 : 134/256 places, 239/493 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54627 ms. Remains : 134/256 places, 239/493 transitions.
[2024-05-23 00:59:25] [INFO ] Flatten gal took : 12 ms
[2024-05-23 00:59:25] [INFO ] Flatten gal took : 12 ms
[2024-05-23 00:59:25] [INFO ] Input system was already deterministic with 239 transitions.
[2024-05-23 00:59:25] [INFO ] Flatten gal took : 11 ms
[2024-05-23 00:59:25] [INFO ] Flatten gal took : 15 ms
[2024-05-23 00:59:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality18414459507096064684.gal : 14 ms
[2024-05-23 00:59:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality12112838025219511323.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/CTLCardinality18414459507096064684.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12112838025219511323.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,382361,3.49539,87324,2,32815,5,252999,6,0,778,187679,0


Converting to forward existential form...Done !
original formula: EF(AG((p2_2_0==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p2_2_0==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t149, t150, t151, t152, t153, t154, t155, t156, t157, t158, t159, t160, t161, t162, t163, t16...456
(forward)formula 0,0,29.6814,593708,1,0,546,2.8085e+06,500,252,6425,1.07928e+06,516
FORMULA Anderson-PT-07-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 256/256 places, 493/493 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 256 transition count 444
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 207 transition count 444
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 98 place count 207 transition count 403
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 180 place count 166 transition count 403
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 211 place count 135 transition count 240
Iterating global reduction 2 with 31 rules applied. Total rules applied 242 place count 135 transition count 240
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 244 place count 134 transition count 239
Applied a total of 244 rules in 38 ms. Remains 134 /256 variables (removed 122) and now considering 239/493 (removed 254) transitions.
// Phase 1: matrix 239 rows 134 cols
[2024-05-23 00:59:55] [INFO ] Computed 16 invariants in 2 ms
[2024-05-23 00:59:56] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-05-23 00:59:56] [INFO ] Invariant cache hit.
[2024-05-23 00:59:56] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-23 00:59:56] [INFO ] Implicit Places using invariants and state equation in 652 ms returned []
Implicit Place search using SMT with State Equation took 918 ms to find 0 implicit places.
[2024-05-23 00:59:56] [INFO ] Redundant transitions in 20 ms returned []
Running 232 sub problems to find dead transitions.
[2024-05-23 00:59:56] [INFO ] Invariant cache hit.
[2024-05-23 00:59:56] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 1/134 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-23 01:00:02] [INFO ] Deduced a trap composed of 61 places in 170 ms of which 3 ms to minimize.
[2024-05-23 01:00:02] [INFO ] Deduced a trap composed of 43 places in 186 ms of which 2 ms to minimize.
[2024-05-23 01:00:02] [INFO ] Deduced a trap composed of 40 places in 179 ms of which 3 ms to minimize.
[2024-05-23 01:00:03] [INFO ] Deduced a trap composed of 47 places in 185 ms of which 2 ms to minimize.
[2024-05-23 01:00:03] [INFO ] Deduced a trap composed of 68 places in 167 ms of which 3 ms to minimize.
[2024-05-23 01:00:03] [INFO ] Deduced a trap composed of 49 places in 173 ms of which 3 ms to minimize.
[2024-05-23 01:00:03] [INFO ] Deduced a trap composed of 62 places in 162 ms of which 3 ms to minimize.
[2024-05-23 01:00:03] [INFO ] Deduced a trap composed of 63 places in 158 ms of which 3 ms to minimize.
[2024-05-23 01:00:04] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 2 ms to minimize.
[2024-05-23 01:00:04] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 3 ms to minimize.
[2024-05-23 01:00:04] [INFO ] Deduced a trap composed of 62 places in 135 ms of which 2 ms to minimize.
[2024-05-23 01:00:04] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 3 ms to minimize.
[2024-05-23 01:00:04] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 2 ms to minimize.
[2024-05-23 01:00:04] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 2 ms to minimize.
[2024-05-23 01:00:04] [INFO ] Deduced a trap composed of 52 places in 125 ms of which 2 ms to minimize.
[2024-05-23 01:00:05] [INFO ] Deduced a trap composed of 59 places in 137 ms of which 2 ms to minimize.
[2024-05-23 01:00:05] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 3 ms to minimize.
[2024-05-23 01:00:05] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 7 ms to minimize.
[2024-05-23 01:00:05] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 2 ms to minimize.
[2024-05-23 01:00:05] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-23 01:00:06] [INFO ] Deduced a trap composed of 46 places in 149 ms of which 2 ms to minimize.
[2024-05-23 01:00:06] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 3 ms to minimize.
[2024-05-23 01:00:06] [INFO ] Deduced a trap composed of 44 places in 145 ms of which 2 ms to minimize.
[2024-05-23 01:00:07] [INFO ] Deduced a trap composed of 63 places in 133 ms of which 2 ms to minimize.
[2024-05-23 01:00:07] [INFO ] Deduced a trap composed of 49 places in 113 ms of which 2 ms to minimize.
[2024-05-23 01:00:07] [INFO ] Deduced a trap composed of 47 places in 131 ms of which 3 ms to minimize.
[2024-05-23 01:00:07] [INFO ] Deduced a trap composed of 66 places in 161 ms of which 2 ms to minimize.
[2024-05-23 01:00:07] [INFO ] Deduced a trap composed of 45 places in 110 ms of which 2 ms to minimize.
[2024-05-23 01:00:08] [INFO ] Deduced a trap composed of 59 places in 149 ms of which 2 ms to minimize.
[2024-05-23 01:00:08] [INFO ] Deduced a trap composed of 61 places in 155 ms of which 3 ms to minimize.
[2024-05-23 01:00:08] [INFO ] Deduced a trap composed of 60 places in 156 ms of which 2 ms to minimize.
[2024-05-23 01:00:08] [INFO ] Deduced a trap composed of 70 places in 172 ms of which 3 ms to minimize.
[2024-05-23 01:00:08] [INFO ] Deduced a trap composed of 69 places in 104 ms of which 2 ms to minimize.
[2024-05-23 01:00:09] [INFO ] Deduced a trap composed of 59 places in 110 ms of which 2 ms to minimize.
[2024-05-23 01:00:09] [INFO ] Deduced a trap composed of 67 places in 93 ms of which 2 ms to minimize.
[2024-05-23 01:00:09] [INFO ] Deduced a trap composed of 55 places in 148 ms of which 3 ms to minimize.
[2024-05-23 01:00:09] [INFO ] Deduced a trap composed of 67 places in 138 ms of which 2 ms to minimize.
[2024-05-23 01:00:09] [INFO ] Deduced a trap composed of 60 places in 140 ms of which 2 ms to minimize.
[2024-05-23 01:00:09] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 3 ms to minimize.
[2024-05-23 01:00:09] [INFO ] Deduced a trap composed of 55 places in 81 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-23 01:00:11] [INFO ] Deduced a trap composed of 57 places in 112 ms of which 2 ms to minimize.
[2024-05-23 01:00:11] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 1 ms to minimize.
[2024-05-23 01:00:11] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 2 ms to minimize.
[2024-05-23 01:00:11] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 2 ms to minimize.
[2024-05-23 01:00:11] [INFO ] Deduced a trap composed of 36 places in 134 ms of which 3 ms to minimize.
[2024-05-23 01:00:11] [INFO ] Deduced a trap composed of 58 places in 106 ms of which 2 ms to minimize.
[2024-05-23 01:00:11] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 2 ms to minimize.
[2024-05-23 01:00:11] [INFO ] Deduced a trap composed of 53 places in 105 ms of which 2 ms to minimize.
[2024-05-23 01:00:12] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 1 ms to minimize.
[2024-05-23 01:00:12] [INFO ] Deduced a trap composed of 55 places in 92 ms of which 1 ms to minimize.
[2024-05-23 01:00:12] [INFO ] Deduced a trap composed of 53 places in 136 ms of which 3 ms to minimize.
[2024-05-23 01:00:12] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 2 ms to minimize.
[2024-05-23 01:00:12] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 1 ms to minimize.
[2024-05-23 01:00:12] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 3 ms to minimize.
[2024-05-23 01:00:12] [INFO ] Deduced a trap composed of 64 places in 139 ms of which 3 ms to minimize.
[2024-05-23 01:00:12] [INFO ] Deduced a trap composed of 54 places in 135 ms of which 3 ms to minimize.
[2024-05-23 01:00:13] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 1 ms to minimize.
[2024-05-23 01:00:13] [INFO ] Deduced a trap composed of 57 places in 88 ms of which 2 ms to minimize.
[2024-05-23 01:00:13] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 2 ms to minimize.
[2024-05-23 01:00:13] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (OVERLAPS) 239/373 variables, 134/210 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 42/252 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/373 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-23 01:00:23] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 2 ms to minimize.
[2024-05-23 01:00:23] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 4 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/373 variables, 2/254 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-23 01:00:26] [INFO ] Deduced a trap composed of 34 places in 138 ms of which 3 ms to minimize.
[2024-05-23 01:00:27] [INFO ] Deduced a trap composed of 36 places in 178 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 373/373 variables, and 256 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 134/134 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 64/64 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 50/63 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (OVERLAPS) 1/134 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 14/80 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-23 01:00:30] [INFO ] Deduced a trap composed of 57 places in 143 ms of which 3 ms to minimize.
[2024-05-23 01:00:30] [INFO ] Deduced a trap composed of 45 places in 176 ms of which 2 ms to minimize.
[2024-05-23 01:00:31] [INFO ] Deduced a trap composed of 49 places in 113 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 134/373 variables, and 83 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/134 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/232 constraints, Known Traps: 67/67 constraints]
After SMT, in 60287ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 60294ms
Starting structural reductions in SI_CTL mode, iteration 1 : 134/256 places, 239/493 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61286 ms. Remains : 134/256 places, 239/493 transitions.
[2024-05-23 01:00:57] [INFO ] Flatten gal took : 8 ms
[2024-05-23 01:00:57] [INFO ] Flatten gal took : 24 ms
[2024-05-23 01:00:57] [INFO ] Input system was already deterministic with 239 transitions.
[2024-05-23 01:00:57] [INFO ] Flatten gal took : 9 ms
[2024-05-23 01:00:57] [INFO ] Flatten gal took : 9 ms
[2024-05-23 01:00:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality3448960903183481490.gal : 3 ms
[2024-05-23 01:00:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality6690250874866705981.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/CTLCardinality3448960903183481490.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6690250874866705981.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,364745,3.87152,97336,2,35693,5,275958,6,0,778,217618,0


Converting to forward existential form...Done !
original formula: AF(AG((p1_6_0==0)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((p1_6_0==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t91, t92, t93, t94, t95, t96, t98, t99, t100, t101, t102, t103, t105, t106, t107, t108, t109,...670
Detected timeout of ITS tools.
[2024-05-23 01:01:27] [INFO ] Flatten gal took : 9 ms
[2024-05-23 01:01:27] [INFO ] Applying decomposition
[2024-05-23 01:01:27] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph929424362251096072.txt' '-o' '/tmp/graph929424362251096072.bin' '-w' '/tmp/graph929424362251096072.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph929424362251096072.bin' '-l' '-1' '-v' '-w' '/tmp/graph929424362251096072.weights' '-q' '0' '-e' '0.001'
[2024-05-23 01:01:27] [INFO ] Decomposing Gal with order
[2024-05-23 01:01:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 01:01:27] [INFO ] Removed a total of 417 redundant transitions.
[2024-05-23 01:01:27] [INFO ] Flatten gal took : 35 ms
[2024-05-23 01:01:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 23 ms.
[2024-05-23 01:01:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality7871574598527531313.gal : 19 ms
[2024-05-23 01:01:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality16132260240264974377.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/CTLCardinality7871574598527531313.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16132260240264974377.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,364745,1.64637,51864,6528,96,70032,394,672,240901,70,1138,0


Converting to forward existential form...Done !
original formula: AF(AG((i8.i1.u21.p1_6_0==0)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((i8.i1.u21.p1_6_0==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t94, t95, t96, t114, t148, t149, t150, t151, t152, t153, t154, t155, t156, t157, t158, t159, ...672
(forward)formula 0,0,11.0148,231596,1,0,287591,1805,3330,956698,267,16725,2072839
FORMULA Anderson-PT-07-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 493/493 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 229 transition count 370
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 229 transition count 370
Applied a total of 54 rules in 6 ms. Remains 229 /256 variables (removed 27) and now considering 370/493 (removed 123) transitions.
// Phase 1: matrix 370 rows 229 cols
[2024-05-23 01:01:38] [INFO ] Computed 16 invariants in 3 ms
[2024-05-23 01:01:39] [INFO ] Implicit Places using invariants in 414 ms returned []
[2024-05-23 01:01:39] [INFO ] Invariant cache hit.
[2024-05-23 01:01:39] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-23 01:01:40] [INFO ] Implicit Places using invariants and state equation in 1162 ms returned []
Implicit Place search using SMT with State Equation took 1596 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2024-05-23 01:01:40] [INFO ] Invariant cache hit.
[2024-05-23 01:01:40] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-23 01:01:44] [INFO ] Deduced a trap composed of 114 places in 240 ms of which 5 ms to minimize.
[2024-05-23 01:01:45] [INFO ] Deduced a trap composed of 112 places in 267 ms of which 5 ms to minimize.
[2024-05-23 01:01:46] [INFO ] Deduced a trap composed of 69 places in 270 ms of which 14 ms to minimize.
[2024-05-23 01:01:46] [INFO ] Deduced a trap composed of 91 places in 240 ms of which 3 ms to minimize.
[2024-05-23 01:01:46] [INFO ] Deduced a trap composed of 79 places in 244 ms of which 4 ms to minimize.
[2024-05-23 01:01:47] [INFO ] Deduced a trap composed of 62 places in 235 ms of which 4 ms to minimize.
[2024-05-23 01:01:47] [INFO ] Deduced a trap composed of 96 places in 272 ms of which 4 ms to minimize.
[2024-05-23 01:01:47] [INFO ] Deduced a trap composed of 70 places in 251 ms of which 4 ms to minimize.
[2024-05-23 01:01:47] [INFO ] Deduced a trap composed of 67 places in 259 ms of which 4 ms to minimize.
[2024-05-23 01:01:48] [INFO ] Deduced a trap composed of 121 places in 250 ms of which 4 ms to minimize.
[2024-05-23 01:01:48] [INFO ] Deduced a trap composed of 133 places in 262 ms of which 4 ms to minimize.
[2024-05-23 01:01:49] [INFO ] Deduced a trap composed of 103 places in 246 ms of which 4 ms to minimize.
[2024-05-23 01:01:49] [INFO ] Deduced a trap composed of 107 places in 265 ms of which 4 ms to minimize.
[2024-05-23 01:01:50] [INFO ] Deduced a trap composed of 85 places in 251 ms of which 4 ms to minimize.
[2024-05-23 01:01:50] [INFO ] Deduced a trap composed of 84 places in 258 ms of which 4 ms to minimize.
[2024-05-23 01:01:50] [INFO ] Deduced a trap composed of 98 places in 257 ms of which 4 ms to minimize.
[2024-05-23 01:01:50] [INFO ] Deduced a trap composed of 118 places in 254 ms of which 4 ms to minimize.
[2024-05-23 01:01:51] [INFO ] Deduced a trap composed of 94 places in 265 ms of which 4 ms to minimize.
[2024-05-23 01:01:52] [INFO ] Deduced a trap composed of 133 places in 213 ms of which 3 ms to minimize.
[2024-05-23 01:01:52] [INFO ] Deduced a trap composed of 131 places in 253 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-23 01:01:53] [INFO ] Deduced a trap composed of 133 places in 248 ms of which 4 ms to minimize.
[2024-05-23 01:01:53] [INFO ] Deduced a trap composed of 124 places in 235 ms of which 4 ms to minimize.
[2024-05-23 01:01:54] [INFO ] Deduced a trap composed of 71 places in 275 ms of which 3 ms to minimize.
[2024-05-23 01:01:54] [INFO ] Deduced a trap composed of 86 places in 242 ms of which 4 ms to minimize.
[2024-05-23 01:01:54] [INFO ] Deduced a trap composed of 82 places in 241 ms of which 4 ms to minimize.
[2024-05-23 01:01:55] [INFO ] Deduced a trap composed of 117 places in 248 ms of which 4 ms to minimize.
[2024-05-23 01:01:55] [INFO ] Deduced a trap composed of 99 places in 241 ms of which 3 ms to minimize.
[2024-05-23 01:01:55] [INFO ] Deduced a trap composed of 139 places in 251 ms of which 3 ms to minimize.
[2024-05-23 01:01:55] [INFO ] Deduced a trap composed of 85 places in 249 ms of which 4 ms to minimize.
[2024-05-23 01:01:56] [INFO ] Deduced a trap composed of 150 places in 246 ms of which 3 ms to minimize.
[2024-05-23 01:01:56] [INFO ] Deduced a trap composed of 67 places in 231 ms of which 4 ms to minimize.
[2024-05-23 01:01:57] [INFO ] Deduced a trap composed of 116 places in 258 ms of which 3 ms to minimize.
[2024-05-23 01:01:57] [INFO ] Deduced a trap composed of 67 places in 238 ms of which 4 ms to minimize.
[2024-05-23 01:01:57] [INFO ] Deduced a trap composed of 130 places in 259 ms of which 4 ms to minimize.
[2024-05-23 01:01:58] [INFO ] Deduced a trap composed of 61 places in 248 ms of which 4 ms to minimize.
[2024-05-23 01:01:58] [INFO ] Deduced a trap composed of 94 places in 245 ms of which 4 ms to minimize.
[2024-05-23 01:01:58] [INFO ] Deduced a trap composed of 87 places in 244 ms of which 4 ms to minimize.
[2024-05-23 01:01:58] [INFO ] Deduced a trap composed of 85 places in 255 ms of which 4 ms to minimize.
[2024-05-23 01:01:59] [INFO ] Deduced a trap composed of 82 places in 262 ms of which 4 ms to minimize.
[2024-05-23 01:01:59] [INFO ] Deduced a trap composed of 96 places in 254 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-23 01:02:05] [INFO ] Deduced a trap composed of 71 places in 248 ms of which 4 ms to minimize.
[2024-05-23 01:02:05] [INFO ] Deduced a trap composed of 84 places in 269 ms of which 4 ms to minimize.
[2024-05-23 01:02:05] [INFO ] Deduced a trap composed of 110 places in 288 ms of which 4 ms to minimize.
[2024-05-23 01:02:06] [INFO ] Deduced a trap composed of 112 places in 250 ms of which 4 ms to minimize.
[2024-05-23 01:02:06] [INFO ] Deduced a trap composed of 136 places in 246 ms of which 4 ms to minimize.
[2024-05-23 01:02:07] [INFO ] Deduced a trap composed of 89 places in 241 ms of which 6 ms to minimize.
[2024-05-23 01:02:07] [INFO ] Deduced a trap composed of 75 places in 243 ms of which 4 ms to minimize.
[2024-05-23 01:02:07] [INFO ] Deduced a trap composed of 71 places in 281 ms of which 4 ms to minimize.
[2024-05-23 01:02:09] [INFO ] Deduced a trap composed of 90 places in 242 ms of which 4 ms to minimize.
[2024-05-23 01:02:09] [INFO ] Deduced a trap composed of 133 places in 250 ms of which 4 ms to minimize.
[2024-05-23 01:02:09] [INFO ] Deduced a trap composed of 89 places in 263 ms of which 4 ms to minimize.
[2024-05-23 01:02:10] [INFO ] Deduced a trap composed of 129 places in 260 ms of which 4 ms to minimize.
[2024-05-23 01:02:10] [INFO ] Deduced a trap composed of 70 places in 242 ms of which 4 ms to minimize.
[2024-05-23 01:02:10] [INFO ] Deduced a trap composed of 109 places in 252 ms of which 4 ms to minimize.
SMT process timed out in 30481ms, After SMT, problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 30489ms
Starting structural reductions in LTL mode, iteration 1 : 229/256 places, 370/493 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32095 ms. Remains : 229/256 places, 370/493 transitions.
[2024-05-23 01:02:10] [INFO ] Flatten gal took : 15 ms
[2024-05-23 01:02:10] [INFO ] Flatten gal took : 17 ms
[2024-05-23 01:02:10] [INFO ] Input system was already deterministic with 370 transitions.
[2024-05-23 01:02:10] [INFO ] Flatten gal took : 20 ms
[2024-05-23 01:02:10] [INFO ] Flatten gal took : 10 ms
[2024-05-23 01:02:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality7065641933024723418.gal : 3 ms
[2024-05-23 01:02:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality2082806432321675667.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/CTLCardinality7065641933024723418.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2082806432321675667.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.99207e+07,17.7198,401160,2,113021,5,1.23639e+06,6,0,1289,1.23033e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-23 01:02:40] [INFO ] Flatten gal took : 11 ms
[2024-05-23 01:02:40] [INFO ] Applying decomposition
[2024-05-23 01:02:40] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10817132450290991554.txt' '-o' '/tmp/graph10817132450290991554.bin' '-w' '/tmp/graph10817132450290991554.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10817132450290991554.bin' '-l' '-1' '-v' '-w' '/tmp/graph10817132450290991554.weights' '-q' '0' '-e' '0.001'
[2024-05-23 01:02:41] [INFO ] Decomposing Gal with order
[2024-05-23 01:02:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 01:02:41] [INFO ] Removed a total of 619 redundant transitions.
[2024-05-23 01:02:41] [INFO ] Flatten gal took : 27 ms
[2024-05-23 01:02:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 9 ms.
[2024-05-23 01:02:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality4779506994307042434.gal : 7 ms
[2024-05-23 01:02:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality5648206421543317406.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/CTLCardinality4779506994307042434.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5648206421543317406.ctl'

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 -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.99207e+07,4.388,95012,12194,25,182882,210,975,134671,38,425,0


Converting to forward existential form...Done !
original formula: EF((AX(EF(((((i8.u13.ncs_1_4==0)||(i2.i1.u3.next_8==1))&&(i2.i0.u79.ncs_5_3==1))||(i2.i0.u55.p2_5_4==1)))) + (!(A((AF(((i9.u90.cs_3_0==0)...386
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(!(E(TRUE U ((((i8.u13.ncs_1_4==0)||(i2.i1.u3.next_8==1))&&(i2.i0.u79.ncs_5_3==1))||(i2...806
Reverse transition relation is NOT exact ! Due to transitions t26, t27, t28, t29, t32, t33, t35, t321, t322, t323, t324, t325, t326, t327, t328, t329, t330...753
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 256/256 places, 493/493 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 256 transition count 445
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 49 rules applied. Total rules applied 97 place count 208 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 207 transition count 444
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 98 place count 207 transition count 402
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 182 place count 165 transition count 402
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 214 place count 133 transition count 238
Iterating global reduction 3 with 32 rules applied. Total rules applied 246 place count 133 transition count 238
Applied a total of 246 rules in 26 ms. Remains 133 /256 variables (removed 123) and now considering 238/493 (removed 255) transitions.
// Phase 1: matrix 238 rows 133 cols
[2024-05-23 01:03:11] [INFO ] Computed 16 invariants in 2 ms
[2024-05-23 01:03:11] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-23 01:03:11] [INFO ] Invariant cache hit.
[2024-05-23 01:03:11] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-23 01:03:11] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2024-05-23 01:03:11] [INFO ] Redundant transitions in 3 ms returned []
Running 231 sub problems to find dead transitions.
[2024-05-23 01:03:11] [INFO ] Invariant cache hit.
[2024-05-23 01:03:11] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (OVERLAPS) 1/133 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-23 01:03:16] [INFO ] Deduced a trap composed of 62 places in 141 ms of which 2 ms to minimize.
[2024-05-23 01:03:16] [INFO ] Deduced a trap composed of 58 places in 177 ms of which 3 ms to minimize.
[2024-05-23 01:03:16] [INFO ] Deduced a trap composed of 47 places in 146 ms of which 3 ms to minimize.
[2024-05-23 01:03:16] [INFO ] Deduced a trap composed of 62 places in 164 ms of which 2 ms to minimize.
[2024-05-23 01:03:16] [INFO ] Deduced a trap composed of 52 places in 172 ms of which 2 ms to minimize.
[2024-05-23 01:03:17] [INFO ] Deduced a trap composed of 34 places in 136 ms of which 2 ms to minimize.
[2024-05-23 01:03:17] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 2 ms to minimize.
[2024-05-23 01:03:17] [INFO ] Deduced a trap composed of 52 places in 133 ms of which 2 ms to minimize.
[2024-05-23 01:03:17] [INFO ] Deduced a trap composed of 50 places in 129 ms of which 3 ms to minimize.
[2024-05-23 01:03:17] [INFO ] Deduced a trap composed of 49 places in 166 ms of which 2 ms to minimize.
[2024-05-23 01:03:17] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 3 ms to minimize.
[2024-05-23 01:03:17] [INFO ] Deduced a trap composed of 44 places in 170 ms of which 3 ms to minimize.
[2024-05-23 01:03:18] [INFO ] Deduced a trap composed of 52 places in 111 ms of which 2 ms to minimize.
[2024-05-23 01:03:18] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 2 ms to minimize.
[2024-05-23 01:03:18] [INFO ] Deduced a trap composed of 33 places in 137 ms of which 3 ms to minimize.
[2024-05-23 01:03:18] [INFO ] Deduced a trap composed of 29 places in 168 ms of which 2 ms to minimize.
[2024-05-23 01:03:18] [INFO ] Deduced a trap composed of 46 places in 162 ms of which 3 ms to minimize.
[2024-05-23 01:03:18] [INFO ] Deduced a trap composed of 46 places in 136 ms of which 2 ms to minimize.
[2024-05-23 01:03:19] [INFO ] Deduced a trap composed of 54 places in 114 ms of which 3 ms to minimize.
[2024-05-23 01:03:19] [INFO ] Deduced a trap composed of 57 places in 138 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-23 01:03:20] [INFO ] Deduced a trap composed of 59 places in 164 ms of which 2 ms to minimize.
[2024-05-23 01:03:20] [INFO ] Deduced a trap composed of 44 places in 184 ms of which 2 ms to minimize.
[2024-05-23 01:03:20] [INFO ] Deduced a trap composed of 44 places in 147 ms of which 2 ms to minimize.
[2024-05-23 01:03:20] [INFO ] Deduced a trap composed of 36 places in 178 ms of which 3 ms to minimize.
[2024-05-23 01:03:20] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 2 ms to minimize.
[2024-05-23 01:03:21] [INFO ] Deduced a trap composed of 36 places in 176 ms of which 3 ms to minimize.
[2024-05-23 01:03:21] [INFO ] Deduced a trap composed of 36 places in 161 ms of which 3 ms to minimize.
[2024-05-23 01:03:21] [INFO ] Deduced a trap composed of 40 places in 170 ms of which 3 ms to minimize.
[2024-05-23 01:03:21] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (OVERLAPS) 238/371 variables, 133/178 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 42/220 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (OVERLAPS) 0/371 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 220 constraints, problems are : Problem set: 0 solved, 231 unsolved in 22733 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 133/133 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (OVERLAPS) 1/133 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-23 01:03:44] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-23 01:03:57] [INFO ] Deduced a trap composed of 52 places in 156 ms of which 3 ms to minimize.
[2024-05-23 01:03:57] [INFO ] Deduced a trap composed of 47 places in 129 ms of which 3 ms to minimize.
[2024-05-23 01:03:57] [INFO ] Deduced a trap composed of 52 places in 92 ms of which 2 ms to minimize.
[2024-05-23 01:03:57] [INFO ] Deduced a trap composed of 54 places in 133 ms of which 3 ms to minimize.
[2024-05-23 01:03:58] [INFO ] Deduced a trap composed of 48 places in 162 ms of which 2 ms to minimize.
[2024-05-23 01:03:58] [INFO ] Deduced a trap composed of 53 places in 138 ms of which 2 ms to minimize.
[2024-05-23 01:03:58] [INFO ] Deduced a trap composed of 49 places in 171 ms of which 3 ms to minimize.
[2024-05-23 01:03:59] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 3 ms to minimize.
[2024-05-23 01:04:00] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 3 ms to minimize.
[2024-05-23 01:04:00] [INFO ] Deduced a trap composed of 46 places in 129 ms of which 2 ms to minimize.
[2024-05-23 01:04:01] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 2 ms to minimize.
[2024-05-23 01:04:01] [INFO ] Deduced a trap composed of 53 places in 132 ms of which 2 ms to minimize.
[2024-05-23 01:04:01] [INFO ] Deduced a trap composed of 45 places in 153 ms of which 3 ms to minimize.
[2024-05-23 01:04:02] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 2 ms to minimize.
[2024-05-23 01:04:02] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 2 ms to minimize.
[2024-05-23 01:04:04] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 2 ms to minimize.
[2024-05-23 01:04:04] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 2 ms to minimize.
[2024-05-23 01:04:04] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 1 ms to minimize.
SMT process timed out in 52887ms, After SMT, problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 52890ms
Starting structural reductions in SI_CTL mode, iteration 1 : 133/256 places, 238/493 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53467 ms. Remains : 133/256 places, 238/493 transitions.
[2024-05-23 01:04:04] [INFO ] Flatten gal took : 10 ms
[2024-05-23 01:04:04] [INFO ] Flatten gal took : 11 ms
[2024-05-23 01:04:04] [INFO ] Input system was already deterministic with 238 transitions.
[2024-05-23 01:04:04] [INFO ] Flatten gal took : 8 ms
[2024-05-23 01:04:04] [INFO ] Flatten gal took : 8 ms
[2024-05-23 01:04:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14785799074890588732.gal : 3 ms
[2024-05-23 01:04:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16325287050866870812.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14785799074890588732.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16325287050866870812.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 40000 steps (8 resets) in 342 ms. (116 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4984 steps (0 resets) in 18 ms. (262 steps per ms) remains 0/1 properties
FORMULA Anderson-PT-07-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 493/493 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 224 transition count 329
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 224 transition count 329
Applied a total of 64 rules in 8 ms. Remains 224 /256 variables (removed 32) and now considering 329/493 (removed 164) transitions.
// Phase 1: matrix 329 rows 224 cols
[2024-05-23 01:04:04] [INFO ] Computed 16 invariants in 2 ms
[2024-05-23 01:04:05] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-05-23 01:04:05] [INFO ] Invariant cache hit.
[2024-05-23 01:04:05] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-23 01:04:06] [INFO ] Implicit Places using invariants and state equation in 1037 ms returned []
Implicit Place search using SMT with State Equation took 1407 ms to find 0 implicit places.
Running 322 sub problems to find dead transitions.
[2024-05-23 01:04:06] [INFO ] Invariant cache hit.
[2024-05-23 01:04:06] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-05-23 01:04:09] [INFO ] Deduced a trap composed of 69 places in 164 ms of which 3 ms to minimize.
[2024-05-23 01:04:10] [INFO ] Deduced a trap composed of 138 places in 226 ms of which 4 ms to minimize.
[2024-05-23 01:04:11] [INFO ] Deduced a trap composed of 131 places in 211 ms of which 3 ms to minimize.
[2024-05-23 01:04:11] [INFO ] Deduced a trap composed of 131 places in 211 ms of which 4 ms to minimize.
[2024-05-23 01:04:11] [INFO ] Deduced a trap composed of 136 places in 205 ms of which 4 ms to minimize.
[2024-05-23 01:04:11] [INFO ] Deduced a trap composed of 113 places in 210 ms of which 3 ms to minimize.
[2024-05-23 01:04:12] [INFO ] Deduced a trap composed of 129 places in 205 ms of which 4 ms to minimize.
[2024-05-23 01:04:12] [INFO ] Deduced a trap composed of 54 places in 155 ms of which 3 ms to minimize.
[2024-05-23 01:04:12] [INFO ] Deduced a trap composed of 82 places in 212 ms of which 4 ms to minimize.
[2024-05-23 01:04:12] [INFO ] Deduced a trap composed of 86 places in 228 ms of which 4 ms to minimize.
[2024-05-23 01:04:12] [INFO ] Deduced a trap composed of 99 places in 144 ms of which 2 ms to minimize.
[2024-05-23 01:04:13] [INFO ] Deduced a trap composed of 46 places in 234 ms of which 2 ms to minimize.
[2024-05-23 01:04:13] [INFO ] Deduced a trap composed of 143 places in 245 ms of which 3 ms to minimize.
[2024-05-23 01:04:13] [INFO ] Deduced a trap composed of 151 places in 238 ms of which 3 ms to minimize.
[2024-05-23 01:04:13] [INFO ] Deduced a trap composed of 82 places in 183 ms of which 3 ms to minimize.
[2024-05-23 01:04:14] [INFO ] Deduced a trap composed of 96 places in 203 ms of which 3 ms to minimize.
[2024-05-23 01:04:14] [INFO ] Deduced a trap composed of 91 places in 160 ms of which 3 ms to minimize.
[2024-05-23 01:04:14] [INFO ] Deduced a trap composed of 95 places in 158 ms of which 3 ms to minimize.
[2024-05-23 01:04:14] [INFO ] Deduced a trap composed of 89 places in 239 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 19/34 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-05-23 01:04:16] [INFO ] Deduced a trap composed of 71 places in 219 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-05-23 01:04:21] [INFO ] Deduced a trap composed of 83 places in 251 ms of which 4 ms to minimize.
[2024-05-23 01:04:23] [INFO ] Deduced a trap composed of 97 places in 182 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (OVERLAPS) 1/224 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-05-23 01:04:33] [INFO ] Deduced a trap composed of 65 places in 228 ms of which 4 ms to minimize.
[2024-05-23 01:04:34] [INFO ] Deduced a trap composed of 69 places in 164 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-05-23 01:04:35] [INFO ] Deduced a trap composed of 162 places in 163 ms of which 4 ms to minimize.
[2024-05-23 01:04:36] [INFO ] Deduced a trap composed of 129 places in 205 ms of which 3 ms to minimize.
[2024-05-23 01:04:36] [INFO ] Deduced a trap composed of 96 places in 209 ms of which 4 ms to minimize.
SMT process timed out in 30163ms, After SMT, problems are : Problem set: 0 solved, 322 unsolved
Search for dead transitions found 0 dead transitions in 30171ms
Starting structural reductions in LTL mode, iteration 1 : 224/256 places, 329/493 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31587 ms. Remains : 224/256 places, 329/493 transitions.
[2024-05-23 01:04:36] [INFO ] Flatten gal took : 9 ms
[2024-05-23 01:04:36] [INFO ] Flatten gal took : 9 ms
[2024-05-23 01:04:36] [INFO ] Input system was already deterministic with 329 transitions.
[2024-05-23 01:04:36] [INFO ] Flatten gal took : 9 ms
[2024-05-23 01:04:36] [INFO ] Flatten gal took : 9 ms
[2024-05-23 01:04:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality13378650179442529886.gal : 3 ms
[2024-05-23 01:04:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality3660778913190356195.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/CTLCardinality13378650179442529886.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3660778913190356195.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.48907e+07,7.87031,192984,2,72164,5,616978,6,0,1228,512584,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-23 01:05:06] [INFO ] Flatten gal took : 8 ms
[2024-05-23 01:05:06] [INFO ] Applying decomposition
[2024-05-23 01:05:06] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3517204996871134843.txt' '-o' '/tmp/graph3517204996871134843.bin' '-w' '/tmp/graph3517204996871134843.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3517204996871134843.bin' '-l' '-1' '-v' '-w' '/tmp/graph3517204996871134843.weights' '-q' '0' '-e' '0.001'
[2024-05-23 01:05:06] [INFO ] Decomposing Gal with order
[2024-05-23 01:05:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 01:05:06] [INFO ] Removed a total of 506 redundant transitions.
[2024-05-23 01:05:06] [INFO ] Flatten gal took : 24 ms
[2024-05-23 01:05:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-23 01:05:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality7425613141334253696.gal : 5 ms
[2024-05-23 01:05:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality18134992388417959271.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/CTLCardinality7425613141334253696.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18134992388417959271.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.48907e+07,5.81103,129172,13123,25,298141,259,843,196433,36,497,0


Converting to forward existential form...Done !
original formula: E((i6.i0.u51.cs_4_4==1) U AX(FALSE))
=> equivalent forward existential formula: [(FwdU(Init,(i6.i0.u51.cs_4_4==1)) * !(EX(!(FALSE))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t280, t282, t283, t284, t285, t286, t287, t288, t289, t290, t291, t292, t293, t294, t295, t29...474
(forward)formula 0,0,22.3874,467560,1,0,852771,259,4025,959546,164,1108,4655346
FORMULA Anderson-PT-07-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 493/493 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 233 transition count 374
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 233 transition count 374
Applied a total of 46 rules in 5 ms. Remains 233 /256 variables (removed 23) and now considering 374/493 (removed 119) transitions.
// Phase 1: matrix 374 rows 233 cols
[2024-05-23 01:05:29] [INFO ] Computed 16 invariants in 3 ms
[2024-05-23 01:05:29] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-23 01:05:29] [INFO ] Invariant cache hit.
[2024-05-23 01:05:29] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-23 01:05:30] [INFO ] Implicit Places using invariants and state equation in 1079 ms returned []
Implicit Place search using SMT with State Equation took 1363 ms to find 0 implicit places.
Running 367 sub problems to find dead transitions.
[2024-05-23 01:05:30] [INFO ] Invariant cache hit.
[2024-05-23 01:05:30] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-23 01:05:35] [INFO ] Deduced a trap composed of 80 places in 220 ms of which 4 ms to minimize.
[2024-05-23 01:05:35] [INFO ] Deduced a trap composed of 47 places in 268 ms of which 4 ms to minimize.
[2024-05-23 01:05:36] [INFO ] Deduced a trap composed of 53 places in 244 ms of which 4 ms to minimize.
[2024-05-23 01:05:36] [INFO ] Deduced a trap composed of 69 places in 200 ms of which 4 ms to minimize.
[2024-05-23 01:05:38] [INFO ] Deduced a trap composed of 97 places in 236 ms of which 4 ms to minimize.
[2024-05-23 01:05:38] [INFO ] Deduced a trap composed of 93 places in 266 ms of which 4 ms to minimize.
[2024-05-23 01:05:38] [INFO ] Deduced a trap composed of 74 places in 266 ms of which 4 ms to minimize.
[2024-05-23 01:05:38] [INFO ] Deduced a trap composed of 98 places in 252 ms of which 4 ms to minimize.
[2024-05-23 01:05:39] [INFO ] Deduced a trap composed of 123 places in 255 ms of which 4 ms to minimize.
[2024-05-23 01:05:39] [INFO ] Deduced a trap composed of 66 places in 234 ms of which 4 ms to minimize.
[2024-05-23 01:05:39] [INFO ] Deduced a trap composed of 46 places in 252 ms of which 4 ms to minimize.
[2024-05-23 01:05:40] [INFO ] Deduced a trap composed of 137 places in 253 ms of which 4 ms to minimize.
[2024-05-23 01:05:40] [INFO ] Deduced a trap composed of 79 places in 251 ms of which 4 ms to minimize.
[2024-05-23 01:05:40] [INFO ] Deduced a trap composed of 50 places in 243 ms of which 4 ms to minimize.
[2024-05-23 01:05:40] [INFO ] Deduced a trap composed of 51 places in 154 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 15/31 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-23 01:05:43] [INFO ] Deduced a trap composed of 94 places in 192 ms of which 3 ms to minimize.
[2024-05-23 01:05:44] [INFO ] Deduced a trap composed of 92 places in 224 ms of which 4 ms to minimize.
[2024-05-23 01:05:44] [INFO ] Deduced a trap composed of 134 places in 233 ms of which 4 ms to minimize.
[2024-05-23 01:05:44] [INFO ] Deduced a trap composed of 104 places in 229 ms of which 4 ms to minimize.
[2024-05-23 01:05:44] [INFO ] Deduced a trap composed of 144 places in 223 ms of which 4 ms to minimize.
[2024-05-23 01:05:45] [INFO ] Deduced a trap composed of 124 places in 223 ms of which 4 ms to minimize.
[2024-05-23 01:05:45] [INFO ] Deduced a trap composed of 112 places in 206 ms of which 3 ms to minimize.
[2024-05-23 01:05:45] [INFO ] Deduced a trap composed of 95 places in 227 ms of which 4 ms to minimize.
[2024-05-23 01:05:45] [INFO ] Deduced a trap composed of 163 places in 269 ms of which 4 ms to minimize.
[2024-05-23 01:05:46] [INFO ] Deduced a trap composed of 115 places in 260 ms of which 4 ms to minimize.
[2024-05-23 01:05:46] [INFO ] Deduced a trap composed of 110 places in 242 ms of which 3 ms to minimize.
[2024-05-23 01:05:46] [INFO ] Deduced a trap composed of 117 places in 238 ms of which 4 ms to minimize.
[2024-05-23 01:05:46] [INFO ] Deduced a trap composed of 123 places in 179 ms of which 3 ms to minimize.
[2024-05-23 01:05:47] [INFO ] Deduced a trap composed of 55 places in 170 ms of which 4 ms to minimize.
[2024-05-23 01:05:47] [INFO ] Deduced a trap composed of 93 places in 219 ms of which 4 ms to minimize.
[2024-05-23 01:05:47] [INFO ] Deduced a trap composed of 49 places in 220 ms of which 4 ms to minimize.
[2024-05-23 01:05:48] [INFO ] Deduced a trap composed of 68 places in 170 ms of which 4 ms to minimize.
[2024-05-23 01:05:48] [INFO ] Deduced a trap composed of 81 places in 175 ms of which 4 ms to minimize.
[2024-05-23 01:05:49] [INFO ] Deduced a trap composed of 143 places in 173 ms of which 3 ms to minimize.
[2024-05-23 01:05:49] [INFO ] Deduced a trap composed of 138 places in 221 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-23 01:05:54] [INFO ] Deduced a trap composed of 84 places in 223 ms of which 4 ms to minimize.
[2024-05-23 01:05:54] [INFO ] Deduced a trap composed of 97 places in 225 ms of which 4 ms to minimize.
[2024-05-23 01:05:54] [INFO ] Deduced a trap composed of 68 places in 225 ms of which 4 ms to minimize.
[2024-05-23 01:05:54] [INFO ] Deduced a trap composed of 84 places in 225 ms of which 4 ms to minimize.
[2024-05-23 01:05:55] [INFO ] Deduced a trap composed of 82 places in 163 ms of which 2 ms to minimize.
[2024-05-23 01:05:55] [INFO ] Deduced a trap composed of 101 places in 173 ms of which 3 ms to minimize.
[2024-05-23 01:05:55] [INFO ] Deduced a trap composed of 93 places in 235 ms of which 4 ms to minimize.
[2024-05-23 01:05:55] [INFO ] Deduced a trap composed of 103 places in 214 ms of which 4 ms to minimize.
[2024-05-23 01:05:56] [INFO ] Deduced a trap composed of 79 places in 163 ms of which 4 ms to minimize.
[2024-05-23 01:05:56] [INFO ] Deduced a trap composed of 156 places in 227 ms of which 4 ms to minimize.
[2024-05-23 01:05:56] [INFO ] Deduced a trap composed of 67 places in 234 ms of which 4 ms to minimize.
[2024-05-23 01:05:57] [INFO ] Deduced a trap composed of 161 places in 226 ms of which 4 ms to minimize.
[2024-05-23 01:05:57] [INFO ] Deduced a trap composed of 128 places in 218 ms of which 4 ms to minimize.
[2024-05-23 01:05:57] [INFO ] Deduced a trap composed of 104 places in 214 ms of which 4 ms to minimize.
[2024-05-23 01:05:57] [INFO ] Deduced a trap composed of 77 places in 235 ms of which 4 ms to minimize.
[2024-05-23 01:05:58] [INFO ] Deduced a trap composed of 90 places in 223 ms of which 3 ms to minimize.
[2024-05-23 01:05:58] [INFO ] Deduced a trap composed of 110 places in 220 ms of which 4 ms to minimize.
[2024-05-23 01:05:58] [INFO ] Deduced a trap composed of 74 places in 219 ms of which 4 ms to minimize.
[2024-05-23 01:05:58] [INFO ] Deduced a trap composed of 111 places in 220 ms of which 4 ms to minimize.
[2024-05-23 01:05:59] [INFO ] Deduced a trap composed of 91 places in 210 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 233/607 variables, and 71 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/233 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 55/71 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-23 01:06:03] [INFO ] Deduced a trap composed of 91 places in 227 ms of which 4 ms to minimize.
[2024-05-23 01:06:04] [INFO ] Deduced a trap composed of 100 places in 219 ms of which 5 ms to minimize.
[2024-05-23 01:06:05] [INFO ] Deduced a trap composed of 127 places in 178 ms of which 4 ms to minimize.
[2024-05-23 01:06:06] [INFO ] Deduced a trap composed of 73 places in 215 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-23 01:06:09] [INFO ] Deduced a trap composed of 77 places in 174 ms of which 4 ms to minimize.
[2024-05-23 01:06:10] [INFO ] Deduced a trap composed of 98 places in 161 ms of which 3 ms to minimize.
[2024-05-23 01:06:10] [INFO ] Deduced a trap composed of 88 places in 169 ms of which 3 ms to minimize.
[2024-05-23 01:06:10] [INFO ] Deduced a trap composed of 73 places in 195 ms of which 3 ms to minimize.
[2024-05-23 01:06:11] [INFO ] Deduced a trap composed of 94 places in 208 ms of which 3 ms to minimize.
[2024-05-23 01:06:11] [INFO ] Deduced a trap composed of 44 places in 179 ms of which 3 ms to minimize.
[2024-05-23 01:06:11] [INFO ] Deduced a trap composed of 142 places in 222 ms of which 3 ms to minimize.
[2024-05-23 01:06:11] [INFO ] Deduced a trap composed of 90 places in 151 ms of which 3 ms to minimize.
[2024-05-23 01:06:12] [INFO ] Deduced a trap composed of 123 places in 243 ms of which 4 ms to minimize.
[2024-05-23 01:06:12] [INFO ] Deduced a trap composed of 92 places in 250 ms of which 4 ms to minimize.
[2024-05-23 01:06:12] [INFO ] Deduced a trap composed of 133 places in 277 ms of which 5 ms to minimize.
[2024-05-23 01:06:13] [INFO ] Deduced a trap composed of 117 places in 168 ms of which 3 ms to minimize.
[2024-05-23 01:06:13] [INFO ] Deduced a trap composed of 97 places in 151 ms of which 2 ms to minimize.
[2024-05-23 01:06:13] [INFO ] Deduced a trap composed of 112 places in 222 ms of which 4 ms to minimize.
[2024-05-23 01:06:13] [INFO ] Deduced a trap composed of 106 places in 220 ms of which 4 ms to minimize.
[2024-05-23 01:06:14] [INFO ] Deduced a trap composed of 71 places in 219 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 16/91 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-23 01:06:15] [INFO ] Deduced a trap composed of 67 places in 218 ms of which 4 ms to minimize.
[2024-05-23 01:06:16] [INFO ] Deduced a trap composed of 156 places in 221 ms of which 7 ms to minimize.
[2024-05-23 01:06:16] [INFO ] Deduced a trap composed of 70 places in 265 ms of which 4 ms to minimize.
[2024-05-23 01:06:16] [INFO ] Deduced a trap composed of 110 places in 188 ms of which 2 ms to minimize.
[2024-05-23 01:06:17] [INFO ] Deduced a trap composed of 68 places in 274 ms of which 4 ms to minimize.
[2024-05-23 01:06:19] [INFO ] Deduced a trap composed of 140 places in 172 ms of which 2 ms to minimize.
[2024-05-23 01:06:19] [INFO ] Deduced a trap composed of 80 places in 184 ms of which 3 ms to minimize.
[2024-05-23 01:06:20] [INFO ] Deduced a trap composed of 76 places in 167 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 8/99 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-23 01:06:26] [INFO ] Deduced a trap composed of 84 places in 275 ms of which 4 ms to minimize.
[2024-05-23 01:06:27] [INFO ] Deduced a trap composed of 89 places in 203 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 233/607 variables, and 101 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/233 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/367 constraints, Known Traps: 85/85 constraints]
After SMT, in 60312ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 60318ms
Starting structural reductions in LTL mode, iteration 1 : 233/256 places, 374/493 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61687 ms. Remains : 233/256 places, 374/493 transitions.
[2024-05-23 01:06:30] [INFO ] Flatten gal took : 9 ms
[2024-05-23 01:06:30] [INFO ] Flatten gal took : 11 ms
[2024-05-23 01:06:30] [INFO ] Input system was already deterministic with 374 transitions.
[2024-05-23 01:06:30] [INFO ] Flatten gal took : 10 ms
[2024-05-23 01:06:30] [INFO ] Flatten gal took : 10 ms
[2024-05-23 01:06:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality18257515364461314605.gal : 4 ms
[2024-05-23 01:06:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality8373249235487521804.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/CTLCardinality18257515364461314605.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8373249235487521804.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.33325e+07,27.5129,625108,2,138144,5,1.70779e+06,6,0,1309,1.94865e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-23 01:07:01] [INFO ] Flatten gal took : 10 ms
[2024-05-23 01:07:01] [INFO ] Applying decomposition
[2024-05-23 01:07:01] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6507633397133805467.txt' '-o' '/tmp/graph6507633397133805467.bin' '-w' '/tmp/graph6507633397133805467.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6507633397133805467.bin' '-l' '-1' '-v' '-w' '/tmp/graph6507633397133805467.weights' '-q' '0' '-e' '0.001'
[2024-05-23 01:07:01] [INFO ] Decomposing Gal with order
[2024-05-23 01:07:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 01:07:01] [INFO ] Removed a total of 613 redundant transitions.
[2024-05-23 01:07:01] [INFO ] Flatten gal took : 39 ms
[2024-05-23 01:07:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 13 ms.
[2024-05-23 01:07:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality17271517541792823214.gal : 6 ms
[2024-05-23 01:07:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality11909167324575621848.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17271517541792823214.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11909167324575621848.ctl'

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 -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.33325e+07,21.6119,321800,19639,27,625440,260,1097,664327,39,640,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 493/493 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 225 transition count 330
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 225 transition count 330
Applied a total of 62 rules in 5 ms. Remains 225 /256 variables (removed 31) and now considering 330/493 (removed 163) transitions.
// Phase 1: matrix 330 rows 225 cols
[2024-05-23 01:07:31] [INFO ] Computed 16 invariants in 2 ms
[2024-05-23 01:07:31] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-23 01:07:31] [INFO ] Invariant cache hit.
[2024-05-23 01:07:31] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-23 01:07:32] [INFO ] Implicit Places using invariants and state equation in 900 ms returned []
Implicit Place search using SMT with State Equation took 1145 ms to find 0 implicit places.
Running 323 sub problems to find dead transitions.
[2024-05-23 01:07:32] [INFO ] Invariant cache hit.
[2024-05-23 01:07:32] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 323 unsolved
[2024-05-23 01:07:36] [INFO ] Deduced a trap composed of 92 places in 227 ms of which 4 ms to minimize.
[2024-05-23 01:07:37] [INFO ] Deduced a trap composed of 159 places in 204 ms of which 3 ms to minimize.
[2024-05-23 01:07:37] [INFO ] Deduced a trap composed of 81 places in 153 ms of which 2 ms to minimize.
[2024-05-23 01:07:37] [INFO ] Deduced a trap composed of 71 places in 250 ms of which 3 ms to minimize.
[2024-05-23 01:07:38] [INFO ] Deduced a trap composed of 131 places in 215 ms of which 4 ms to minimize.
[2024-05-23 01:07:38] [INFO ] Deduced a trap composed of 85 places in 252 ms of which 4 ms to minimize.
[2024-05-23 01:07:38] [INFO ] Deduced a trap composed of 89 places in 259 ms of which 4 ms to minimize.
[2024-05-23 01:07:38] [INFO ] Deduced a trap composed of 93 places in 183 ms of which 3 ms to minimize.
[2024-05-23 01:07:39] [INFO ] Deduced a trap composed of 82 places in 218 ms of which 3 ms to minimize.
[2024-05-23 01:07:39] [INFO ] Deduced a trap composed of 78 places in 195 ms of which 2 ms to minimize.
[2024-05-23 01:07:39] [INFO ] Deduced a trap composed of 71 places in 128 ms of which 2 ms to minimize.
[2024-05-23 01:07:40] [INFO ] Deduced a trap composed of 157 places in 154 ms of which 3 ms to minimize.
[2024-05-23 01:07:40] [INFO ] Deduced a trap composed of 87 places in 194 ms of which 3 ms to minimize.
[2024-05-23 01:07:40] [INFO ] Deduced a trap composed of 136 places in 174 ms of which 3 ms to minimize.
[2024-05-23 01:07:40] [INFO ] Deduced a trap composed of 78 places in 170 ms of which 2 ms to minimize.
[2024-05-23 01:07:40] [INFO ] Deduced a trap composed of 57 places in 180 ms of which 2 ms to minimize.
[2024-05-23 01:07:41] [INFO ] Deduced a trap composed of 103 places in 155 ms of which 2 ms to minimize.
[2024-05-23 01:07:41] [INFO ] Deduced a trap composed of 109 places in 141 ms of which 2 ms to minimize.
[2024-05-23 01:07:41] [INFO ] Deduced a trap composed of 117 places in 243 ms of which 4 ms to minimize.
[2024-05-23 01:07:41] [INFO ] Deduced a trap composed of 80 places in 242 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 323 unsolved
[2024-05-23 01:07:44] [INFO ] Deduced a trap composed of 79 places in 119 ms of which 3 ms to minimize.
[2024-05-23 01:07:44] [INFO ] Deduced a trap composed of 65 places in 209 ms of which 4 ms to minimize.
[2024-05-23 01:07:45] [INFO ] Deduced a trap composed of 95 places in 142 ms of which 3 ms to minimize.
[2024-05-23 01:07:45] [INFO ] Deduced a trap composed of 86 places in 169 ms of which 2 ms to minimize.
[2024-05-23 01:07:45] [INFO ] Deduced a trap composed of 66 places in 133 ms of which 3 ms to minimize.
[2024-05-23 01:07:45] [INFO ] Deduced a trap composed of 78 places in 160 ms of which 4 ms to minimize.
[2024-05-23 01:07:45] [INFO ] Deduced a trap composed of 68 places in 118 ms of which 2 ms to minimize.
[2024-05-23 01:07:46] [INFO ] Deduced a trap composed of 96 places in 207 ms of which 3 ms to minimize.
[2024-05-23 01:07:46] [INFO ] Deduced a trap composed of 45 places in 133 ms of which 2 ms to minimize.
[2024-05-23 01:07:46] [INFO ] Deduced a trap composed of 117 places in 117 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 5 (OVERLAPS) 1/225 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 323 unsolved
[2024-05-23 01:07:53] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 2 ms to minimize.
[2024-05-23 01:07:53] [INFO ] Deduced a trap composed of 103 places in 179 ms of which 3 ms to minimize.
[2024-05-23 01:07:54] [INFO ] Deduced a trap composed of 109 places in 171 ms of which 3 ms to minimize.
[2024-05-23 01:07:54] [INFO ] Deduced a trap composed of 101 places in 143 ms of which 2 ms to minimize.
[2024-05-23 01:07:54] [INFO ] Deduced a trap composed of 103 places in 158 ms of which 4 ms to minimize.
[2024-05-23 01:07:54] [INFO ] Deduced a trap composed of 87 places in 158 ms of which 4 ms to minimize.
[2024-05-23 01:07:56] [INFO ] Deduced a trap composed of 101 places in 122 ms of which 3 ms to minimize.
[2024-05-23 01:07:56] [INFO ] Deduced a trap composed of 54 places in 213 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 323 unsolved
[2024-05-23 01:08:01] [INFO ] Deduced a trap composed of 108 places in 255 ms of which 4 ms to minimize.
[2024-05-23 01:08:01] [INFO ] Deduced a trap composed of 102 places in 255 ms of which 4 ms to minimize.
[2024-05-23 01:08:02] [INFO ] Deduced a trap composed of 112 places in 189 ms of which 2 ms to minimize.
[2024-05-23 01:08:02] [INFO ] Deduced a trap composed of 156 places in 208 ms of which 2 ms to minimize.
[2024-05-23 01:08:02] [INFO ] Deduced a trap composed of 103 places in 209 ms of which 4 ms to minimize.
[2024-05-23 01:08:02] [INFO ] Deduced a trap composed of 126 places in 208 ms of which 4 ms to minimize.
SMT process timed out in 30436ms, After SMT, problems are : Problem set: 0 solved, 323 unsolved
Search for dead transitions found 0 dead transitions in 30443ms
Starting structural reductions in LTL mode, iteration 1 : 225/256 places, 330/493 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31596 ms. Remains : 225/256 places, 330/493 transitions.
[2024-05-23 01:08:02] [INFO ] Flatten gal took : 8 ms
[2024-05-23 01:08:02] [INFO ] Flatten gal took : 14 ms
[2024-05-23 01:08:02] [INFO ] Input system was already deterministic with 330 transitions.
[2024-05-23 01:08:02] [INFO ] Flatten gal took : 20 ms
[2024-05-23 01:08:02] [INFO ] Flatten gal took : 14 ms
[2024-05-23 01:08:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality15785738344428256653.gal : 3 ms
[2024-05-23 01:08:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality16452540738031942782.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/CTLCardinality15785738344428256653.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16452540738031942782.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.55744e+07,10.9269,254076,2,77280,5,755680,6,0,1233,695071,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-23 01:08:32] [INFO ] Flatten gal took : 8 ms
[2024-05-23 01:08:32] [INFO ] Applying decomposition
[2024-05-23 01:08:32] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8338100592811115389.txt' '-o' '/tmp/graph8338100592811115389.bin' '-w' '/tmp/graph8338100592811115389.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8338100592811115389.bin' '-l' '-1' '-v' '-w' '/tmp/graph8338100592811115389.weights' '-q' '0' '-e' '0.001'
[2024-05-23 01:08:33] [INFO ] Decomposing Gal with order
[2024-05-23 01:08:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 01:08:33] [INFO ] Removed a total of 492 redundant transitions.
[2024-05-23 01:08:33] [INFO ] Flatten gal took : 22 ms
[2024-05-23 01:08:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 7 ms.
[2024-05-23 01:08:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality2244402827097262581.gal : 6 ms
[2024-05-23 01:08:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality12784490916704883234.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/CTLCardinality2244402827097262581.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12784490916704883234.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.55744e+07,4.1676,84344,11014,26,165741,154,920,104549,42,298,0


Converting to forward existential form...Done !
original formula: AX(EG((i5.u41.p1_2_2==0)))
=> equivalent forward existential formula: [(EY(Init) * !(EG((i5.u41.p1_2_2==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t281, t282, t283, t284, t285, t286, t287, t288, t289, t290, t291, t292, t293, t294, t295, t29...732
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,1,28.1512,572408,1,0,1.10542e+06,214,4528,899045,188,898,5701452
FORMULA Anderson-PT-07-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 493/493 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 231 transition count 336
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 231 transition count 336
Applied a total of 50 rules in 5 ms. Remains 231 /256 variables (removed 25) and now considering 336/493 (removed 157) transitions.
// Phase 1: matrix 336 rows 231 cols
[2024-05-23 01:09:01] [INFO ] Computed 16 invariants in 2 ms
[2024-05-23 01:09:01] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-23 01:09:01] [INFO ] Invariant cache hit.
[2024-05-23 01:09:02] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-23 01:09:02] [INFO ] Implicit Places using invariants and state equation in 1148 ms returned []
Implicit Place search using SMT with State Equation took 1434 ms to find 0 implicit places.
Running 329 sub problems to find dead transitions.
[2024-05-23 01:09:02] [INFO ] Invariant cache hit.
[2024-05-23 01:09:02] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-23 01:09:07] [INFO ] Deduced a trap composed of 72 places in 249 ms of which 7 ms to minimize.
[2024-05-23 01:09:08] [INFO ] Deduced a trap composed of 117 places in 251 ms of which 4 ms to minimize.
[2024-05-23 01:09:08] [INFO ] Deduced a trap composed of 71 places in 235 ms of which 4 ms to minimize.
[2024-05-23 01:09:08] [INFO ] Deduced a trap composed of 138 places in 238 ms of which 4 ms to minimize.
[2024-05-23 01:09:09] [INFO ] Deduced a trap composed of 116 places in 239 ms of which 4 ms to minimize.
[2024-05-23 01:09:09] [INFO ] Deduced a trap composed of 68 places in 225 ms of which 4 ms to minimize.
[2024-05-23 01:09:09] [INFO ] Deduced a trap composed of 100 places in 166 ms of which 3 ms to minimize.
[2024-05-23 01:09:10] [INFO ] Deduced a trap composed of 163 places in 228 ms of which 4 ms to minimize.
[2024-05-23 01:09:10] [INFO ] Deduced a trap composed of 156 places in 256 ms of which 3 ms to minimize.
[2024-05-23 01:09:10] [INFO ] Deduced a trap composed of 105 places in 230 ms of which 4 ms to minimize.
[2024-05-23 01:09:11] [INFO ] Deduced a trap composed of 65 places in 251 ms of which 4 ms to minimize.
[2024-05-23 01:09:11] [INFO ] Deduced a trap composed of 124 places in 231 ms of which 4 ms to minimize.
[2024-05-23 01:09:11] [INFO ] Deduced a trap composed of 69 places in 255 ms of which 3 ms to minimize.
[2024-05-23 01:09:11] [INFO ] Deduced a trap composed of 72 places in 253 ms of which 4 ms to minimize.
[2024-05-23 01:09:12] [INFO ] Deduced a trap composed of 74 places in 213 ms of which 4 ms to minimize.
[2024-05-23 01:09:12] [INFO ] Deduced a trap composed of 115 places in 168 ms of which 4 ms to minimize.
[2024-05-23 01:09:12] [INFO ] Deduced a trap composed of 124 places in 223 ms of which 4 ms to minimize.
[2024-05-23 01:09:12] [INFO ] Deduced a trap composed of 66 places in 266 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-23 01:09:16] [INFO ] Deduced a trap composed of 95 places in 249 ms of which 4 ms to minimize.
[2024-05-23 01:09:17] [INFO ] Deduced a trap composed of 105 places in 247 ms of which 4 ms to minimize.
[2024-05-23 01:09:17] [INFO ] Deduced a trap composed of 119 places in 212 ms of which 3 ms to minimize.
[2024-05-23 01:09:17] [INFO ] Deduced a trap composed of 91 places in 269 ms of which 4 ms to minimize.
[2024-05-23 01:09:17] [INFO ] Deduced a trap composed of 82 places in 269 ms of which 4 ms to minimize.
[2024-05-23 01:09:18] [INFO ] Deduced a trap composed of 48 places in 170 ms of which 3 ms to minimize.
[2024-05-23 01:09:18] [INFO ] Deduced a trap composed of 79 places in 232 ms of which 4 ms to minimize.
[2024-05-23 01:09:18] [INFO ] Deduced a trap composed of 46 places in 213 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-23 01:09:24] [INFO ] Deduced a trap composed of 91 places in 236 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-23 01:09:27] [INFO ] Deduced a trap composed of 115 places in 237 ms of which 4 ms to minimize.
[2024-05-23 01:09:28] [INFO ] Deduced a trap composed of 108 places in 246 ms of which 4 ms to minimize.
[2024-05-23 01:09:28] [INFO ] Deduced a trap composed of 118 places in 242 ms of which 4 ms to minimize.
[2024-05-23 01:09:28] [INFO ] Deduced a trap composed of 124 places in 236 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 230/567 variables, and 46 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/231 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 329 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-23 01:09:35] [INFO ] Deduced a trap composed of 89 places in 229 ms of which 4 ms to minimize.
[2024-05-23 01:09:36] [INFO ] Deduced a trap composed of 75 places in 241 ms of which 3 ms to minimize.
[2024-05-23 01:09:36] [INFO ] Deduced a trap composed of 86 places in 238 ms of which 4 ms to minimize.
[2024-05-23 01:09:37] [INFO ] Deduced a trap composed of 135 places in 223 ms of which 5 ms to minimize.
[2024-05-23 01:09:37] [INFO ] Deduced a trap composed of 142 places in 246 ms of which 4 ms to minimize.
[2024-05-23 01:09:37] [INFO ] Deduced a trap composed of 123 places in 234 ms of which 4 ms to minimize.
[2024-05-23 01:09:38] [INFO ] Deduced a trap composed of 109 places in 257 ms of which 4 ms to minimize.
[2024-05-23 01:09:38] [INFO ] Deduced a trap composed of 123 places in 243 ms of which 4 ms to minimize.
[2024-05-23 01:09:38] [INFO ] Deduced a trap composed of 128 places in 235 ms of which 4 ms to minimize.
[2024-05-23 01:09:38] [INFO ] Deduced a trap composed of 144 places in 260 ms of which 3 ms to minimize.
[2024-05-23 01:09:39] [INFO ] Deduced a trap composed of 124 places in 216 ms of which 4 ms to minimize.
[2024-05-23 01:09:41] [INFO ] Deduced a trap composed of 113 places in 238 ms of which 4 ms to minimize.
[2024-05-23 01:09:41] [INFO ] Deduced a trap composed of 114 places in 223 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 230/567 variables, and 59 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/231 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/329 constraints, Known Traps: 44/44 constraints]
After SMT, in 60282ms problems are : Problem set: 0 solved, 329 unsolved
Search for dead transitions found 0 dead transitions in 60287ms
Starting structural reductions in LTL mode, iteration 1 : 231/256 places, 336/493 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61728 ms. Remains : 231/256 places, 336/493 transitions.
[2024-05-23 01:10:03] [INFO ] Flatten gal took : 8 ms
[2024-05-23 01:10:03] [INFO ] Flatten gal took : 9 ms
[2024-05-23 01:10:03] [INFO ] Input system was already deterministic with 336 transitions.
[2024-05-23 01:10:03] [INFO ] Flatten gal took : 9 ms
[2024-05-23 01:10:03] [INFO ] Flatten gal took : 9 ms
[2024-05-23 01:10:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality16873306308856205435.gal : 2 ms
[2024-05-23 01:10:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality11723250950489483381.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/CTLCardinality16873306308856205435.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11723250950489483381.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.99785e+07,19.0417,426160,2,107650,5,1.21164e+06,6,0,1263,1.33906e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-23 01:10:33] [INFO ] Flatten gal took : 9 ms
[2024-05-23 01:10:33] [INFO ] Applying decomposition
[2024-05-23 01:10:33] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12348207225530781643.txt' '-o' '/tmp/graph12348207225530781643.bin' '-w' '/tmp/graph12348207225530781643.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12348207225530781643.bin' '-l' '-1' '-v' '-w' '/tmp/graph12348207225530781643.weights' '-q' '0' '-e' '0.001'
[2024-05-23 01:10:33] [INFO ] Decomposing Gal with order
[2024-05-23 01:10:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 01:10:33] [INFO ] Removed a total of 499 redundant transitions.
[2024-05-23 01:10:33] [INFO ] Flatten gal took : 23 ms
[2024-05-23 01:10:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 5 ms.
[2024-05-23 01:10:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality6993528951459955110.gal : 16 ms
[2024-05-23 01:10:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality12283808835343113253.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/CTLCardinality6993528951459955110.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12283808835343113253.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.99785e+07,8.85243,169356,24656,26,308952,208,893,200235,39,421,0


Converting to forward existential form...Done !
original formula: E(!((((((!(AF((i2.u8.p1_0_10==1))) + !(EG((i6.u30.p1_1_9==1)))) * ((EF(((i11.u36.cs_2_1==0)||(i9.u49.p1_5_1==1))) + (i10.i0.u97.cs_5_4!=1...429
=> equivalent forward existential formula: [(FwdU(Init,!((((((!(!(EG(!((i2.u8.p1_0_10==1))))) + !(EG((i6.u30.p1_1_9==1)))) * ((E(TRUE U ((i11.u36.cs_2_1==0...656
Reverse transition relation is NOT exact ! Due to transitions t287, t288, t289, t290, t291, t292, t293, t294, t295, t296, t297, t298, t299, t300, t301, t30...874
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-23 01:11:03] [INFO ] Flatten gal took : 13 ms
[2024-05-23 01:11:03] [INFO ] Flatten gal took : 24 ms
[2024-05-23 01:11:03] [INFO ] Applying decomposition
[2024-05-23 01:11:03] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8704639514610409598.txt' '-o' '/tmp/graph8704639514610409598.bin' '-w' '/tmp/graph8704639514610409598.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8704639514610409598.bin' '-l' '-1' '-v' '-w' '/tmp/graph8704639514610409598.weights' '-q' '0' '-e' '0.001'
[2024-05-23 01:11:03] [INFO ] Decomposing Gal with order
[2024-05-23 01:11:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 01:11:03] [INFO ] Removed a total of 950 redundant transitions.
[2024-05-23 01:11:03] [INFO ] Flatten gal took : 31 ms
[2024-05-23 01:11:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 8 ms.
[2024-05-23 01:11:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality13774836654087917460.gal : 4 ms
[2024-05-23 01:11:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality17577534305376154535.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/CTLCardinality13774836654087917460.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17577534305376154535.ctl'

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 -...264
No direction supplied, using forward translation only.
Parsed 4 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.03537e+07,46.3252,688560,32003,48,1.13913e+06,279,1324,1.17786e+06,56,901,0


Converting to forward existential form...Done !
original formula: EF((A(AF(AX((i8.u24.p1_5_8==1))) U (EX((i6.u15.p2_2_3==0)) + EF((i3.u49.ncs_4_5==0)))) * AX(FALSE)))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((E(!((EX((i6.u15.p2_2_3==0)) + E(TRUE U (i3.u49.ncs_4_5==0)))) U (!(!(EG(!(!(EX(!((i8.u24...335
Reverse transition relation is NOT exact ! Due to transitions t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t41, t42, t43, t44, t45, t52, t53, t54...1755
(forward)formula 0,0,111.976,1399588,1,0,2.16498e+06,530,5789,2.64678e+06,228,2333,13604463
FORMULA Anderson-PT-07-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((AX(EF(((((i2.u12.ncs_1_4==0)||(i0.i1.u4.next_8==1))&&(i8.u76.ncs_5_3==1))||(i8.u52.p2_5_4==1)))) + (!(A((AF(((i4.u41.cs_3_0==0)||(i0....375
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(!(E(TRUE U ((((i2.u12.ncs_1_4==0)||(i0.i1.u4.next_8==1))&&(i8.u76.ncs_5_3==1))||(i8.u5...785
(forward)formula 1,1,255.701,2313288,1,0,3.72406e+06,588,3872,4.33237e+06,138,2421,10218637
FORMULA Anderson-PT-07-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A((AF(!((((i5.i1.u61.cs_0_2==0)||(i8.u26.p1_5_3==1)) * AX(((i5.i1.u61.slot_F.F.T.F.F.F.F==0)||(i0.i1.u54.p2_5_6==1)))))) * (AG(E(!(((i6.u...617
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(((EG(!(EG(!((i0.i1.u59.p1_6_6==0))))) * !(E(TRUE U !((i6.u71.cs_2_6==1))))) * E(((!((i3....1409
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 2,0,752.699,5856004,1,0,9.05079e+06,613,5692,9.24945e+06,194,2432,26072978
FORMULA Anderson-PT-07-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E(!((((((!(AF((i5.i0.u33.p1_0_10==1))) + !(EG((i2.u10.p1_1_9==1)))) * ((EF(((i5.i2.u68.cs_2_1==0)||(i8.u24.p1_5_1==1))) + (i7.i0.u77.cs_5...445
=> equivalent forward existential formula: [(FwdU(Init,!((((((!(!(EG(!((i5.i0.u33.p1_0_10==1))))) + !(EG((i2.u10.p1_1_9==1)))) * ((E(TRUE U ((i5.i2.u68.cs_...674
(forward)formula 3,0,804.696,6336024,1,0,9.991e+06,616,5708,1.02907e+07,195,2434,31819995
FORMULA Anderson-PT-07-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1830946 ms.

BK_STOP 1716427469688

--------------------
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="Anderson-PT-07"
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 Anderson-PT-07, 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 r004-smll-171620118300337"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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