About the Execution of GreatSPN+red for PolyORBLF-PT-S04J04T06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16205.739 | 3600000.00 | 13233491.00 | 1989.40 | FTT??TT?????F??T | normal |
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.r289-tajo-171654445500265.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 greatspnxred
Input is PolyORBLF-PT-S04J04T06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445500265
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.3M
-rw-r--r-- 1 mcc users 17K Apr 11 17:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 11 17:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 29K Apr 11 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 157K Apr 11 17:01 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 8.4K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 33K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 11 17:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 11 17:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 40K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 207K Apr 11 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 2.5M 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-S04J04T06-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716863582399
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 02:33:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 02:33:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 02:33:04] [INFO ] Load time of PNML (sax parser for PT used): 379 ms
[2024-05-28 02:33:04] [INFO ] Transformed 554 places.
[2024-05-28 02:33:04] [INFO ] Transformed 2998 transitions.
[2024-05-28 02:33:04] [INFO ] Parsed PT model containing 554 places and 2998 transitions and 20754 arcs in 618 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 23 ms.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
Support contains 340 out of 554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 554/554 places, 1372/1372 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 550 transition count 1372
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 544 transition count 1366
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 544 transition count 1366
Applied a total of 16 rules in 80 ms. Remains 544 /554 variables (removed 10) and now considering 1366/1372 (removed 6) transitions.
Running 1362 sub problems to find dead transitions.
[2024-05-28 02:33:05] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
// Phase 1: matrix 1342 rows 544 cols
[2024-05-28 02:33:05] [INFO ] Computed 46 invariants in 136 ms
[2024-05-28 02:33:05] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 26/42 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-05-28 02:33:20] [INFO ] Deduced a trap composed of 74 places in 193 ms of which 23 ms to minimize.
[2024-05-28 02:33:20] [INFO ] Deduced a trap composed of 75 places in 84 ms of which 2 ms to minimize.
[2024-05-28 02:33:21] [INFO ] Deduced a trap composed of 76 places in 68 ms of which 2 ms to minimize.
[2024-05-28 02:33:21] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 2 ms to minimize.
[2024-05-28 02:33:21] [INFO ] Deduced a trap composed of 39 places in 204 ms of which 2 ms to minimize.
[2024-05-28 02:33:21] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 1 ms to minimize.
[2024-05-28 02:33:22] [INFO ] Deduced a trap composed of 132 places in 324 ms of which 4 ms to minimize.
[2024-05-28 02:33:22] [INFO ] Deduced a trap composed of 230 places in 300 ms of which 3 ms to minimize.
[2024-05-28 02:33:22] [INFO ] Deduced a trap composed of 165 places in 313 ms of which 3 ms to minimize.
[2024-05-28 02:33:23] [INFO ] Deduced a trap composed of 336 places in 390 ms of which 4 ms to minimize.
[2024-05-28 02:33:23] [INFO ] Deduced a trap composed of 271 places in 367 ms of which 5 ms to minimize.
[2024-05-28 02:33:23] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 2 ms to minimize.
[2024-05-28 02:33:24] [INFO ] Deduced a trap composed of 282 places in 348 ms of which 4 ms to minimize.
[2024-05-28 02:33:24] [INFO ] Deduced a trap composed of 268 places in 299 ms of which 4 ms to minimize.
[2024-05-28 02:33:25] [INFO ] Deduced a trap composed of 15 places in 248 ms of which 3 ms to minimize.
[2024-05-28 02:33:27] [INFO ] Deduced a trap composed of 264 places in 347 ms of which 4 ms to minimize.
[2024-05-28 02:33:27] [INFO ] Deduced a trap composed of 295 places in 392 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 540/1886 variables, and 59 constraints, problems are : Problem set: 0 solved, 1362 unsolved in 20091 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/544 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1362/1362 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 26/42 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/540 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-05-28 02:33:42] [INFO ] Deduced a trap composed of 322 places in 395 ms of which 5 ms to minimize.
[2024-05-28 02:33:42] [INFO ] Deduced a trap composed of 290 places in 357 ms of which 4 ms to minimize.
[2024-05-28 02:33:43] [INFO ] Deduced a trap composed of 298 places in 282 ms of which 3 ms to minimize.
[2024-05-28 02:33:44] [INFO ] Deduced a trap composed of 259 places in 292 ms of which 3 ms to minimize.
[2024-05-28 02:33:44] [INFO ] Deduced a trap composed of 281 places in 375 ms of which 5 ms to minimize.
[2024-05-28 02:33:45] [INFO ] Deduced a trap composed of 321 places in 369 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/1886 variables, and 65 constraints, problems are : Problem set: 0 solved, 1362 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/544 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1362 constraints, Known Traps: 23/23 constraints]
After SMT, in 45109ms problems are : Problem set: 0 solved, 1362 unsolved
Search for dead transitions found 0 dead transitions in 45175ms
[2024-05-28 02:33:50] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
[2024-05-28 02:33:50] [INFO ] Invariant cache hit.
[2024-05-28 02:33:50] [INFO ] Implicit Places using invariants in 357 ms returned [89, 244, 274, 361, 383, 480]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 365 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 538/554 places, 1366/1372 transitions.
Applied a total of 0 rules in 15 ms. Remains 538 /538 variables (removed 0) and now considering 1366/1366 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45694 ms. Remains : 538/554 places, 1366/1372 transitions.
Support contains 340 out of 538 places after structural reductions.
[2024-05-28 02:33:50] [INFO ] Flatten gal took : 177 ms
[2024-05-28 02:33:51] [INFO ] Flatten gal took : 115 ms
[2024-05-28 02:33:51] [INFO ] Input system was already deterministic with 1366 transitions.
Support contains 335 out of 538 places (down from 340) after GAL structural reductions.
RANDOM walk for 40001 steps (9 resets) in 2439 ms. (16 steps per ms) remains 51/80 properties
BEST_FIRST walk for 4003 steps (8 resets) in 105 ms. (37 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 83 ms. (47 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4000 steps (8 resets) in 56 ms. (70 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 51 ms. (76 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 60 ms. (65 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 43 ms. (90 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 78 ms. (50 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 62 ms. (63 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 51/51 properties
[2024-05-28 02:33:53] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
// Phase 1: matrix 1342 rows 538 cols
[2024-05-28 02:33:53] [INFO ] Computed 40 invariants in 40 ms
[2024-05-28 02:33:53] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp72 is UNSAT
At refinement iteration 1 (OVERLAPS) 221/436 variables, 11/11 constraints. Problems are: Problem set: 25 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 0/11 constraints. Problems are: Problem set: 25 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 2/438 variables, 2/13 constraints. Problems are: Problem set: 25 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/438 variables, 0/13 constraints. Problems are: Problem set: 25 solved, 26 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp79 is UNSAT
After SMT solving in domain Real declared 537/1880 variables, and 39 constraints, problems are : Problem set: 51 solved, 0 unsolved in 781 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints]
After SMT, in 927ms problems are : Problem set: 51 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 51 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBLF-PT-S04J04T06-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T06-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T06-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T06-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 02:33:54] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-28 02:33:54] [INFO ] Flatten gal took : 74 ms
[2024-05-28 02:33:54] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBLF-PT-S04J04T06-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T06-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 02:33:54] [INFO ] Flatten gal took : 71 ms
[2024-05-28 02:33:54] [INFO ] Input system was already deterministic with 1366 transitions.
Support contains 89 out of 538 places (down from 91) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 1366/1366 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 532 transition count 1360
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 532 transition count 1360
Applied a total of 12 rules in 34 ms. Remains 532 /538 variables (removed 6) and now considering 1360/1366 (removed 6) transitions.
Running 1356 sub problems to find dead transitions.
[2024-05-28 02:33:54] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 532 cols
[2024-05-28 02:33:54] [INFO ] Computed 40 invariants in 82 ms
[2024-05-28 02:33:54] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 02:34:11] [INFO ] Deduced a trap composed of 39 places in 228 ms of which 3 ms to minimize.
[2024-05-28 02:34:11] [INFO ] Deduced a trap composed of 139 places in 290 ms of which 4 ms to minimize.
[2024-05-28 02:34:12] [INFO ] Deduced a trap composed of 304 places in 313 ms of which 3 ms to minimize.
[2024-05-28 02:34:12] [INFO ] Deduced a trap composed of 278 places in 255 ms of which 3 ms to minimize.
[2024-05-28 02:34:12] [INFO ] Deduced a trap composed of 258 places in 242 ms of which 3 ms to minimize.
[2024-05-28 02:34:13] [INFO ] Deduced a trap composed of 286 places in 302 ms of which 4 ms to minimize.
[2024-05-28 02:34:14] [INFO ] Deduced a trap composed of 299 places in 266 ms of which 3 ms to minimize.
[2024-05-28 02:34:14] [INFO ] Deduced a trap composed of 253 places in 290 ms of which 4 ms to minimize.
[2024-05-28 02:34:14] [INFO ] Deduced a trap composed of 41 places in 222 ms of which 2 ms to minimize.
[2024-05-28 02:34:14] [INFO ] Deduced a trap composed of 82 places in 158 ms of which 1 ms to minimize.
[2024-05-28 02:34:15] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 2 ms to minimize.
[2024-05-28 02:34:17] [INFO ] Deduced a trap composed of 289 places in 226 ms of which 3 ms to minimize.
[2024-05-28 02:34:17] [INFO ] Deduced a trap composed of 348 places in 227 ms of which 3 ms to minimize.
[2024-05-28 02:34:17] [INFO ] Deduced a trap composed of 291 places in 217 ms of which 3 ms to minimize.
[2024-05-28 02:34:18] [INFO ] Deduced a trap composed of 42 places in 279 ms of which 3 ms to minimize.
[2024-05-28 02:34:19] [INFO ] Deduced a trap composed of 321 places in 302 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 43 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 12/25 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 02:34:29] [INFO ] Deduced a trap composed of 344 places in 410 ms of which 3 ms to minimize.
[2024-05-28 02:34:36] [INFO ] Deduced a trap composed of 5 places in 327 ms of which 6 ms to minimize.
[2024-05-28 02:34:36] [INFO ] Deduced a trap composed of 3 places in 307 ms of which 3 ms to minimize.
[2024-05-28 02:34:37] [INFO ] Deduced a trap composed of 5 places in 313 ms of which 3 ms to minimize.
[2024-05-28 02:34:37] [INFO ] Deduced a trap composed of 74 places in 308 ms of which 4 ms to minimize.
[2024-05-28 02:34:37] [INFO ] Deduced a trap composed of 28 places in 344 ms of which 3 ms to minimize.
[2024-05-28 02:34:38] [INFO ] Deduced a trap composed of 28 places in 331 ms of which 3 ms to minimize.
[2024-05-28 02:34:38] [INFO ] Deduced a trap composed of 303 places in 317 ms of which 3 ms to minimize.
[2024-05-28 02:34:38] [INFO ] Deduced a trap composed of 75 places in 363 ms of which 4 ms to minimize.
[2024-05-28 02:34:39] [INFO ] Deduced a trap composed of 74 places in 305 ms of which 3 ms to minimize.
[2024-05-28 02:34:39] [INFO ] Deduced a trap composed of 75 places in 61 ms of which 0 ms to minimize.
[2024-05-28 02:34:39] [INFO ] Deduced a trap composed of 317 places in 301 ms of which 3 ms to minimize.
[2024-05-28 02:34:39] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1868 variables, and 56 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 12/25 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 29/29 constraints]
After SMT, in 45596ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 45613ms
Finished structural reductions in LTL mode , in 1 iterations and 45652 ms. Remains : 532/538 places, 1360/1366 transitions.
[2024-05-28 02:34:40] [INFO ] Flatten gal took : 54 ms
[2024-05-28 02:34:40] [INFO ] Flatten gal took : 51 ms
[2024-05-28 02:34:40] [INFO ] Input system was already deterministic with 1360 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 538/538 places, 1366/1366 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 538 transition count 1324
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 496 transition count 1324
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 84 place count 496 transition count 1294
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 144 place count 466 transition count 1294
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 276 place count 400 transition count 1228
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 278 place count 398 transition count 1226
Iterating global reduction 2 with 2 rules applied. Total rules applied 280 place count 398 transition count 1226
Applied a total of 280 rules in 269 ms. Remains 398 /538 variables (removed 140) and now considering 1226/1366 (removed 140) transitions.
Running 1222 sub problems to find dead transitions.
[2024-05-28 02:34:40] [INFO ] Flow matrix only has 1202 transitions (discarded 24 similar events)
// Phase 1: matrix 1202 rows 398 cols
[2024-05-28 02:34:40] [INFO ] Computed 40 invariants in 52 ms
[2024-05-28 02:34:40] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-28 02:34:53] [INFO ] Deduced a trap composed of 3 places in 198 ms of which 2 ms to minimize.
[2024-05-28 02:34:55] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/1600 variables, and 35 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/398 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-28 02:35:09] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 1 ms to minimize.
[2024-05-28 02:35:09] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 1 ms to minimize.
[2024-05-28 02:35:09] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 6 ms to minimize.
[2024-05-28 02:35:10] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-28 02:35:22] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 1 ms to minimize.
[2024-05-28 02:35:22] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 1 ms to minimize.
(s10 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 9)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/1600 variables, and 41 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/398 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1222 constraints, Known Traps: 8/8 constraints]
After SMT, in 45663ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 45684ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 45970 ms. Remains : 398/538 places, 1226/1366 transitions.
[2024-05-28 02:35:26] [INFO ] Flatten gal took : 58 ms
[2024-05-28 02:35:26] [INFO ] Flatten gal took : 66 ms
[2024-05-28 02:35:26] [INFO ] Input system was already deterministic with 1226 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 538/538 places, 1366/1366 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 538 transition count 1342
Reduce places removed 24 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 30 rules applied. Total rules applied 54 place count 514 transition count 1336
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 60 place count 508 transition count 1336
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 60 place count 508 transition count 1276
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 180 place count 448 transition count 1276
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 312 place count 382 transition count 1210
Applied a total of 312 rules in 117 ms. Remains 382 /538 variables (removed 156) and now considering 1210/1366 (removed 156) transitions.
Running 1206 sub problems to find dead transitions.
[2024-05-28 02:35:26] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
// Phase 1: matrix 1186 rows 382 cols
[2024-05-28 02:35:26] [INFO ] Computed 40 invariants in 25 ms
[2024-05-28 02:35:26] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-28 02:35:39] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 1 ms to minimize.
[2024-05-28 02:35:39] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 1 ms to minimize.
[2024-05-28 02:35:39] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 1 ms to minimize.
[2024-05-28 02:35:39] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 3 ms to minimize.
[2024-05-28 02:35:39] [INFO ] Deduced a trap composed of 67 places in 154 ms of which 1 ms to minimize.
[2024-05-28 02:35:46] [INFO ] Deduced a trap composed of 132 places in 165 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-28 02:35:50] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1568 variables, and 42 constraints, problems are : Problem set: 0 solved, 1206 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1206/1206 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 7/42 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-28 02:35:54] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 2 ms to minimize.
[2024-05-28 02:35:55] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 1 ms to minimize.
[2024-05-28 02:35:55] [INFO ] Deduced a trap composed of 49 places in 35 ms of which 4 ms to minimize.
[2024-05-28 02:35:55] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 0 ms to minimize.
[2024-05-28 02:36:00] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 1 ms to minimize.
[2024-05-28 02:36:05] [INFO ] Deduced a trap composed of 115 places in 191 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-28 02:36:09] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/1568 variables, and 49 constraints, problems are : Problem set: 0 solved, 1206 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1206 constraints, Known Traps: 14/14 constraints]
After SMT, in 45338ms problems are : Problem set: 0 solved, 1206 unsolved
Search for dead transitions found 0 dead transitions in 45349ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 45482 ms. Remains : 382/538 places, 1210/1366 transitions.
[2024-05-28 02:36:12] [INFO ] Flatten gal took : 42 ms
[2024-05-28 02:36:12] [INFO ] Flatten gal took : 46 ms
[2024-05-28 02:36:12] [INFO ] Input system was already deterministic with 1210 transitions.
RANDOM walk for 321 steps (0 resets) in 6 ms. (45 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-PT-S04J04T06-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 1366/1366 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 532 transition count 1360
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 532 transition count 1360
Applied a total of 12 rules in 33 ms. Remains 532 /538 variables (removed 6) and now considering 1360/1366 (removed 6) transitions.
Running 1356 sub problems to find dead transitions.
[2024-05-28 02:36:12] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 532 cols
[2024-05-28 02:36:12] [INFO ] Computed 40 invariants in 34 ms
[2024-05-28 02:36:12] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 02:36:28] [INFO ] Deduced a trap composed of 39 places in 222 ms of which 2 ms to minimize.
[2024-05-28 02:36:28] [INFO ] Deduced a trap composed of 139 places in 309 ms of which 2 ms to minimize.
[2024-05-28 02:36:28] [INFO ] Deduced a trap composed of 304 places in 283 ms of which 3 ms to minimize.
[2024-05-28 02:36:29] [INFO ] Deduced a trap composed of 278 places in 248 ms of which 3 ms to minimize.
[2024-05-28 02:36:29] [INFO ] Deduced a trap composed of 258 places in 224 ms of which 3 ms to minimize.
[2024-05-28 02:36:30] [INFO ] Deduced a trap composed of 286 places in 229 ms of which 3 ms to minimize.
[2024-05-28 02:36:30] [INFO ] Deduced a trap composed of 299 places in 274 ms of which 3 ms to minimize.
[2024-05-28 02:36:30] [INFO ] Deduced a trap composed of 253 places in 311 ms of which 3 ms to minimize.
[2024-05-28 02:36:31] [INFO ] Deduced a trap composed of 41 places in 197 ms of which 2 ms to minimize.
[2024-05-28 02:36:31] [INFO ] Deduced a trap composed of 82 places in 179 ms of which 2 ms to minimize.
[2024-05-28 02:36:31] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 1 ms to minimize.
[2024-05-28 02:36:33] [INFO ] Deduced a trap composed of 289 places in 277 ms of which 3 ms to minimize.
[2024-05-28 02:36:33] [INFO ] Deduced a trap composed of 348 places in 210 ms of which 3 ms to minimize.
[2024-05-28 02:36:34] [INFO ] Deduced a trap composed of 291 places in 221 ms of which 3 ms to minimize.
[2024-05-28 02:36:34] [INFO ] Deduced a trap composed of 42 places in 306 ms of which 4 ms to minimize.
[2024-05-28 02:36:35] [INFO ] Deduced a trap composed of 321 places in 247 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 43 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 12/25 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 02:36:45] [INFO ] Deduced a trap composed of 344 places in 300 ms of which 3 ms to minimize.
[2024-05-28 02:36:53] [INFO ] Deduced a trap composed of 5 places in 392 ms of which 4 ms to minimize.
[2024-05-28 02:36:53] [INFO ] Deduced a trap composed of 3 places in 313 ms of which 3 ms to minimize.
[2024-05-28 02:36:54] [INFO ] Deduced a trap composed of 5 places in 374 ms of which 4 ms to minimize.
[2024-05-28 02:36:54] [INFO ] Deduced a trap composed of 74 places in 349 ms of which 3 ms to minimize.
[2024-05-28 02:36:54] [INFO ] Deduced a trap composed of 28 places in 327 ms of which 3 ms to minimize.
[2024-05-28 02:36:55] [INFO ] Deduced a trap composed of 28 places in 314 ms of which 3 ms to minimize.
[2024-05-28 02:36:55] [INFO ] Deduced a trap composed of 303 places in 364 ms of which 4 ms to minimize.
[2024-05-28 02:36:56] [INFO ] Deduced a trap composed of 75 places in 346 ms of which 3 ms to minimize.
[2024-05-28 02:36:56] [INFO ] Deduced a trap composed of 74 places in 362 ms of which 4 ms to minimize.
[2024-05-28 02:36:56] [INFO ] Deduced a trap composed of 75 places in 69 ms of which 1 ms to minimize.
[2024-05-28 02:36:56] [INFO ] Deduced a trap composed of 317 places in 378 ms of which 4 ms to minimize.
SMT process timed out in 44418ms, After SMT, problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 44444ms
Finished structural reductions in LTL mode , in 1 iterations and 44493 ms. Remains : 532/538 places, 1360/1366 transitions.
[2024-05-28 02:36:57] [INFO ] Flatten gal took : 51 ms
[2024-05-28 02:36:57] [INFO ] Flatten gal took : 64 ms
[2024-05-28 02:36:57] [INFO ] Input system was already deterministic with 1360 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 538/538 places, 1366/1366 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 538 transition count 1324
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 496 transition count 1324
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 84 place count 496 transition count 1264
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 204 place count 436 transition count 1264
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 2 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 334 place count 371 transition count 1199
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 336 place count 369 transition count 1197
Iterating global reduction 2 with 2 rules applied. Total rules applied 338 place count 369 transition count 1197
Applied a total of 338 rules in 84 ms. Remains 369 /538 variables (removed 169) and now considering 1197/1366 (removed 169) transitions.
Running 1193 sub problems to find dead transitions.
[2024-05-28 02:36:57] [INFO ] Flow matrix only has 1173 transitions (discarded 24 similar events)
// Phase 1: matrix 1173 rows 369 cols
[2024-05-28 02:36:57] [INFO ] Computed 40 invariants in 19 ms
[2024-05-28 02:36:57] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-05-28 02:37:08] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 1 ms to minimize.
[2024-05-28 02:37:08] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 1 ms to minimize.
[2024-05-28 02:37:08] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 0 ms to minimize.
[2024-05-28 02:37:08] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 0 ms to minimize.
[2024-05-28 02:37:09] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-05-28 02:37:09] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-05-28 02:37:09] [INFO ] Deduced a trap composed of 27 places in 199 ms of which 2 ms to minimize.
[2024-05-28 02:37:10] [INFO ] Deduced a trap composed of 38 places in 216 ms of which 2 ms to minimize.
[2024-05-28 02:37:10] [INFO ] Deduced a trap composed of 128 places in 218 ms of which 2 ms to minimize.
[2024-05-28 02:37:10] [INFO ] Deduced a trap composed of 138 places in 212 ms of which 2 ms to minimize.
[2024-05-28 02:37:10] [INFO ] Deduced a trap composed of 47 places in 239 ms of which 2 ms to minimize.
[2024-05-28 02:37:11] [INFO ] Deduced a trap composed of 156 places in 247 ms of which 3 ms to minimize.
[2024-05-28 02:37:12] [INFO ] Deduced a trap composed of 160 places in 262 ms of which 3 ms to minimize.
[2024-05-28 02:37:12] [INFO ] Deduced a trap composed of 123 places in 232 ms of which 2 ms to minimize.
[2024-05-28 02:37:15] [INFO ] Deduced a trap composed of 15 places in 200 ms of which 2 ms to minimize.
[2024-05-28 02:37:21] [INFO ] Deduced a trap composed of 163 places in 320 ms of which 2 ms to minimize.
[2024-05-28 02:37:21] [INFO ] Deduced a trap composed of 175 places in 333 ms of which 3 ms to minimize.
[2024-05-28 02:37:22] [INFO ] Deduced a trap composed of 137 places in 228 ms of which 3 ms to minimize.
[2024-05-28 02:37:22] [INFO ] Deduced a trap composed of 121 places in 221 ms of which 5 ms to minimize.
SMT process timed out in 25250ms, After SMT, problems are : Problem set: 0 solved, 1193 unsolved
Search for dead transitions found 0 dead transitions in 25266ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 25355 ms. Remains : 369/538 places, 1197/1366 transitions.
[2024-05-28 02:37:22] [INFO ] Flatten gal took : 40 ms
[2024-05-28 02:37:22] [INFO ] Flatten gal took : 44 ms
[2024-05-28 02:37:22] [INFO ] Input system was already deterministic with 1197 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 538/538 places, 1366/1366 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 538 transition count 1325
Reduce places removed 41 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 83 place count 497 transition count 1324
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 84 place count 496 transition count 1324
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 84 place count 496 transition count 1264
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 204 place count 436 transition count 1264
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 2 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 334 place count 371 transition count 1199
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 336 place count 369 transition count 1197
Iterating global reduction 3 with 2 rules applied. Total rules applied 338 place count 369 transition count 1197
Applied a total of 338 rules in 71 ms. Remains 369 /538 variables (removed 169) and now considering 1197/1366 (removed 169) transitions.
Running 1193 sub problems to find dead transitions.
[2024-05-28 02:37:22] [INFO ] Flow matrix only has 1173 transitions (discarded 24 similar events)
// Phase 1: matrix 1173 rows 369 cols
[2024-05-28 02:37:22] [INFO ] Computed 40 invariants in 19 ms
[2024-05-28 02:37:22] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-05-28 02:37:34] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 1 ms to minimize.
[2024-05-28 02:37:34] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 1 ms to minimize.
[2024-05-28 02:37:34] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 0 ms to minimize.
[2024-05-28 02:37:34] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 1 ms to minimize.
[2024-05-28 02:37:34] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2024-05-28 02:37:34] [INFO ] Deduced a trap composed of 39 places in 255 ms of which 3 ms to minimize.
[2024-05-28 02:37:34] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 0 ms to minimize.
[2024-05-28 02:37:35] [INFO ] Deduced a trap composed of 149 places in 235 ms of which 2 ms to minimize.
[2024-05-28 02:37:35] [INFO ] Deduced a trap composed of 140 places in 169 ms of which 2 ms to minimize.
[2024-05-28 02:37:35] [INFO ] Deduced a trap composed of 143 places in 265 ms of which 2 ms to minimize.
[2024-05-28 02:37:35] [INFO ] Deduced a trap composed of 146 places in 192 ms of which 3 ms to minimize.
[2024-05-28 02:37:36] [INFO ] Deduced a trap composed of 45 places in 209 ms of which 2 ms to minimize.
[2024-05-28 02:37:36] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 2 ms to minimize.
[2024-05-28 02:37:36] [INFO ] Deduced a trap composed of 60 places in 182 ms of which 2 ms to minimize.
[2024-05-28 02:37:37] [INFO ] Deduced a trap composed of 121 places in 168 ms of which 2 ms to minimize.
[2024-05-28 02:37:45] [INFO ] Deduced a trap composed of 148 places in 301 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 365/1542 variables, and 52 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/369 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1193/1193 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-05-28 02:37:55] [INFO ] Deduced a trap composed of 184 places in 217 ms of which 2 ms to minimize.
[2024-05-28 02:37:56] [INFO ] Deduced a trap composed of 139 places in 225 ms of which 3 ms to minimize.
[2024-05-28 02:37:57] [INFO ] Deduced a trap composed of 147 places in 225 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/1542 variables, and 55 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/369 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1193 constraints, Known Traps: 19/19 constraints]
After SMT, in 45066ms problems are : Problem set: 0 solved, 1193 unsolved
Search for dead transitions found 0 dead transitions in 45077ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 45150 ms. Remains : 369/538 places, 1197/1366 transitions.
[2024-05-28 02:38:08] [INFO ] Flatten gal took : 40 ms
[2024-05-28 02:38:08] [INFO ] Flatten gal took : 41 ms
[2024-05-28 02:38:08] [INFO ] Input system was already deterministic with 1197 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 538/538 places, 1366/1366 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 538 transition count 1324
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 496 transition count 1324
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 59 Pre rules applied. Total rules applied 84 place count 496 transition count 1265
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 202 place count 437 transition count 1265
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 2 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 334 place count 371 transition count 1199
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 336 place count 369 transition count 1197
Iterating global reduction 2 with 2 rules applied. Total rules applied 338 place count 369 transition count 1197
Applied a total of 338 rules in 77 ms. Remains 369 /538 variables (removed 169) and now considering 1197/1366 (removed 169) transitions.
Running 1193 sub problems to find dead transitions.
[2024-05-28 02:38:08] [INFO ] Flow matrix only has 1173 transitions (discarded 24 similar events)
// Phase 1: matrix 1173 rows 369 cols
[2024-05-28 02:38:08] [INFO ] Computed 40 invariants in 20 ms
[2024-05-28 02:38:08] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-05-28 02:38:19] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 1 ms to minimize.
[2024-05-28 02:38:20] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 2 ms to minimize.
[2024-05-28 02:38:20] [INFO ] Deduced a trap composed of 28 places in 180 ms of which 3 ms to minimize.
[2024-05-28 02:38:20] [INFO ] Deduced a trap composed of 27 places in 182 ms of which 2 ms to minimize.
[2024-05-28 02:38:20] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 1 ms to minimize.
[2024-05-28 02:38:20] [INFO ] Deduced a trap composed of 55 places in 150 ms of which 1 ms to minimize.
[2024-05-28 02:38:21] [INFO ] Deduced a trap composed of 67 places in 120 ms of which 1 ms to minimize.
[2024-05-28 02:38:22] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 1 ms to minimize.
[2024-05-28 02:38:28] [INFO ] Deduced a trap composed of 121 places in 207 ms of which 2 ms to minimize.
[2024-05-28 02:38:29] [INFO ] Deduced a trap composed of 108 places in 206 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 365/1542 variables, and 45 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 19/24 constraints, State Equation: 0/369 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1193/1193 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-05-28 02:38:34] [INFO ] Deduced a trap composed of 46 places in 33 ms of which 1 ms to minimize.
[2024-05-28 02:38:34] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 0 ms to minimize.
[2024-05-28 02:38:34] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-05-28 02:38:36] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2024-05-28 02:38:36] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
[2024-05-28 02:38:36] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/365 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/1542 variables, and 51 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 19/24 constraints, State Equation: 0/369 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1193 constraints, Known Traps: 16/16 constraints]
After SMT, in 44965ms problems are : Problem set: 0 solved, 1193 unsolved
Search for dead transitions found 0 dead transitions in 44978ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 45058 ms. Remains : 369/538 places, 1197/1366 transitions.
[2024-05-28 02:38:53] [INFO ] Flatten gal took : 88 ms
[2024-05-28 02:38:53] [INFO ] Flatten gal took : 92 ms
[2024-05-28 02:38:53] [INFO ] Input system was already deterministic with 1197 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 538/538 places, 1366/1366 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 538 transition count 1325
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 82 place count 497 transition count 1325
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 59 Pre rules applied. Total rules applied 82 place count 497 transition count 1266
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 200 place count 438 transition count 1266
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 326 place count 375 transition count 1203
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 327 place count 374 transition count 1202
Iterating global reduction 2 with 1 rules applied. Total rules applied 328 place count 374 transition count 1202
Applied a total of 328 rules in 77 ms. Remains 374 /538 variables (removed 164) and now considering 1202/1366 (removed 164) transitions.
Running 1198 sub problems to find dead transitions.
[2024-05-28 02:38:53] [INFO ] Flow matrix only has 1178 transitions (discarded 24 similar events)
// Phase 1: matrix 1178 rows 374 cols
[2024-05-28 02:38:53] [INFO ] Computed 40 invariants in 38 ms
[2024-05-28 02:38:53] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 02:39:07] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 1 ms to minimize.
[2024-05-28 02:39:07] [INFO ] Deduced a trap composed of 48 places in 74 ms of which 1 ms to minimize.
[2024-05-28 02:39:07] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
[2024-05-28 02:39:08] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 0 ms to minimize.
[2024-05-28 02:39:08] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 0 ms to minimize.
[2024-05-28 02:39:08] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 0 ms to minimize.
[2024-05-28 02:39:08] [INFO ] Deduced a trap composed of 71 places in 159 ms of which 2 ms to minimize.
[2024-05-28 02:39:09] [INFO ] Deduced a trap composed of 55 places in 190 ms of which 3 ms to minimize.
[2024-05-28 02:39:09] [INFO ] Deduced a trap composed of 82 places in 202 ms of which 2 ms to minimize.
[2024-05-28 02:39:09] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 2 ms to minimize.
[2024-05-28 02:39:10] [INFO ] Deduced a trap composed of 123 places in 195 ms of which 2 ms to minimize.
[2024-05-28 02:39:12] [INFO ] Deduced a trap composed of 120 places in 136 ms of which 1 ms to minimize.
[2024-05-28 02:39:16] [INFO ] Deduced a trap composed of 167 places in 189 ms of which 2 ms to minimize.
[2024-05-28 02:39:16] [INFO ] Deduced a trap composed of 157 places in 196 ms of which 2 ms to minimize.
[2024-05-28 02:39:17] [INFO ] Deduced a trap composed of 182 places in 205 ms of which 2 ms to minimize.
[2024-05-28 02:39:17] [INFO ] Deduced a trap composed of 176 places in 242 ms of which 2 ms to minimize.
[2024-05-28 02:39:18] [INFO ] Deduced a trap composed of 182 places in 233 ms of which 2 ms to minimize.
[2024-05-28 02:39:18] [INFO ] Deduced a trap composed of 178 places in 234 ms of which 2 ms to minimize.
[2024-05-28 02:39:18] [INFO ] Deduced a trap composed of 143 places in 200 ms of which 2 ms to minimize.
[2024-05-28 02:39:18] [INFO ] Deduced a trap composed of 175 places in 205 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 9.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 (/ 17.0 4.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 1.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 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/1552 variables, and 56 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/25 constraints, State Equation: 0/374 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1198/1198 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 02:39:25] [INFO ] Deduced a trap composed of 181 places in 321 ms of which 3 ms to minimize.
[2024-05-28 02:39:26] [INFO ] Deduced a trap composed of 186 places in 289 ms of which 2 ms to minimize.
[2024-05-28 02:39:26] [INFO ] Deduced a trap composed of 198 places in 244 ms of which 3 ms to minimize.
[2024-05-28 02:39:26] [INFO ] Deduced a trap composed of 178 places in 236 ms of which 2 ms to minimize.
[2024-05-28 02:39:27] [INFO ] Deduced a trap composed of 212 places in 234 ms of which 2 ms to minimize.
[2024-05-28 02:39:27] [INFO ] Deduced a trap composed of 178 places in 234 ms of which 3 ms to minimize.
[2024-05-28 02:39:27] [INFO ] Deduced a trap composed of 207 places in 245 ms of which 2 ms to minimize.
[2024-05-28 02:39:27] [INFO ] Deduced a trap composed of 179 places in 234 ms of which 2 ms to minimize.
[2024-05-28 02:39:28] [INFO ] Deduced a trap composed of 186 places in 233 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/1552 variables, and 65 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/25 constraints, State Equation: 0/374 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1198 constraints, Known Traps: 29/29 constraints]
After SMT, in 46286ms problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 46298ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 46380 ms. Remains : 374/538 places, 1202/1366 transitions.
[2024-05-28 02:39:40] [INFO ] Flatten gal took : 52 ms
[2024-05-28 02:39:40] [INFO ] Flatten gal took : 56 ms
[2024-05-28 02:39:40] [INFO ] Input system was already deterministic with 1202 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 538/538 places, 1366/1366 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 538 transition count 1324
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 496 transition count 1324
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 84 place count 496 transition count 1264
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 204 place count 436 transition count 1264
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 2 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 334 place count 371 transition count 1199
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 336 place count 369 transition count 1197
Iterating global reduction 2 with 2 rules applied. Total rules applied 338 place count 369 transition count 1197
Applied a total of 338 rules in 130 ms. Remains 369 /538 variables (removed 169) and now considering 1197/1366 (removed 169) transitions.
Running 1193 sub problems to find dead transitions.
[2024-05-28 02:39:40] [INFO ] Flow matrix only has 1173 transitions (discarded 24 similar events)
// Phase 1: matrix 1173 rows 369 cols
[2024-05-28 02:39:40] [INFO ] Computed 40 invariants in 17 ms
[2024-05-28 02:39:40] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-05-28 02:39:51] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 1 ms to minimize.
[2024-05-28 02:39:51] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-05-28 02:39:52] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2024-05-28 02:39:52] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
[2024-05-28 02:39:52] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 0 ms to minimize.
[2024-05-28 02:39:52] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-05-28 02:39:52] [INFO ] Deduced a trap composed of 26 places in 224 ms of which 2 ms to minimize.
[2024-05-28 02:39:52] [INFO ] Deduced a trap composed of 61 places in 214 ms of which 3 ms to minimize.
[2024-05-28 02:39:53] [INFO ] Deduced a trap composed of 27 places in 224 ms of which 6 ms to minimize.
[2024-05-28 02:39:55] [INFO ] Deduced a trap composed of 15 places in 1572 ms of which 14 ms to minimize.
[2024-05-28 02:40:05] [INFO ] Deduced a trap composed of 139 places in 10594 ms of which 91 ms to minimize.
SMT process timed out in 25436ms, After SMT, problems are : Problem set: 0 solved, 1193 unsolved
Search for dead transitions found 0 dead transitions in 25447ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 25581 ms. Remains : 369/538 places, 1197/1366 transitions.
[2024-05-28 02:40:05] [INFO ] Flatten gal took : 107 ms
[2024-05-28 02:40:05] [INFO ] Flatten gal took : 92 ms
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running PolyORBLF-PT-S04J04T06
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 554
TRANSITIONS: 2998
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.099s, Sys 0.011s]
SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.014s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1233
MODEL NAME: /home/mcc/execution/model
554 places, 2998 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
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
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-S04J04T06"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is PolyORBLF-PT-S04J04T06, 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 r289-tajo-171654445500265"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S04J04T06.tgz
mv PolyORBLF-PT-S04J04T06 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 '
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 ;