Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446600217.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBLF-PT-S02J04T06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446600217
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 11K Apr 11 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 11 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K Apr 11 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 133K Apr 11 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Apr 11 17:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 11 17:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 862K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716912708456

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J04T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-28 16:11:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 16:11:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 16:11:49] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2024-05-28 16:11:49] [INFO ] Transformed 476 places.
[2024-05-28 16:11:50] [INFO ] Transformed 920 transitions.
[2024-05-28 16:11:50] [INFO ] Parsed PT model containing 476 places and 920 transitions and 4242 arcs in 259 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 42 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Support contains 216 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 474 transition count 824
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 6 place count 470 transition count 820
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 470 transition count 820
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 467 transition count 817
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 467 transition count 817
Applied a total of 16 rules in 95 ms. Remains 467 /476 variables (removed 9) and now considering 817/824 (removed 7) transitions.
Running 815 sub problems to find dead transitions.
[2024-05-28 16:11:50] [INFO ] Flow matrix only has 805 transitions (discarded 12 similar events)
// Phase 1: matrix 805 rows 467 cols
[2024-05-28 16:11:50] [INFO ] Computed 44 invariants in 41 ms
[2024-05-28 16:11:50] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 815 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 815 unsolved
[2024-05-28 16:11:58] [INFO ] Deduced a trap composed of 37 places in 211 ms of which 36 ms to minimize.
[2024-05-28 16:11:59] [INFO ] Deduced a trap composed of 126 places in 198 ms of which 2 ms to minimize.
[2024-05-28 16:11:59] [INFO ] Deduced a trap composed of 222 places in 207 ms of which 3 ms to minimize.
[2024-05-28 16:11:59] [INFO ] Deduced a trap composed of 15 places in 263 ms of which 1 ms to minimize.
[2024-05-28 16:12:00] [INFO ] Deduced a trap composed of 227 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:12:00] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 2 ms to minimize.
[2024-05-28 16:12:02] [INFO ] Deduced a trap composed of 239 places in 165 ms of which 5 ms to minimize.
[2024-05-28 16:12:02] [INFO ] Deduced a trap composed of 236 places in 148 ms of which 3 ms to minimize.
[2024-05-28 16:12:02] [INFO ] Deduced a trap composed of 240 places in 143 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 815 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 465/1272 variables, and 50 constraints, problems are : Problem set: 0 solved, 815 unsolved in 20107 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 26/29 constraints, State Equation: 0/467 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 815/815 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 815 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 815 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 815 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 815 unsolved
[2024-05-28 16:12:16] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 2 ms to minimize.
[2024-05-28 16:12:16] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 2 ms to minimize.
[2024-05-28 16:12:16] [INFO ] Deduced a trap composed of 65 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:12:16] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 2 ms to minimize.
[2024-05-28 16:12:16] [INFO ] Deduced a trap composed of 65 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:12:17] [INFO ] Deduced a trap composed of 206 places in 215 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/465 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 815 unsolved
[2024-05-28 16:12:27] [INFO ] Deduced a trap composed of 66 places in 37 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 465/1272 variables, and 57 constraints, problems are : Problem set: 0 solved, 815 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 26/29 constraints, State Equation: 0/467 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/815 constraints, Known Traps: 16/16 constraints]
After SMT, in 41156ms problems are : Problem set: 0 solved, 815 unsolved
Search for dead transitions found 0 dead transitions in 41196ms
[2024-05-28 16:12:31] [INFO ] Flow matrix only has 805 transitions (discarded 12 similar events)
[2024-05-28 16:12:31] [INFO ] Invariant cache hit.
[2024-05-28 16:12:31] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-28 16:12:31] [INFO ] Flow matrix only has 805 transitions (discarded 12 similar events)
[2024-05-28 16:12:31] [INFO ] Invariant cache hit.
[2024-05-28 16:12:32] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:12:34] [INFO ] Implicit Places using invariants and state equation in 2470 ms returned []
Implicit Place search using SMT with State Equation took 2684 ms to find 0 implicit places.
Running 815 sub problems to find dead transitions.
[2024-05-28 16:12:34] [INFO ] Flow matrix only has 805 transitions (discarded 12 similar events)
[2024-05-28 16:12:34] [INFO ] Invariant cache hit.
[2024-05-28 16:12:34] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 815 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 815 unsolved
[2024-05-28 16:12:40] [INFO ] Deduced a trap composed of 126 places in 86 ms of which 2 ms to minimize.
[2024-05-28 16:12:40] [INFO ] Deduced a trap composed of 230 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:12:40] [INFO ] Deduced a trap composed of 222 places in 119 ms of which 2 ms to minimize.
[2024-05-28 16:12:40] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:12:41] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:12:41] [INFO ] Deduced a trap composed of 223 places in 104 ms of which 3 ms to minimize.
[2024-05-28 16:12:41] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 3 ms to minimize.
[2024-05-28 16:12:43] [INFO ] Deduced a trap composed of 246 places in 149 ms of which 3 ms to minimize.
[2024-05-28 16:12:43] [INFO ] Deduced a trap composed of 237 places in 151 ms of which 3 ms to minimize.
[2024-05-28 16:12:44] [INFO ] Deduced a trap composed of 235 places in 139 ms of which 3 ms to minimize.
[2024-05-28 16:12:44] [INFO ] Deduced a trap composed of 42 places in 151 ms of which 2 ms to minimize.
[2024-05-28 16:12:46] [INFO ] Deduced a trap composed of 61 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 12/53 constraints. Problems are: Problem set: 0 solved, 815 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/465 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 815 unsolved
Problem TDEAD23 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/467 variables, 3/56 constraints. Problems are: Problem set: 66 solved, 749 unsolved
[2024-05-28 16:13:03] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 2 ms to minimize.
[2024-05-28 16:13:03] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:13:03] [INFO ] Deduced a trap composed of 63 places in 31 ms of which 1 ms to minimize.
[2024-05-28 16:13:03] [INFO ] Deduced a trap composed of 251 places in 158 ms of which 3 ms to minimize.
[2024-05-28 16:13:03] [INFO ] Deduced a trap composed of 63 places in 34 ms of which 0 ms to minimize.
[2024-05-28 16:13:04] [INFO ] Deduced a trap composed of 65 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:13:04] [INFO ] Deduced a trap composed of 65 places in 34 ms of which 3 ms to minimize.
[2024-05-28 16:13:04] [INFO ] Deduced a trap composed of 245 places in 200 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 467/1272 variables, and 64 constraints, problems are : Problem set: 66 solved, 749 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/467 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 815/815 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 66 solved, 749 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 15/15 constraints. Problems are: Problem set: 66 solved, 749 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 26/41 constraints. Problems are: Problem set: 66 solved, 749 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 20/61 constraints. Problems are: Problem set: 66 solved, 749 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/465 variables, 0/61 constraints. Problems are: Problem set: 66 solved, 749 unsolved
At refinement iteration 4 (OVERLAPS) 2/467 variables, 3/64 constraints. Problems are: Problem set: 66 solved, 749 unsolved
[2024-05-28 16:13:28] [INFO ] Deduced a trap composed of 63 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:13:28] [INFO ] Deduced a trap composed of 192 places in 147 ms of which 3 ms to minimize.
[2024-05-28 16:13:29] [INFO ] Deduced a trap composed of 280 places in 166 ms of which 3 ms to minimize.
[2024-05-28 16:13:29] [INFO ] Deduced a trap composed of 76 places in 156 ms of which 3 ms to minimize.
[2024-05-28 16:13:30] [INFO ] Deduced a trap composed of 201 places in 173 ms of which 3 ms to minimize.
[2024-05-28 16:13:31] [INFO ] Deduced a trap composed of 207 places in 184 ms of which 4 ms to minimize.
[2024-05-28 16:13:34] [INFO ] Deduced a trap composed of 239 places in 168 ms of which 2 ms to minimize.
SMT process timed out in 60758ms, After SMT, problems are : Problem set: 66 solved, 749 unsolved
Search for dead transitions found 66 dead transitions in 60766ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in LTL mode, iteration 1 : 467/476 places, 751/824 transitions.
Reduce places removed 0 places and 12 transitions.
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 10 places and 12 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 457 transition count 727
Deduced a syphon composed of 4 places in 1 ms
Applied a total of 10 rules in 20 ms. Remains 457 /467 variables (removed 10) and now considering 727/751 (removed 24) transitions.
[2024-05-28 16:13:34] [INFO ] Flow matrix only has 715 transitions (discarded 12 similar events)
// Phase 1: matrix 715 rows 457 cols
[2024-05-28 16:13:34] [INFO ] Computed 48 invariants in 17 ms
[2024-05-28 16:13:35] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-28 16:13:35] [INFO ] Flow matrix only has 715 transitions (discarded 12 similar events)
[2024-05-28 16:13:35] [INFO ] Invariant cache hit.
[2024-05-28 16:13:35] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:13:37] [INFO ] Implicit Places using invariants and state equation in 2324 ms returned []
Implicit Place search using SMT with State Equation took 2604 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 457/476 places, 727/824 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 107444 ms. Remains : 457/476 places, 727/824 transitions.
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Support contains 206 out of 453 places after structural reductions.
FORMULA PolyORBLF-PT-S02J04T06-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 16:13:37] [INFO ] Flatten gal took : 108 ms
[2024-05-28 16:13:38] [INFO ] Flatten gal took : 75 ms
[2024-05-28 16:13:38] [INFO ] Input system was already deterministic with 727 transitions.
RANDOM walk for 40000 steps (12 resets) in 1616 ms. (24 steps per ms) remains 41/79 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 63 ms. (62 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (8 resets) in 29 ms. (133 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (8 resets) in 36 ms. (108 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (8 resets) in 21 ms. (181 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (9 resets) in 27 ms. (142 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (8 resets) in 48 ms. (81 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (8 resets) in 23 ms. (166 steps per ms) remains 41/41 properties
[2024-05-28 16:13:39] [INFO ] Flow matrix only has 715 transitions (discarded 12 similar events)
// Phase 1: matrix 715 rows 453 cols
[2024-05-28 16:13:39] [INFO ] Computed 44 invariants in 14 ms
[2024-05-28 16:13:39] [INFO ] State equation strengthened by 72 read => feed constraints.
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp30 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 4/4 constraints. Problems are: Problem set: 7 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 1/5 constraints. Problems are: Problem set: 7 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 7 solved, 34 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp74 is UNSAT
At refinement iteration 3 (OVERLAPS) 229/320 variables, 8/13 constraints. Problems are: Problem set: 21 solved, 20 unsolved
Problem AtomicPropp14 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 7/20 constraints. Problems are: Problem set: 22 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 0/20 constraints. Problems are: Problem set: 22 solved, 19 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp73 is UNSAT
At refinement iteration 6 (OVERLAPS) 132/452 variables, 23/43 constraints. Problems are: Problem set: 38 solved, 3 unsolved
[2024-05-28 16:13:40] [INFO ] Deduced a trap composed of 62 places in 155 ms of which 3 ms to minimize.
Problem AtomicPropp32 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 1/44 constraints. Problems are: Problem set: 39 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 0/44 constraints. Problems are: Problem set: 39 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/453 variables, 1/45 constraints. Problems are: Problem set: 39 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/453 variables, 0/45 constraints. Problems are: Problem set: 39 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 715/1168 variables, 453/498 constraints. Problems are: Problem set: 39 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1168 variables, 72/570 constraints. Problems are: Problem set: 39 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1168 variables, 0/570 constraints. Problems are: Problem set: 39 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1168 variables, 0/570 constraints. Problems are: Problem set: 39 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1168/1168 variables, and 570 constraints, problems are : Problem set: 39 solved, 2 unsolved in 1483 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 453/453 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 39 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 39 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 216/218 variables, 1/1 constraints. Problems are: Problem set: 39 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/1 constraints. Problems are: Problem set: 39 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 57/275 variables, 7/8 constraints. Problems are: Problem set: 39 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 0/8 constraints. Problems are: Problem set: 39 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/277 variables, 1/9 constraints. Problems are: Problem set: 39 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/9 constraints. Problems are: Problem set: 39 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 171/448 variables, 31/40 constraints. Problems are: Problem set: 39 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 1/41 constraints. Problems are: Problem set: 39 solved, 2 unsolved
[2024-05-28 16:13:41] [INFO ] Deduced a trap composed of 150 places in 138 ms of which 3 ms to minimize.
[2024-05-28 16:13:41] [INFO ] Deduced a trap composed of 61 places in 140 ms of which 2 ms to minimize.
[2024-05-28 16:13:41] [INFO ] Deduced a trap composed of 62 places in 128 ms of which 3 ms to minimize.
[2024-05-28 16:13:41] [INFO ] Deduced a trap composed of 61 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:13:41] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:13:41] [INFO ] Deduced a trap composed of 61 places in 157 ms of which 2 ms to minimize.
Problem AtomicPropp35 is UNSAT
[2024-05-28 16:13:42] [INFO ] Deduced a trap composed of 78 places in 159 ms of which 3 ms to minimize.
[2024-05-28 16:13:42] [INFO ] Deduced a trap composed of 144 places in 148 ms of which 2 ms to minimize.
[2024-05-28 16:13:42] [INFO ] Deduced a trap composed of 100 places in 154 ms of which 3 ms to minimize.
[2024-05-28 16:13:42] [INFO ] Deduced a trap composed of 48 places in 149 ms of which 2 ms to minimize.
[2024-05-28 16:13:42] [INFO ] Deduced a trap composed of 99 places in 132 ms of which 3 ms to minimize.
[2024-05-28 16:13:42] [INFO ] Deduced a trap composed of 63 places in 33 ms of which 5 ms to minimize.
[2024-05-28 16:13:42] [INFO ] Deduced a trap composed of 238 places in 134 ms of which 2 ms to minimize.
[2024-05-28 16:13:42] [INFO ] Deduced a trap composed of 230 places in 128 ms of which 2 ms to minimize.
[2024-05-28 16:13:43] [INFO ] Deduced a trap composed of 234 places in 145 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/448 variables, 15/56 constraints. Problems are: Problem set: 40 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/448 variables, 0/56 constraints. Problems are: Problem set: 40 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/451 variables, 3/59 constraints. Problems are: Problem set: 40 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 0/59 constraints. Problems are: Problem set: 40 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 715/1166 variables, 451/510 constraints. Problems are: Problem set: 40 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1166 variables, 72/582 constraints. Problems are: Problem set: 40 solved, 1 unsolved
Problem AtomicPropp71 is UNSAT
After SMT solving in domain Int declared 1166/1168 variables, and 583 constraints, problems are : Problem set: 41 solved, 0 unsolved in 2977 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 451/453 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/41 constraints, Known Traps: 16/16 constraints]
After SMT, in 4523ms problems are : Problem set: 41 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 41 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBLF-PT-S02J04T06-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T06-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T06-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 16:13:44] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2024-05-28 16:13:44] [INFO ] Flatten gal took : 62 ms
[2024-05-28 16:13:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBLF-PT-S02J04T06-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T06-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T06-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T06-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T06-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 16:13:44] [INFO ] Flatten gal took : 33 ms
[2024-05-28 16:13:44] [INFO ] Input system was already deterministic with 727 transitions.
Support contains 49 out of 453 places (down from 114) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 453/453 places, 727/727 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 453 transition count 681
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 407 transition count 681
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 92 place count 407 transition count 633
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 188 place count 359 transition count 633
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 286 place count 310 transition count 584
Applied a total of 286 rules in 74 ms. Remains 310 /453 variables (removed 143) and now considering 584/727 (removed 143) transitions.
Running 582 sub problems to find dead transitions.
[2024-05-28 16:13:44] [INFO ] Flow matrix only has 572 transitions (discarded 12 similar events)
// Phase 1: matrix 572 rows 310 cols
[2024-05-28 16:13:44] [INFO ] Computed 44 invariants in 6 ms
[2024-05-28 16:13:44] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 26/42 constraints. Problems are: Problem set: 0 solved, 582 unsolved
[2024-05-28 16:13:47] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 3 ms to minimize.
[2024-05-28 16:13:47] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 2 ms to minimize.
[2024-05-28 16:13:47] [INFO ] Deduced a trap composed of 108 places in 125 ms of which 2 ms to minimize.
[2024-05-28 16:13:47] [INFO ] Deduced a trap composed of 109 places in 139 ms of which 2 ms to minimize.
[2024-05-28 16:13:48] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 1 ms to minimize.
[2024-05-28 16:13:48] [INFO ] Deduced a trap composed of 39 places in 27 ms of which 1 ms to minimize.
[2024-05-28 16:13:48] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:13:48] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:13:48] [INFO ] Deduced a trap composed of 39 places in 29 ms of which 0 ms to minimize.
[2024-05-28 16:13:48] [INFO ] Deduced a trap composed of 112 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:13:48] [INFO ] Deduced a trap composed of 141 places in 142 ms of which 3 ms to minimize.
[2024-05-28 16:13:48] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 3 ms to minimize.
[2024-05-28 16:13:49] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 2 ms to minimize.
[2024-05-28 16:13:49] [INFO ] Deduced a trap composed of 164 places in 151 ms of which 3 ms to minimize.
[2024-05-28 16:13:49] [INFO ] Deduced a trap composed of 108 places in 168 ms of which 2 ms to minimize.
[2024-05-28 16:13:49] [INFO ] Deduced a trap composed of 131 places in 137 ms of which 2 ms to minimize.
[2024-05-28 16:13:49] [INFO ] Deduced a trap composed of 136 places in 134 ms of which 2 ms to minimize.
[2024-05-28 16:13:49] [INFO ] Deduced a trap composed of 136 places in 138 ms of which 2 ms to minimize.
[2024-05-28 16:13:50] [INFO ] Deduced a trap composed of 128 places in 114 ms of which 1 ms to minimize.
[2024-05-28 16:13:50] [INFO ] Deduced a trap composed of 142 places in 134 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 582 unsolved
[2024-05-28 16:13:51] [INFO ] Deduced a trap composed of 145 places in 100 ms of which 2 ms to minimize.
[2024-05-28 16:13:51] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 2 ms to minimize.
[2024-05-28 16:13:51] [INFO ] Deduced a trap composed of 54 places in 109 ms of which 2 ms to minimize.
[2024-05-28 16:13:51] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 1 ms to minimize.
[2024-05-28 16:13:52] [INFO ] Deduced a trap composed of 88 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:13:52] [INFO ] Deduced a trap composed of 145 places in 105 ms of which 2 ms to minimize.
[2024-05-28 16:13:52] [INFO ] Deduced a trap composed of 125 places in 103 ms of which 2 ms to minimize.
[2024-05-28 16:13:52] [INFO ] Deduced a trap composed of 148 places in 105 ms of which 2 ms to minimize.
[2024-05-28 16:13:53] [INFO ] Deduced a trap composed of 155 places in 153 ms of which 2 ms to minimize.
[2024-05-28 16:13:53] [INFO ] Deduced a trap composed of 142 places in 134 ms of which 2 ms to minimize.
[2024-05-28 16:13:53] [INFO ] Deduced a trap composed of 122 places in 137 ms of which 1 ms to minimize.
[2024-05-28 16:13:54] [INFO ] Deduced a trap composed of 132 places in 112 ms of which 2 ms to minimize.
[2024-05-28 16:13:54] [INFO ] Deduced a trap composed of 139 places in 111 ms of which 2 ms to minimize.
[2024-05-28 16:13:54] [INFO ] Deduced a trap composed of 128 places in 111 ms of which 2 ms to minimize.
[2024-05-28 16:13:54] [INFO ] Deduced a trap composed of 137 places in 103 ms of which 2 ms to minimize.
[2024-05-28 16:13:54] [INFO ] Deduced a trap composed of 139 places in 110 ms of which 2 ms to minimize.
[2024-05-28 16:13:54] [INFO ] Deduced a trap composed of 132 places in 111 ms of which 2 ms to minimize.
[2024-05-28 16:13:54] [INFO ] Deduced a trap composed of 137 places in 117 ms of which 2 ms to minimize.
[2024-05-28 16:13:54] [INFO ] Deduced a trap composed of 98 places in 100 ms of which 2 ms to minimize.
[2024-05-28 16:13:55] [INFO ] Deduced a trap composed of 118 places in 93 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 582 unsolved
[2024-05-28 16:13:58] [INFO ] Deduced a trap composed of 115 places in 124 ms of which 2 ms to minimize.
[2024-05-28 16:13:59] [INFO ] Deduced a trap composed of 154 places in 185 ms of which 3 ms to minimize.
[2024-05-28 16:13:59] [INFO ] Deduced a trap composed of 152 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:13:59] [INFO ] Deduced a trap composed of 120 places in 101 ms of which 1 ms to minimize.
[2024-05-28 16:13:59] [INFO ] Deduced a trap composed of 120 places in 122 ms of which 3 ms to minimize.
[2024-05-28 16:13:59] [INFO ] Deduced a trap composed of 122 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:14:00] [INFO ] Deduced a trap composed of 128 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:14:00] [INFO ] Deduced a trap composed of 132 places in 86 ms of which 2 ms to minimize.
[2024-05-28 16:14:00] [INFO ] Deduced a trap composed of 132 places in 98 ms of which 1 ms to minimize.
[2024-05-28 16:14:00] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 1 ms to minimize.
[2024-05-28 16:14:00] [INFO ] Deduced a trap composed of 151 places in 100 ms of which 2 ms to minimize.
[2024-05-28 16:14:00] [INFO ] Deduced a trap composed of 145 places in 99 ms of which 3 ms to minimize.
[2024-05-28 16:14:01] [INFO ] Deduced a trap composed of 151 places in 96 ms of which 2 ms to minimize.
[2024-05-28 16:14:01] [INFO ] Deduced a trap composed of 110 places in 96 ms of which 1 ms to minimize.
[2024-05-28 16:14:01] [INFO ] Deduced a trap composed of 123 places in 97 ms of which 1 ms to minimize.
[2024-05-28 16:14:01] [INFO ] Deduced a trap composed of 141 places in 96 ms of which 2 ms to minimize.
[2024-05-28 16:14:01] [INFO ] Deduced a trap composed of 150 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:14:02] [INFO ] Deduced a trap composed of 112 places in 121 ms of which 2 ms to minimize.
[2024-05-28 16:14:02] [INFO ] Deduced a trap composed of 135 places in 98 ms of which 2 ms to minimize.
[2024-05-28 16:14:03] [INFO ] Deduced a trap composed of 152 places in 111 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 582 unsolved
[2024-05-28 16:14:04] [INFO ] Deduced a trap composed of 120 places in 156 ms of which 3 ms to minimize.
[2024-05-28 16:14:04] [INFO ] Deduced a trap composed of 88 places in 149 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/882 variables, and 104 constraints, problems are : Problem set: 0 solved, 582 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/310 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 582/582 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 582 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 26/42 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 62/104 constraints. Problems are: Problem set: 0 solved, 582 unsolved
[2024-05-28 16:14:09] [INFO ] Deduced a trap composed of 108 places in 150 ms of which 2 ms to minimize.
[2024-05-28 16:14:12] [INFO ] Deduced a trap composed of 151 places in 137 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 582 unsolved
[2024-05-28 16:14:21] [INFO ] Deduced a trap composed of 104 places in 145 ms of which 2 ms to minimize.
[2024-05-28 16:14:21] [INFO ] Deduced a trap composed of 123 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:14:21] [INFO ] Deduced a trap composed of 134 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:14:21] [INFO ] Deduced a trap composed of 114 places in 142 ms of which 2 ms to minimize.
[2024-05-28 16:14:21] [INFO ] Deduced a trap composed of 110 places in 123 ms of which 2 ms to minimize.
[2024-05-28 16:14:22] [INFO ] Deduced a trap composed of 132 places in 117 ms of which 2 ms to minimize.
[2024-05-28 16:14:22] [INFO ] Deduced a trap composed of 129 places in 110 ms of which 2 ms to minimize.
[2024-05-28 16:14:22] [INFO ] Deduced a trap composed of 141 places in 157 ms of which 4 ms to minimize.
[2024-05-28 16:14:22] [INFO ] Deduced a trap composed of 133 places in 137 ms of which 2 ms to minimize.
[2024-05-28 16:14:22] [INFO ] Deduced a trap composed of 121 places in 139 ms of which 3 ms to minimize.
[2024-05-28 16:14:22] [INFO ] Deduced a trap composed of 145 places in 151 ms of which 2 ms to minimize.
[2024-05-28 16:14:23] [INFO ] Deduced a trap composed of 135 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:14:23] [INFO ] Deduced a trap composed of 133 places in 132 ms of which 2 ms to minimize.
[2024-05-28 16:14:23] [INFO ] Deduced a trap composed of 136 places in 142 ms of which 2 ms to minimize.
[2024-05-28 16:14:23] [INFO ] Deduced a trap composed of 125 places in 158 ms of which 3 ms to minimize.
[2024-05-28 16:14:23] [INFO ] Deduced a trap composed of 136 places in 121 ms of which 1 ms to minimize.
[2024-05-28 16:14:23] [INFO ] Deduced a trap composed of 141 places in 133 ms of which 3 ms to minimize.
[2024-05-28 16:14:24] [INFO ] Deduced a trap composed of 127 places in 172 ms of which 2 ms to minimize.
[2024-05-28 16:14:24] [INFO ] Deduced a trap composed of 126 places in 137 ms of which 4 ms to minimize.
[2024-05-28 16:14:24] [INFO ] Deduced a trap composed of 149 places in 171 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/882 variables, and 126 constraints, problems are : Problem set: 0 solved, 582 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/310 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/582 constraints, Known Traps: 84/84 constraints]
After SMT, in 40515ms problems are : Problem set: 0 solved, 582 unsolved
Search for dead transitions found 0 dead transitions in 40520ms
[2024-05-28 16:14:24] [INFO ] Flow matrix only has 572 transitions (discarded 12 similar events)
[2024-05-28 16:14:24] [INFO ] Invariant cache hit.
[2024-05-28 16:14:25] [INFO ] Implicit Places using invariants in 335 ms returned [77, 156, 178, 180, 275, 285]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 338 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 304/453 places, 584/727 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 300 transition count 580
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 300 transition count 580
Applied a total of 8 rules in 36 ms. Remains 300 /304 variables (removed 4) and now considering 580/584 (removed 4) transitions.
[2024-05-28 16:14:25] [INFO ] Flow matrix only has 568 transitions (discarded 12 similar events)
// Phase 1: matrix 568 rows 300 cols
[2024-05-28 16:14:25] [INFO ] Computed 38 invariants in 7 ms
[2024-05-28 16:14:25] [INFO ] Implicit Places using invariants in 512 ms returned []
[2024-05-28 16:14:25] [INFO ] Flow matrix only has 568 transitions (discarded 12 similar events)
[2024-05-28 16:14:25] [INFO ] Invariant cache hit.
[2024-05-28 16:14:25] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 16:14:27] [INFO ] Implicit Places using invariants and state equation in 1948 ms returned []
Implicit Place search using SMT with State Equation took 2464 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 300/453 places, 580/727 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 43436 ms. Remains : 300/453 places, 580/727 transitions.
[2024-05-28 16:14:27] [INFO ] Flatten gal took : 56 ms
[2024-05-28 16:14:27] [INFO ] Flatten gal took : 39 ms
[2024-05-28 16:14:27] [INFO ] Input system was already deterministic with 580 transitions.
[2024-05-28 16:14:27] [INFO ] Flatten gal took : 43 ms
[2024-05-28 16:14:27] [INFO ] Flatten gal took : 27 ms
[2024-05-28 16:14:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality11626087986463306020.gal : 16 ms
[2024-05-28 16:14:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality11119157115437807574.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11626087986463306020.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11119157115437807574.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.
Detected timeout of ITS tools.
[2024-05-28 16:14:58] [INFO ] Flatten gal took : 45 ms
[2024-05-28 16:14:58] [INFO ] Applying decomposition
[2024-05-28 16:14:58] [INFO ] Flatten gal took : 34 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/graph9857596285383742406.txt' '-o' '/tmp/graph9857596285383742406.bin' '-w' '/tmp/graph9857596285383742406.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9857596285383742406.bin' '-l' '-1' '-v' '-w' '/tmp/graph9857596285383742406.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:14:58] [INFO ] Decomposing Gal with order
[2024-05-28 16:14:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:14:58] [INFO ] Removed a total of 646 redundant transitions.
[2024-05-28 16:14:58] [INFO ] Flatten gal took : 156 ms
[2024-05-28 16:14:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 221 labels/synchronizations in 39 ms.
[2024-05-28 16:14:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality15394472661562201973.gal : 14 ms
[2024-05-28 16:14:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality15000604450997567908.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/CTLCardinality15394472661562201973.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15000604450997567908.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 453/453 places, 727/727 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 450 transition count 724
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 450 transition count 724
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 448 transition count 722
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 448 transition count 722
Applied a total of 10 rules in 36 ms. Remains 448 /453 variables (removed 5) and now considering 722/727 (removed 5) transitions.
Running 720 sub problems to find dead transitions.
[2024-05-28 16:15:28] [INFO ] Flow matrix only has 710 transitions (discarded 12 similar events)
// Phase 1: matrix 710 rows 448 cols
[2024-05-28 16:15:28] [INFO ] Computed 44 invariants in 9 ms
[2024-05-28 16:15:28] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-28 16:15:34] [INFO ] Deduced a trap composed of 62 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:15:35] [INFO ] Deduced a trap composed of 61 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:15:35] [INFO ] Deduced a trap composed of 62 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:15:35] [INFO ] Deduced a trap composed of 62 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:15:35] [INFO ] Deduced a trap composed of 274 places in 189 ms of which 3 ms to minimize.
[2024-05-28 16:15:35] [INFO ] Deduced a trap composed of 62 places in 44 ms of which 0 ms to minimize.
[2024-05-28 16:15:35] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-28 16:15:35] [INFO ] Deduced a trap composed of 107 places in 177 ms of which 2 ms to minimize.
[2024-05-28 16:15:36] [INFO ] Deduced a trap composed of 61 places in 40 ms of which 0 ms to minimize.
[2024-05-28 16:15:36] [INFO ] Deduced a trap composed of 216 places in 156 ms of which 3 ms to minimize.
[2024-05-28 16:15:36] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 3 ms to minimize.
[2024-05-28 16:15:36] [INFO ] Deduced a trap composed of 241 places in 153 ms of which 2 ms to minimize.
[2024-05-28 16:15:36] [INFO ] Deduced a trap composed of 252 places in 143 ms of which 2 ms to minimize.
[2024-05-28 16:15:36] [INFO ] Deduced a trap composed of 212 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:15:37] [INFO ] Deduced a trap composed of 225 places in 129 ms of which 2 ms to minimize.
[2024-05-28 16:15:37] [INFO ] Deduced a trap composed of 244 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:15:37] [INFO ] Deduced a trap composed of 208 places in 159 ms of which 3 ms to minimize.
[2024-05-28 16:15:38] [INFO ] Deduced a trap composed of 266 places in 192 ms of which 2 ms to minimize.
[2024-05-28 16:15:38] [INFO ] Deduced a trap composed of 255 places in 185 ms of which 3 ms to minimize.
[2024-05-28 16:15:39] [INFO ] Deduced a trap composed of 232 places in 195 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-28 16:15:40] [INFO ] Deduced a trap composed of 285 places in 202 ms of which 4 ms to minimize.
[2024-05-28 16:15:40] [INFO ] Deduced a trap composed of 242 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:15:40] [INFO ] Deduced a trap composed of 247 places in 165 ms of which 3 ms to minimize.
[2024-05-28 16:15:40] [INFO ] Deduced a trap composed of 264 places in 157 ms of which 2 ms to minimize.
[2024-05-28 16:15:40] [INFO ] Deduced a trap composed of 281 places in 156 ms of which 2 ms to minimize.
[2024-05-28 16:15:41] [INFO ] Deduced a trap composed of 262 places in 133 ms of which 3 ms to minimize.
[2024-05-28 16:15:41] [INFO ] Deduced a trap composed of 251 places in 145 ms of which 3 ms to minimize.
[2024-05-28 16:15:41] [INFO ] Deduced a trap composed of 277 places in 143 ms of which 3 ms to minimize.
[2024-05-28 16:15:41] [INFO ] Deduced a trap composed of 271 places in 141 ms of which 2 ms to minimize.
[2024-05-28 16:15:41] [INFO ] Deduced a trap composed of 28 places in 201 ms of which 4 ms to minimize.
[2024-05-28 16:15:42] [INFO ] Deduced a trap composed of 205 places in 219 ms of which 3 ms to minimize.
[2024-05-28 16:15:43] [INFO ] Deduced a trap composed of 258 places in 149 ms of which 2 ms to minimize.
[2024-05-28 16:15:44] [INFO ] Deduced a trap composed of 233 places in 229 ms of which 3 ms to minimize.
[2024-05-28 16:15:45] [INFO ] Deduced a trap composed of 223 places in 224 ms of which 3 ms to minimize.
[2024-05-28 16:15:45] [INFO ] Deduced a trap composed of 315 places in 211 ms of which 3 ms to minimize.
[2024-05-28 16:15:45] [INFO ] Deduced a trap composed of 280 places in 197 ms of which 3 ms to minimize.
[2024-05-28 16:15:46] [INFO ] Deduced a trap composed of 292 places in 187 ms of which 3 ms to minimize.
[2024-05-28 16:15:46] [INFO ] Deduced a trap composed of 283 places in 194 ms of which 3 ms to minimize.
[2024-05-28 16:15:46] [INFO ] Deduced a trap composed of 255 places in 175 ms of which 3 ms to minimize.
[2024-05-28 16:15:46] [INFO ] Deduced a trap composed of 262 places in 153 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/1158 variables, and 82 constraints, problems are : Problem set: 0 solved, 720 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 720/720 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 720 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 40/82 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-28 16:15:51] [INFO ] Deduced a trap composed of 253 places in 207 ms of which 3 ms to minimize.
[2024-05-28 16:15:51] [INFO ] Deduced a trap composed of 250 places in 175 ms of which 2 ms to minimize.
[2024-05-28 16:15:51] [INFO ] Deduced a trap composed of 270 places in 160 ms of which 3 ms to minimize.
[2024-05-28 16:15:51] [INFO ] Deduced a trap composed of 256 places in 171 ms of which 3 ms to minimize.
[2024-05-28 16:15:52] [INFO ] Deduced a trap composed of 112 places in 153 ms of which 2 ms to minimize.
[2024-05-28 16:15:52] [INFO ] Deduced a trap composed of 258 places in 164 ms of which 3 ms to minimize.
[2024-05-28 16:15:52] [INFO ] Deduced a trap composed of 262 places in 177 ms of which 2 ms to minimize.
[2024-05-28 16:15:52] [INFO ] Deduced a trap composed of 268 places in 197 ms of which 4 ms to minimize.
[2024-05-28 16:15:52] [INFO ] Deduced a trap composed of 263 places in 157 ms of which 2 ms to minimize.
[2024-05-28 16:15:53] [INFO ] Deduced a trap composed of 280 places in 152 ms of which 2 ms to minimize.
[2024-05-28 16:15:53] [INFO ] Deduced a trap composed of 259 places in 151 ms of which 2 ms to minimize.
[2024-05-28 16:15:53] [INFO ] Deduced a trap composed of 262 places in 149 ms of which 3 ms to minimize.
[2024-05-28 16:15:53] [INFO ] Deduced a trap composed of 263 places in 146 ms of which 3 ms to minimize.
[2024-05-28 16:15:53] [INFO ] Deduced a trap composed of 281 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:15:53] [INFO ] Deduced a trap composed of 255 places in 135 ms of which 2 ms to minimize.
[2024-05-28 16:15:53] [INFO ] Deduced a trap composed of 247 places in 163 ms of which 3 ms to minimize.
[2024-05-28 16:15:54] [INFO ] Deduced a trap composed of 293 places in 169 ms of which 3 ms to minimize.
[2024-05-28 16:15:54] [INFO ] Deduced a trap composed of 283 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:15:54] [INFO ] Deduced a trap composed of 280 places in 135 ms of which 2 ms to minimize.
[2024-05-28 16:15:54] [INFO ] Deduced a trap composed of 283 places in 133 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-28 16:15:56] [INFO ] Deduced a trap composed of 270 places in 206 ms of which 3 ms to minimize.
[2024-05-28 16:15:56] [INFO ] Deduced a trap composed of 272 places in 187 ms of which 3 ms to minimize.
[2024-05-28 16:15:56] [INFO ] Deduced a trap composed of 281 places in 164 ms of which 3 ms to minimize.
[2024-05-28 16:15:56] [INFO ] Deduced a trap composed of 270 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:15:56] [INFO ] Deduced a trap composed of 258 places in 163 ms of which 3 ms to minimize.
[2024-05-28 16:15:57] [INFO ] Deduced a trap composed of 279 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:15:57] [INFO ] Deduced a trap composed of 283 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:15:57] [INFO ] Deduced a trap composed of 279 places in 148 ms of which 2 ms to minimize.
[2024-05-28 16:15:57] [INFO ] Deduced a trap composed of 283 places in 150 ms of which 2 ms to minimize.
[2024-05-28 16:15:57] [INFO ] Deduced a trap composed of 253 places in 174 ms of which 3 ms to minimize.
[2024-05-28 16:15:57] [INFO ] Deduced a trap composed of 253 places in 138 ms of which 2 ms to minimize.
[2024-05-28 16:15:58] [INFO ] Deduced a trap composed of 258 places in 163 ms of which 3 ms to minimize.
[2024-05-28 16:15:58] [INFO ] Deduced a trap composed of 247 places in 161 ms of which 3 ms to minimize.
[2024-05-28 16:15:58] [INFO ] Deduced a trap composed of 269 places in 132 ms of which 3 ms to minimize.
[2024-05-28 16:15:58] [INFO ] Deduced a trap composed of 274 places in 130 ms of which 3 ms to minimize.
[2024-05-28 16:15:58] [INFO ] Deduced a trap composed of 268 places in 129 ms of which 2 ms to minimize.
[2024-05-28 16:15:59] [INFO ] Deduced a trap composed of 243 places in 195 ms of which 3 ms to minimize.
[2024-05-28 16:15:59] [INFO ] Deduced a trap composed of 273 places in 137 ms of which 3 ms to minimize.
[2024-05-28 16:15:59] [INFO ] Deduced a trap composed of 280 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:15:59] [INFO ] Deduced a trap composed of 278 places in 136 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-28 16:16:01] [INFO ] Deduced a trap composed of 287 places in 174 ms of which 3 ms to minimize.
[2024-05-28 16:16:01] [INFO ] Deduced a trap composed of 290 places in 188 ms of which 3 ms to minimize.
[2024-05-28 16:16:01] [INFO ] Deduced a trap composed of 273 places in 171 ms of which 3 ms to minimize.
[2024-05-28 16:16:01] [INFO ] Deduced a trap composed of 279 places in 154 ms of which 3 ms to minimize.
[2024-05-28 16:16:02] [INFO ] Deduced a trap composed of 277 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:16:02] [INFO ] Deduced a trap composed of 280 places in 155 ms of which 3 ms to minimize.
[2024-05-28 16:16:02] [INFO ] Deduced a trap composed of 289 places in 168 ms of which 3 ms to minimize.
[2024-05-28 16:16:02] [INFO ] Deduced a trap composed of 268 places in 166 ms of which 3 ms to minimize.
[2024-05-28 16:16:02] [INFO ] Deduced a trap composed of 285 places in 141 ms of which 2 ms to minimize.
[2024-05-28 16:16:02] [INFO ] Deduced a trap composed of 284 places in 132 ms of which 2 ms to minimize.
[2024-05-28 16:16:03] [INFO ] Deduced a trap composed of 285 places in 135 ms of which 2 ms to minimize.
[2024-05-28 16:16:03] [INFO ] Deduced a trap composed of 282 places in 135 ms of which 2 ms to minimize.
[2024-05-28 16:16:03] [INFO ] Deduced a trap composed of 287 places in 131 ms of which 3 ms to minimize.
[2024-05-28 16:16:03] [INFO ] Deduced a trap composed of 274 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:16:03] [INFO ] Deduced a trap composed of 282 places in 141 ms of which 2 ms to minimize.
[2024-05-28 16:16:03] [INFO ] Deduced a trap composed of 280 places in 137 ms of which 2 ms to minimize.
[2024-05-28 16:16:04] [INFO ] Deduced a trap composed of 280 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:16:04] [INFO ] Deduced a trap composed of 284 places in 161 ms of which 3 ms to minimize.
[2024-05-28 16:16:04] [INFO ] Deduced a trap composed of 285 places in 135 ms of which 3 ms to minimize.
[2024-05-28 16:16:04] [INFO ] Deduced a trap composed of 289 places in 138 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-28 16:16:08] [INFO ] Deduced a trap composed of 266 places in 204 ms of which 3 ms to minimize.
[2024-05-28 16:16:08] [INFO ] Deduced a trap composed of 232 places in 224 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/1158 variables, and 144 constraints, problems are : Problem set: 0 solved, 720 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/720 constraints, Known Traps: 102/102 constraints]
After SMT, in 40520ms problems are : Problem set: 0 solved, 720 unsolved
Search for dead transitions found 0 dead transitions in 40528ms
[2024-05-28 16:16:09] [INFO ] Flow matrix only has 710 transitions (discarded 12 similar events)
[2024-05-28 16:16:09] [INFO ] Invariant cache hit.
[2024-05-28 16:16:09] [INFO ] Implicit Places using invariants in 416 ms returned [108, 227, 262, 265, 399, 409]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 419 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/453 places, 722/727 transitions.
Applied a total of 0 rules in 10 ms. Remains 442 /442 variables (removed 0) and now considering 722/722 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40995 ms. Remains : 442/453 places, 722/727 transitions.
[2024-05-28 16:16:09] [INFO ] Flatten gal took : 40 ms
[2024-05-28 16:16:09] [INFO ] Flatten gal took : 43 ms
[2024-05-28 16:16:09] [INFO ] Input system was already deterministic with 722 transitions.
[2024-05-28 16:16:09] [INFO ] Flatten gal took : 29 ms
[2024-05-28 16:16:10] [INFO ] Flatten gal took : 26 ms
[2024-05-28 16:16:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality1855660333344729083.gal : 4 ms
[2024-05-28 16:16:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality2363459861444338497.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/CTLCardinality1855660333344729083.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2363459861444338497.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.
Detected timeout of ITS tools.
[2024-05-28 16:16:40] [INFO ] Flatten gal took : 36 ms
[2024-05-28 16:16:40] [INFO ] Applying decomposition
[2024-05-28 16:16:40] [INFO ] Flatten gal took : 30 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/graph11680553065639554087.txt' '-o' '/tmp/graph11680553065639554087.bin' '-w' '/tmp/graph11680553065639554087.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11680553065639554087.bin' '-l' '-1' '-v' '-w' '/tmp/graph11680553065639554087.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:16:40] [INFO ] Decomposing Gal with order
[2024-05-28 16:16:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:16:40] [INFO ] Removed a total of 647 redundant transitions.
[2024-05-28 16:16:40] [INFO ] Flatten gal took : 60 ms
[2024-05-28 16:16:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 189 labels/synchronizations in 25 ms.
[2024-05-28 16:16:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality8353244982069573391.gal : 11 ms
[2024-05-28 16:16:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality11817367514808359415.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/CTLCardinality8353244982069573391.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11817367514808359415.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 453/453 places, 727/727 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 450 transition count 724
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 450 transition count 724
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 448 transition count 722
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 448 transition count 722
Applied a total of 10 rules in 34 ms. Remains 448 /453 variables (removed 5) and now considering 722/727 (removed 5) transitions.
Running 720 sub problems to find dead transitions.
[2024-05-28 16:17:10] [INFO ] Flow matrix only has 710 transitions (discarded 12 similar events)
[2024-05-28 16:17:10] [INFO ] Invariant cache hit.
[2024-05-28 16:17:10] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-28 16:17:15] [INFO ] Deduced a trap composed of 61 places in 31 ms of which 1 ms to minimize.
[2024-05-28 16:17:15] [INFO ] Deduced a trap composed of 62 places in 30 ms of which 0 ms to minimize.
[2024-05-28 16:17:16] [INFO ] Deduced a trap composed of 62 places in 31 ms of which 1 ms to minimize.
[2024-05-28 16:17:16] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-05-28 16:17:16] [INFO ] Deduced a trap composed of 62 places in 29 ms of which 0 ms to minimize.
[2024-05-28 16:17:16] [INFO ] Deduced a trap composed of 62 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:17:16] [INFO ] Deduced a trap composed of 270 places in 145 ms of which 2 ms to minimize.
[2024-05-28 16:17:16] [INFO ] Deduced a trap composed of 117 places in 142 ms of which 2 ms to minimize.
[2024-05-28 16:17:16] [INFO ] Deduced a trap composed of 62 places in 29 ms of which 1 ms to minimize.
[2024-05-28 16:17:17] [INFO ] Deduced a trap composed of 110 places in 152 ms of which 3 ms to minimize.
[2024-05-28 16:17:17] [INFO ] Deduced a trap composed of 229 places in 152 ms of which 5 ms to minimize.
[2024-05-28 16:17:17] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-05-28 16:17:17] [INFO ] Deduced a trap composed of 248 places in 138 ms of which 3 ms to minimize.
[2024-05-28 16:17:17] [INFO ] Deduced a trap composed of 254 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:17:17] [INFO ] Deduced a trap composed of 212 places in 129 ms of which 2 ms to minimize.
[2024-05-28 16:17:17] [INFO ] Deduced a trap composed of 208 places in 130 ms of which 3 ms to minimize.
[2024-05-28 16:17:18] [INFO ] Deduced a trap composed of 279 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:17:19] [INFO ] Deduced a trap composed of 253 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:17:19] [INFO ] Deduced a trap composed of 229 places in 169 ms of which 3 ms to minimize.
[2024-05-28 16:17:20] [INFO ] Deduced a trap composed of 251 places in 183 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-28 16:17:20] [INFO ] Deduced a trap composed of 278 places in 129 ms of which 2 ms to minimize.
[2024-05-28 16:17:20] [INFO ] Deduced a trap composed of 255 places in 130 ms of which 3 ms to minimize.
[2024-05-28 16:17:21] [INFO ] Deduced a trap composed of 270 places in 154 ms of which 2 ms to minimize.
[2024-05-28 16:17:21] [INFO ] Deduced a trap composed of 255 places in 147 ms of which 2 ms to minimize.
[2024-05-28 16:17:21] [INFO ] Deduced a trap composed of 253 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:17:21] [INFO ] Deduced a trap composed of 235 places in 125 ms of which 2 ms to minimize.
[2024-05-28 16:17:22] [INFO ] Deduced a trap composed of 246 places in 138 ms of which 3 ms to minimize.
[2024-05-28 16:17:22] [INFO ] Deduced a trap composed of 265 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:17:22] [INFO ] Deduced a trap composed of 273 places in 126 ms of which 2 ms to minimize.
[2024-05-28 16:17:22] [INFO ] Deduced a trap composed of 240 places in 128 ms of which 2 ms to minimize.
[2024-05-28 16:17:22] [INFO ] Deduced a trap composed of 239 places in 126 ms of which 2 ms to minimize.
[2024-05-28 16:17:23] [INFO ] Deduced a trap composed of 242 places in 202 ms of which 3 ms to minimize.
[2024-05-28 16:17:24] [INFO ] Deduced a trap composed of 221 places in 164 ms of which 4 ms to minimize.
[2024-05-28 16:17:24] [INFO ] Deduced a trap composed of 262 places in 194 ms of which 3 ms to minimize.
[2024-05-28 16:17:25] [INFO ] Deduced a trap composed of 225 places in 156 ms of which 3 ms to minimize.
[2024-05-28 16:17:25] [INFO ] Deduced a trap composed of 253 places in 185 ms of which 3 ms to minimize.
[2024-05-28 16:17:25] [INFO ] Deduced a trap composed of 253 places in 135 ms of which 2 ms to minimize.
[2024-05-28 16:17:25] [INFO ] Deduced a trap composed of 263 places in 192 ms of which 7 ms to minimize.
[2024-05-28 16:17:26] [INFO ] Deduced a trap composed of 223 places in 150 ms of which 3 ms to minimize.
[2024-05-28 16:17:26] [INFO ] Deduced a trap composed of 284 places in 149 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/1158 variables, and 82 constraints, problems are : Problem set: 0 solved, 720 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 720/720 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 720 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 40/82 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-28 16:17:33] [INFO ] Deduced a trap composed of 281 places in 188 ms of which 3 ms to minimize.
[2024-05-28 16:17:33] [INFO ] Deduced a trap composed of 266 places in 203 ms of which 3 ms to minimize.
[2024-05-28 16:17:33] [INFO ] Deduced a trap composed of 281 places in 154 ms of which 3 ms to minimize.
[2024-05-28 16:17:33] [INFO ] Deduced a trap composed of 281 places in 150 ms of which 2 ms to minimize.
[2024-05-28 16:17:34] [INFO ] Deduced a trap composed of 282 places in 149 ms of which 2 ms to minimize.
[2024-05-28 16:17:34] [INFO ] Deduced a trap composed of 285 places in 149 ms of which 3 ms to minimize.
[2024-05-28 16:17:34] [INFO ] Deduced a trap composed of 277 places in 148 ms of which 3 ms to minimize.
[2024-05-28 16:17:34] [INFO ] Deduced a trap composed of 289 places in 139 ms of which 2 ms to minimize.
[2024-05-28 16:17:34] [INFO ] Deduced a trap composed of 279 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:17:34] [INFO ] Deduced a trap composed of 248 places in 130 ms of which 3 ms to minimize.
[2024-05-28 16:17:34] [INFO ] Deduced a trap composed of 287 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:17:35] [INFO ] Deduced a trap composed of 290 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:17:35] [INFO ] Deduced a trap composed of 263 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:17:35] [INFO ] Deduced a trap composed of 270 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:17:35] [INFO ] Deduced a trap composed of 290 places in 132 ms of which 2 ms to minimize.
[2024-05-28 16:17:35] [INFO ] Deduced a trap composed of 274 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:17:35] [INFO ] Deduced a trap composed of 277 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:17:35] [INFO ] Deduced a trap composed of 278 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:17:36] [INFO ] Deduced a trap composed of 270 places in 134 ms of which 2 ms to minimize.
[2024-05-28 16:17:36] [INFO ] Deduced a trap composed of 280 places in 131 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-28 16:17:37] [INFO ] Deduced a trap composed of 240 places in 171 ms of which 3 ms to minimize.
[2024-05-28 16:17:38] [INFO ] Deduced a trap composed of 262 places in 187 ms of which 2 ms to minimize.
[2024-05-28 16:17:38] [INFO ] Deduced a trap composed of 285 places in 179 ms of which 3 ms to minimize.
[2024-05-28 16:17:38] [INFO ] Deduced a trap composed of 291 places in 177 ms of which 3 ms to minimize.
[2024-05-28 16:17:38] [INFO ] Deduced a trap composed of 285 places in 170 ms of which 2 ms to minimize.
[2024-05-28 16:17:39] [INFO ] Deduced a trap composed of 272 places in 154 ms of which 2 ms to minimize.
[2024-05-28 16:17:39] [INFO ] Deduced a trap composed of 282 places in 147 ms of which 3 ms to minimize.
[2024-05-28 16:17:39] [INFO ] Deduced a trap composed of 265 places in 149 ms of which 3 ms to minimize.
[2024-05-28 16:17:39] [INFO ] Deduced a trap composed of 263 places in 153 ms of which 3 ms to minimize.
[2024-05-28 16:17:39] [INFO ] Deduced a trap composed of 272 places in 146 ms of which 2 ms to minimize.
[2024-05-28 16:17:39] [INFO ] Deduced a trap composed of 277 places in 142 ms of which 3 ms to minimize.
[2024-05-28 16:17:40] [INFO ] Deduced a trap composed of 223 places in 168 ms of which 3 ms to minimize.
[2024-05-28 16:17:40] [INFO ] Deduced a trap composed of 246 places in 193 ms of which 3 ms to minimize.
[2024-05-28 16:17:40] [INFO ] Deduced a trap composed of 259 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:17:40] [INFO ] Deduced a trap composed of 256 places in 128 ms of which 2 ms to minimize.
[2024-05-28 16:17:41] [INFO ] Deduced a trap composed of 269 places in 139 ms of which 3 ms to minimize.
[2024-05-28 16:17:41] [INFO ] Deduced a trap composed of 255 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:17:41] [INFO ] Deduced a trap composed of 277 places in 127 ms of which 2 ms to minimize.
[2024-05-28 16:17:41] [INFO ] Deduced a trap composed of 268 places in 203 ms of which 3 ms to minimize.
[2024-05-28 16:17:41] [INFO ] Deduced a trap composed of 277 places in 196 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/1158 variables, and 122 constraints, problems are : Problem set: 0 solved, 720 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/720 constraints, Known Traps: 80/80 constraints]
After SMT, in 40598ms problems are : Problem set: 0 solved, 720 unsolved
Search for dead transitions found 0 dead transitions in 40608ms
[2024-05-28 16:17:51] [INFO ] Flow matrix only has 710 transitions (discarded 12 similar events)
[2024-05-28 16:17:51] [INFO ] Invariant cache hit.
[2024-05-28 16:17:51] [INFO ] Implicit Places using invariants in 301 ms returned [108, 227, 262, 265, 399, 409]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 303 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/453 places, 722/727 transitions.
Applied a total of 0 rules in 4 ms. Remains 442 /442 variables (removed 0) and now considering 722/722 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40953 ms. Remains : 442/453 places, 722/727 transitions.
[2024-05-28 16:17:51] [INFO ] Flatten gal took : 20 ms
[2024-05-28 16:17:51] [INFO ] Flatten gal took : 20 ms
[2024-05-28 16:17:51] [INFO ] Input system was already deterministic with 722 transitions.
[2024-05-28 16:17:51] [INFO ] Flatten gal took : 19 ms
[2024-05-28 16:17:51] [INFO ] Flatten gal took : 19 ms
[2024-05-28 16:17:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality10041586413452275767.gal : 4 ms
[2024-05-28 16:17:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality7534629107492478835.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/CTLCardinality10041586413452275767.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7534629107492478835.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.
Detected timeout of ITS tools.
[2024-05-28 16:18:21] [INFO ] Flatten gal took : 22 ms
[2024-05-28 16:18:21] [INFO ] Applying decomposition
[2024-05-28 16:18:21] [INFO ] Flatten gal took : 22 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/graph2687507834239264816.txt' '-o' '/tmp/graph2687507834239264816.bin' '-w' '/tmp/graph2687507834239264816.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2687507834239264816.bin' '-l' '-1' '-v' '-w' '/tmp/graph2687507834239264816.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:18:21] [INFO ] Decomposing Gal with order
[2024-05-28 16:18:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:18:21] [INFO ] Removed a total of 769 redundant transitions.
[2024-05-28 16:18:21] [INFO ] Flatten gal took : 99 ms
[2024-05-28 16:18:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 157 labels/synchronizations in 34 ms.
[2024-05-28 16:18:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality5800921992017639436.gal : 12 ms
[2024-05-28 16:18:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality2305229883737761322.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/CTLCardinality5800921992017639436.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2305229883737761322.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 453/453 places, 727/727 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 450 transition count 724
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 450 transition count 724
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 448 transition count 722
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 448 transition count 722
Applied a total of 10 rules in 11 ms. Remains 448 /453 variables (removed 5) and now considering 722/727 (removed 5) transitions.
Running 720 sub problems to find dead transitions.
[2024-05-28 16:18:52] [INFO ] Flow matrix only has 710 transitions (discarded 12 similar events)
[2024-05-28 16:18:52] [INFO ] Invariant cache hit.
[2024-05-28 16:18:52] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-28 16:18:57] [INFO ] Deduced a trap composed of 61 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:18:57] [INFO ] Deduced a trap composed of 62 places in 27 ms of which 1 ms to minimize.
[2024-05-28 16:18:57] [INFO ] Deduced a trap composed of 62 places in 26 ms of which 0 ms to minimize.
[2024-05-28 16:18:58] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-05-28 16:18:58] [INFO ] Deduced a trap composed of 62 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:18:58] [INFO ] Deduced a trap composed of 62 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:18:58] [INFO ] Deduced a trap composed of 270 places in 192 ms of which 2 ms to minimize.
[2024-05-28 16:18:58] [INFO ] Deduced a trap composed of 117 places in 160 ms of which 2 ms to minimize.
[2024-05-28 16:18:58] [INFO ] Deduced a trap composed of 62 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:18:59] [INFO ] Deduced a trap composed of 110 places in 176 ms of which 3 ms to minimize.
[2024-05-28 16:18:59] [INFO ] Deduced a trap composed of 229 places in 141 ms of which 2 ms to minimize.
[2024-05-28 16:18:59] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 1 ms to minimize.
[2024-05-28 16:18:59] [INFO ] Deduced a trap composed of 248 places in 165 ms of which 3 ms to minimize.
[2024-05-28 16:18:59] [INFO ] Deduced a trap composed of 254 places in 137 ms of which 2 ms to minimize.
[2024-05-28 16:18:59] [INFO ] Deduced a trap composed of 212 places in 168 ms of which 3 ms to minimize.
[2024-05-28 16:19:00] [INFO ] Deduced a trap composed of 208 places in 162 ms of which 2 ms to minimize.
[2024-05-28 16:19:00] [INFO ] Deduced a trap composed of 279 places in 172 ms of which 4 ms to minimize.
[2024-05-28 16:19:01] [INFO ] Deduced a trap composed of 253 places in 178 ms of which 3 ms to minimize.
[2024-05-28 16:19:01] [INFO ] Deduced a trap composed of 229 places in 164 ms of which 3 ms to minimize.
[2024-05-28 16:19:02] [INFO ] Deduced a trap composed of 251 places in 189 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-28 16:19:03] [INFO ] Deduced a trap composed of 278 places in 130 ms of which 3 ms to minimize.
[2024-05-28 16:19:03] [INFO ] Deduced a trap composed of 255 places in 131 ms of which 3 ms to minimize.
[2024-05-28 16:19:03] [INFO ] Deduced a trap composed of 270 places in 202 ms of which 3 ms to minimize.
[2024-05-28 16:19:03] [INFO ] Deduced a trap composed of 255 places in 168 ms of which 3 ms to minimize.
[2024-05-28 16:19:04] [INFO ] Deduced a trap composed of 253 places in 155 ms of which 2 ms to minimize.
[2024-05-28 16:19:04] [INFO ] Deduced a trap composed of 235 places in 126 ms of which 3 ms to minimize.
[2024-05-28 16:19:04] [INFO ] Deduced a trap composed of 246 places in 128 ms of which 3 ms to minimize.
[2024-05-28 16:19:05] [INFO ] Deduced a trap composed of 265 places in 186 ms of which 3 ms to minimize.
[2024-05-28 16:19:05] [INFO ] Deduced a trap composed of 273 places in 132 ms of which 3 ms to minimize.
[2024-05-28 16:19:05] [INFO ] Deduced a trap composed of 240 places in 129 ms of which 3 ms to minimize.
[2024-05-28 16:19:05] [INFO ] Deduced a trap composed of 239 places in 142 ms of which 3 ms to minimize.
[2024-05-28 16:19:06] [INFO ] Deduced a trap composed of 242 places in 194 ms of which 4 ms to minimize.
[2024-05-28 16:19:07] [INFO ] Deduced a trap composed of 221 places in 131 ms of which 3 ms to minimize.
[2024-05-28 16:19:07] [INFO ] Deduced a trap composed of 262 places in 128 ms of which 2 ms to minimize.
[2024-05-28 16:19:07] [INFO ] Deduced a trap composed of 225 places in 159 ms of which 2 ms to minimize.
[2024-05-28 16:19:07] [INFO ] Deduced a trap composed of 253 places in 146 ms of which 3 ms to minimize.
[2024-05-28 16:19:07] [INFO ] Deduced a trap composed of 253 places in 142 ms of which 3 ms to minimize.
[2024-05-28 16:19:08] [INFO ] Deduced a trap composed of 263 places in 139 ms of which 2 ms to minimize.
[2024-05-28 16:19:08] [INFO ] Deduced a trap composed of 223 places in 137 ms of which 2 ms to minimize.
[2024-05-28 16:19:08] [INFO ] Deduced a trap composed of 284 places in 129 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/1158 variables, and 82 constraints, problems are : Problem set: 0 solved, 720 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 720/720 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 720 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 40/82 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-28 16:19:14] [INFO ] Deduced a trap composed of 281 places in 172 ms of which 4 ms to minimize.
[2024-05-28 16:19:14] [INFO ] Deduced a trap composed of 266 places in 222 ms of which 3 ms to minimize.
[2024-05-28 16:19:14] [INFO ] Deduced a trap composed of 281 places in 132 ms of which 2 ms to minimize.
[2024-05-28 16:19:15] [INFO ] Deduced a trap composed of 281 places in 129 ms of which 2 ms to minimize.
[2024-05-28 16:19:15] [INFO ] Deduced a trap composed of 282 places in 149 ms of which 2 ms to minimize.
[2024-05-28 16:19:15] [INFO ] Deduced a trap composed of 285 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:19:15] [INFO ] Deduced a trap composed of 277 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:19:15] [INFO ] Deduced a trap composed of 289 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:19:15] [INFO ] Deduced a trap composed of 279 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:19:16] [INFO ] Deduced a trap composed of 248 places in 168 ms of which 3 ms to minimize.
[2024-05-28 16:19:16] [INFO ] Deduced a trap composed of 287 places in 133 ms of which 3 ms to minimize.
[2024-05-28 16:19:16] [INFO ] Deduced a trap composed of 290 places in 134 ms of which 2 ms to minimize.
[2024-05-28 16:19:16] [INFO ] Deduced a trap composed of 263 places in 134 ms of which 2 ms to minimize.
[2024-05-28 16:19:16] [INFO ] Deduced a trap composed of 270 places in 171 ms of which 3 ms to minimize.
[2024-05-28 16:19:16] [INFO ] Deduced a trap composed of 290 places in 169 ms of which 3 ms to minimize.
[2024-05-28 16:19:16] [INFO ] Deduced a trap composed of 274 places in 135 ms of which 2 ms to minimize.
[2024-05-28 16:19:17] [INFO ] Deduced a trap composed of 277 places in 174 ms of which 3 ms to minimize.
[2024-05-28 16:19:17] [INFO ] Deduced a trap composed of 278 places in 150 ms of which 2 ms to minimize.
[2024-05-28 16:19:17] [INFO ] Deduced a trap composed of 270 places in 137 ms of which 2 ms to minimize.
[2024-05-28 16:19:17] [INFO ] Deduced a trap composed of 280 places in 134 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-28 16:19:19] [INFO ] Deduced a trap composed of 240 places in 218 ms of which 3 ms to minimize.
[2024-05-28 16:19:19] [INFO ] Deduced a trap composed of 262 places in 166 ms of which 3 ms to minimize.
[2024-05-28 16:19:19] [INFO ] Deduced a trap composed of 285 places in 171 ms of which 4 ms to minimize.
[2024-05-28 16:19:19] [INFO ] Deduced a trap composed of 291 places in 180 ms of which 3 ms to minimize.
[2024-05-28 16:19:20] [INFO ] Deduced a trap composed of 285 places in 189 ms of which 4 ms to minimize.
[2024-05-28 16:19:20] [INFO ] Deduced a trap composed of 272 places in 205 ms of which 3 ms to minimize.
[2024-05-28 16:19:20] [INFO ] Deduced a trap composed of 282 places in 179 ms of which 3 ms to minimize.
[2024-05-28 16:19:20] [INFO ] Deduced a trap composed of 265 places in 168 ms of which 3 ms to minimize.
[2024-05-28 16:19:21] [INFO ] Deduced a trap composed of 263 places in 169 ms of which 3 ms to minimize.
[2024-05-28 16:19:21] [INFO ] Deduced a trap composed of 272 places in 145 ms of which 2 ms to minimize.
[2024-05-28 16:19:21] [INFO ] Deduced a trap composed of 277 places in 169 ms of which 2 ms to minimize.
[2024-05-28 16:19:21] [INFO ] Deduced a trap composed of 223 places in 158 ms of which 2 ms to minimize.
[2024-05-28 16:19:22] [INFO ] Deduced a trap composed of 246 places in 167 ms of which 3 ms to minimize.
[2024-05-28 16:19:22] [INFO ] Deduced a trap composed of 259 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:19:22] [INFO ] Deduced a trap composed of 256 places in 137 ms of which 2 ms to minimize.
[2024-05-28 16:19:22] [INFO ] Deduced a trap composed of 269 places in 131 ms of which 5 ms to minimize.
[2024-05-28 16:19:22] [INFO ] Deduced a trap composed of 255 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:19:22] [INFO ] Deduced a trap composed of 277 places in 127 ms of which 2 ms to minimize.
[2024-05-28 16:19:23] [INFO ] Deduced a trap composed of 268 places in 218 ms of which 3 ms to minimize.
[2024-05-28 16:19:23] [INFO ] Deduced a trap composed of 277 places in 131 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/1158 variables, and 122 constraints, problems are : Problem set: 0 solved, 720 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/720 constraints, Known Traps: 80/80 constraints]
After SMT, in 40451ms problems are : Problem set: 0 solved, 720 unsolved
Search for dead transitions found 0 dead transitions in 40456ms
[2024-05-28 16:19:32] [INFO ] Flow matrix only has 710 transitions (discarded 12 similar events)
[2024-05-28 16:19:32] [INFO ] Invariant cache hit.
[2024-05-28 16:19:33] [INFO ] Implicit Places using invariants in 334 ms returned [108, 227, 262, 265, 399, 409]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 335 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/453 places, 722/727 transitions.
Applied a total of 0 rules in 4 ms. Remains 442 /442 variables (removed 0) and now considering 722/722 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40809 ms. Remains : 442/453 places, 722/727 transitions.
[2024-05-28 16:19:33] [INFO ] Flatten gal took : 18 ms
[2024-05-28 16:19:33] [INFO ] Flatten gal took : 18 ms
[2024-05-28 16:19:33] [INFO ] Input system was already deterministic with 722 transitions.
[2024-05-28 16:19:33] [INFO ] Flatten gal took : 17 ms
[2024-05-28 16:19:33] [INFO ] Flatten gal took : 18 ms
[2024-05-28 16:19:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality922388649871956203.gal : 5 ms
[2024-05-28 16:19:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality11950124967805829573.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/CTLCardinality922388649871956203.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11950124967805829573.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.
Detected timeout of ITS tools.
[2024-05-28 16:20:03] [INFO ] Flatten gal took : 43 ms
[2024-05-28 16:20:03] [INFO ] Applying decomposition
[2024-05-28 16:20:03] [INFO ] Flatten gal took : 35 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/graph5770875025685420233.txt' '-o' '/tmp/graph5770875025685420233.bin' '-w' '/tmp/graph5770875025685420233.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5770875025685420233.bin' '-l' '-1' '-v' '-w' '/tmp/graph5770875025685420233.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:20:03] [INFO ] Decomposing Gal with order
[2024-05-28 16:20:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:20:03] [INFO ] Removed a total of 637 redundant transitions.
[2024-05-28 16:20:03] [INFO ] Flatten gal took : 74 ms
[2024-05-28 16:20:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 132 labels/synchronizations in 28 ms.
[2024-05-28 16:20:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality12111508710980879785.gal : 20 ms
[2024-05-28 16:20:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality14398058587993625432.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/CTLCardinality12111508710980879785.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14398058587993625432.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 453/453 places, 727/727 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 450 transition count 724
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 450 transition count 724
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 448 transition count 722
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 448 transition count 722
Applied a total of 10 rules in 22 ms. Remains 448 /453 variables (removed 5) and now considering 722/727 (removed 5) transitions.
Running 720 sub problems to find dead transitions.
[2024-05-28 16:20:33] [INFO ] Flow matrix only has 710 transitions (discarded 12 similar events)
[2024-05-28 16:20:33] [INFO ] Invariant cache hit.
[2024-05-28 16:20:33] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-28 16:20:38] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 1 ms to minimize.
[2024-05-28 16:20:38] [INFO ] Deduced a trap composed of 62 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:20:38] [INFO ] Deduced a trap composed of 62 places in 33 ms of which 1 ms to minimize.
[2024-05-28 16:20:39] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-05-28 16:20:39] [INFO ] Deduced a trap composed of 62 places in 28 ms of which 0 ms to minimize.
[2024-05-28 16:20:39] [INFO ] Deduced a trap composed of 62 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:20:39] [INFO ] Deduced a trap composed of 270 places in 191 ms of which 3 ms to minimize.
[2024-05-28 16:20:39] [INFO ] Deduced a trap composed of 117 places in 168 ms of which 3 ms to minimize.
[2024-05-28 16:20:39] [INFO ] Deduced a trap composed of 62 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:20:40] [INFO ] Deduced a trap composed of 110 places in 145 ms of which 3 ms to minimize.
[2024-05-28 16:20:40] [INFO ] Deduced a trap composed of 229 places in 154 ms of which 3 ms to minimize.
[2024-05-28 16:20:40] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 1 ms to minimize.
[2024-05-28 16:20:40] [INFO ] Deduced a trap composed of 248 places in 149 ms of which 2 ms to minimize.
[2024-05-28 16:20:40] [INFO ] Deduced a trap composed of 254 places in 132 ms of which 3 ms to minimize.
[2024-05-28 16:20:40] [INFO ] Deduced a trap composed of 212 places in 165 ms of which 3 ms to minimize.
[2024-05-28 16:20:41] [INFO ] Deduced a trap composed of 208 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:20:41] [INFO ] Deduced a trap composed of 279 places in 148 ms of which 2 ms to minimize.
[2024-05-28 16:20:42] [INFO ] Deduced a trap composed of 253 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:20:42] [INFO ] Deduced a trap composed of 229 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:20:43] [INFO ] Deduced a trap composed of 251 places in 208 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-28 16:20:43] [INFO ] Deduced a trap composed of 278 places in 128 ms of which 3 ms to minimize.
[2024-05-28 16:20:43] [INFO ] Deduced a trap composed of 255 places in 144 ms of which 9 ms to minimize.
[2024-05-28 16:20:44] [INFO ] Deduced a trap composed of 270 places in 193 ms of which 3 ms to minimize.
[2024-05-28 16:20:44] [INFO ] Deduced a trap composed of 255 places in 131 ms of which 3 ms to minimize.
[2024-05-28 16:20:44] [INFO ] Deduced a trap composed of 253 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:20:44] [INFO ] Deduced a trap composed of 235 places in 163 ms of which 3 ms to minimize.
[2024-05-28 16:20:45] [INFO ] Deduced a trap composed of 246 places in 165 ms of which 3 ms to minimize.
[2024-05-28 16:20:45] [INFO ] Deduced a trap composed of 265 places in 144 ms of which 3 ms to minimize.
[2024-05-28 16:20:45] [INFO ] Deduced a trap composed of 273 places in 155 ms of which 2 ms to minimize.
[2024-05-28 16:20:45] [INFO ] Deduced a trap composed of 240 places in 162 ms of which 4 ms to minimize.
[2024-05-28 16:20:45] [INFO ] Deduced a trap composed of 239 places in 162 ms of which 6 ms to minimize.
[2024-05-28 16:20:47] [INFO ] Deduced a trap composed of 242 places in 201 ms of which 3 ms to minimize.
[2024-05-28 16:20:47] [INFO ] Deduced a trap composed of 221 places in 199 ms of which 4 ms to minimize.
[2024-05-28 16:20:48] [INFO ] Deduced a trap composed of 262 places in 196 ms of which 3 ms to minimize.
[2024-05-28 16:20:48] [INFO ] Deduced a trap composed of 225 places in 171 ms of which 3 ms to minimize.
[2024-05-28 16:20:48] [INFO ] Deduced a trap composed of 253 places in 217 ms of which 3 ms to minimize.
[2024-05-28 16:20:48] [INFO ] Deduced a trap composed of 253 places in 154 ms of which 2 ms to minimize.
[2024-05-28 16:20:49] [INFO ] Deduced a trap composed of 263 places in 191 ms of which 3 ms to minimize.
[2024-05-28 16:20:49] [INFO ] Deduced a trap composed of 223 places in 159 ms of which 2 ms to minimize.
[2024-05-28 16:20:49] [INFO ] Deduced a trap composed of 284 places in 141 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/1158 variables, and 82 constraints, problems are : Problem set: 0 solved, 720 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 720/720 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 720 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 40/82 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-28 16:20:55] [INFO ] Deduced a trap composed of 281 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:20:56] [INFO ] Deduced a trap composed of 266 places in 169 ms of which 3 ms to minimize.
[2024-05-28 16:20:56] [INFO ] Deduced a trap composed of 281 places in 135 ms of which 2 ms to minimize.
[2024-05-28 16:20:56] [INFO ] Deduced a trap composed of 281 places in 135 ms of which 3 ms to minimize.
[2024-05-28 16:20:56] [INFO ] Deduced a trap composed of 282 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:20:56] [INFO ] Deduced a trap composed of 285 places in 143 ms of which 3 ms to minimize.
[2024-05-28 16:20:56] [INFO ] Deduced a trap composed of 277 places in 133 ms of which 3 ms to minimize.
[2024-05-28 16:20:56] [INFO ] Deduced a trap composed of 289 places in 134 ms of which 2 ms to minimize.
[2024-05-28 16:20:57] [INFO ] Deduced a trap composed of 279 places in 137 ms of which 3 ms to minimize.
[2024-05-28 16:20:57] [INFO ] Deduced a trap composed of 248 places in 141 ms of which 2 ms to minimize.
[2024-05-28 16:20:57] [INFO ] Deduced a trap composed of 287 places in 134 ms of which 2 ms to minimize.
[2024-05-28 16:20:57] [INFO ] Deduced a trap composed of 290 places in 144 ms of which 2 ms to minimize.
[2024-05-28 16:20:57] [INFO ] Deduced a trap composed of 263 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:20:57] [INFO ] Deduced a trap composed of 270 places in 132 ms of which 2 ms to minimize.
[2024-05-28 16:20:58] [INFO ] Deduced a trap composed of 290 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:20:58] [INFO ] Deduced a trap composed of 274 places in 132 ms of which 2 ms to minimize.
[2024-05-28 16:20:58] [INFO ] Deduced a trap composed of 277 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:20:58] [INFO ] Deduced a trap composed of 278 places in 134 ms of which 2 ms to minimize.
[2024-05-28 16:20:58] [INFO ] Deduced a trap composed of 270 places in 133 ms of which 3 ms to minimize.
[2024-05-28 16:20:58] [INFO ] Deduced a trap composed of 280 places in 136 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-28 16:21:00] [INFO ] Deduced a trap composed of 240 places in 200 ms of which 2 ms to minimize.
[2024-05-28 16:21:00] [INFO ] Deduced a trap composed of 262 places in 156 ms of which 3 ms to minimize.
[2024-05-28 16:21:00] [INFO ] Deduced a trap composed of 285 places in 168 ms of which 4 ms to minimize.
[2024-05-28 16:21:01] [INFO ] Deduced a trap composed of 291 places in 168 ms of which 4 ms to minimize.
[2024-05-28 16:21:01] [INFO ] Deduced a trap composed of 285 places in 168 ms of which 3 ms to minimize.
[2024-05-28 16:21:01] [INFO ] Deduced a trap composed of 272 places in 141 ms of which 3 ms to minimize.
[2024-05-28 16:21:01] [INFO ] Deduced a trap composed of 282 places in 132 ms of which 2 ms to minimize.
[2024-05-28 16:21:01] [INFO ] Deduced a trap composed of 265 places in 132 ms of which 2 ms to minimize.
[2024-05-28 16:21:01] [INFO ] Deduced a trap composed of 263 places in 144 ms of which 2 ms to minimize.
[2024-05-28 16:21:02] [INFO ] Deduced a trap composed of 272 places in 129 ms of which 3 ms to minimize.
[2024-05-28 16:21:02] [INFO ] Deduced a trap composed of 277 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:21:02] [INFO ] Deduced a trap composed of 223 places in 135 ms of which 2 ms to minimize.
[2024-05-28 16:21:02] [INFO ] Deduced a trap composed of 246 places in 187 ms of which 3 ms to minimize.
[2024-05-28 16:21:03] [INFO ] Deduced a trap composed of 259 places in 128 ms of which 2 ms to minimize.
[2024-05-28 16:21:03] [INFO ] Deduced a trap composed of 256 places in 129 ms of which 2 ms to minimize.
[2024-05-28 16:21:03] [INFO ] Deduced a trap composed of 269 places in 125 ms of which 2 ms to minimize.
[2024-05-28 16:21:03] [INFO ] Deduced a trap composed of 255 places in 127 ms of which 3 ms to minimize.
[2024-05-28 16:21:03] [INFO ] Deduced a trap composed of 277 places in 128 ms of which 2 ms to minimize.
[2024-05-28 16:21:04] [INFO ] Deduced a trap composed of 268 places in 207 ms of which 3 ms to minimize.
[2024-05-28 16:21:04] [INFO ] Deduced a trap composed of 277 places in 131 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/1158 variables, and 122 constraints, problems are : Problem set: 0 solved, 720 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/720 constraints, Known Traps: 80/80 constraints]
After SMT, in 40450ms problems are : Problem set: 0 solved, 720 unsolved
Search for dead transitions found 0 dead transitions in 40458ms
[2024-05-28 16:21:14] [INFO ] Flow matrix only has 710 transitions (discarded 12 similar events)
[2024-05-28 16:21:14] [INFO ] Invariant cache hit.
[2024-05-28 16:21:14] [INFO ] Implicit Places using invariants in 403 ms returned [108, 227, 262, 265, 399, 409]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 409 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/453 places, 722/727 transitions.
Applied a total of 0 rules in 5 ms. Remains 442 /442 variables (removed 0) and now considering 722/722 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40897 ms. Remains : 442/453 places, 722/727 transitions.
[2024-05-28 16:21:14] [INFO ] Flatten gal took : 22 ms
[2024-05-28 16:21:14] [INFO ] Flatten gal took : 24 ms
[2024-05-28 16:21:14] [INFO ] Input system was already deterministic with 722 transitions.
[2024-05-28 16:21:14] [INFO ] Flatten gal took : 24 ms
[2024-05-28 16:21:14] [INFO ] Flatten gal took : 25 ms
[2024-05-28 16:21:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality16381206559289408312.gal : 4 ms
[2024-05-28 16:21:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality17123995180064507596.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/CTLCardinality16381206559289408312.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17123995180064507596.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.
Detected timeout of ITS tools.
[2024-05-28 16:21:44] [INFO ] Flatten gal took : 40 ms
[2024-05-28 16:21:44] [INFO ] Applying decomposition
[2024-05-28 16:21:44] [INFO ] Flatten gal took : 32 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/graph9328262171848883459.txt' '-o' '/tmp/graph9328262171848883459.bin' '-w' '/tmp/graph9328262171848883459.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9328262171848883459.bin' '-l' '-1' '-v' '-w' '/tmp/graph9328262171848883459.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:21:44] [INFO ] Decomposing Gal with order
[2024-05-28 16:21:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:21:45] [INFO ] Removed a total of 705 redundant transitions.
[2024-05-28 16:21:45] [INFO ] Flatten gal took : 50 ms
[2024-05-28 16:21:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 111 labels/synchronizations in 8 ms.
[2024-05-28 16:21:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality15242994534929228369.gal : 6 ms
[2024-05-28 16:21:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality14399219057432968559.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/CTLCardinality15242994534929228369.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14399219057432968559.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 453/453 places, 727/727 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 450 transition count 724
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 450 transition count 724
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 448 transition count 722
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 448 transition count 722
Applied a total of 10 rules in 22 ms. Remains 448 /453 variables (removed 5) and now considering 722/727 (removed 5) transitions.
Running 720 sub problems to find dead transitions.
[2024-05-28 16:22:15] [INFO ] Flow matrix only has 710 transitions (discarded 12 similar events)
[2024-05-28 16:22:15] [INFO ] Invariant cache hit.
[2024-05-28 16:22:15] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-28 16:22:20] [INFO ] Deduced a trap composed of 61 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:22:21] [INFO ] Deduced a trap composed of 62 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:22:21] [INFO ] Deduced a trap composed of 62 places in 37 ms of which 0 ms to minimize.
[2024-05-28 16:22:21] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 3 ms to minimize.
[2024-05-28 16:22:21] [INFO ] Deduced a trap composed of 62 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:22:21] [INFO ] Deduced a trap composed of 62 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:22:21] [INFO ] Deduced a trap composed of 270 places in 143 ms of which 2 ms to minimize.
[2024-05-28 16:22:21] [INFO ] Deduced a trap composed of 117 places in 218 ms of which 3 ms to minimize.
[2024-05-28 16:22:22] [INFO ] Deduced a trap composed of 62 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:22:22] [INFO ] Deduced a trap composed of 110 places in 176 ms of which 3 ms to minimize.
[2024-05-28 16:22:22] [INFO ] Deduced a trap composed of 229 places in 173 ms of which 3 ms to minimize.
[2024-05-28 16:22:22] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-05-28 16:22:22] [INFO ] Deduced a trap composed of 248 places in 184 ms of which 3 ms to minimize.
[2024-05-28 16:22:23] [INFO ] Deduced a trap composed of 254 places in 166 ms of which 3 ms to minimize.
[2024-05-28 16:22:23] [INFO ] Deduced a trap composed of 212 places in 170 ms of which 2 ms to minimize.
[2024-05-28 16:22:23] [INFO ] Deduced a trap composed of 208 places in 154 ms of which 2 ms to minimize.
[2024-05-28 16:22:24] [INFO ] Deduced a trap composed of 279 places in 173 ms of which 3 ms to minimize.
[2024-05-28 16:22:24] [INFO ] Deduced a trap composed of 253 places in 136 ms of which 3 ms to minimize.
[2024-05-28 16:22:24] [INFO ] Deduced a trap composed of 229 places in 158 ms of which 2 ms to minimize.
[2024-05-28 16:22:25] [INFO ] Deduced a trap composed of 251 places in 189 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-28 16:22:26] [INFO ] Deduced a trap composed of 278 places in 191 ms of which 3 ms to minimize.
[2024-05-28 16:22:26] [INFO ] Deduced a trap composed of 255 places in 220 ms of which 4 ms to minimize.
[2024-05-28 16:22:27] [INFO ] Deduced a trap composed of 270 places in 152 ms of which 2 ms to minimize.
[2024-05-28 16:22:27] [INFO ] Deduced a trap composed of 255 places in 150 ms of which 2 ms to minimize.
[2024-05-28 16:22:27] [INFO ] Deduced a trap composed of 253 places in 159 ms of which 3 ms to minimize.
[2024-05-28 16:22:27] [INFO ] Deduced a trap composed of 235 places in 159 ms of which 4 ms to minimize.
[2024-05-28 16:22:28] [INFO ] Deduced a trap composed of 246 places in 181 ms of which 4 ms to minimize.
[2024-05-28 16:22:28] [INFO ] Deduced a trap composed of 265 places in 168 ms of which 3 ms to minimize.
[2024-05-28 16:22:28] [INFO ] Deduced a trap composed of 273 places in 161 ms of which 3 ms to minimize.
[2024-05-28 16:22:28] [INFO ] Deduced a trap composed of 240 places in 140 ms of which 3 ms to minimize.
[2024-05-28 16:22:29] [INFO ] Deduced a trap composed of 239 places in 147 ms of which 2 ms to minimize.
[2024-05-28 16:22:30] [INFO ] Deduced a trap composed of 242 places in 182 ms of which 3 ms to minimize.
[2024-05-28 16:22:30] [INFO ] Deduced a trap composed of 221 places in 150 ms of which 2 ms to minimize.
[2024-05-28 16:22:30] [INFO ] Deduced a trap composed of 262 places in 183 ms of which 3 ms to minimize.
[2024-05-28 16:22:31] [INFO ] Deduced a trap composed of 225 places in 166 ms of which 3 ms to minimize.
[2024-05-28 16:22:31] [INFO ] Deduced a trap composed of 253 places in 200 ms of which 3 ms to minimize.
[2024-05-28 16:22:31] [INFO ] Deduced a trap composed of 253 places in 148 ms of which 2 ms to minimize.
[2024-05-28 16:22:32] [INFO ] Deduced a trap composed of 263 places in 214 ms of which 3 ms to minimize.
[2024-05-28 16:22:32] [INFO ] Deduced a trap composed of 223 places in 166 ms of which 4 ms to minimize.
[2024-05-28 16:22:32] [INFO ] Deduced a trap composed of 284 places in 182 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 9.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 3.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/1158 variables, and 82 constraints, problems are : Problem set: 0 solved, 720 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 720/720 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 720 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 40/82 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-28 16:22:37] [INFO ] Deduced a trap composed of 281 places in 151 ms of which 2 ms to minimize.
[2024-05-28 16:22:37] [INFO ] Deduced a trap composed of 266 places in 156 ms of which 3 ms to minimize.
[2024-05-28 16:22:37] [INFO ] Deduced a trap composed of 281 places in 150 ms of which 3 ms to minimize.
[2024-05-28 16:22:38] [INFO ] Deduced a trap composed of 281 places in 147 ms of which 3 ms to minimize.
[2024-05-28 16:22:38] [INFO ] Deduced a trap composed of 282 places in 154 ms of which 3 ms to minimize.
[2024-05-28 16:22:38] [INFO ] Deduced a trap composed of 285 places in 149 ms of which 3 ms to minimize.
[2024-05-28 16:22:38] [INFO ] Deduced a trap composed of 277 places in 149 ms of which 3 ms to minimize.
[2024-05-28 16:22:38] [INFO ] Deduced a trap composed of 289 places in 149 ms of which 3 ms to minimize.
[2024-05-28 16:22:38] [INFO ] Deduced a trap composed of 279 places in 148 ms of which 2 ms to minimize.
[2024-05-28 16:22:39] [INFO ] Deduced a trap composed of 248 places in 147 ms of which 3 ms to minimize.
[2024-05-28 16:22:39] [INFO ] Deduced a trap composed of 287 places in 148 ms of which 2 ms to minimize.
[2024-05-28 16:22:39] [INFO ] Deduced a trap composed of 290 places in 160 ms of which 3 ms to minimize.
[2024-05-28 16:22:39] [INFO ] Deduced a trap composed of 263 places in 180 ms of which 3 ms to minimize.
[2024-05-28 16:22:39] [INFO ] Deduced a trap composed of 270 places in 147 ms of which 2 ms to minimize.
[2024-05-28 16:22:39] [INFO ] Deduced a trap composed of 290 places in 152 ms of which 2 ms to minimize.
[2024-05-28 16:22:40] [INFO ] Deduced a trap composed of 274 places in 162 ms of which 3 ms to minimize.
[2024-05-28 16:22:40] [INFO ] Deduced a trap composed of 277 places in 150 ms of which 2 ms to minimize.
[2024-05-28 16:22:40] [INFO ] Deduced a trap composed of 278 places in 149 ms of which 3 ms to minimize.
[2024-05-28 16:22:40] [INFO ] Deduced a trap composed of 270 places in 147 ms of which 3 ms to minimize.
[2024-05-28 16:22:40] [INFO ] Deduced a trap composed of 280 places in 139 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-28 16:22:42] [INFO ] Deduced a trap composed of 240 places in 158 ms of which 3 ms to minimize.
[2024-05-28 16:22:42] [INFO ] Deduced a trap composed of 262 places in 168 ms of which 3 ms to minimize.
[2024-05-28 16:22:42] [INFO ] Deduced a trap composed of 285 places in 172 ms of which 3 ms to minimize.
[2024-05-28 16:22:42] [INFO ] Deduced a trap composed of 291 places in 187 ms of which 3 ms to minimize.
[2024-05-28 16:22:43] [INFO ] Deduced a trap composed of 285 places in 176 ms of which 2 ms to minimize.
[2024-05-28 16:22:43] [INFO ] Deduced a trap composed of 272 places in 195 ms of which 4 ms to minimize.
[2024-05-28 16:22:43] [INFO ] Deduced a trap composed of 282 places in 150 ms of which 2 ms to minimize.
[2024-05-28 16:22:43] [INFO ] Deduced a trap composed of 265 places in 147 ms of which 2 ms to minimize.
[2024-05-28 16:22:43] [INFO ] Deduced a trap composed of 263 places in 132 ms of which 2 ms to minimize.
[2024-05-28 16:22:44] [INFO ] Deduced a trap composed of 272 places in 164 ms of which 3 ms to minimize.
[2024-05-28 16:22:44] [INFO ] Deduced a trap composed of 277 places in 129 ms of which 2 ms to minimize.
[2024-05-28 16:22:44] [INFO ] Deduced a trap composed of 223 places in 212 ms of which 3 ms to minimize.
[2024-05-28 16:22:45] [INFO ] Deduced a trap composed of 246 places in 171 ms of which 3 ms to minimize.
[2024-05-28 16:22:45] [INFO ] Deduced a trap composed of 259 places in 173 ms of which 4 ms to minimize.
[2024-05-28 16:22:45] [INFO ] Deduced a trap composed of 256 places in 177 ms of which 3 ms to minimize.
[2024-05-28 16:22:45] [INFO ] Deduced a trap composed of 269 places in 202 ms of which 3 ms to minimize.
[2024-05-28 16:22:45] [INFO ] Deduced a trap composed of 255 places in 162 ms of which 3 ms to minimize.
[2024-05-28 16:22:46] [INFO ] Deduced a trap composed of 277 places in 145 ms of which 3 ms to minimize.
[2024-05-28 16:22:46] [INFO ] Deduced a trap composed of 268 places in 189 ms of which 3 ms to minimize.
[2024-05-28 16:22:46] [INFO ] Deduced a trap composed of 277 places in 195 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/1158 variables, and 122 constraints, problems are : Problem set: 0 solved, 720 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/720 constraints, Known Traps: 80/80 constraints]
After SMT, in 40535ms problems are : Problem set: 0 solved, 720 unsolved
Search for dead transitions found 0 dead transitions in 40544ms
[2024-05-28 16:22:55] [INFO ] Flow matrix only has 710 transitions (discarded 12 similar events)
[2024-05-28 16:22:55] [INFO ] Invariant cache hit.
[2024-05-28 16:22:56] [INFO ] Implicit Places using invariants in 320 ms returned [108, 227, 262, 265, 399, 409]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 321 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/453 places, 722/727 transitions.
Applied a total of 0 rules in 5 ms. Remains 442 /442 variables (removed 0) and now considering 722/722 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40895 ms. Remains : 442/453 places, 722/727 transitions.
[2024-05-28 16:22:56] [INFO ] Flatten gal took : 22 ms
[2024-05-28 16:22:56] [INFO ] Flatten gal took : 24 ms
[2024-05-28 16:22:56] [INFO ] Input system was already deterministic with 722 transitions.
[2024-05-28 16:22:56] [INFO ] Flatten gal took : 32 ms
[2024-05-28 16:22:56] [INFO ] Flatten gal took : 23 ms
[2024-05-28 16:22:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality8033896447236892333.gal : 6 ms
[2024-05-28 16:22:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality1106593918972872166.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/CTLCardinality8033896447236892333.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1106593918972872166.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.
Detected timeout of ITS tools.
[2024-05-28 16:23:26] [INFO ] Flatten gal took : 31 ms
[2024-05-28 16:23:26] [INFO ] Applying decomposition
[2024-05-28 16:23:26] [INFO ] Flatten gal took : 27 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/graph15125159611059687525.txt' '-o' '/tmp/graph15125159611059687525.bin' '-w' '/tmp/graph15125159611059687525.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15125159611059687525.bin' '-l' '-1' '-v' '-w' '/tmp/graph15125159611059687525.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:23:26] [INFO ] Decomposing Gal with order
[2024-05-28 16:23:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:23:26] [INFO ] Removed a total of 644 redundant transitions.
[2024-05-28 16:23:26] [INFO ] Flatten gal took : 61 ms
[2024-05-28 16:23:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 132 labels/synchronizations in 11 ms.
[2024-05-28 16:23:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality8300232784795746065.gal : 6 ms
[2024-05-28 16:23:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality11154201536803808635.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/CTLCardinality8300232784795746065.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11154201536803808635.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 453/453 places, 727/727 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 450 transition count 724
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 450 transition count 724
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 448 transition count 722
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 448 transition count 722
Applied a total of 10 rules in 18 ms. Remains 448 /453 variables (removed 5) and now considering 722/727 (removed 5) transitions.
Running 720 sub problems to find dead transitions.
[2024-05-28 16:23:56] [INFO ] Flow matrix only has 710 transitions (discarded 12 similar events)
[2024-05-28 16:23:56] [INFO ] Invariant cache hit.
[2024-05-28 16:23:56] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-28 16:24:02] [INFO ] Deduced a trap composed of 61 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:24:02] [INFO ] Deduced a trap composed of 62 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:24:03] [INFO ] Deduced a trap composed of 62 places in 29 ms of which 1 ms to minimize.
[2024-05-28 16:24:03] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2024-05-28 16:24:03] [INFO ] Deduced a trap composed of 62 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:24:03] [INFO ] Deduced a trap composed of 62 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:24:03] [INFO ] Deduced a trap composed of 270 places in 161 ms of which 3 ms to minimize.
[2024-05-28 16:24:03] [INFO ] Deduced a trap composed of 117 places in 137 ms of which 2 ms to minimize.
[2024-05-28 16:24:03] [INFO ] Deduced a trap composed of 62 places in 31 ms of which 1 ms to minimize.
[2024-05-28 16:24:04] [INFO ] Deduced a trap composed of 110 places in 147 ms of which 2 ms to minimize.
[2024-05-28 16:24:04] [INFO ] Deduced a trap composed of 229 places in 169 ms of which 4 ms to minimize.
[2024-05-28 16:24:04] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-05-28 16:24:04] [INFO ] Deduced a trap composed of 248 places in 149 ms of which 3 ms to minimize.
[2024-05-28 16:24:04] [INFO ] Deduced a trap composed of 254 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:24:05] [INFO ] Deduced a trap composed of 212 places in 168 ms of which 3 ms to minimize.
[2024-05-28 16:24:05] [INFO ] Deduced a trap composed of 208 places in 163 ms of which 3 ms to minimize.
[2024-05-28 16:24:05] [INFO ] Deduced a trap composed of 279 places in 193 ms of which 3 ms to minimize.
[2024-05-28 16:24:06] [INFO ] Deduced a trap composed of 253 places in 159 ms of which 3 ms to minimize.
[2024-05-28 16:24:06] [INFO ] Deduced a trap composed of 229 places in 158 ms of which 2 ms to minimize.
[2024-05-28 16:24:07] [INFO ] Deduced a trap composed of 251 places in 160 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-28 16:24:08] [INFO ] Deduced a trap composed of 278 places in 163 ms of which 4 ms to minimize.
[2024-05-28 16:24:08] [INFO ] Deduced a trap composed of 255 places in 166 ms of which 3 ms to minimize.
[2024-05-28 16:24:08] [INFO ] Deduced a trap composed of 270 places in 158 ms of which 3 ms to minimize.
[2024-05-28 16:24:08] [INFO ] Deduced a trap composed of 255 places in 169 ms of which 4 ms to minimize.
[2024-05-28 16:24:09] [INFO ] Deduced a trap composed of 253 places in 145 ms of which 2 ms to minimize.
[2024-05-28 16:24:09] [INFO ] Deduced a trap composed of 235 places in 151 ms of which 3 ms to minimize.
[2024-05-28 16:24:09] [INFO ] Deduced a trap composed of 246 places in 126 ms of which 3 ms to minimize.
[2024-05-28 16:24:09] [INFO ] Deduced a trap composed of 265 places in 128 ms of which 2 ms to minimize.
[2024-05-28 16:24:09] [INFO ] Deduced a trap composed of 273 places in 130 ms of which 3 ms to minimize.
[2024-05-28 16:24:10] [INFO ] Deduced a trap composed of 240 places in 125 ms of which 2 ms to minimize.
[2024-05-28 16:24:10] [INFO ] Deduced a trap composed of 239 places in 138 ms of which 2 ms to minimize.
[2024-05-28 16:24:11] [INFO ] Deduced a trap composed of 242 places in 156 ms of which 2 ms to minimize.
[2024-05-28 16:24:12] [INFO ] Deduced a trap composed of 221 places in 132 ms of which 2 ms to minimize.
[2024-05-28 16:24:12] [INFO ] Deduced a trap composed of 262 places in 148 ms of which 2 ms to minimize.
[2024-05-28 16:24:12] [INFO ] Deduced a trap composed of 225 places in 146 ms of which 2 ms to minimize.
[2024-05-28 16:24:12] [INFO ] Deduced a trap composed of 253 places in 153 ms of which 3 ms to minimize.
[2024-05-28 16:24:12] [INFO ] Deduced a trap composed of 253 places in 131 ms of which 3 ms to minimize.
[2024-05-28 16:24:13] [INFO ] Deduced a trap composed of 263 places in 199 ms of which 3 ms to minimize.
[2024-05-28 16:24:13] [INFO ] Deduced a trap composed of 223 places in 132 ms of which 2 ms to minimize.
[2024-05-28 16:24:13] [INFO ] Deduced a trap composed of 284 places in 150 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/1158 variables, and 82 constraints, problems are : Problem set: 0 solved, 720 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 720/720 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 720 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 40/82 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-28 16:24:19] [INFO ] Deduced a trap composed of 281 places in 149 ms of which 2 ms to minimize.
[2024-05-28 16:24:19] [INFO ] Deduced a trap composed of 266 places in 132 ms of which 2 ms to minimize.
[2024-05-28 16:24:19] [INFO ] Deduced a trap composed of 281 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:24:19] [INFO ] Deduced a trap composed of 281 places in 142 ms of which 3 ms to minimize.
[2024-05-28 16:24:19] [INFO ] Deduced a trap composed of 282 places in 131 ms of which 3 ms to minimize.
[2024-05-28 16:24:19] [INFO ] Deduced a trap composed of 285 places in 131 ms of which 3 ms to minimize.
[2024-05-28 16:24:19] [INFO ] Deduced a trap composed of 277 places in 132 ms of which 2 ms to minimize.
[2024-05-28 16:24:20] [INFO ] Deduced a trap composed of 289 places in 133 ms of which 3 ms to minimize.
[2024-05-28 16:24:20] [INFO ] Deduced a trap composed of 279 places in 135 ms of which 3 ms to minimize.
[2024-05-28 16:24:20] [INFO ] Deduced a trap composed of 248 places in 132 ms of which 3 ms to minimize.
[2024-05-28 16:24:20] [INFO ] Deduced a trap composed of 287 places in 131 ms of which 3 ms to minimize.
[2024-05-28 16:24:20] [INFO ] Deduced a trap composed of 290 places in 140 ms of which 2 ms to minimize.
[2024-05-28 16:24:20] [INFO ] Deduced a trap composed of 263 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:24:20] [INFO ] Deduced a trap composed of 270 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:24:21] [INFO ] Deduced a trap composed of 290 places in 136 ms of which 3 ms to minimize.
[2024-05-28 16:24:21] [INFO ] Deduced a trap composed of 274 places in 172 ms of which 3 ms to minimize.
[2024-05-28 16:24:21] [INFO ] Deduced a trap composed of 277 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:24:21] [INFO ] Deduced a trap composed of 278 places in 143 ms of which 2 ms to minimize.
[2024-05-28 16:24:21] [INFO ] Deduced a trap composed of 270 places in 185 ms of which 3 ms to minimize.
[2024-05-28 16:24:21] [INFO ] Deduced a trap composed of 280 places in 131 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-28 16:24:23] [INFO ] Deduced a trap composed of 240 places in 162 ms of which 2 ms to minimize.
[2024-05-28 16:24:23] [INFO ] Deduced a trap composed of 262 places in 157 ms of which 2 ms to minimize.
[2024-05-28 16:24:23] [INFO ] Deduced a trap composed of 285 places in 152 ms of which 3 ms to minimize.
[2024-05-28 16:24:24] [INFO ] Deduced a trap composed of 291 places in 135 ms of which 3 ms to minimize.
[2024-05-28 16:24:24] [INFO ] Deduced a trap composed of 285 places in 169 ms of which 3 ms to minimize.
[2024-05-28 16:24:24] [INFO ] Deduced a trap composed of 272 places in 177 ms of which 3 ms to minimize.
[2024-05-28 16:24:24] [INFO ] Deduced a trap composed of 282 places in 205 ms of which 3 ms to minimize.
[2024-05-28 16:24:24] [INFO ] Deduced a trap composed of 265 places in 188 ms of which 3 ms to minimize.
[2024-05-28 16:24:25] [INFO ] Deduced a trap composed of 263 places in 191 ms of which 3 ms to minimize.
[2024-05-28 16:24:25] [INFO ] Deduced a trap composed of 272 places in 183 ms of which 3 ms to minimize.
[2024-05-28 16:24:25] [INFO ] Deduced a trap composed of 277 places in 151 ms of which 3 ms to minimize.
[2024-05-28 16:24:25] [INFO ] Deduced a trap composed of 223 places in 143 ms of which 2 ms to minimize.
[2024-05-28 16:24:26] [INFO ] Deduced a trap composed of 246 places in 154 ms of which 2 ms to minimize.
[2024-05-28 16:24:26] [INFO ] Deduced a trap composed of 259 places in 147 ms of which 2 ms to minimize.
[2024-05-28 16:24:26] [INFO ] Deduced a trap composed of 256 places in 151 ms of which 3 ms to minimize.
[2024-05-28 16:24:26] [INFO ] Deduced a trap composed of 269 places in 143 ms of which 2 ms to minimize.
[2024-05-28 16:24:26] [INFO ] Deduced a trap composed of 255 places in 142 ms of which 2 ms to minimize.
[2024-05-28 16:24:27] [INFO ] Deduced a trap composed of 277 places in 139 ms of which 2 ms to minimize.
[2024-05-28 16:24:27] [INFO ] Deduced a trap composed of 268 places in 143 ms of which 2 ms to minimize.
[2024-05-28 16:24:27] [INFO ] Deduced a trap composed of 277 places in 145 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/1158 variables, and 122 constraints, problems are : Problem set: 0 solved, 720 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/720 constraints, Known Traps: 80/80 constraints]
After SMT, in 40585ms problems are : Problem set: 0 solved, 720 unsolved
Search for dead transitions found 0 dead transitions in 40593ms
[2024-05-28 16:24:37] [INFO ] Flow matrix only has 710 transitions (discarded 12 similar events)
[2024-05-28 16:24:37] [INFO ] Invariant cache hit.
[2024-05-28 16:24:37] [INFO ] Implicit Places using invariants in 320 ms returned [108, 227, 262, 265, 399, 409]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 321 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/453 places, 722/727 transitions.
Applied a total of 0 rules in 5 ms. Remains 442 /442 variables (removed 0) and now considering 722/722 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40939 ms. Remains : 442/453 places, 722/727 transitions.
[2024-05-28 16:24:37] [INFO ] Flatten gal took : 18 ms
[2024-05-28 16:24:37] [INFO ] Flatten gal took : 19 ms
[2024-05-28 16:24:37] [INFO ] Input system was already deterministic with 722 transitions.
[2024-05-28 16:24:37] [INFO ] Flatten gal took : 18 ms
[2024-05-28 16:24:37] [INFO ] Flatten gal took : 18 ms
[2024-05-28 16:24:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality12253400911794801473.gal : 3 ms
[2024-05-28 16:24:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality9693151504505176425.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/CTLCardinality12253400911794801473.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9693151504505176425.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.
Detected timeout of ITS tools.
[2024-05-28 16:25:07] [INFO ] Flatten gal took : 30 ms
[2024-05-28 16:25:07] [INFO ] Applying decomposition
[2024-05-28 16:25:07] [INFO ] Flatten gal took : 28 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/graph8969706679828103264.txt' '-o' '/tmp/graph8969706679828103264.bin' '-w' '/tmp/graph8969706679828103264.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8969706679828103264.bin' '-l' '-1' '-v' '-w' '/tmp/graph8969706679828103264.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:25:07] [INFO ] Decomposing Gal with order
[2024-05-28 16:25:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:25:07] [INFO ] Removed a total of 594 redundant transitions.
[2024-05-28 16:25:07] [INFO ] Flatten gal took : 38 ms
[2024-05-28 16:25:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 102 labels/synchronizations in 6 ms.
[2024-05-28 16:25:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality3915012028766918922.gal : 4 ms
[2024-05-28 16:25:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality6873735570199208247.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/CTLCardinality3915012028766918922.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6873735570199208247.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.
Detected timeout of ITS tools.
[2024-05-28 16:25:38] [INFO ] Flatten gal took : 18 ms
[2024-05-28 16:25:38] [INFO ] Flatten gal took : 18 ms
[2024-05-28 16:25:38] [INFO ] Applying decomposition
[2024-05-28 16:25:38] [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/graph9339542780352825752.txt' '-o' '/tmp/graph9339542780352825752.bin' '-w' '/tmp/graph9339542780352825752.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9339542780352825752.bin' '-l' '-1' '-v' '-w' '/tmp/graph9339542780352825752.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:25:38] [INFO ] Decomposing Gal with order
[2024-05-28 16:25:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:25:38] [INFO ] Removed a total of 870 redundant transitions.
[2024-05-28 16:25:38] [INFO ] Flatten gal took : 45 ms
[2024-05-28 16:25:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 168 labels/synchronizations in 10 ms.
[2024-05-28 16:25:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality14797343208362732651.gal : 4 ms
[2024-05-28 16:25:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality3810751479051820508.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/CTLCardinality14797343208362732651.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3810751479051820508.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 7 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-28 16:35:44] [INFO ] Flatten gal took : 42 ms
[2024-05-28 16:35:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality13543293713279130397.gal : 5 ms
[2024-05-28 16:35:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality8620468778386527232.ctl : 5 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/CTLCardinality13543293713279130397.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8620468778386527232.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 7 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.4053e+08,110.727,2202160,2,301271,5,3.76111e+06,6,0,2551,4.72108e+06,0


Converting to forward existential form...Done !
ITS-tools command line returned an error code 137
[2024-05-28 16:46:48] [INFO ] Flatten gal took : 21 ms
[2024-05-28 16:46:48] [INFO ] Input system was already deterministic with 727 transitions.
[2024-05-28 16:46:48] [INFO ] Transformed 453 places.
[2024-05-28 16:46:48] [INFO ] Transformed 727 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 16:47:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality3438560780829581243.gal : 8 ms
[2024-05-28 16:47:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality3667090214379239877.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/CTLCardinality3438560780829581243.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3667090214379239877.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 7 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.4053e+08,429.208,8290316,2,536905,5,1.2167e+07,6,0,2551,1.20241e+07,0


Converting to forward existential form...Done !
original formula: EG(EF((SigAbort>((((P_2579_4_2+P_2579_1_1)+(P_2579_2_1+P_2579_3_2))+((P_2579_3_1+P_2579_2_2)+(P_2579_1_2+P_2579_6_1)))+((P_2579_6_2+P_257...190
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (SigAbort>((((P_2579_4_2+P_2579_1_1)+(P_2579_2_1+P_2579_3_2))+((P_2579_3_1+P_2579_2_2)+(P_25...239
Reverse transition relation is NOT exact ! Due to transitions t15, t16, t18, t20, t21, t22, t24, t27, t30, t35, t39, t41, t42, t45, t46, t53, t55, t60, t63...953
ITS-tools command line returned an error code 137
Total runtime 3012369 ms.

BK_STOP 1716915722196

--------------------
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="PolyORBLF-PT-S02J04T06"
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 PolyORBLF-PT-S02J04T06, 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 r290-tajo-171654446600217"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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