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.r516-tajo-171654446700241.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 ltsminxred
Input is PolyORBLF-PT-S02J06T06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446700241
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 22K Apr 11 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 11 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 11 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K 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.9K 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 11K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Apr 11 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 11 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 43K Apr 11 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 216K Apr 11 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K 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 601K 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-S02J06T06-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-PT-S02J06T06-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717252681369

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:38:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 14:38:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:38:03] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2024-06-01 14:38:03] [INFO ] Transformed 536 places.
[2024-06-01 14:38:03] [INFO ] Transformed 1064 transitions.
[2024-06-01 14:38:03] [INFO ] Parsed PT model containing 536 places and 1064 transitions and 4866 arcs in 322 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 23 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Support contains 442 out of 536 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Applied a total of 0 rules in 49 ms. Remains 536 /536 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Running 966 sub problems to find dead transitions.
[2024-06-01 14:38:03] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 536 cols
[2024-06-01 14:38:03] [INFO ] Computed 50 invariants in 77 ms
[2024-06-01 14:38:03] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 27/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-06-01 14:38:12] [INFO ] Deduced a trap composed of 20 places in 417 ms of which 54 ms to minimize.
[2024-06-01 14:38:12] [INFO ] Deduced a trap composed of 74 places in 128 ms of which 2 ms to minimize.
[2024-06-01 14:38:12] [INFO ] Deduced a trap composed of 75 places in 269 ms of which 28 ms to minimize.
[2024-06-01 14:38:13] [INFO ] Deduced a trap composed of 15 places in 561 ms of which 3 ms to minimize.
[2024-06-01 14:38:13] [INFO ] Deduced a trap composed of 75 places in 89 ms of which 2 ms to minimize.
[2024-06-01 14:38:13] [INFO ] Deduced a trap composed of 73 places in 424 ms of which 4 ms to minimize.
[2024-06-01 14:38:14] [INFO ] Deduced a trap composed of 272 places in 269 ms of which 4 ms to minimize.
[2024-06-01 14:38:14] [INFO ] Deduced a trap composed of 73 places in 61 ms of which 9 ms to minimize.
[2024-06-01 14:38:14] [INFO ] Deduced a trap composed of 73 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:38:15] [INFO ] Deduced a trap composed of 253 places in 251 ms of which 3 ms to minimize.
[2024-06-01 14:38:15] [INFO ] Deduced a trap composed of 249 places in 163 ms of which 3 ms to minimize.
[2024-06-01 14:38:16] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 2 ms to minimize.
[2024-06-01 14:38:17] [INFO ] Deduced a trap composed of 264 places in 181 ms of which 3 ms to minimize.
[2024-06-01 14:38:19] [INFO ] Deduced a trap composed of 250 places in 199 ms of which 3 ms to minimize.
[2024-06-01 14:38:23] [INFO ] Deduced a trap composed of 286 places in 183 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/1492 variables, and 61 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20075 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 27/31 constraints, State Equation: 0/536 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 27/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/1492 variables, and 61 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 27/31 constraints, State Equation: 0/536 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 15/15 constraints]
After SMT, in 41416ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 41460ms
[2024-06-01 14:38:44] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-06-01 14:38:44] [INFO ] Invariant cache hit.
[2024-06-01 14:38:44] [INFO ] Implicit Places using invariants in 184 ms returned [96, 111, 241, 254, 307, 497]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 202 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 530/536 places, 968/968 transitions.
Applied a total of 0 rules in 13 ms. Remains 530 /530 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41794 ms. Remains : 530/536 places, 968/968 transitions.
Support contains 442 out of 530 places after structural reductions.
[2024-06-01 14:38:45] [INFO ] Flatten gal took : 109 ms
[2024-06-01 14:38:45] [INFO ] Flatten gal took : 55 ms
[2024-06-01 14:38:45] [INFO ] Input system was already deterministic with 968 transitions.
RANDOM walk for 40000 steps (17 resets) in 3496 ms. (11 steps per ms) remains 48/89 properties
BEST_FIRST walk for 4000 steps (8 resets) in 65 ms. (60 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 60 ms. (65 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 69 ms. (57 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 79 ms. (50 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 61 ms. (64 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 55 ms. (71 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 60 ms. (65 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 59 ms. (66 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 72 ms. (54 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 86 ms. (46 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 69 ms. (57 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 121 ms. (32 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (9 resets) in 42 ms. (93 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 70 ms. (56 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 104 ms. (38 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 50 ms. (78 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4000 steps (8 resets) in 49 ms. (80 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (9 resets) in 48 ms. (81 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 60 ms. (65 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 55 ms. (71 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4000 steps (8 resets) in 37 ms. (105 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 60 ms. (65 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 43 ms. (90 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 58 ms. (67 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 48/48 properties
[2024-06-01 14:38:48] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 530 cols
[2024-06-01 14:38:48] [INFO ] Computed 44 invariants in 16 ms
[2024-06-01 14:38:48] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp83 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp88 is UNSAT
At refinement iteration 1 (OVERLAPS) 156/479 variables, 14/14 constraints. Problems are: Problem set: 31 solved, 17 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp77 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 3/17 constraints. Problems are: Problem set: 38 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/479 variables, 0/17 constraints. Problems are: Problem set: 38 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 3/482 variables, 3/20 constraints. Problems are: Problem set: 38 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 0/20 constraints. Problems are: Problem set: 38 solved, 10 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp80 is UNSAT
At refinement iteration 6 (OVERLAPS) 46/528 variables, 23/43 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 0/43 constraints. Problems are: Problem set: 47 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1484/1486 variables, and 571 constraints, problems are : Problem set: 47 solved, 1 unsolved in 1715 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 528/530 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 47 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 284/285 variables, 3/3 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 0/3 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 136/421 variables, 9/12 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 0/12 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/427 variables, 4/16 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 0/16 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 100/527 variables, 26/42 constraints. Problems are: Problem set: 47 solved, 1 unsolved
[2024-06-01 14:38:50] [INFO ] Deduced a trap composed of 75 places in 140 ms of which 3 ms to minimize.
[2024-06-01 14:38:50] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 2 ms to minimize.
[2024-06-01 14:38:50] [INFO ] Deduced a trap composed of 74 places in 83 ms of which 1 ms to minimize.
[2024-06-01 14:38:50] [INFO ] Deduced a trap composed of 74 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:38:50] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/527 variables, 5/47 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/527 variables, 0/47 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/528 variables, 1/48 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/528 variables, 0/48 constraints. Problems are: Problem set: 47 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1484/1486 variables, and 576 constraints, problems are : Problem set: 47 solved, 1 unsolved in 2174 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 528/530 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/48 constraints, Known Traps: 5/5 constraints]
After SMT, in 4015ms problems are : Problem set: 47 solved, 1 unsolved
Parikh walk visited 0 properties in 64 ms.
Support contains 1 out of 530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 968/968 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 528 transition count 914
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 474 transition count 914
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 110 place count 474 transition count 854
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 230 place count 414 transition count 854
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 233 place count 411 transition count 851
Iterating global reduction 2 with 3 rules applied. Total rules applied 236 place count 411 transition count 851
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 332 place count 363 transition count 803
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 344 place count 363 transition count 791
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 356 place count 351 transition count 791
Applied a total of 356 rules in 181 ms. Remains 351 /530 variables (removed 179) and now considering 791/968 (removed 177) transitions.
Running 789 sub problems to find dead transitions.
[2024-06-01 14:38:52] [INFO ] Flow matrix only has 779 transitions (discarded 12 similar events)
// Phase 1: matrix 779 rows 351 cols
[2024-06-01 14:38:52] [INFO ] Computed 42 invariants in 14 ms
[2024-06-01 14:38:52] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/349 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/349 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 789 unsolved
[2024-06-01 14:38:57] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 2 ms to minimize.
[2024-06-01 14:38:57] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 13 ms to minimize.
[2024-06-01 14:38:57] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:38:57] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:38:57] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:38:58] [INFO ] Deduced a trap composed of 45 places in 204 ms of which 2 ms to minimize.
[2024-06-01 14:38:58] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 2 ms to minimize.
[2024-06-01 14:38:58] [INFO ] Deduced a trap composed of 54 places in 191 ms of which 3 ms to minimize.
[2024-06-01 14:38:58] [INFO ] Deduced a trap composed of 50 places in 167 ms of which 2 ms to minimize.
[2024-06-01 14:39:01] [INFO ] Deduced a trap composed of 202 places in 201 ms of which 3 ms to minimize.
[2024-06-01 14:39:01] [INFO ] Deduced a trap composed of 212 places in 157 ms of which 2 ms to minimize.
[2024-06-01 14:39:02] [INFO ] Deduced a trap composed of 197 places in 181 ms of which 2 ms to minimize.
[2024-06-01 14:39:02] [INFO ] Deduced a trap composed of 122 places in 215 ms of which 4 ms to minimize.
[2024-06-01 14:39:02] [INFO ] Deduced a trap composed of 26 places in 229 ms of which 2 ms to minimize.
[2024-06-01 14:39:03] [INFO ] Deduced a trap composed of 118 places in 144 ms of which 2 ms to minimize.
[2024-06-01 14:39:03] [INFO ] Deduced a trap composed of 95 places in 134 ms of which 2 ms to minimize.
[2024-06-01 14:39:03] [INFO ] Deduced a trap composed of 131 places in 143 ms of which 2 ms to minimize.
[2024-06-01 14:39:04] [INFO ] Deduced a trap composed of 138 places in 206 ms of which 3 ms to minimize.
[2024-06-01 14:39:04] [INFO ] Deduced a trap composed of 142 places in 183 ms of which 2 ms to minimize.
[2024-06-01 14:39:04] [INFO ] Deduced a trap composed of 155 places in 164 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 789 unsolved
[2024-06-01 14:39:05] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:39:06] [INFO ] Deduced a trap composed of 120 places in 216 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 789 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 349/1130 variables, and 62 constraints, problems are : Problem set: 0 solved, 789 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/351 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 789/789 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 789 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/349 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/349 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 22/62 constraints. Problems are: Problem set: 0 solved, 789 unsolved
[2024-06-01 14:39:16] [INFO ] Deduced a trap composed of 164 places in 192 ms of which 2 ms to minimize.
[2024-06-01 14:39:16] [INFO ] Deduced a trap composed of 114 places in 146 ms of which 2 ms to minimize.
[2024-06-01 14:39:17] [INFO ] Deduced a trap composed of 194 places in 119 ms of which 1 ms to minimize.
[2024-06-01 14:39:17] [INFO ] Deduced a trap composed of 200 places in 129 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 789 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 349/1130 variables, and 66 constraints, problems are : Problem set: 0 solved, 789 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/351 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/789 constraints, Known Traps: 26/26 constraints]
After SMT, in 41284ms problems are : Problem set: 0 solved, 789 unsolved
Search for dead transitions found 0 dead transitions in 41291ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41475 ms. Remains : 351/530 places, 791/968 transitions.
RANDOM walk for 40000 steps (20 resets) in 552 ms. (72 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (12 resets) in 331 ms. (120 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 234685 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 1
Probabilistic random walk after 234685 steps, saw 134072 distinct states, run finished after 3005 ms. (steps per millisecond=78 ) properties seen :0
[2024-06-01 14:39:36] [INFO ] Flow matrix only has 779 transitions (discarded 12 similar events)
[2024-06-01 14:39:36] [INFO ] Invariant cache hit.
[2024-06-01 14:39:36] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 111/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/152 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/156 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 177/333 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/341 variables, 8/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/349 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:39:37] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:39:37] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 1 ms to minimize.
[2024-06-01 14:39:37] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/349 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/349 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 779/1128 variables, 349/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1128 variables, 72/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1128 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/1130 variables, 2/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1130 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1130 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1130 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1130/1130 variables, and 468 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1051 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 351/351 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 111/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/152 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/156 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 177/333 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/341 variables, 8/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/349 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/349 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:39:38] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/349 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/349 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 779/1128 variables, 349/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1128 variables, 72/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp70 is UNSAT
After SMT solving in domain Int declared 1128/1130 variables, and 467 constraints, problems are : Problem set: 1 solved, 0 unsolved in 1014 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 349/351 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 2075ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 48 atomic propositions for a total of 16 simplifications.
[2024-06-01 14:39:39] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 14:39:39] [INFO ] Flatten gal took : 90 ms
[2024-06-01 14:39:39] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA PolyORBLF-PT-S02J06T06-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T06-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T06-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:39:39] [INFO ] Flatten gal took : 61 ms
[2024-06-01 14:39:39] [INFO ] Input system was already deterministic with 968 transitions.
Support contains 92 out of 530 places (down from 127) after GAL structural reductions.
FORMULA PolyORBLF-PT-S02J06T06-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 530/530 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 528 transition count 968
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 522 transition count 962
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 522 transition count 962
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 516 transition count 956
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 516 transition count 956
Applied a total of 26 rules in 49 ms. Remains 516 /530 variables (removed 14) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-06-01 14:39:39] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 516 cols
[2024-06-01 14:39:39] [INFO ] Computed 42 invariants in 30 ms
[2024-06-01 14:39:39] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 14:39:47] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 15 ms to minimize.
[2024-06-01 14:39:47] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:39:47] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:39:47] [INFO ] Deduced a trap composed of 73 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:39:47] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:39:47] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:39:48] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 16 ms to minimize.
[2024-06-01 14:39:48] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:39:48] [INFO ] Deduced a trap composed of 246 places in 221 ms of which 3 ms to minimize.
[2024-06-01 14:39:48] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 1 ms to minimize.
[2024-06-01 14:39:49] [INFO ] Deduced a trap composed of 176 places in 165 ms of which 3 ms to minimize.
[2024-06-01 14:39:49] [INFO ] Deduced a trap composed of 121 places in 163 ms of which 2 ms to minimize.
[2024-06-01 14:39:50] [INFO ] Deduced a trap composed of 161 places in 172 ms of which 2 ms to minimize.
[2024-06-01 14:39:52] [INFO ] Deduced a trap composed of 277 places in 174 ms of which 3 ms to minimize.
[2024-06-01 14:39:55] [INFO ] Deduced a trap composed of 106 places in 195 ms of which 3 ms to minimize.
[2024-06-01 14:39:56] [INFO ] Deduced a trap composed of 255 places in 199 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 56 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 14:40:14] [INFO ] Deduced a trap composed of 158 places in 173 ms of which 2 ms to minimize.
[2024-06-01 14:40:20] [INFO ] Deduced a trap composed of 373 places in 264 ms of which 3 ms to minimize.
SMT process timed out in 41432ms, After SMT, problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 41446ms
Finished structural reductions in LTL mode , in 1 iterations and 41502 ms. Remains : 516/530 places, 956/968 transitions.
[2024-06-01 14:40:20] [INFO ] Flatten gal took : 30 ms
[2024-06-01 14:40:20] [INFO ] Flatten gal took : 30 ms
[2024-06-01 14:40:20] [INFO ] Input system was already deterministic with 956 transitions.
Starting structural reductions in LTL mode, iteration 0 : 530/530 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 528 transition count 968
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 522 transition count 962
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 522 transition count 962
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 516 transition count 956
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 516 transition count 956
Applied a total of 26 rules in 29 ms. Remains 516 /530 variables (removed 14) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-06-01 14:40:20] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-06-01 14:40:20] [INFO ] Invariant cache hit.
[2024-06-01 14:40:21] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 14:40:28] [INFO ] Deduced a trap composed of 20 places in 163 ms of which 3 ms to minimize.
[2024-06-01 14:40:28] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 1 ms to minimize.
[2024-06-01 14:40:28] [INFO ] Deduced a trap composed of 73 places in 74 ms of which 1 ms to minimize.
[2024-06-01 14:40:28] [INFO ] Deduced a trap composed of 72 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:40:28] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:40:28] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:40:29] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 2 ms to minimize.
[2024-06-01 14:40:29] [INFO ] Deduced a trap composed of 72 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:40:29] [INFO ] Deduced a trap composed of 246 places in 187 ms of which 3 ms to minimize.
[2024-06-01 14:40:29] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 2 ms to minimize.
[2024-06-01 14:40:30] [INFO ] Deduced a trap composed of 243 places in 203 ms of which 4 ms to minimize.
[2024-06-01 14:40:30] [INFO ] Deduced a trap composed of 173 places in 198 ms of which 4 ms to minimize.
[2024-06-01 14:40:32] [INFO ] Deduced a trap composed of 42 places in 275 ms of which 4 ms to minimize.
[2024-06-01 14:40:35] [INFO ] Deduced a trap composed of 258 places in 251 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 54 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 14:40:50] [INFO ] Deduced a trap composed of 292 places in 319 ms of which 3 ms to minimize.
[2024-06-01 14:40:51] [INFO ] Deduced a trap composed of 277 places in 226 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")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 56 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 16/16 constraints]
After SMT, in 41079ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 41086ms
Finished structural reductions in LTL mode , in 1 iterations and 41117 ms. Remains : 516/530 places, 956/968 transitions.
[2024-06-01 14:41:02] [INFO ] Flatten gal took : 26 ms
[2024-06-01 14:41:02] [INFO ] Flatten gal took : 28 ms
[2024-06-01 14:41:02] [INFO ] Input system was already deterministic with 956 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 530/530 places, 968/968 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 528 transition count 938
Reduce places removed 30 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 36 rules applied. Total rules applied 66 place count 498 transition count 932
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 492 transition count 932
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 72 place count 492 transition count 878
Deduced a syphon composed of 54 places in 2 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 180 place count 438 transition count 878
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 183 place count 435 transition count 875
Iterating global reduction 3 with 3 rules applied. Total rules applied 186 place count 435 transition count 875
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 270 place count 393 transition count 833
Applied a total of 270 rules in 68 ms. Remains 393 /530 variables (removed 137) and now considering 833/968 (removed 135) transitions.
Running 831 sub problems to find dead transitions.
[2024-06-01 14:41:02] [INFO ] Flow matrix only has 821 transitions (discarded 12 similar events)
// Phase 1: matrix 821 rows 393 cols
[2024-06-01 14:41:02] [INFO ] Computed 42 invariants in 18 ms
[2024-06-01 14:41:02] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/391 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/391 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 831 unsolved
[2024-06-01 14:41:07] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 2 ms to minimize.
[2024-06-01 14:41:07] [INFO ] Deduced a trap composed of 51 places in 79 ms of which 2 ms to minimize.
[2024-06-01 14:41:07] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:41:07] [INFO ] Deduced a trap composed of 52 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:41:07] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:41:07] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:41:08] [INFO ] Deduced a trap composed of 153 places in 190 ms of which 3 ms to minimize.
[2024-06-01 14:41:08] [INFO ] Deduced a trap composed of 143 places in 170 ms of which 3 ms to minimize.
[2024-06-01 14:41:08] [INFO ] Deduced a trap composed of 144 places in 193 ms of which 3 ms to minimize.
[2024-06-01 14:41:08] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:41:09] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 2 ms to minimize.
[2024-06-01 14:41:10] [INFO ] Deduced a trap composed of 59 places in 214 ms of which 3 ms to minimize.
[2024-06-01 14:41:10] [INFO ] Deduced a trap composed of 113 places in 214 ms of which 3 ms to minimize.
[2024-06-01 14:41:10] [INFO ] Deduced a trap composed of 75 places in 214 ms of which 3 ms to minimize.
[2024-06-01 14:41:12] [INFO ] Deduced a trap composed of 242 places in 164 ms of which 5 ms to minimize.
[2024-06-01 14:41:15] [INFO ] Deduced a trap composed of 164 places in 215 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 831 unsolved
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 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.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)
(s61 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 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.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 0.0)
(s89 0.0)
(s90 0.0)
(s91 timeout
0.0)
(s92 1.0)
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 391/1214 variables, and 56 constraints, problems are : Problem set: 0 solved, 831 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/393 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 831/831 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 831 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/391 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/391 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 831 unsolved
[2024-06-01 14:41:33] [INFO ] Deduced a trap composed of 183 places in 140 ms of which 2 ms to minimize.
[2024-06-01 14:41:33] [INFO ] Deduced a trap composed of 159 places in 165 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/391 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 831 unsolved
[2024-06-01 14:41:41] [INFO ] Deduced a trap composed of 180 places in 173 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 391/1214 variables, and 59 constraints, problems are : Problem set: 0 solved, 831 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/393 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/831 constraints, Known Traps: 19/19 constraints]
After SMT, in 40818ms problems are : Problem set: 0 solved, 831 unsolved
Search for dead transitions found 0 dead transitions in 40824ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 40894 ms. Remains : 393/530 places, 833/968 transitions.
[2024-06-01 14:41:43] [INFO ] Flatten gal took : 25 ms
[2024-06-01 14:41:43] [INFO ] Flatten gal took : 27 ms
[2024-06-01 14:41:43] [INFO ] Input system was already deterministic with 833 transitions.
Starting structural reductions in LTL mode, iteration 0 : 530/530 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 528 transition count 968
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 522 transition count 962
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 522 transition count 962
Applied a total of 14 rules in 19 ms. Remains 522 /530 variables (removed 8) and now considering 962/968 (removed 6) transitions.
Running 960 sub problems to find dead transitions.
[2024-06-01 14:41:43] [INFO ] Flow matrix only has 950 transitions (discarded 12 similar events)
// Phase 1: matrix 950 rows 522 cols
[2024-06-01 14:41:43] [INFO ] Computed 42 invariants in 10 ms
[2024-06-01 14:41:43] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 14:41:50] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 3 ms to minimize.
[2024-06-01 14:41:50] [INFO ] Deduced a trap composed of 73 places in 135 ms of which 2 ms to minimize.
[2024-06-01 14:41:50] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 1 ms to minimize.
[2024-06-01 14:41:51] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 2 ms to minimize.
[2024-06-01 14:41:51] [INFO ] Deduced a trap composed of 73 places in 39 ms of which 0 ms to minimize.
[2024-06-01 14:41:51] [INFO ] Deduced a trap composed of 73 places in 51 ms of which 0 ms to minimize.
[2024-06-01 14:41:51] [INFO ] Deduced a trap composed of 73 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:41:51] [INFO ] Deduced a trap composed of 73 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:41:51] [INFO ] Deduced a trap composed of 73 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:41:51] [INFO ] Deduced a trap composed of 253 places in 186 ms of which 2 ms to minimize.
[2024-06-01 14:41:51] [INFO ] Deduced a trap composed of 252 places in 182 ms of which 3 ms to minimize.
[2024-06-01 14:41:52] [INFO ] Deduced a trap composed of 151 places in 160 ms of which 3 ms to minimize.
[2024-06-01 14:41:53] [INFO ] Deduced a trap composed of 357 places in 193 ms of which 3 ms to minimize.
[2024-06-01 14:41:53] [INFO ] Deduced a trap composed of 261 places in 295 ms of which 3 ms to minimize.
[2024-06-01 14:41:57] [INFO ] Deduced a trap composed of 283 places in 201 ms of which 3 ms to minimize.
[2024-06-01 14:41:58] [INFO ] Deduced a trap composed of 246 places in 202 ms of which 2 ms to minimize.
[2024-06-01 14:41:59] [INFO ] Deduced a trap composed of 92 places in 179 ms of which 2 ms to minimize.
[2024-06-01 14:41:59] [INFO ] Deduced a trap composed of 42 places in 222 ms of which 2 ms to minimize.
[2024-06-01 14:42:01] [INFO ] Deduced a trap composed of 260 places in 213 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
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 520/1472 variables, and 59 constraints, problems are : Problem set: 0 solved, 960 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 14:42:16] [INFO ] Deduced a trap composed of 354 places in 226 ms of which 5 ms to minimize.
[2024-06-01 14:42:21] [INFO ] Deduced a trap composed of 260 places in 222 ms of which 3 ms to minimize.
[2024-06-01 14:42:22] [INFO ] Deduced a trap composed of 247 places in 211 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/1472 variables, and 62 constraints, problems are : Problem set: 0 solved, 960 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 22/22 constraints]
After SMT, in 41141ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 41153ms
Finished structural reductions in LTL mode , in 1 iterations and 41187 ms. Remains : 522/530 places, 962/968 transitions.
[2024-06-01 14:42:24] [INFO ] Flatten gal took : 38 ms
[2024-06-01 14:42:24] [INFO ] Flatten gal took : 35 ms
[2024-06-01 14:42:24] [INFO ] Input system was already deterministic with 962 transitions.
Starting structural reductions in LTL mode, iteration 0 : 530/530 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 528 transition count 968
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 522 transition count 962
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 522 transition count 962
Applied a total of 14 rules in 34 ms. Remains 522 /530 variables (removed 8) and now considering 962/968 (removed 6) transitions.
Running 960 sub problems to find dead transitions.
[2024-06-01 14:42:24] [INFO ] Flow matrix only has 950 transitions (discarded 12 similar events)
[2024-06-01 14:42:24] [INFO ] Invariant cache hit.
[2024-06-01 14:42:24] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 14:42:32] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 3 ms to minimize.
[2024-06-01 14:42:32] [INFO ] Deduced a trap composed of 73 places in 81 ms of which 1 ms to minimize.
[2024-06-01 14:42:32] [INFO ] Deduced a trap composed of 73 places in 64 ms of which 2 ms to minimize.
[2024-06-01 14:42:32] [INFO ] Deduced a trap composed of 73 places in 41 ms of which 0 ms to minimize.
[2024-06-01 14:42:32] [INFO ] Deduced a trap composed of 73 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:42:32] [INFO ] Deduced a trap composed of 73 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:42:32] [INFO ] Deduced a trap composed of 73 places in 38 ms of which 0 ms to minimize.
[2024-06-01 14:42:32] [INFO ] Deduced a trap composed of 247 places in 206 ms of which 3 ms to minimize.
[2024-06-01 14:42:33] [INFO ] Deduced a trap composed of 252 places in 192 ms of which 2 ms to minimize.
[2024-06-01 14:42:33] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 2 ms to minimize.
[2024-06-01 14:42:34] [INFO ] Deduced a trap composed of 172 places in 239 ms of which 3 ms to minimize.
[2024-06-01 14:42:34] [INFO ] Deduced a trap composed of 163 places in 221 ms of which 4 ms to minimize.
[2024-06-01 14:42:34] [INFO ] Deduced a trap composed of 130 places in 202 ms of which 3 ms to minimize.
[2024-06-01 14:42:40] [INFO ] Deduced a trap composed of 92 places in 211 ms of which 3 ms to minimize.
[2024-06-01 14:42:40] [INFO ] Deduced a trap composed of 261 places in 211 ms of which 3 ms to minimize.
[2024-06-01 14:42:43] [INFO ] Deduced a trap composed of 290 places in 166 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 960 unsolved
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 520/1472 variables, and 56 constraints, problems are : Problem set: 0 solved, 960 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 14:42:57] [INFO ] Deduced a trap composed of 270 places in 230 ms of which 4 ms to minimize.
[2024-06-01 14:42:58] [INFO ] Deduced a trap composed of 283 places in 174 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/1472 variables, and 58 constraints, problems are : Problem set: 0 solved, 960 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 18/18 constraints]
After SMT, in 40883ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 40891ms
Finished structural reductions in LTL mode , in 1 iterations and 40927 ms. Remains : 522/530 places, 962/968 transitions.
[2024-06-01 14:43:05] [INFO ] Flatten gal took : 23 ms
[2024-06-01 14:43:05] [INFO ] Flatten gal took : 25 ms
[2024-06-01 14:43:05] [INFO ] Input system was already deterministic with 962 transitions.
Starting structural reductions in LTL mode, iteration 0 : 530/530 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 528 transition count 968
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 522 transition count 962
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 522 transition count 962
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 516 transition count 956
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 516 transition count 956
Applied a total of 26 rules in 15 ms. Remains 516 /530 variables (removed 14) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-06-01 14:43:05] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 516 cols
[2024-06-01 14:43:05] [INFO ] Computed 42 invariants in 9 ms
[2024-06-01 14:43:05] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 14:43:12] [INFO ] Deduced a trap composed of 20 places in 162 ms of which 3 ms to minimize.
[2024-06-01 14:43:12] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 2 ms to minimize.
[2024-06-01 14:43:12] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:43:12] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:43:12] [INFO ] Deduced a trap composed of 73 places in 40 ms of which 0 ms to minimize.
[2024-06-01 14:43:12] [INFO ] Deduced a trap composed of 72 places in 36 ms of which 0 ms to minimize.
[2024-06-01 14:43:12] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 2 ms to minimize.
[2024-06-01 14:43:12] [INFO ] Deduced a trap composed of 72 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:43:13] [INFO ] Deduced a trap composed of 246 places in 206 ms of which 3 ms to minimize.
[2024-06-01 14:43:13] [INFO ] Deduced a trap composed of 37 places in 196 ms of which 3 ms to minimize.
[2024-06-01 14:43:14] [INFO ] Deduced a trap composed of 176 places in 253 ms of which 3 ms to minimize.
[2024-06-01 14:43:14] [INFO ] Deduced a trap composed of 121 places in 212 ms of which 3 ms to minimize.
[2024-06-01 14:43:16] [INFO ] Deduced a trap composed of 161 places in 228 ms of which 4 ms to minimize.
[2024-06-01 14:43:18] [INFO ] Deduced a trap composed of 277 places in 166 ms of which 2 ms to minimize.
[2024-06-01 14:43:20] [INFO ] Deduced a trap composed of 106 places in 173 ms of which 3 ms to minimize.
[2024-06-01 14:43:22] [INFO ] Deduced a trap composed of 255 places in 210 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 14:43:26] [INFO ] Deduced a trap composed of 42 places in 174 ms of which 3 ms to minimize.
SMT process timed out in 20977ms, After SMT, problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 20984ms
Finished structural reductions in LTL mode , in 1 iterations and 21001 ms. Remains : 516/530 places, 956/968 transitions.
[2024-06-01 14:43:26] [INFO ] Flatten gal took : 22 ms
[2024-06-01 14:43:26] [INFO ] Flatten gal took : 23 ms
[2024-06-01 14:43:26] [INFO ] Input system was already deterministic with 956 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 530/530 places, 968/968 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 528 transition count 917
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 477 transition count 917
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 102 place count 477 transition count 857
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 222 place count 417 transition count 857
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 224 place count 415 transition count 855
Iterating global reduction 2 with 2 rules applied. Total rules applied 226 place count 415 transition count 855
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 320 place count 368 transition count 808
Applied a total of 320 rules in 68 ms. Remains 368 /530 variables (removed 162) and now considering 808/968 (removed 160) transitions.
Running 806 sub problems to find dead transitions.
[2024-06-01 14:43:26] [INFO ] Flow matrix only has 796 transitions (discarded 12 similar events)
// Phase 1: matrix 796 rows 368 cols
[2024-06-01 14:43:26] [INFO ] Computed 42 invariants in 9 ms
[2024-06-01 14:43:26] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 806 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 806 unsolved
[2024-06-01 14:43:32] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 2 ms to minimize.
[2024-06-01 14:43:32] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 2 ms to minimize.
[2024-06-01 14:43:32] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:43:32] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:43:32] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:43:32] [INFO ] Deduced a trap composed of 51 places in 48 ms of which 2 ms to minimize.
[2024-06-01 14:43:33] [INFO ] Deduced a trap composed of 141 places in 177 ms of which 3 ms to minimize.
[2024-06-01 14:43:33] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 2 ms to minimize.
[2024-06-01 14:43:33] [INFO ] Deduced a trap composed of 130 places in 99 ms of which 2 ms to minimize.
[2024-06-01 14:43:33] [INFO ] Deduced a trap composed of 124 places in 157 ms of which 3 ms to minimize.
[2024-06-01 14:43:34] [INFO ] Deduced a trap composed of 61 places in 124 ms of which 2 ms to minimize.
[2024-06-01 14:43:36] [INFO ] Deduced a trap composed of 132 places in 219 ms of which 3 ms to minimize.
[2024-06-01 14:43:38] [INFO ] Deduced a trap composed of 111 places in 171 ms of which 2 ms to minimize.
[2024-06-01 14:43:38] [INFO ] Deduced a trap composed of 138 places in 164 ms of which 3 ms to minimize.
[2024-06-01 14:43:38] [INFO ] Deduced a trap composed of 141 places in 165 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 806 unsolved
[2024-06-01 14:43:40] [INFO ] Deduced a trap composed of 135 places in 200 ms of which 2 ms to minimize.
[2024-06-01 14:43:44] [INFO ] Deduced a trap composed of 137 places in 136 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/1164 variables, and 57 constraints, problems are : Problem set: 0 solved, 806 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/368 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 806/806 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 806 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 806 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 806 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 806 unsolved
[2024-06-01 14:43:53] [INFO ] Deduced a trap composed of 132 places in 167 ms of which 2 ms to minimize.
[2024-06-01 14:43:53] [INFO ] Deduced a trap composed of 135 places in 153 ms of which 2 ms to minimize.
[2024-06-01 14:43:57] [INFO ] Deduced a trap composed of 228 places in 191 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/1164 variables, and 60 constraints, problems are : Problem set: 0 solved, 806 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/368 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/806 constraints, Known Traps: 20/20 constraints]
After SMT, in 40905ms problems are : Problem set: 0 solved, 806 unsolved
Search for dead transitions found 0 dead transitions in 40911ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 40980 ms. Remains : 368/530 places, 808/968 transitions.
[2024-06-01 14:44:07] [INFO ] Flatten gal took : 35 ms
[2024-06-01 14:44:07] [INFO ] Flatten gal took : 32 ms
[2024-06-01 14:44:07] [INFO ] Input system was already deterministic with 808 transitions.
Starting structural reductions in LTL mode, iteration 0 : 530/530 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 528 transition count 968
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 522 transition count 962
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 522 transition count 962
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 19 place count 517 transition count 957
Iterating global reduction 1 with 5 rules applied. Total rules applied 24 place count 517 transition count 957
Applied a total of 24 rules in 33 ms. Remains 517 /530 variables (removed 13) and now considering 957/968 (removed 11) transitions.
Running 955 sub problems to find dead transitions.
[2024-06-01 14:44:07] [INFO ] Flow matrix only has 945 transitions (discarded 12 similar events)
// Phase 1: matrix 945 rows 517 cols
[2024-06-01 14:44:07] [INFO ] Computed 42 invariants in 13 ms
[2024-06-01 14:44:07] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 955 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 955 unsolved
[2024-06-01 14:44:15] [INFO ] Deduced a trap composed of 73 places in 35 ms of which 1 ms to minimize.
[2024-06-01 14:44:15] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 0 ms to minimize.
[2024-06-01 14:44:15] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:44:16] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 0 ms to minimize.
[2024-06-01 14:44:16] [INFO ] Deduced a trap composed of 73 places in 164 ms of which 4 ms to minimize.
[2024-06-01 14:44:16] [INFO ] Deduced a trap composed of 73 places in 148 ms of which 2 ms to minimize.
[2024-06-01 14:44:16] [INFO ] Deduced a trap composed of 53 places in 126 ms of which 2 ms to minimize.
[2024-06-01 14:44:17] [INFO ] Deduced a trap composed of 247 places in 191 ms of which 3 ms to minimize.
[2024-06-01 14:44:17] [INFO ] Deduced a trap composed of 87 places in 186 ms of which 3 ms to minimize.
[2024-06-01 14:44:17] [INFO ] Deduced a trap composed of 169 places in 183 ms of which 3 ms to minimize.
[2024-06-01 14:44:17] [INFO ] Deduced a trap composed of 246 places in 201 ms of which 2 ms to minimize.
[2024-06-01 14:44:18] [INFO ] Deduced a trap composed of 122 places in 171 ms of which 3 ms to minimize.
[2024-06-01 14:44:18] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
[2024-06-01 14:44:21] [INFO ] Deduced a trap composed of 253 places in 255 ms of which 3 ms to minimize.
[2024-06-01 14:44:22] [INFO ] Deduced a trap composed of 263 places in 281 ms of which 4 ms to minimize.
[2024-06-01 14:44:22] [INFO ] Deduced a trap composed of 310 places in 253 ms of which 4 ms to minimize.
[2024-06-01 14:44:22] [INFO ] Deduced a trap composed of 296 places in 198 ms of which 3 ms to minimize.
[2024-06-01 14:44:22] [INFO ] Deduced a trap composed of 301 places in 253 ms of which 4 ms to minimize.
[2024-06-01 14:44:22] [INFO ] Deduced a trap composed of 363 places in 186 ms of which 3 ms to minimize.
[2024-06-01 14:44:23] [INFO ] Deduced a trap composed of 348 places in 290 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/515 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 955 unsolved
[2024-06-01 14:44:27] [INFO ] Deduced a trap composed of 42 places in 256 ms of which 4 ms to minimize.
[2024-06-01 14:44:28] [INFO ] Deduced a trap composed of 225 places in 237 ms of which 4 ms to minimize.
[2024-06-01 14:44:28] [INFO ] Deduced a trap composed of 278 places in 231 ms of which 4 ms to minimize.
(s313 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
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 10.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 0.0)
(s29 0.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 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.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)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.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 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 1.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 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 1.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 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.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 0.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 0.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 1.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 0.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 0.0)
(s221 0.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 1.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.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 1.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0timeout
)
(s314 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 515/1462 variables, and 63 constraints, problems are : Problem set: 0 solved, 955 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/517 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 955/955 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 955 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 955 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 955 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/515 variables, 23/63 constraints. Problems are: Problem set: 0 solved, 955 unsolved
[2024-06-01 14:44:38] [INFO ] Deduced a trap composed of 349 places in 290 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 515/1462 variables, and 64 constraints, problems are : Problem set: 0 solved, 955 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/517 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/955 constraints, Known Traps: 24/24 constraints]
After SMT, in 40892ms problems are : Problem set: 0 solved, 955 unsolved
Search for dead transitions found 0 dead transitions in 40914ms
Finished structural reductions in LTL mode , in 1 iterations and 40952 ms. Remains : 517/530 places, 957/968 transitions.
[2024-06-01 14:44:48] [INFO ] Flatten gal took : 32 ms
[2024-06-01 14:44:48] [INFO ] Flatten gal took : 33 ms
[2024-06-01 14:44:48] [INFO ] Input system was already deterministic with 957 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 530/530 places, 968/968 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 528 transition count 914
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 474 transition count 914
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 108 place count 474 transition count 854
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 228 place count 414 transition count 854
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 231 place count 411 transition count 851
Iterating global reduction 2 with 3 rules applied. Total rules applied 234 place count 411 transition count 851
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 328 place count 364 transition count 804
Applied a total of 328 rules in 106 ms. Remains 364 /530 variables (removed 166) and now considering 804/968 (removed 164) transitions.
Running 802 sub problems to find dead transitions.
[2024-06-01 14:44:49] [INFO ] Flow matrix only has 792 transitions (discarded 12 similar events)
// Phase 1: matrix 792 rows 364 cols
[2024-06-01 14:44:49] [INFO ] Computed 42 invariants in 10 ms
[2024-06-01 14:44:49] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 802 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 802 unsolved
[2024-06-01 14:44:53] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 1 ms to minimize.
[2024-06-01 14:44:54] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 1 ms to minimize.
[2024-06-01 14:44:54] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 1 ms to minimize.
[2024-06-01 14:44:54] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:44:54] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:44:54] [INFO ] Deduced a trap composed of 48 places in 145 ms of which 2 ms to minimize.
[2024-06-01 14:44:54] [INFO ] Deduced a trap composed of 129 places in 166 ms of which 2 ms to minimize.
[2024-06-01 14:44:54] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:44:54] [INFO ] Deduced a trap composed of 125 places in 152 ms of which 2 ms to minimize.
[2024-06-01 14:44:54] [INFO ] Deduced a trap composed of 130 places in 150 ms of which 2 ms to minimize.
[2024-06-01 14:44:55] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2024-06-01 14:44:55] [INFO ] Deduced a trap composed of 121 places in 154 ms of which 2 ms to minimize.
[2024-06-01 14:44:55] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 2 ms to minimize.
[2024-06-01 14:44:56] [INFO ] Deduced a trap composed of 59 places in 146 ms of which 2 ms to minimize.
[2024-06-01 14:44:59] [INFO ] Deduced a trap composed of 175 places in 129 ms of which 2 ms to minimize.
[2024-06-01 14:44:59] [INFO ] Deduced a trap composed of 164 places in 151 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 802 unsolved
[2024-06-01 14:45:04] [INFO ] Deduced a trap composed of 159 places in 140 ms of which 2 ms to minimize.
[2024-06-01 14:45:04] [INFO ] Deduced a trap composed of 160 places in 154 ms of which 2 ms to minimize.
[2024-06-01 14:45:05] [INFO ] Deduced a trap composed of 107 places in 133 ms of which 2 ms to minimize.
[2024-06-01 14:45:05] [INFO ] Deduced a trap composed of 140 places in 129 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 10.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 1.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.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)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.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 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.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 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.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 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.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 10.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.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 1.0)
(s187 0.0)
(s188 0.0)
(s189 1.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 1.0)
(s208 0.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 0.0)
(s221 0.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 1.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 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.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 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 3.0)
(s275 10.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 1.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 802 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 362/1156 variables, and 60 constraints, problems are : Problem set: 0 solved, 802 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/364 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 802/802 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 802 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 802 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 802 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 802 unsolved
[2024-06-01 14:45:25] [INFO ] Deduced a trap composed of 145 places in 193 ms of which 2 ms to minimize.
[2024-06-01 14:45:27] [INFO ] Deduced a trap composed of 213 places in 176 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")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 362/1156 variables, and 62 constraints, problems are : Problem set: 0 solved, 802 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/364 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/802 constraints, Known Traps: 22/22 constraints]
After SMT, in 40937ms problems are : Problem set: 0 solved, 802 unsolved
Search for dead transitions found 0 dead transitions in 40946ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41067 ms. Remains : 364/530 places, 804/968 transitions.
[2024-06-01 14:45:30] [INFO ] Flatten gal took : 28 ms
[2024-06-01 14:45:30] [INFO ] Flatten gal took : 29 ms
[2024-06-01 14:45:30] [INFO ] Input system was already deterministic with 804 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 530/530 places, 968/968 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 528 transition count 916
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 104 place count 476 transition count 916
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 57 Pre rules applied. Total rules applied 104 place count 476 transition count 859
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 218 place count 419 transition count 859
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 221 place count 416 transition count 856
Iterating global reduction 2 with 3 rules applied. Total rules applied 224 place count 416 transition count 856
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 316 place count 370 transition count 810
Applied a total of 316 rules in 88 ms. Remains 370 /530 variables (removed 160) and now considering 810/968 (removed 158) transitions.
Running 808 sub problems to find dead transitions.
[2024-06-01 14:45:30] [INFO ] Flow matrix only has 798 transitions (discarded 12 similar events)
// Phase 1: matrix 798 rows 370 cols
[2024-06-01 14:45:30] [INFO ] Computed 42 invariants in 10 ms
[2024-06-01 14:45:30] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/368 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/368 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 808 unsolved
[2024-06-01 14:45:35] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:45:35] [INFO ] Deduced a trap composed of 108 places in 120 ms of which 1 ms to minimize.
[2024-06-01 14:45:35] [INFO ] Deduced a trap composed of 132 places in 124 ms of which 2 ms to minimize.
[2024-06-01 14:45:36] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 2 ms to minimize.
[2024-06-01 14:45:36] [INFO ] Deduced a trap composed of 58 places in 126 ms of which 1 ms to minimize.
[2024-06-01 14:45:36] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 2 ms to minimize.
[2024-06-01 14:45:37] [INFO ] Deduced a trap composed of 138 places in 113 ms of which 1 ms to minimize.
[2024-06-01 14:45:37] [INFO ] Deduced a trap composed of 136 places in 110 ms of which 2 ms to minimize.
[2024-06-01 14:45:38] [INFO ] Deduced a trap composed of 125 places in 117 ms of which 2 ms to minimize.
[2024-06-01 14:45:40] [INFO ] Deduced a trap composed of 102 places in 128 ms of which 1 ms to minimize.
[2024-06-01 14:45:40] [INFO ] Deduced a trap composed of 127 places in 139 ms of which 2 ms to minimize.
[2024-06-01 14:45:40] [INFO ] Deduced a trap composed of 121 places in 136 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/368 variables, 12/51 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/368 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 808 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/370 variables, 3/54 constraints. Problems are: Problem set: 66 solved, 742 unsolved
[2024-06-01 14:45:51] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:45:51] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 0 ms to minimize.
[2024-06-01 14:45:51] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/1168 variables, and 57 constraints, problems are : Problem set: 66 solved, 742 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/370 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 808/808 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 66 solved, 742 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/368 variables, 18/18 constraints. Problems are: Problem set: 66 solved, 742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/368 variables, 21/39 constraints. Problems are: Problem set: 66 solved, 742 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/368 variables, 15/54 constraints. Problems are: Problem set: 66 solved, 742 unsolved
[2024-06-01 14:45:53] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:45:53] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/368 variables, 2/56 constraints. Problems are: Problem set: 66 solved, 742 unsolved
[2024-06-01 14:46:01] [INFO ] Deduced a trap composed of 48 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 1/57 constraints. Problems are: Problem set: 66 solved, 742 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/1168 variables, and 57 constraints, problems are : Problem set: 66 solved, 742 unsolved in 20011 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/370 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/808 constraints, Known Traps: 18/18 constraints]
After SMT, in 41015ms problems are : Problem set: 66 solved, 742 unsolved
Search for dead transitions found 66 dead transitions in 41025ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 370/530 places, 744/968 transitions.
Reduce places removed 2 places and 12 transitions.
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 356 transition count 720
Applied a total of 12 rules in 16 ms. Remains 356 /370 variables (removed 14) and now considering 720/744 (removed 24) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 41132 ms. Remains : 356/530 places, 720/968 transitions.
[2024-06-01 14:46:11] [INFO ] Flatten gal took : 18 ms
[2024-06-01 14:46:11] [INFO ] Flatten gal took : 19 ms
[2024-06-01 14:46:11] [INFO ] Input system was already deterministic with 720 transitions.
Starting structural reductions in LTL mode, iteration 0 : 530/530 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 528 transition count 968
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 522 transition count 962
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 522 transition count 962
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 516 transition count 956
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 516 transition count 956
Applied a total of 26 rules in 16 ms. Remains 516 /530 variables (removed 14) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-06-01 14:46:11] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 516 cols
[2024-06-01 14:46:11] [INFO ] Computed 42 invariants in 11 ms
[2024-06-01 14:46:11] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 14:46:18] [INFO ] Deduced a trap composed of 20 places in 154 ms of which 3 ms to minimize.
[2024-06-01 14:46:18] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:46:18] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:46:18] [INFO ] Deduced a trap composed of 73 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:46:18] [INFO ] Deduced a trap composed of 73 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:46:19] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 0 ms to minimize.
[2024-06-01 14:46:19] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 3 ms to minimize.
[2024-06-01 14:46:19] [INFO ] Deduced a trap composed of 72 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:46:19] [INFO ] Deduced a trap composed of 246 places in 210 ms of which 2 ms to minimize.
[2024-06-01 14:46:19] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 2 ms to minimize.
[2024-06-01 14:46:20] [INFO ] Deduced a trap composed of 176 places in 211 ms of which 4 ms to minimize.
[2024-06-01 14:46:20] [INFO ] Deduced a trap composed of 121 places in 196 ms of which 6 ms to minimize.
[2024-06-01 14:46:22] [INFO ] Deduced a trap composed of 161 places in 184 ms of which 3 ms to minimize.
[2024-06-01 14:46:24] [INFO ] Deduced a trap composed of 277 places in 240 ms of which 4 ms to minimize.
[2024-06-01 14:46:27] [INFO ] Deduced a trap composed of 106 places in 186 ms of which 2 ms to minimize.
[2024-06-01 14:46:29] [INFO ] Deduced a trap composed of 255 places in 206 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 56 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 14:46:46] [INFO ] Deduced a trap composed of 158 places in 192 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 57 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 17/17 constraints]
After SMT, in 40839ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40846ms
Finished structural reductions in LTL mode , in 1 iterations and 40863 ms. Remains : 516/530 places, 956/968 transitions.
[2024-06-01 14:46:52] [INFO ] Flatten gal took : 22 ms
[2024-06-01 14:46:52] [INFO ] Flatten gal took : 23 ms
[2024-06-01 14:46:52] [INFO ] Input system was already deterministic with 956 transitions.
Starting structural reductions in LTL mode, iteration 0 : 530/530 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 528 transition count 968
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 522 transition count 962
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 522 transition count 962
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 516 transition count 956
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 516 transition count 956
Applied a total of 26 rules in 16 ms. Remains 516 /530 variables (removed 14) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-06-01 14:46:52] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-06-01 14:46:52] [INFO ] Invariant cache hit.
[2024-06-01 14:46:52] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 14:46:59] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 3 ms to minimize.
[2024-06-01 14:46:59] [INFO ] Deduced a trap composed of 72 places in 88 ms of which 2 ms to minimize.
[2024-06-01 14:46:59] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:46:59] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:46:59] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:46:59] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:46:59] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 2 ms to minimize.
[2024-06-01 14:46:59] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 0 ms to minimize.
[2024-06-01 14:47:00] [INFO ] Deduced a trap composed of 246 places in 312 ms of which 3 ms to minimize.
[2024-06-01 14:47:00] [INFO ] Deduced a trap composed of 37 places in 184 ms of which 2 ms to minimize.
[2024-06-01 14:47:01] [INFO ] Deduced a trap composed of 243 places in 228 ms of which 3 ms to minimize.
[2024-06-01 14:47:01] [INFO ] Deduced a trap composed of 173 places in 198 ms of which 4 ms to minimize.
[2024-06-01 14:47:04] [INFO ] Deduced a trap composed of 42 places in 192 ms of which 3 ms to minimize.
[2024-06-01 14:47:07] [INFO ] Deduced a trap composed of 258 places in 203 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 954 unsolved
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 514/1460 variables, and 54 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 14:47:22] [INFO ] Deduced a trap composed of 292 places in 278 ms of which 3 ms to minimize.
[2024-06-01 14:47:23] [INFO ] Deduced a trap composed of 277 places in 203 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 56 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 16/16 constraints]
After SMT, in 40917ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40925ms
Finished structural reductions in LTL mode , in 1 iterations and 40943 ms. Remains : 516/530 places, 956/968 transitions.
[2024-06-01 14:47:33] [INFO ] Flatten gal took : 22 ms
[2024-06-01 14:47:33] [INFO ] Flatten gal took : 23 ms
[2024-06-01 14:47:33] [INFO ] Input system was already deterministic with 956 transitions.
[2024-06-01 14:47:33] [INFO ] Flatten gal took : 22 ms
[2024-06-01 14:47:33] [INFO ] Flatten gal took : 23 ms
[2024-06-01 14:47:33] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 14:47:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 530 places, 968 transitions and 4182 arcs took 21 ms.
Total runtime 570788 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PolyORBLF-PT-S02J06T06-CTLCardinality-2024-00
Could not compute solution for formula : PolyORBLF-PT-S02J06T06-CTLCardinality-2024-02
Could not compute solution for formula : PolyORBLF-PT-S02J06T06-CTLCardinality-2024-04
Could not compute solution for formula : PolyORBLF-PT-S02J06T06-CTLCardinality-2024-05
Could not compute solution for formula : PolyORBLF-PT-S02J06T06-CTLCardinality-2024-07
Could not compute solution for formula : PolyORBLF-PT-S02J06T06-CTLCardinality-2024-08
Could not compute solution for formula : PolyORBLF-PT-S02J06T06-CTLCardinality-2024-09
Could not compute solution for formula : PolyORBLF-PT-S02J06T06-CTLCardinality-2024-10
Could not compute solution for formula : PolyORBLF-PT-S02J06T06-CTLCardinality-2024-11
Could not compute solution for formula : PolyORBLF-PT-S02J06T06-CTLCardinality-2024-12
Could not compute solution for formula : PolyORBLF-PT-S02J06T06-CTLCardinality-2024-13
Could not compute solution for formula : PolyORBLF-PT-S02J06T06-CTLCardinality-2024-15

BK_STOP 1717253253970

--------------------
content from stderr:

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name PolyORBLF-PT-S02J06T06-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/1540/ctl_0_
ctl formula name PolyORBLF-PT-S02J06T06-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/1540/ctl_1_
ctl formula name PolyORBLF-PT-S02J06T06-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/1540/ctl_2_
ctl formula name PolyORBLF-PT-S02J06T06-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/1540/ctl_3_
ctl formula name PolyORBLF-PT-S02J06T06-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/1540/ctl_4_
ctl formula name PolyORBLF-PT-S02J06T06-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/1540/ctl_5_
ctl formula name PolyORBLF-PT-S02J06T06-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/1540/ctl_6_
ctl formula name PolyORBLF-PT-S02J06T06-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/1540/ctl_7_
ctl formula name PolyORBLF-PT-S02J06T06-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/1540/ctl_8_
ctl formula name PolyORBLF-PT-S02J06T06-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/1540/ctl_9_
ctl formula name PolyORBLF-PT-S02J06T06-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/1540/ctl_10_
ctl formula name PolyORBLF-PT-S02J06T06-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/1540/ctl_11_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-S02J06T06"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is PolyORBLF-PT-S02J06T06, 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 r516-tajo-171654446700241"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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