About the Execution of LTSMin+red for PolyORBLF-PT-S04J04T08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 335853.00 | 0.00 | 0.00 | FF????????FFF??? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654446700274.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-S04J04T08, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446700274
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.4M
-rw-r--r-- 1 mcc users 21K Apr 11 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 11 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 109K Apr 11 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 501K Apr 11 16:48 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.0K 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 12K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 29K Apr 11 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 11 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 178K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 780K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.8K 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 3.3M 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-S04J04T08-CTLFireability-2024-00
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLFireability-2024-01
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLFireability-2024-02
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLFireability-2024-03
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLFireability-2024-04
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLFireability-2024-05
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLFireability-2024-06
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLFireability-2024-07
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLFireability-2024-08
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLFireability-2024-09
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLFireability-2024-10
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLFireability-2024-11
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLFireability-2024-12
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLFireability-2024-13
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLFireability-2024-14
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717253823125
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J04T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:57:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 14:57:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:57:04] [INFO ] Load time of PNML (sax parser for PT used): 313 ms
[2024-06-01 14:57:04] [INFO ] Transformed 712 places.
[2024-06-01 14:57:04] [INFO ] Transformed 4012 transitions.
[2024-06-01 14:57:04] [INFO ] Parsed PT model containing 712 places and 4012 transitions and 27744 arcs in 493 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 39 ms.
[2024-06-01 14:57:04] [INFO ] Reduced 48 identical enabling conditions.
[2024-06-01 14:57:04] [INFO ] Reduced 1768 identical enabling conditions.
[2024-06-01 14:57:04] [INFO ] Reduced 48 identical enabling conditions.
[2024-06-01 14:57:04] [INFO ] Reduced 1768 identical enabling conditions.
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
Support contains 565 out of 712 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 712/712 places, 1844/1844 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 708 transition count 1844
Applied a total of 4 rules in 58 ms. Remains 708 /712 variables (removed 4) and now considering 1844/1844 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-06-01 14:57:05] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 708 cols
[2024-06-01 14:57:05] [INFO ] Computed 50 invariants in 101 ms
[2024-06-01 14:57:05] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-06-01 14:57:31] [INFO ] Deduced a trap composed of 147 places in 198 ms of which 25 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 704/2520 variables, and 41 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20103 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/38 constraints, State Equation: 0/708 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1840/1840 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/704 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-06-01 14:57:36] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 2 ms to minimize.
[2024-06-01 14:57:37] [INFO ] Deduced a trap composed of 5 places in 310 ms of which 3 ms to minimize.
[2024-06-01 14:57:37] [INFO ] Deduced a trap composed of 75 places in 355 ms of which 3 ms to minimize.
[2024-06-01 14:57:38] [INFO ] Deduced a trap composed of 76 places in 409 ms of which 3 ms to minimize.
[2024-06-01 14:57:38] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 2 ms to minimize.
[2024-06-01 14:57:38] [INFO ] Deduced a trap composed of 75 places in 77 ms of which 1 ms to minimize.
[2024-06-01 14:57:38] [INFO ] Deduced a trap composed of 75 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:57:39] [INFO ] Deduced a trap composed of 41 places in 385 ms of which 3 ms to minimize.
[2024-06-01 14:57:39] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 1 ms to minimize.
[2024-06-01 14:57:39] [INFO ] Deduced a trap composed of 76 places in 76 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 704/2520 variables, and 51 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/38 constraints, State Equation: 0/708 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1840 constraints, Known Traps: 11/11 constraints]
After SMT, in 48023ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 48076ms
[2024-06-01 14:57:53] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-06-01 14:57:53] [INFO ] Invariant cache hit.
[2024-06-01 14:57:53] [INFO ] Implicit Places using invariants in 257 ms returned [142, 228, 251, 352, 479, 558, 687]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 282 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 701/712 places, 1844/1844 transitions.
Applied a total of 0 rules in 23 ms. Remains 701 /701 variables (removed 0) and now considering 1844/1844 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48488 ms. Remains : 701/712 places, 1844/1844 transitions.
Support contains 565 out of 701 places after structural reductions.
[2024-06-01 14:57:54] [INFO ] Flatten gal took : 325 ms
[2024-06-01 14:57:54] [INFO ] Flatten gal took : 183 ms
[2024-06-01 14:57:55] [INFO ] Input system was already deterministic with 1844 transitions.
Reduction of identical properties reduced properties to check from 82 to 81
RANDOM walk for 40000 steps (8 resets) in 3982 ms. (10 steps per ms) remains 30/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 180 ms. (22 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 29/29 properties
[2024-06-01 14:57:56] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 701 cols
[2024-06-01 14:57:56] [INFO ] Computed 43 invariants in 54 ms
[2024-06-01 14:57:56] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp76 is UNSAT
At refinement iteration 1 (OVERLAPS) 146/297 variables, 9/9 constraints. Problems are: Problem set: 9 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 0/9 constraints. Problems are: Problem set: 9 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 10/307 variables, 3/12 constraints. Problems are: Problem set: 9 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 0/12 constraints. Problems are: Problem set: 9 solved, 20 unsolved
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp80 is UNSAT
At refinement iteration 5 (OVERLAPS) 379/686 variables, 20/32 constraints. Problems are: Problem set: 23 solved, 6 unsolved
[2024-06-01 14:57:58] [INFO ] Deduced a trap composed of 76 places in 120 ms of which 2 ms to minimize.
[2024-06-01 14:57:58] [INFO ] Deduced a trap composed of 76 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:57:58] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 1 ms to minimize.
[2024-06-01 14:57:58] [INFO ] Deduced a trap composed of 76 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/686 variables, 4/36 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/686 variables, 0/36 constraints. Problems are: Problem set: 23 solved, 6 unsolved
Problem AtomicPropp8 is UNSAT
At refinement iteration 8 (OVERLAPS) 2/688 variables, 2/38 constraints. Problems are: Problem set: 24 solved, 5 unsolved
[2024-06-01 14:57:58] [INFO ] Deduced a trap composed of 76 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:57:58] [INFO ] Deduced a trap composed of 76 places in 43 ms of which 0 ms to minimize.
[2024-06-01 14:57:59] [INFO ] Deduced a trap composed of 75 places in 504 ms of which 4 ms to minimize.
[2024-06-01 14:57:59] [INFO ] Deduced a trap composed of 432 places in 518 ms of which 5 ms to minimize.
[2024-06-01 14:58:00] [INFO ] Deduced a trap composed of 422 places in 482 ms of which 5 ms to minimize.
[2024-06-01 14:58:00] [INFO ] Deduced a trap composed of 381 places in 360 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/688 variables, 6/44 constraints. Problems are: Problem set: 24 solved, 5 unsolved
[2024-06-01 14:58:01] [INFO ] Deduced a trap composed of 397 places in 491 ms of which 5 ms to minimize.
[2024-06-01 14:58:01] [INFO ] Deduced a trap composed of 414 places in 437 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/688 variables, 2/46 constraints. Problems are: Problem set: 24 solved, 5 unsolved
[2024-06-01 14:58:02] [INFO ] Deduced a trap composed of 386 places in 425 ms of which 5 ms to minimize.
SMT process timed out in 5674ms, After SMT, problems are : Problem set: 24 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 117 out of 701 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 701/701 places, 1844/1844 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 701 transition count 1828
Reduce places removed 16 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 1 with 31 rules applied. Total rules applied 47 place count 685 transition count 1813
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 62 place count 670 transition count 1813
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 62 place count 670 transition count 1773
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 142 place count 630 transition count 1773
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 218 place count 592 transition count 1735
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 3 with 24 rules applied. Total rules applied 242 place count 592 transition count 1711
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 266 place count 568 transition count 1711
Applied a total of 266 rules in 495 ms. Remains 568 /701 variables (removed 133) and now considering 1711/1844 (removed 133) transitions.
Running 1707 sub problems to find dead transitions.
[2024-06-01 14:58:03] [INFO ] Flow matrix only has 1679 transitions (discarded 32 similar events)
// Phase 1: matrix 1679 rows 568 cols
[2024-06-01 14:58:03] [INFO ] Computed 43 invariants in 53 ms
[2024-06-01 14:58:03] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/564 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1707 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/564 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1707 unsolved
[2024-06-01 14:58:27] [INFO ] Deduced a trap composed of 3 places in 274 ms of which 3 ms to minimize.
[2024-06-01 14:58:27] [INFO ] Deduced a trap composed of 19 places in 196 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 564/2247 variables, and 38 constraints, problems are : Problem set: 0 solved, 1707 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/29 constraints, State Equation: 0/568 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1707/1707 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1707 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/564 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1707 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/564 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1707 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/564 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1707 unsolved
[2024-06-01 14:58:39] [INFO ] Deduced a trap composed of 60 places in 188 ms of which 3 ms to minimize.
[2024-06-01 14:58:39] [INFO ] Deduced a trap composed of 58 places in 141 ms of which 2 ms to minimize.
[2024-06-01 14:58:39] [INFO ] Deduced a trap composed of 59 places in 124 ms of which 2 ms to minimize.
[2024-06-01 14:58:39] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 2 ms to minimize.
[2024-06-01 14:58:39] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 0 ms to minimize.
[2024-06-01 14:58:39] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:58:40] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:58:44] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 564/2247 variables, and 46 constraints, problems are : Problem set: 0 solved, 1707 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/29 constraints, State Equation: 0/568 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1707 constraints, Known Traps: 10/10 constraints]
After SMT, in 52241ms problems are : Problem set: 0 solved, 1707 unsolved
Search for dead transitions found 0 dead transitions in 52285ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52816 ms. Remains : 568/701 places, 1711/1844 transitions.
RANDOM walk for 40000 steps (9 resets) in 880 ms. (45 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 444 ms. (89 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 522 ms. (76 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (9 resets) in 303 ms. (131 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 253 ms. (157 steps per ms) remains 4/4 properties
[2024-06-01 14:58:56] [INFO ] Flow matrix only has 1679 transitions (discarded 32 similar events)
[2024-06-01 14:58:56] [INFO ] Invariant cache hit.
[2024-06-01 14:58:56] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 107/223 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 15/238 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 315/553 variables, 21/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 14:58:56] [INFO ] Deduced a trap composed of 59 places in 221 ms of which 6 ms to minimize.
[2024-06-01 14:58:56] [INFO ] Deduced a trap composed of 59 places in 126 ms of which 2 ms to minimize.
[2024-06-01 14:58:57] [INFO ] Deduced a trap composed of 59 places in 115 ms of which 2 ms to minimize.
[2024-06-01 14:58:57] [INFO ] Deduced a trap composed of 59 places in 95 ms of which 1 ms to minimize.
[2024-06-01 14:58:57] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:58:57] [INFO ] Deduced a trap composed of 60 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 3/556 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/556 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
At refinement iteration 10 (OVERLAPS) 12/568 variables, 8/49 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/568 variables, 0/49 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2247/2247 variables, and 617 constraints, problems are : Problem set: 3 solved, 1 unsolved in 45017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 568/568 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/11 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 488/499 variables, 9/10 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-06-01 14:59:41] [INFO ] Deduced a trap composed of 326 places in 461 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/499 variables, 1/11 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/524 variables, 10/21 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 0/21 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/525 variables, 1/22 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/525 variables, 0/22 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 40/565 variables, 20/42 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/565 variables, 6/48 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-06-01 14:59:42] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/565 variables, 1/49 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/565 variables, 0/49 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/566 variables, 1/50 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/50 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1679/2245 variables, 566/616 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2245 variables, 160/776 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2245 variables, 1/777 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2245 variables, 0/777 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/2247 variables, 2/779 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2247 variables, 1/780 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-06-01 14:59:47] [INFO ] Deduced a trap composed of 39 places in 477 ms of which 4 ms to minimize.
[2024-06-01 14:59:49] [INFO ] Deduced a trap composed of 305 places in 407 ms of which 4 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/2247 variables, 2/782 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2247 variables, 0/782 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/2247 variables, 0/782 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2247/2247 variables, and 782 constraints, problems are : Problem set: 3 solved, 1 unsolved in 8739 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 568/568 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 10/10 constraints]
After SMT, in 53833ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 85 ms.
Support contains 2 out of 568 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 568/568 places, 1711/1711 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 568 transition count 1686
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 543 transition count 1686
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 50 place count 543 transition count 1646
Deduced a syphon composed of 40 places in 3 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 130 place count 503 transition count 1646
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 136 place count 497 transition count 1640
Iterating global reduction 2 with 6 rules applied. Total rules applied 142 place count 497 transition count 1640
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 222 place count 457 transition count 1600
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 230 place count 457 transition count 1592
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 238 place count 449 transition count 1592
Applied a total of 238 rules in 217 ms. Remains 449 /568 variables (removed 119) and now considering 1592/1711 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 449/568 places, 1592/1711 transitions.
Successfully simplified 27 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-PT-S04J04T08-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:59:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 14:59:50] [INFO ] Flatten gal took : 111 ms
FORMULA PolyORBLF-PT-S04J04T08-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:59:50] [INFO ] Flatten gal took : 110 ms
[2024-06-01 14:59:50] [INFO ] Input system was already deterministic with 1844 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 701/701 places, 1844/1844 transitions.
Applied a total of 0 rules in 15 ms. Remains 701 /701 variables (removed 0) and now considering 1844/1844 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-06-01 14:59:51] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 701 cols
[2024-06-01 14:59:51] [INFO ] Computed 43 invariants in 31 ms
[2024-06-01 14:59:51] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/697 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/697 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-06-01 15:00:15] [INFO ] Deduced a trap composed of 76 places in 115 ms of which 2 ms to minimize.
[2024-06-01 15:00:15] [INFO ] Deduced a trap composed of 76 places in 78 ms of which 1 ms to minimize.
[2024-06-01 15:00:16] [INFO ] Deduced a trap composed of 76 places in 75 ms of which 2 ms to minimize.
[2024-06-01 15:00:16] [INFO ] Deduced a trap composed of 76 places in 82 ms of which 2 ms to minimize.
[2024-06-01 15:00:16] [INFO ] Deduced a trap composed of 76 places in 52 ms of which 1 ms to minimize.
[2024-06-01 15:00:16] [INFO ] Deduced a trap composed of 76 places in 72 ms of which 1 ms to minimize.
[2024-06-01 15:00:16] [INFO ] Deduced a trap composed of 76 places in 49 ms of which 1 ms to minimize.
[2024-06-01 15:00:16] [INFO ] Deduced a trap composed of 343 places in 356 ms of which 4 ms to minimize.
[2024-06-01 15:00:17] [INFO ] Deduced a trap composed of 372 places in 381 ms of which 4 ms to minimize.
[2024-06-01 15:00:17] [INFO ] Deduced a trap composed of 146 places in 383 ms of which 4 ms to minimize.
[2024-06-01 15:00:18] [INFO ] Deduced a trap composed of 191 places in 375 ms of which 4 ms to minimize.
[2024-06-01 15:00:18] [INFO ] Deduced a trap composed of 26 places in 281 ms of which 2 ms to minimize.
[2024-06-01 15:00:18] [INFO ] Deduced a trap composed of 77 places in 53 ms of which 8 ms to minimize.
[2024-06-01 15:00:19] [INFO ] Deduced a trap composed of 47 places in 253 ms of which 3 ms to minimize.
[2024-06-01 15:00:19] [INFO ] Deduced a trap composed of 324 places in 328 ms of which 4 ms to minimize.
SMT process timed out in 28752ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 28770ms
Finished structural reductions in LTL mode , in 1 iterations and 28790 ms. Remains : 701/701 places, 1844/1844 transitions.
[2024-06-01 15:00:19] [INFO ] Flatten gal took : 66 ms
[2024-06-01 15:00:19] [INFO ] Flatten gal took : 73 ms
[2024-06-01 15:00:20] [INFO ] Input system was already deterministic with 1844 transitions.
Starting structural reductions in LTL mode, iteration 0 : 701/701 places, 1844/1844 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 693 transition count 1836
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 693 transition count 1836
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 685 transition count 1828
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 685 transition count 1828
Applied a total of 32 rules in 63 ms. Remains 685 /701 variables (removed 16) and now considering 1828/1844 (removed 16) transitions.
Running 1824 sub problems to find dead transitions.
[2024-06-01 15:00:20] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
// Phase 1: matrix 1796 rows 685 cols
[2024-06-01 15:00:20] [INFO ] Computed 43 invariants in 57 ms
[2024-06-01 15:00:20] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/681 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/681 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-06-01 15:00:46] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 2 ms to minimize.
[2024-06-01 15:00:47] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 1 ms to minimize.
[2024-06-01 15:00:47] [INFO ] Deduced a trap composed of 75 places in 78 ms of which 2 ms to minimize.
[2024-06-01 15:00:47] [INFO ] Deduced a trap composed of 75 places in 81 ms of which 2 ms to minimize.
[2024-06-01 15:00:47] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 1 ms to minimize.
[2024-06-01 15:00:47] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 0 ms to minimize.
[2024-06-01 15:00:47] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 1 ms to minimize.
[2024-06-01 15:00:47] [INFO ] Deduced a trap composed of 74 places in 77 ms of which 1 ms to minimize.
[2024-06-01 15:00:48] [INFO ] Deduced a trap composed of 19 places in 196 ms of which 3 ms to minimize.
[2024-06-01 15:00:49] [INFO ] Deduced a trap composed of 352 places in 484 ms of which 5 ms to minimize.
[2024-06-01 15:00:49] [INFO ] Deduced a trap composed of 411 places in 459 ms of which 5 ms to minimize.
[2024-06-01 15:00:50] [INFO ] Deduced a trap composed of 419 places in 495 ms of which 5 ms to minimize.
SMT process timed out in 30140ms, After SMT, problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 30177ms
Finished structural reductions in LTL mode , in 1 iterations and 30258 ms. Remains : 685/701 places, 1828/1844 transitions.
[2024-06-01 15:00:50] [INFO ] Flatten gal took : 64 ms
[2024-06-01 15:00:50] [INFO ] Flatten gal took : 65 ms
[2024-06-01 15:00:50] [INFO ] Input system was already deterministic with 1828 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 701/701 places, 1844/1844 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 701 transition count 1788
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 645 transition count 1788
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 88 Pre rules applied. Total rules applied 112 place count 645 transition count 1700
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 288 place count 557 transition count 1700
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 296 place count 549 transition count 1692
Iterating global reduction 2 with 8 rules applied. Total rules applied 304 place count 549 transition count 1692
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 432 place count 485 transition count 1628
Applied a total of 432 rules in 109 ms. Remains 485 /701 variables (removed 216) and now considering 1628/1844 (removed 216) transitions.
Running 1624 sub problems to find dead transitions.
[2024-06-01 15:00:50] [INFO ] Flow matrix only has 1596 transitions (discarded 32 similar events)
// Phase 1: matrix 1596 rows 485 cols
[2024-06-01 15:00:51] [INFO ] Computed 43 invariants in 59 ms
[2024-06-01 15:00:51] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1624 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 1624 unsolved
[2024-06-01 15:01:11] [INFO ] Deduced a trap composed of 167 places in 291 ms of which 3 ms to minimize.
[2024-06-01 15:01:11] [INFO ] Deduced a trap composed of 25 places in 186 ms of which 1 ms to minimize.
[2024-06-01 15:01:11] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 2 ms to minimize.
[2024-06-01 15:01:13] [INFO ] Deduced a trap composed of 44 places in 274 ms of which 3 ms to minimize.
[2024-06-01 15:01:14] [INFO ] Deduced a trap composed of 115 places in 286 ms of which 3 ms to minimize.
[2024-06-01 15:01:14] [INFO ] Deduced a trap composed of 79 places in 319 ms of which 3 ms to minimize.
[2024-06-01 15:01:17] [INFO ] Deduced a trap composed of 42 places in 277 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/2081 variables, and 45 constraints, problems are : Problem set: 0 solved, 1624 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 26/29 constraints, State Equation: 0/485 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1624/1624 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1624 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1624 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 1624 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 7/45 constraints. Problems are: Problem set: 0 solved, 1624 unsolved
[2024-06-01 15:01:22] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:01:22] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:01:23] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 2 ms to minimize.
[2024-06-01 15:01:23] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:01:25] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 0 ms to minimize.
[2024-06-01 15:01:25] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:01:27] [INFO ] Deduced a trap composed of 48 places in 97 ms of which 2 ms to minimize.
[2024-06-01 15:01:27] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/2081 variables, and 53 constraints, problems are : Problem set: 0 solved, 1624 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 26/29 constraints, State Equation: 0/485 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1624 constraints, Known Traps: 15/15 constraints]
After SMT, in 48971ms problems are : Problem set: 0 solved, 1624 unsolved
Search for dead transitions found 0 dead transitions in 48988ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 49101 ms. Remains : 485/701 places, 1628/1844 transitions.
[2024-06-01 15:01:39] [INFO ] Flatten gal took : 53 ms
[2024-06-01 15:01:40] [INFO ] Flatten gal took : 52 ms
[2024-06-01 15:01:40] [INFO ] Input system was already deterministic with 1628 transitions.
Starting structural reductions in LTL mode, iteration 0 : 701/701 places, 1844/1844 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 693 transition count 1836
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 693 transition count 1836
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 685 transition count 1828
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 685 transition count 1828
Applied a total of 32 rules in 31 ms. Remains 685 /701 variables (removed 16) and now considering 1828/1844 (removed 16) transitions.
Running 1824 sub problems to find dead transitions.
[2024-06-01 15:01:40] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
// Phase 1: matrix 1796 rows 685 cols
[2024-06-01 15:01:40] [INFO ] Computed 43 invariants in 43 ms
[2024-06-01 15:01:40] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/681 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/681 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-06-01 15:02:06] [INFO ] Deduced a trap composed of 74 places in 152 ms of which 2 ms to minimize.
[2024-06-01 15:02:06] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 1 ms to minimize.
[2024-06-01 15:02:06] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 0 ms to minimize.
[2024-06-01 15:02:06] [INFO ] Deduced a trap composed of 75 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:02:06] [INFO ] Deduced a trap composed of 74 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:02:06] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 1 ms to minimize.
[2024-06-01 15:02:07] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 0 ms to minimize.
[2024-06-01 15:02:07] [INFO ] Deduced a trap composed of 74 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:02:07] [INFO ] Deduced a trap composed of 19 places in 193 ms of which 2 ms to minimize.
[2024-06-01 15:02:08] [INFO ] Deduced a trap composed of 352 places in 431 ms of which 5 ms to minimize.
[2024-06-01 15:02:08] [INFO ] Deduced a trap composed of 411 places in 451 ms of which 4 ms to minimize.
[2024-06-01 15:02:09] [INFO ] Deduced a trap composed of 419 places in 367 ms of which 4 ms to minimize.
[2024-06-01 15:02:09] [INFO ] Deduced a trap composed of 54 places in 375 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 681/2481 variables, and 52 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/685 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/681 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/681 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/681 variables, 13/52 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-06-01 15:02:23] [INFO ] Deduced a trap composed of 59 places in 342 ms of which 4 ms to minimize.
[2024-06-01 15:02:24] [INFO ] Deduced a trap composed of 422 places in 402 ms of which 5 ms to minimize.
[2024-06-01 15:02:24] [INFO ] Deduced a trap composed of 410 places in 357 ms of which 3 ms to minimize.
[2024-06-01 15:02:25] [INFO ] Deduced a trap composed of 342 places in 351 ms of which 4 ms to minimize.
[2024-06-01 15:02:27] [INFO ] Deduced a trap composed of 325 places in 396 ms of which 5 ms to minimize.
[2024-06-01 15:02:27] [INFO ] Deduced a trap composed of 384 places in 311 ms of which 4 ms to minimize.
[2024-06-01 15:02:28] [INFO ] Deduced a trap composed of 385 places in 323 ms of which 3 ms to minimize.
[2024-06-01 15:02:30] [INFO ] Deduced a trap composed of 175 places in 325 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 681/2481 variables, and 60 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/685 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1824 constraints, Known Traps: 21/21 constraints]
After SMT, in 50107ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 50125ms
Finished structural reductions in LTL mode , in 1 iterations and 50161 ms. Remains : 685/701 places, 1828/1844 transitions.
[2024-06-01 15:02:30] [INFO ] Flatten gal took : 69 ms
[2024-06-01 15:02:30] [INFO ] Flatten gal took : 78 ms
[2024-06-01 15:02:30] [INFO ] Input system was already deterministic with 1828 transitions.
Starting structural reductions in LTL mode, iteration 0 : 701/701 places, 1844/1844 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 693 transition count 1836
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 693 transition count 1836
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 685 transition count 1828
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 685 transition count 1828
Applied a total of 32 rules in 32 ms. Remains 685 /701 variables (removed 16) and now considering 1828/1844 (removed 16) transitions.
Running 1824 sub problems to find dead transitions.
[2024-06-01 15:02:30] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-06-01 15:02:30] [INFO ] Invariant cache hit.
[2024-06-01 15:02:30] [INFO ] State equation strengthened by 160 read => feed constraints.
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : PolyORBLF-PT-S04J04T08-CTLFireability-2024-00
Could not compute solution for formula : PolyORBLF-PT-S04J04T08-CTLFireability-2024-01
Could not compute solution for formula : PolyORBLF-PT-S04J04T08-CTLFireability-2024-02
Could not compute solution for formula : PolyORBLF-PT-S04J04T08-CTLFireability-2024-03
Could not compute solution for formula : PolyORBLF-PT-S04J04T08-CTLFireability-2024-04
Could not compute solution for formula : PolyORBLF-PT-S04J04T08-CTLFireability-2024-05
Could not compute solution for formula : PolyORBLF-PT-S04J04T08-CTLFireability-2024-06
Could not compute solution for formula : PolyORBLF-PT-S04J04T08-CTLFireability-2024-07
Could not compute solution for formula : PolyORBLF-PT-S04J04T08-CTLFireability-2024-08
Could not compute solution for formula : PolyORBLF-PT-S04J04T08-CTLFireability-2024-09
Could not compute solution for formula : PolyORBLF-PT-S04J04T08-CTLFireability-2024-10
Could not compute solution for formula : PolyORBLF-PT-S04J04T08-CTLFireability-2024-11
Could not compute solution for formula : PolyORBLF-PT-S04J04T08-CTLFireability-2024-12
Could not compute solution for formula : PolyORBLF-PT-S04J04T08-CTLFireability-2024-13
Could not compute solution for formula : PolyORBLF-PT-S04J04T08-CTLFireability-2024-14
Could not compute solution for formula : PolyORBLF-PT-S04J04T08-CTLFireability-2024-15
BK_STOP 1717254158978
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name PolyORBLF-PT-S04J04T08-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/900/ctl_0_
ctl formula name PolyORBLF-PT-S04J04T08-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/900/ctl_1_
ctl formula name PolyORBLF-PT-S04J04T08-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/900/ctl_2_
ctl formula name PolyORBLF-PT-S04J04T08-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/900/ctl_3_
ctl formula name PolyORBLF-PT-S04J04T08-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/900/ctl_4_
ctl formula name PolyORBLF-PT-S04J04T08-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/900/ctl_5_
ctl formula name PolyORBLF-PT-S04J04T08-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/900/ctl_6_
ctl formula name PolyORBLF-PT-S04J04T08-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/900/ctl_7_
ctl formula name PolyORBLF-PT-S04J04T08-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/900/ctl_8_
ctl formula name PolyORBLF-PT-S04J04T08-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/900/ctl_9_
ctl formula name PolyORBLF-PT-S04J04T08-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/900/ctl_10_
ctl formula name PolyORBLF-PT-S04J04T08-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/900/ctl_11_
ctl formula name PolyORBLF-PT-S04J04T08-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/900/ctl_12_
ctl formula name PolyORBLF-PT-S04J04T08-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/900/ctl_13_
ctl formula name PolyORBLF-PT-S04J04T08-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/900/ctl_14_
ctl formula name PolyORBLF-PT-S04J04T08-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/900/ctl_15_
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-S04J04T08"
export BK_EXAMINATION="CTLFireability"
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-S04J04T08, examination is CTLFireability"
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-171654446700274"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S04J04T08.tgz
mv PolyORBLF-PT-S04J04T08 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;