Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654446900354.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-S06J06T08, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446900354
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 25K Apr 11 17:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 146K Apr 11 17:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 249K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.1M Apr 11 17:07 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 17K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 53K Apr 11 17:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 268K Apr 11 17:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 265K Apr 11 17:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.1M Apr 11 17:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.6K Apr 23 07:44 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 14M 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-S06J06T08-CTLFireability-2024-00
FORMULA_NAME PolyORBLF-PT-S06J06T08-CTLFireability-2024-01
FORMULA_NAME PolyORBLF-PT-S06J06T08-CTLFireability-2024-02
FORMULA_NAME PolyORBLF-PT-S06J06T08-CTLFireability-2024-03
FORMULA_NAME PolyORBLF-PT-S06J06T08-CTLFireability-2024-04
FORMULA_NAME PolyORBLF-PT-S06J06T08-CTLFireability-2024-05
FORMULA_NAME PolyORBLF-PT-S06J06T08-CTLFireability-2024-06
FORMULA_NAME PolyORBLF-PT-S06J06T08-CTLFireability-2024-07
FORMULA_NAME PolyORBLF-PT-S06J06T08-CTLFireability-2024-08
FORMULA_NAME PolyORBLF-PT-S06J06T08-CTLFireability-2024-09
FORMULA_NAME PolyORBLF-PT-S06J06T08-CTLFireability-2024-10
FORMULA_NAME PolyORBLF-PT-S06J06T08-CTLFireability-2024-11
FORMULA_NAME PolyORBLF-PT-S06J06T08-CTLFireability-2024-12
FORMULA_NAME PolyORBLF-PT-S06J06T08-CTLFireability-2024-13
FORMULA_NAME PolyORBLF-PT-S06J06T08-CTLFireability-2024-14
FORMULA_NAME PolyORBLF-PT-S06J06T08-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717256472194

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-S06J06T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:41:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 15:41:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:41:14] [INFO ] Load time of PNML (sax parser for PT used): 837 ms
[2024-06-01 15:41:14] [INFO ] Transformed 894 places.
[2024-06-01 15:41:14] [INFO ] Transformed 14334 transitions.
[2024-06-01 15:41:14] [INFO ] Parsed PT model containing 894 places and 14334 transitions and 119772 arcs in 1110 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 67 ms.
[2024-06-01 15:41:15] [INFO ] Reduced 9360 identical enabling conditions.
Ensure Unique test removed 10760 transitions
Reduce redundant transitions removed 10760 transitions.
Support contains 691 out of 894 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 894/894 places, 3574/3574 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 886 transition count 3566
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 886 transition count 3566
Applied a total of 16 rules in 224 ms. Remains 886 /894 variables (removed 8) and now considering 3566/3574 (removed 8) transitions.
Running 3560 sub problems to find dead transitions.
[2024-06-01 15:41:15] [INFO ] Flow matrix only has 3518 transitions (discarded 48 similar events)
// Phase 1: matrix 3518 rows 886 cols
[2024-06-01 15:41:16] [INFO ] Computed 62 invariants in 252 ms
[2024-06-01 15:41:16] [INFO ] State equation strengthened by 224 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/874 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3560 unsolved
SMT process timed out in 46619ms, After SMT, problems are : Problem set: 0 solved, 3560 unsolved
Search for dead transitions found 0 dead transitions in 46748ms
[2024-06-01 15:42:02] [INFO ] Flow matrix only has 3518 transitions (discarded 48 similar events)
[2024-06-01 15:42:02] [INFO ] Invariant cache hit.
[2024-06-01 15:42:02] [INFO ] Implicit Places using invariants in 465 ms returned []
[2024-06-01 15:42:02] [INFO ] Flow matrix only has 3518 transitions (discarded 48 similar events)
[2024-06-01 15:42:02] [INFO ] Invariant cache hit.
[2024-06-01 15:42:07] [INFO ] State equation strengthened by 224 read => feed constraints.
[2024-06-01 15:42:37] [INFO ] Performed 641/886 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 15:42:40] [INFO ] Implicit Places using invariants and state equation in 37914 ms returned []
Implicit Place search using SMT with State Equation took 38386 ms to find 0 implicit places.
Running 3560 sub problems to find dead transitions.
[2024-06-01 15:42:40] [INFO ] Flow matrix only has 3518 transitions (discarded 48 similar events)
[2024-06-01 15:42:40] [INFO ] Invariant cache hit.
[2024-06-01 15:42:40] [INFO ] State equation strengthened by 224 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/874 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3560 unsolved
SMT process timed out in 55374ms, After SMT, problems are : Problem set: 0 solved, 3560 unsolved
Search for dead transitions found 0 dead transitions in 55425ms
Starting structural reductions in LTL mode, iteration 1 : 886/894 places, 3566/3574 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140913 ms. Remains : 886/894 places, 3566/3574 transitions.
Support contains 691 out of 886 places after structural reductions.
[2024-06-01 15:43:37] [INFO ] Flatten gal took : 605 ms
[2024-06-01 15:43:37] [INFO ] Flatten gal took : 205 ms
[2024-06-01 15:43:38] [INFO ] Input system was already deterministic with 3566 transitions.
RANDOM walk for 40000 steps (218 resets) in 4784 ms. (8 steps per ms) remains 40/84 properties
BEST_FIRST walk for 4002 steps (8 resets) in 267 ms. (14 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (22 resets) in 138 ms. (28 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (16 resets) in 78 ms. (50 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (8 resets) in 791 ms. (5 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (11 resets) in 68 ms. (58 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 77 ms. (51 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (14 resets) in 47 ms. (83 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 39/39 properties
[2024-06-01 15:43:41] [INFO ] Flow matrix only has 3518 transitions (discarded 48 similar events)
[2024-06-01 15:43:41] [INFO ] Invariant cache hit.
[2024-06-01 15:43:41] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp76 is UNSAT
At refinement iteration 1 (OVERLAPS) 312/566 variables, 16/16 constraints. Problems are: Problem set: 13 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 9/25 constraints. Problems are: Problem set: 13 solved, 26 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/566 variables, 0/25 constraints. Problems are: Problem set: 13 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 12/578 variables, 3/28 constraints. Problems are: Problem set: 13 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 0/28 constraints. Problems are: Problem set: 13 solved, 26 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp81 is UNSAT
At refinement iteration 6 (OVERLAPS) 292/870 variables, 23/51 constraints. Problems are: Problem set: 30 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/870 variables, 0/51 constraints. Problems are: Problem set: 30 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1/871 variables, 1/52 constraints. Problems are: Problem set: 30 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/871 variables, 0/52 constraints. Problems are: Problem set: 30 solved, 9 unsolved
Problem AtomicPropp20 is UNSAT
At refinement iteration 10 (OVERLAPS) 13/884 variables, 9/61 constraints. Problems are: Problem set: 31 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/884 variables, 0/61 constraints. Problems are: Problem set: 31 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4402/4404 variables, and 945 constraints, problems are : Problem set: 31 solved, 8 unsolved in 5031 ms.
Refiners :[Positive P Invariants (semi-flows): 20/21 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 884/886 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 39/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 31 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 31 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 148/176 variables, 6/6 constraints. Problems are: Problem set: 31 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/6 constraints. Problems are: Problem set: 31 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 15/191 variables, 3/9 constraints. Problems are: Problem set: 31 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/9 constraints. Problems are: Problem set: 31 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 105/296 variables, 3/12 constraints. Problems are: Problem set: 31 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 0/12 constraints. Problems are: Problem set: 31 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 553/849 variables, 21/33 constraints. Problems are: Problem set: 31 solved, 8 unsolved
[2024-06-01 15:43:52] [INFO ] Deduced a trap composed of 93 places in 429 ms of which 29 ms to minimize.
[2024-06-01 15:43:52] [INFO ] Deduced a trap composed of 93 places in 267 ms of which 3 ms to minimize.
[2024-06-01 15:43:52] [INFO ] Deduced a trap composed of 92 places in 225 ms of which 5 ms to minimize.
[2024-06-01 15:43:53] [INFO ] Deduced a trap composed of 94 places in 149 ms of which 3 ms to minimize.
[2024-06-01 15:43:53] [INFO ] Deduced a trap composed of 94 places in 141 ms of which 1 ms to minimize.
[2024-06-01 15:43:53] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 1 ms to minimize.
[2024-06-01 15:43:53] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/849 variables, 7/40 constraints. Problems are: Problem set: 31 solved, 8 unsolved
[2024-06-01 15:43:54] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 2 ms to minimize.
[2024-06-01 15:43:54] [INFO ] Deduced a trap composed of 92 places in 83 ms of which 2 ms to minimize.
[2024-06-01 15:43:54] [INFO ] Deduced a trap composed of 93 places in 79 ms of which 1 ms to minimize.
[2024-06-01 15:43:54] [INFO ] Deduced a trap composed of 93 places in 74 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/849 variables, 4/44 constraints. Problems are: Problem set: 31 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/849 variables, 0/44 constraints. Problems are: Problem set: 31 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 11/860 variables, 8/52 constraints. Problems are: Problem set: 31 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/860 variables, 0/52 constraints. Problems are: Problem set: 31 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 24/884 variables, 20/72 constraints. Problems are: Problem set: 31 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/884 variables, 0/72 constraints. Problems are: Problem set: 31 solved, 8 unsolved
SMT process timed out in 14708ms, After SMT, problems are : Problem set: 31 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 28 out of 886 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 886/886 places, 3566/3566 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 880 transition count 3526
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 86 place count 840 transition count 3526
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 86 place count 840 transition count 3414
Deduced a syphon composed of 112 places in 2 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 310 place count 728 transition count 3414
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 2 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 486 place count 640 transition count 3326
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 2 with 19 rules applied. Total rules applied 505 place count 640 transition count 3307
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 524 place count 621 transition count 3307
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 532 place count 621 transition count 3307
Applied a total of 532 rules in 740 ms. Remains 621 /886 variables (removed 265) and now considering 3307/3566 (removed 259) transitions.
Running 3301 sub problems to find dead transitions.
[2024-06-01 15:43:56] [INFO ] Flow matrix only has 3259 transitions (discarded 48 similar events)
// Phase 1: matrix 3259 rows 621 cols
[2024-06-01 15:43:57] [INFO ] Computed 56 invariants in 152 ms
[2024-06-01 15:43:57] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 3301 unsolved
SMT process timed out in 54405ms, After SMT, problems are : Problem set: 0 solved, 3301 unsolved
Search for dead transitions found 0 dead transitions in 54456ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55208 ms. Remains : 621/886 places, 3307/3566 transitions.
RANDOM walk for 40000 steps (412 resets) in 1433 ms. (27 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40002 steps (94 resets) in 463 ms. (86 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 400 ms. (99 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (48 resets) in 298 ms. (133 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (51 resets) in 294 ms. (135 steps per ms) remains 3/3 properties
[2024-06-01 15:44:52] [INFO ] Flow matrix only has 3259 transitions (discarded 48 similar events)
[2024-06-01 15:44:52] [INFO ] Invariant cache hit.
[2024-06-01 15:44:52] [INFO ] State equation strengthened by 224 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 66/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 30/107 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 125/232 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 358/590 variables, 19/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 15:44:52] [INFO ] Deduced a trap composed of 60 places in 306 ms of which 2 ms to minimize.
[2024-06-01 15:44:53] [INFO ] Deduced a trap composed of 60 places in 235 ms of which 2 ms to minimize.
[2024-06-01 15:44:53] [INFO ] Deduced a trap composed of 61 places in 204 ms of which 2 ms to minimize.
[2024-06-01 15:44:53] [INFO ] Deduced a trap composed of 60 places in 162 ms of which 1 ms to minimize.
[2024-06-01 15:44:53] [INFO ] Deduced a trap composed of 60 places in 136 ms of which 2 ms to minimize.
[2024-06-01 15:44:53] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 1 ms to minimize.
[2024-06-01 15:44:53] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/590 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/590 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 8/598 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/598 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 21/619 variables, 17/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/619 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 3259/3878 variables, 619/681 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3878 variables, 224/905 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3878 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/3880 variables, 2/907 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3880 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3880 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/3880 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3880/3880 variables, and 908 constraints, problems are : Problem set: 0 solved, 3 unsolved in 29491 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 621/621 constraints, ReadFeed: 224/224 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 66/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 30/107 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 125/232 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 358/590 variables, 19/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/590 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 15:45:22] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/590 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/590 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 8/598 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/598 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 21/619 variables, 17/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/619 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 3259/3878 variables, 619/682 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3878 variables, 224/906 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3878 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/3880 variables, 2/908 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3880 variables, 1/909 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 15:45:42] [INFO ] Deduced a trap composed of 19 places in 653 ms of which 4 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/3880 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3880 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/3880 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3880/3880 variables, and 910 constraints, problems are : Problem set: 0 solved, 3 unsolved in 26830 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 621/621 constraints, ReadFeed: 224/224 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 9/9 constraints]
After SMT, in 56395ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1172 ms.
Support contains 11 out of 621 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 621/621 places, 3307/3307 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 621 transition count 3299
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 613 transition count 3299
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 48 place count 597 transition count 3283
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 49 place count 597 transition count 3282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 50 place count 596 transition count 3282
Applied a total of 50 rules in 287 ms. Remains 596 /621 variables (removed 25) and now considering 3282/3307 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 289 ms. Remains : 596/621 places, 3282/3307 transitions.
Successfully simplified 31 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBLF-PT-S06J06T08-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T08-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T08-CTLFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:45:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 15:45:50] [INFO ] Flatten gal took : 148 ms
FORMULA PolyORBLF-PT-S06J06T08-CTLFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:45:50] [INFO ] Flatten gal took : 174 ms
[2024-06-01 15:45:51] [INFO ] Input system was already deterministic with 3566 transitions.
Support contains 662 out of 886 places (down from 663) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 886/886 places, 3566/3566 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 880 transition count 3566
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 14 place count 872 transition count 3558
Iterating global reduction 1 with 8 rules applied. Total rules applied 22 place count 872 transition count 3558
Applied a total of 22 rules in 146 ms. Remains 872 /886 variables (removed 14) and now considering 3558/3566 (removed 8) transitions.
Running 3552 sub problems to find dead transitions.
[2024-06-01 15:45:51] [INFO ] Flow matrix only has 3510 transitions (discarded 48 similar events)
// Phase 1: matrix 3510 rows 872 cols
[2024-06-01 15:45:51] [INFO ] Computed 56 invariants in 90 ms
[2024-06-01 15:45:51] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/866 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 3552 unsolved
SMT process timed out in 49163ms, After SMT, problems are : Problem set: 0 solved, 3552 unsolved
Search for dead transitions found 0 dead transitions in 49212ms
Finished structural reductions in LTL mode , in 1 iterations and 49371 ms. Remains : 872/886 places, 3558/3566 transitions.
[2024-06-01 15:46:40] [INFO ] Flatten gal took : 131 ms
[2024-06-01 15:46:40] [INFO ] Flatten gal took : 131 ms
[2024-06-01 15:46:41] [INFO ] Input system was already deterministic with 3558 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 886/886 places, 3566/3566 transitions.
Ensure Unique test removed 6 places
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 880 transition count 3510
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 824 transition count 3510
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 112 place count 824 transition count 3502
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 128 place count 816 transition count 3502
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 2 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 320 place count 720 transition count 3406
Applied a total of 320 rules in 299 ms. Remains 720 /886 variables (removed 166) and now considering 3406/3566 (removed 160) transitions.
Running 3400 sub problems to find dead transitions.
[2024-06-01 15:46:41] [INFO ] Flow matrix only has 3358 transitions (discarded 48 similar events)
// Phase 1: matrix 3358 rows 720 cols
[2024-06-01 15:46:41] [INFO ] Computed 56 invariants in 57 ms
[2024-06-01 15:46:41] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/714 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 3400 unsolved
SMT process timed out in 49721ms, After SMT, problems are : Problem set: 0 solved, 3400 unsolved
Search for dead transitions found 0 dead transitions in 49752ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 50071 ms. Remains : 720/886 places, 3406/3566 transitions.
[2024-06-01 15:47:31] [INFO ] Flatten gal took : 152 ms
[2024-06-01 15:47:31] [INFO ] Flatten gal took : 212 ms
[2024-06-01 15:47:31] [INFO ] Input system was already deterministic with 3406 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 886/886 places, 3566/3566 transitions.
Ensure Unique test removed 6 places
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 880 transition count 3542
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 856 transition count 3542
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 48 place count 856 transition count 3430
Deduced a syphon composed of 112 places in 2 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 272 place count 744 transition count 3430
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 2 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 464 place count 648 transition count 3334
Applied a total of 464 rules in 244 ms. Remains 648 /886 variables (removed 238) and now considering 3334/3566 (removed 232) transitions.
Running 3328 sub problems to find dead transitions.
[2024-06-01 15:47:32] [INFO ] Flow matrix only has 3286 transitions (discarded 48 similar events)
// Phase 1: matrix 3286 rows 648 cols
[2024-06-01 15:47:32] [INFO ] Computed 56 invariants in 81 ms
[2024-06-01 15:47:32] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3328 unsolved
SMT process timed out in 47266ms, After SMT, problems are : Problem set: 0 solved, 3328 unsolved
Search for dead transitions found 0 dead transitions in 47305ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 47560 ms. Remains : 648/886 places, 3334/3566 transitions.
[2024-06-01 15:48:19] [INFO ] Flatten gal took : 240 ms
[2024-06-01 15:48:20] [INFO ] Flatten gal took : 226 ms
[2024-06-01 15:48:20] [INFO ] Input system was already deterministic with 3334 transitions.
Starting structural reductions in LTL mode, iteration 0 : 886/886 places, 3566/3566 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 880 transition count 3566
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 14 place count 872 transition count 3558
Iterating global reduction 1 with 8 rules applied. Total rules applied 22 place count 872 transition count 3558
Applied a total of 22 rules in 83 ms. Remains 872 /886 variables (removed 14) and now considering 3558/3566 (removed 8) transitions.
Running 3552 sub problems to find dead transitions.
[2024-06-01 15:48:20] [INFO ] Flow matrix only has 3510 transitions (discarded 48 similar events)
// Phase 1: matrix 3510 rows 872 cols
[2024-06-01 15:48:20] [INFO ] Computed 56 invariants in 207 ms
[2024-06-01 15:48:20] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/866 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 3552 unsolved
SMT process timed out in 47979ms, After SMT, problems are : Problem set: 0 solved, 3552 unsolved
Search for dead transitions found 0 dead transitions in 48010ms
Finished structural reductions in LTL mode , in 1 iterations and 48101 ms. Remains : 872/886 places, 3558/3566 transitions.
[2024-06-01 15:49:08] [INFO ] Flatten gal took : 114 ms
[2024-06-01 15:49:08] [INFO ] Flatten gal took : 127 ms
[2024-06-01 15:49:09] [INFO ] Input system was already deterministic with 3558 transitions.
Starting structural reductions in LTL mode, iteration 0 : 886/886 places, 3566/3566 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 880 transition count 3566
Applied a total of 6 rules in 74 ms. Remains 880 /886 variables (removed 6) and now considering 3566/3566 (removed 0) transitions.
Running 3560 sub problems to find dead transitions.
[2024-06-01 15:49:09] [INFO ] Flow matrix only has 3518 transitions (discarded 48 similar events)
// Phase 1: matrix 3518 rows 880 cols
[2024-06-01 15:49:09] [INFO ] Computed 56 invariants in 111 ms
[2024-06-01 15:49:09] [INFO ] State equation strengthened by 224 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/874 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3560 unsolved
SMT process timed out in 50356ms, After SMT, problems are : Problem set: 0 solved, 3560 unsolved
Search for dead transitions found 0 dead transitions in 50403ms
Finished structural reductions in LTL mode , in 1 iterations and 50489 ms. Remains : 880/886 places, 3566/3566 transitions.
[2024-06-01 15:49:59] [INFO ] Flatten gal took : 111 ms
[2024-06-01 15:49:59] [INFO ] Flatten gal took : 126 ms
[2024-06-01 15:50:00] [INFO ] Input system was already deterministic with 3566 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 886/886 places, 3566/3566 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 880 transition count 3526
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 80 place count 840 transition count 3526
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 80 place count 840 transition count 3462
Deduced a syphon composed of 64 places in 3 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 208 place count 776 transition count 3462
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 288 place count 736 transition count 3422
Applied a total of 288 rules in 304 ms. Remains 736 /886 variables (removed 150) and now considering 3422/3566 (removed 144) transitions.
Running 3416 sub problems to find dead transitions.
[2024-06-01 15:50:00] [INFO ] Flow matrix only has 3374 transitions (discarded 48 similar events)
// Phase 1: matrix 3374 rows 736 cols
[2024-06-01 15:50:00] [INFO ] Computed 56 invariants in 105 ms
[2024-06-01 15:50:00] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/730 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3416 unsolved
SMT process timed out in 53597ms, After SMT, problems are : Problem set: 0 solved, 3416 unsolved
Search for dead transitions found 0 dead transitions in 53648ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 53965 ms. Remains : 736/886 places, 3422/3566 transitions.
[2024-06-01 15:50:54] [INFO ] Flatten gal took : 158 ms
[2024-06-01 15:50:54] [INFO ] Flatten gal took : 179 ms
[2024-06-01 15:50:54] [INFO ] Input system was already deterministic with 3422 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 886/886 places, 3566/3566 transitions.
Ensure Unique test removed 6 places
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 880 transition count 3510
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 824 transition count 3510
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 112 place count 824 transition count 3398
Deduced a syphon composed of 112 places in 3 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 336 place count 712 transition count 3398
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 448 place count 656 transition count 3342
Applied a total of 448 rules in 231 ms. Remains 656 /886 variables (removed 230) and now considering 3342/3566 (removed 224) transitions.
Running 3336 sub problems to find dead transitions.
[2024-06-01 15:50:55] [INFO ] Flow matrix only has 3294 transitions (discarded 48 similar events)
// Phase 1: matrix 3294 rows 656 cols
[2024-06-01 15:50:55] [INFO ] Computed 56 invariants in 124 ms
[2024-06-01 15:50:55] [INFO ] State equation strengthened by 224 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 4.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 1.0)
(s33 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/650 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 3336 unsolved
SMT process timed out in 51867ms, After SMT, problems are : Problem set: 0 solved, 3336 unsolved
Search for dead transitions found 0 dead transitions in 51898ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 52136 ms. Remains : 656/886 places, 3342/3566 transitions.
[2024-06-01 15:51:47] [INFO ] Flatten gal took : 140 ms
[2024-06-01 15:51:47] [INFO ] Flatten gal took : 156 ms
[2024-06-01 15:51:47] [INFO ] Input system was already deterministic with 3342 transitions.
RANDOM walk for 385 steps (5 resets) in 19 ms. (19 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-PT-S06J06T08-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 886/886 places, 3566/3566 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 878 transition count 3558
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 878 transition count 3558
Applied a total of 16 rules in 61 ms. Remains 878 /886 variables (removed 8) and now considering 3558/3566 (removed 8) transitions.
Running 3552 sub problems to find dead transitions.
[2024-06-01 15:51:47] [INFO ] Flow matrix only has 3510 transitions (discarded 48 similar events)
// Phase 1: matrix 3510 rows 878 cols
[2024-06-01 15:51:48] [INFO ] Computed 62 invariants in 145 ms
[2024-06-01 15:51:48] [INFO ] State equation strengthened by 224 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 4.0)
(s21 0.0)
(s22 0.0)
(s24 0.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 2.0)
(s58 1.0)
(s59 0.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 3.0)
(s73 1.0)
(s74 1.0)
(s75 0.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 2.0)
(s87 1.0)
(s88 1.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 1.0)
(s93 1.0)
(s94 0.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 0.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 4.0)
(s128 1.0)
(s129 0.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 0.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 0.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 0.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 0.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 0.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 0.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 0.0)
(s226 1.0)
(s227 1.0)
(s228 0.0)
(s229 1.0)
(s230 1.0)
(s231 0.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 3.0)
(s238 1.0)
(s239 1.0)
(s240 0.0)
(s241 4.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 0.0)
(s248 1.0)
(s249 1.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 1.0)
(s255 4.0)
(s256 0.0)
(s257 1.0)
(s258 1.0)
(s259 0.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 0.0)
(s268 1.0)
(s269 1.0)
(s270 0.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 4.0)
(s277 1.0)
(s278 1.0)
(s280 1.0)
(s281 1.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 2.0)
(s286 0.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 0.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 0.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 0.0)
(s307 9.0)
(s308 1.0)
(s309 0.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 1.0)
(s322 1.0)
(s323 0.0)
(s324 1.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 0.0)
(s335 0.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 0.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 0.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 1.0)
(s361 0.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 0.0)
(s367 1.0)
(s368 0.0)
(s369 4.0)
(s370 0.0)
(s371 1.0)
(s372 0.0)
(s373 1.0)
(s374 1.0)
(s375 3.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 0.0)
(s382 1.0)
(s383 1.0)
(s384 0.0)
(s385 1.0)
(s386 2.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 0.0)
(s391 1.0)
(s392 0.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 0.0)
(s397 1.0)
(s398 9.0)
(s399 1.0)
(s400 0.0)
(s402 1.0)
(s403 1.0)
(s404 0.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 0.0)
(s410 0.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 0.0)
(s418 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/866 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 3552 unsolved
SMT process timed out in 53112ms, After SMT, problems are : Problem set: 0 solved, 3552 unsolved
Search for dead transitions found 0 dead transitions in 53160ms
Finished structural reductions in LTL mode , in 1 iterations and 53233 ms. Remains : 878/886 places, 3558/3566 transitions.
[2024-06-01 15:52:41] [INFO ] Flatten gal took : 129 ms
[2024-06-01 15:52:41] [INFO ] Flatten gal took : 148 ms
[2024-06-01 15:52:41] [INFO ] Input system was already deterministic with 3558 transitions.
Starting structural reductions in LTL mode, iteration 0 : 886/886 places, 3566/3566 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 880 transition count 3566
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 14 place count 872 transition count 3558
Iterating global reduction 1 with 8 rules applied. Total rules applied 22 place count 872 transition count 3558
Applied a total of 22 rules in 83 ms. Remains 872 /886 variables (removed 14) and now considering 3558/3566 (removed 8) transitions.
Running 3552 sub problems to find dead transitions.
[2024-06-01 15:52:41] [INFO ] Flow matrix only has 3510 transitions (discarded 48 similar events)
// Phase 1: matrix 3510 rows 872 cols
[2024-06-01 15:52:41] [INFO ] Computed 56 invariants in 133 ms
[2024-06-01 15:52:41] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/866 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 3552 unsolved
SMT process timed out in 53141ms, After SMT, problems are : Problem set: 0 solved, 3552 unsolved
Search for dead transitions found 0 dead transitions in 53186ms
Finished structural reductions in LTL mode , in 1 iterations and 53280 ms. Remains : 872/886 places, 3558/3566 transitions.
[2024-06-01 15:53:35] [INFO ] Flatten gal took : 122 ms
[2024-06-01 15:53:35] [INFO ] Flatten gal took : 139 ms
[2024-06-01 15:53:35] [INFO ] Input system was already deterministic with 3558 transitions.
Starting structural reductions in LTL mode, iteration 0 : 886/886 places, 3566/3566 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 880 transition count 3566
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 14 place count 872 transition count 3558
Iterating global reduction 1 with 8 rules applied. Total rules applied 22 place count 872 transition count 3558
Applied a total of 22 rules in 85 ms. Remains 872 /886 variables (removed 14) and now considering 3558/3566 (removed 8) transitions.
Running 3552 sub problems to find dead transitions.
[2024-06-01 15:53:35] [INFO ] Flow matrix only has 3510 transitions (discarded 48 similar events)
[2024-06-01 15:53:35] [INFO ] Invariant cache hit.
[2024-06-01 15:53:35] [INFO ] State equation strengthened by 224 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/866 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 3552 unsolved
SMT process timed out in 53182ms, After SMT, problems are : Problem set: 0 solved, 3552 unsolved
Search for dead transitions found 0 dead transitions in 53226ms
Finished structural reductions in LTL mode , in 1 iterations and 53322 ms. Remains : 872/886 places, 3558/3566 transitions.
[2024-06-01 15:54:28] [INFO ] Flatten gal took : 141 ms
[2024-06-01 15:54:29] [INFO ] Flatten gal took : 150 ms
[2024-06-01 15:54:29] [INFO ] Input system was already deterministic with 3558 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 886/886 places, 3566/3566 transitions.
Ensure Unique test removed 6 places
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 880 transition count 3510
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 824 transition count 3510
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 112 place count 824 transition count 3399
Deduced a syphon composed of 111 places in 2 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 334 place count 713 transition count 3399
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 536 place count 612 transition count 3298
Applied a total of 536 rules in 216 ms. Remains 612 /886 variables (removed 274) and now considering 3298/3566 (removed 268) transitions.
Running 3292 sub problems to find dead transitions.
[2024-06-01 15:54:29] [INFO ] Flow matrix only has 3250 transitions (discarded 48 similar events)
// Phase 1: matrix 3250 rows 612 cols
[2024-06-01 15:54:30] [INFO ] Computed 56 invariants in 123 ms
[2024-06-01 15:54:30] [INFO ] State equation strengthened by 224 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 3292 unsolved
SMT process timed out in 51543ms, After SMT, problems are : Problem set: 0 solved, 3292 unsolved
Search for dead transitions found 0 dead transitions in 51582ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 51807 ms. Remains : 612/886 places, 3298/3566 transitions.
[2024-06-01 15:55:21] [INFO ] Flatten gal took : 127 ms
[2024-06-01 15:55:21] [INFO ] Flatten gal took : 159 ms
[2024-06-01 15:55:22] [INFO ] Input system was already deterministic with 3298 transitions.
Starting structural reductions in LTL mode, iteration 0 : 886/886 places, 3566/3566 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 880 transition count 3566
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 14 place count 872 transition count 3558
Iterating global reduction 1 with 8 rules applied. Total rules applied 22 place count 872 transition count 3558
Applied a total of 22 rules in 85 ms. Remains 872 /886 variables (removed 14) and now considering 3558/3566 (removed 8) transitions.
Running 3552 sub problems to find dead transitions.
[2024-06-01 15:55:22] [INFO ] Flow matrix only has 3510 transitions (discarded 48 similar events)
// Phase 1: matrix 3510 rows 872 cols
[2024-06-01 15:55:22] [INFO ] Computed 56 invariants in 70 ms
[2024-06-01 15:55:22] [INFO ] State equation strengthened by 224 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/866 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 3552 unsolved
SMT process timed out in 48672ms, After SMT, problems are : Problem set: 0 solved, 3552 unsolved
Search for dead transitions found 0 dead transitions in 48719ms
Finished structural reductions in LTL mode , in 1 iterations and 48815 ms. Remains : 872/886 places, 3558/3566 transitions.
[2024-06-01 15:56:10] [INFO ] Flatten gal took : 106 ms
[2024-06-01 15:56:11] [INFO ] Flatten gal took : 195 ms
[2024-06-01 15:56:11] [INFO ] Input system was already deterministic with 3558 transitions.
[2024-06-01 15:56:11] [INFO ] Flatten gal took : 125 ms
[2024-06-01 15:56:11] [INFO ] Flatten gal took : 125 ms
[2024-06-01 15:56:11] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLFireability.sr.xml took 12 ms.
[2024-06-01 15:56:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 886 places, 3566 transitions and 21236 arcs took 20 ms.
Total runtime 898133 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PolyORBLF-PT-S06J06T08-CTLFireability-2024-00
Could not compute solution for formula : PolyORBLF-PT-S06J06T08-CTLFireability-2024-01
Could not compute solution for formula : PolyORBLF-PT-S06J06T08-CTLFireability-2024-02
Could not compute solution for formula : PolyORBLF-PT-S06J06T08-CTLFireability-2024-03
Could not compute solution for formula : PolyORBLF-PT-S06J06T08-CTLFireability-2024-04
Could not compute solution for formula : PolyORBLF-PT-S06J06T08-CTLFireability-2024-05
Could not compute solution for formula : PolyORBLF-PT-S06J06T08-CTLFireability-2024-07
Could not compute solution for formula : PolyORBLF-PT-S06J06T08-CTLFireability-2024-09
Could not compute solution for formula : PolyORBLF-PT-S06J06T08-CTLFireability-2024-10
Could not compute solution for formula : PolyORBLF-PT-S06J06T08-CTLFireability-2024-12
Could not compute solution for formula : PolyORBLF-PT-S06J06T08-CTLFireability-2024-15

BK_STOP 1717257372327

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name PolyORBLF-PT-S06J06T08-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/741/ctl_0_
ctl formula name PolyORBLF-PT-S06J06T08-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/741/ctl_1_
ctl formula name PolyORBLF-PT-S06J06T08-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/741/ctl_2_
ctl formula name PolyORBLF-PT-S06J06T08-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/741/ctl_3_
ctl formula name PolyORBLF-PT-S06J06T08-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/741/ctl_4_
ctl formula name PolyORBLF-PT-S06J06T08-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/741/ctl_5_
ctl formula name PolyORBLF-PT-S06J06T08-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/741/ctl_6_
ctl formula name PolyORBLF-PT-S06J06T08-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/741/ctl_7_
ctl formula name PolyORBLF-PT-S06J06T08-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/741/ctl_8_
ctl formula name PolyORBLF-PT-S06J06T08-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/741/ctl_9_
ctl formula name PolyORBLF-PT-S06J06T08-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/741/ctl_10_
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-S06J06T08"
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-S06J06T08, 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-171654446900354"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S06J06T08.tgz
mv PolyORBLF-PT-S06J06T08 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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;