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-171654447200482.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 PolyORBNT-PT-S10J20, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654447200482
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 24M
-rw-r--r-- 1 mcc users 23K Apr 12 11:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 12 11:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 958K Apr 12 11:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.6M Apr 12 11:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.6K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 32K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 114K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 31K Apr 12 14:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Apr 12 14:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Apr 12 13:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.7M Apr 12 13:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K 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 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 13M 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 PolyORBNT-PT-S10J20-CTLFireability-2024-00
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-2024-01
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-2024-02
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-2024-03
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-2024-04
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-2024-05
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-2024-06
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-2024-07
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-2024-08
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-2024-09
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-2024-10
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-2024-11
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-2024-12
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-2024-13
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-2024-14
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717260911028

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:55:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 16:55:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:55:12] [INFO ] Load time of PNML (sax parser for PT used): 530 ms
[2024-06-01 16:55:13] [INFO ] Transformed 474 places.
[2024-06-01 16:55:13] [INFO ] Transformed 11760 transitions.
[2024-06-01 16:55:13] [INFO ] Parsed PT model containing 474 places and 11760 transitions and 111119 arcs in 754 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 107 ms.
[2024-06-01 16:55:13] [INFO ] Reduced 9285 identical enabling conditions.
[2024-06-01 16:55:13] [INFO ] Reduced 9285 identical enabling conditions.
[2024-06-01 16:55:13] [INFO ] Reduced 9285 identical enabling conditions.
[2024-06-01 16:55:13] [INFO ] Reduced 45 identical enabling conditions.
[2024-06-01 16:55:13] [INFO ] Reduced 780 identical enabling conditions.
[2024-06-01 16:55:13] [INFO ] Reduced 9285 identical enabling conditions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 177 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Applied a total of 0 rules in 68 ms. Remains 474 /474 variables (removed 0) and now considering 1650/1650 (removed 0) transitions.
Running 1639 sub problems to find dead transitions.
[2024-06-01 16:55:13] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2024-06-01 16:55:13] [INFO ] Computed 72 invariants in 65 ms
[2024-06-01 16:55:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 453/2115 variables, and 51 constraints, problems are : Problem set: 0 solved, 1639 unsolved in 20089 ms.
Refiners :[Positive P Invariants (semi-flows): 43/45 constraints, Generalized P Invariants (flows): 8/27 constraints, State Equation: 0/474 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1639/639 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1639 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-06-01 16:55:56] [INFO ] Deduced a trap composed of 70 places in 492 ms of which 27 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 453/2115 variables, and 52 constraints, problems are : Problem set: 0 solved, 1639 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 43/45 constraints, Generalized P Invariants (flows): 8/27 constraints, State Equation: 0/474 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/639 constraints, Known Traps: 1/1 constraints]
After SMT, in 56346ms problems are : Problem set: 0 solved, 1639 unsolved
Search for dead transitions found 0 dead transitions in 56429ms
[2024-06-01 16:56:10] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
[2024-06-01 16:56:10] [INFO ] Invariant cache hit.
[2024-06-01 16:56:10] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-06-01 16:56:10] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
[2024-06-01 16:56:10] [INFO ] Invariant cache hit.
[2024-06-01 16:56:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:56:12] [INFO ] Implicit Places using invariants and state equation in 2188 ms returned []
Implicit Place search using SMT with State Equation took 2448 ms to find 0 implicit places.
Running 1639 sub problems to find dead transitions.
[2024-06-01 16:56:12] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
[2024-06-01 16:56:12] [INFO ] Invariant cache hit.
[2024-06-01 16:56:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
Problem TDEAD230 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1375 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1645 is UNSAT
At refinement iteration 3 (OVERLAPS) 2/455 variables, 2/53 constraints. Problems are: Problem set: 66 solved, 1573 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/2115 variables, and 53 constraints, problems are : Problem set: 66 solved, 1573 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 8/27 constraints, State Equation: 0/474 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1639/639 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 66 solved, 1573 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 43/43 constraints. Problems are: Problem set: 66 solved, 1573 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 8/51 constraints. Problems are: Problem set: 66 solved, 1573 unsolved
[2024-06-01 16:57:05] [INFO ] Deduced a trap composed of 19 places in 416 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 1/52 constraints. Problems are: Problem set: 66 solved, 1573 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/453 variables, 0/52 constraints. Problems are: Problem set: 66 solved, 1573 unsolved
At refinement iteration 4 (OVERLAPS) 2/455 variables, 2/54 constraints. Problems are: Problem set: 66 solved, 1573 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/2115 variables, and 54 constraints, problems are : Problem set: 66 solved, 1573 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 8/27 constraints, State Equation: 0/474 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 934/639 constraints, Known Traps: 1/1 constraints]
After SMT, in 77090ms problems are : Problem set: 66 solved, 1573 unsolved
Search for dead transitions found 66 dead transitions in 77126ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in LTL mode, iteration 1 : 474/474 places, 1584/1650 transitions.
Applied a total of 0 rules in 26 ms. Remains 474 /474 variables (removed 0) and now considering 1584/1584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 136191 ms. Remains : 474/474 places, 1584/1650 transitions.
Support contains 177 out of 474 places after structural reductions.
[2024-06-01 16:57:30] [INFO ] Flatten gal took : 300 ms
[2024-06-01 16:57:31] [INFO ] Flatten gal took : 206 ms
[2024-06-01 16:57:31] [INFO ] Input system was already deterministic with 1584 transitions.
Support contains 174 out of 474 places (down from 177) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 75 to 74
RANDOM walk for 40000 steps (2240 resets) in 13714 ms. (2 steps per ms) remains 63/74 properties
BEST_FIRST walk for 4003 steps (40 resets) in 364 ms. (10 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (41 resets) in 338 ms. (11 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (41 resets) in 244 ms. (16 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (40 resets) in 261 ms. (15 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4001 steps (39 resets) in 438 ms. (9 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 604 ms. (6 steps per ms) remains 54/63 properties
BEST_FIRST walk for 4002 steps (40 resets) in 146 ms. (27 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (40 resets) in 93 ms. (42 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 46/54 properties
BEST_FIRST walk for 4003 steps (40 resets) in 54 ms. (72 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 45/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 43/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 42/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 41/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 35/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4004 steps (40 resets) in 29 ms. (133 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 29/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4004 steps (9 resets) in 13 ms. (286 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4004 steps (40 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4004 steps (40 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 18/19 properties
[2024-06-01 16:57:36] [INFO ] Flow matrix only has 1575 transitions (discarded 9 similar events)
// Phase 1: matrix 1575 rows 474 cols
[2024-06-01 16:57:36] [INFO ] Computed 72 invariants in 33 ms
[2024-06-01 16:57:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp57 is UNSAT
At refinement iteration 1 (OVERLAPS) 191/232 variables, 23/23 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/23 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 181/413 variables, 20/43 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 0/43 constraints. Problems are: Problem set: 4 solved, 14 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp72 is UNSAT
At refinement iteration 5 (OVERLAPS) 59/472 variables, 27/70 constraints. Problems are: Problem set: 15 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 0/70 constraints. Problems are: Problem set: 15 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/474 variables, 2/72 constraints. Problems are: Problem set: 15 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 0/72 constraints. Problems are: Problem set: 15 solved, 3 unsolved
Problem AtomicPropp63 is UNSAT
At refinement iteration 9 (OVERLAPS) 1575/2049 variables, 474/546 constraints. Problems are: Problem set: 16 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2049 variables, 1/547 constraints. Problems are: Problem set: 16 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2049 variables, 0/547 constraints. Problems are: Problem set: 16 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/2049 variables, 0/547 constraints. Problems are: Problem set: 16 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2049/2049 variables, and 547 constraints, problems are : Problem set: 16 solved, 2 unsolved in 1837 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 474/474 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 16 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 16 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/13 variables, 1/1 constraints. Problems are: Problem set: 16 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 16 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 24/37 variables, 2/3 constraints. Problems are: Problem set: 16 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 16 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 200/237 variables, 20/23 constraints. Problems are: Problem set: 16 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/23 constraints. Problems are: Problem set: 16 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 152/389 variables, 19/42 constraints. Problems are: Problem set: 16 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/42 constraints. Problems are: Problem set: 16 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/396 variables, 1/43 constraints. Problems are: Problem set: 16 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 0/43 constraints. Problems are: Problem set: 16 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 75/471 variables, 27/70 constraints. Problems are: Problem set: 16 solved, 2 unsolved
[2024-06-01 16:57:39] [INFO ] Deduced a trap composed of 113 places in 373 ms of which 3 ms to minimize.
[2024-06-01 16:57:40] [INFO ] Deduced a trap composed of 24 places in 341 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/471 variables, 2/72 constraints. Problems are: Problem set: 16 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/471 variables, 0/72 constraints. Problems are: Problem set: 16 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/473 variables, 2/74 constraints. Problems are: Problem set: 16 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/473 variables, 0/74 constraints. Problems are: Problem set: 16 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1575/2048 variables, 473/547 constraints. Problems are: Problem set: 16 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2048 variables, 1/548 constraints. Problems are: Problem set: 16 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2048 variables, 1/549 constraints. Problems are: Problem set: 16 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2048 variables, 0/549 constraints. Problems are: Problem set: 16 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/2049 variables, 1/550 constraints. Problems are: Problem set: 16 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2049 variables, 1/551 constraints. Problems are: Problem set: 16 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2049 variables, 0/551 constraints. Problems are: Problem set: 16 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/2049 variables, 0/551 constraints. Problems are: Problem set: 16 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2049/2049 variables, and 551 constraints, problems are : Problem set: 16 solved, 2 unsolved in 2718 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 474/474 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/17 constraints, Known Traps: 2/2 constraints]
After SMT, in 5079ms problems are : Problem set: 16 solved, 2 unsolved
Finished Parikh walk after 2397 steps, including 234 resets, run visited all 1 properties in 24 ms. (steps per millisecond=99 )
Parikh walk visited 2 properties in 41 ms.
Successfully simplified 16 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBNT-PT-S10J20-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 16:57:42] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 16:57:42] [INFO ] Flatten gal took : 127 ms
FORMULA PolyORBNT-PT-S10J20-CTLFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 16:57:42] [INFO ] Flatten gal took : 146 ms
[2024-06-01 16:57:43] [INFO ] Input system was already deterministic with 1584 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1584/1584 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1584
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1583
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1583
Applied a total of 12 rules in 59 ms. Remains 463 /474 variables (removed 11) and now considering 1583/1584 (removed 1) transitions.
Running 1572 sub problems to find dead transitions.
[2024-06-01 16:57:43] [INFO ] Flow matrix only has 1574 transitions (discarded 9 similar events)
// Phase 1: matrix 1574 rows 463 cols
[2024-06-01 16:57:43] [INFO ] Computed 62 invariants in 23 ms
[2024-06-01 16:57:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 452/2037 variables, and 51 constraints, problems are : Problem set: 0 solved, 1572 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 44/45 constraints, Generalized P Invariants (flows): 7/17 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1572/1572 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1572 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 3 (OVERLAPS) 1/453 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 453/2037 variables, and 52 constraints, problems are : Problem set: 0 solved, 1572 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 7/17 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1572 constraints, Known Traps: 0/0 constraints]
After SMT, in 64911ms problems are : Problem set: 0 solved, 1572 unsolved
Search for dead transitions found 0 dead transitions in 64935ms
Finished structural reductions in LTL mode , in 1 iterations and 65001 ms. Remains : 463/474 places, 1583/1584 transitions.
[2024-06-01 16:58:48] [INFO ] Flatten gal took : 64 ms
[2024-06-01 16:58:48] [INFO ] Flatten gal took : 72 ms
[2024-06-01 16:58:48] [INFO ] Input system was already deterministic with 1583 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1584/1584 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1584
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1583
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1583
Applied a total of 12 rules in 38 ms. Remains 463 /474 variables (removed 11) and now considering 1583/1584 (removed 1) transitions.
Running 1572 sub problems to find dead transitions.
[2024-06-01 16:58:48] [INFO ] Flow matrix only has 1574 transitions (discarded 9 similar events)
[2024-06-01 16:58:48] [INFO ] Invariant cache hit.
[2024-06-01 16:58:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
SMT process timed out in 41139ms, After SMT, problems are : Problem set: 0 solved, 1572 unsolved
Search for dead transitions found 0 dead transitions in 41155ms
Finished structural reductions in LTL mode , in 1 iterations and 41197 ms. Remains : 463/474 places, 1583/1584 transitions.
[2024-06-01 16:59:30] [INFO ] Flatten gal took : 84 ms
[2024-06-01 16:59:30] [INFO ] Flatten gal took : 100 ms
[2024-06-01 16:59:30] [INFO ] Input system was already deterministic with 1583 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1584/1584 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1584
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1583
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1583
Applied a total of 12 rules in 34 ms. Remains 463 /474 variables (removed 11) and now considering 1583/1584 (removed 1) transitions.
Running 1572 sub problems to find dead transitions.
[2024-06-01 16:59:30] [INFO ] Flow matrix only has 1574 transitions (discarded 9 similar events)
[2024-06-01 16:59:30] [INFO ] Invariant cache hit.
[2024-06-01 16:59:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 452/2037 variables, and 51 constraints, problems are : Problem set: 0 solved, 1572 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 44/45 constraints, Generalized P Invariants (flows): 7/17 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1572/1572 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1572 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
[2024-06-01 17:00:20] [INFO ] Deduced a trap composed of 62 places in 163 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 452/2037 variables, and 52 constraints, problems are : Problem set: 0 solved, 1572 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 44/45 constraints, Generalized P Invariants (flows): 7/17 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1572 constraints, Known Traps: 1/1 constraints]
After SMT, in 64589ms problems are : Problem set: 0 solved, 1572 unsolved
Search for dead transitions found 0 dead transitions in 64611ms
Finished structural reductions in LTL mode , in 1 iterations and 64650 ms. Remains : 463/474 places, 1583/1584 transitions.
[2024-06-01 17:00:35] [INFO ] Flatten gal took : 62 ms
[2024-06-01 17:00:35] [INFO ] Flatten gal took : 68 ms
[2024-06-01 17:00:35] [INFO ] Input system was already deterministic with 1583 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1584/1584 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 473 transition count 1583
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 473 transition count 1583
Applied a total of 2 rules in 24 ms. Remains 473 /474 variables (removed 1) and now considering 1583/1584 (removed 1) transitions.
Running 1572 sub problems to find dead transitions.
[2024-06-01 17:00:35] [INFO ] Flow matrix only has 1574 transitions (discarded 9 similar events)
// Phase 1: matrix 1574 rows 473 cols
[2024-06-01 17:00:35] [INFO ] Computed 72 invariants in 38 ms
[2024-06-01 17:00:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 3 (OVERLAPS) 2/454 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/2047 variables, and 53 constraints, problems are : Problem set: 0 solved, 1572 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 7/26 constraints, State Equation: 0/473 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1572/1572 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1572 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 3 (OVERLAPS) 2/454 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/2047 variables, and 53 constraints, problems are : Problem set: 0 solved, 1572 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 7/26 constraints, State Equation: 0/473 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1572 constraints, Known Traps: 0/0 constraints]
After SMT, in 64239ms problems are : Problem set: 0 solved, 1572 unsolved
Search for dead transitions found 0 dead transitions in 64257ms
Finished structural reductions in LTL mode , in 1 iterations and 64286 ms. Remains : 473/474 places, 1583/1584 transitions.
[2024-06-01 17:01:39] [INFO ] Flatten gal took : 63 ms
[2024-06-01 17:01:39] [INFO ] Flatten gal took : 68 ms
[2024-06-01 17:01:39] [INFO ] Input system was already deterministic with 1583 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 1584/1584 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 464 transition count 1558
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 438 transition count 1558
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 52 place count 438 transition count 1534
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 100 place count 414 transition count 1534
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 413 transition count 1533
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 413 transition count 1533
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 106 place count 411 transition count 1531
Applied a total of 106 rules in 148 ms. Remains 411 /474 variables (removed 63) and now considering 1531/1584 (removed 53) transitions.
Running 1520 sub problems to find dead transitions.
[2024-06-01 17:01:40] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
// Phase 1: matrix 1522 rows 411 cols
[2024-06-01 17:01:40] [INFO ] Computed 62 invariants in 34 ms
[2024-06-01 17:01:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
(s38 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 3.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1/401 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 401/1933 variables, and 52 constraints, problems are : Problem set: 0 solved, 1520 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 7/17 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1520/1520 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1520 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 3 (OVERLAPS) 1/401 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 401/1933 variables, and 52 constraints, problems are : Problem set: 0 solved, 1520 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 7/17 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1520 constraints, Known Traps: 0/0 constraints]
After SMT, in 64004ms problems are : Problem set: 0 solved, 1520 unsolved
Search for dead transitions found 0 dead transitions in 64022ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 64175 ms. Remains : 411/474 places, 1531/1584 transitions.
[2024-06-01 17:02:44] [INFO ] Flatten gal took : 63 ms
[2024-06-01 17:02:44] [INFO ] Flatten gal took : 66 ms
[2024-06-01 17:02:44] [INFO ] Input system was already deterministic with 1531 transitions.
RANDOM walk for 2672 steps (198 resets) in 48 ms. (54 steps per ms) remains 0/1 properties
FORMULA PolyORBNT-PT-S10J20-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 1584/1584 transitions.
Ensure Unique test removed 10 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 464 transition count 1560
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 440 transition count 1559
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 439 transition count 1559
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 50 place count 439 transition count 1536
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 96 place count 416 transition count 1536
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 415 transition count 1535
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 415 transition count 1535
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 102 place count 413 transition count 1533
Applied a total of 102 rules in 112 ms. Remains 413 /474 variables (removed 61) and now considering 1533/1584 (removed 51) transitions.
Running 1522 sub problems to find dead transitions.
[2024-06-01 17:02:44] [INFO ] Flow matrix only has 1524 transitions (discarded 9 similar events)
// Phase 1: matrix 1524 rows 413 cols
[2024-06-01 17:02:44] [INFO ] Computed 62 invariants in 26 ms
[2024-06-01 17:02:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 1522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1522 unsolved
At refinement iteration 3 (OVERLAPS) 1/404 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 404/1937 variables, and 53 constraints, problems are : Problem set: 0 solved, 1522 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 9/18 constraints, State Equation: 0/413 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1522/1522 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 1522 unsolved
[2024-06-01 17:03:28] [INFO ] Deduced a trap composed of 18 places in 343 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1522 unsolved
[2024-06-01 17:03:41] [INFO ] Deduced a trap composed of 174 places in 437 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 403/1937 variables, and 54 constraints, problems are : Problem set: 0 solved, 1522 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 43/44 constraints, Generalized P Invariants (flows): 9/18 constraints, State Equation: 0/413 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1522 constraints, Known Traps: 2/2 constraints]
After SMT, in 61373ms problems are : Problem set: 0 solved, 1522 unsolved
Search for dead transitions found 0 dead transitions in 61388ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 61504 ms. Remains : 413/474 places, 1533/1584 transitions.
[2024-06-01 17:03:45] [INFO ] Flatten gal took : 56 ms
[2024-06-01 17:03:46] [INFO ] Flatten gal took : 62 ms
[2024-06-01 17:03:46] [INFO ] Input system was already deterministic with 1533 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 1584/1584 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 474 transition count 1560
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 450 transition count 1560
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 48 place count 450 transition count 1537
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 94 place count 427 transition count 1537
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 426 transition count 1536
Applied a total of 96 rules in 93 ms. Remains 426 /474 variables (removed 48) and now considering 1536/1584 (removed 48) transitions.
Running 1525 sub problems to find dead transitions.
[2024-06-01 17:03:46] [INFO ] Flow matrix only has 1527 transitions (discarded 9 similar events)
// Phase 1: matrix 1527 rows 426 cols
[2024-06-01 17:03:46] [INFO ] Computed 72 invariants in 34 ms
[2024-06-01 17:03:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1525 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1525 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1525 unsolved
At refinement iteration 3 (OVERLAPS) 2/407 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1525 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 407/1953 variables, and 53 constraints, problems are : Problem set: 0 solved, 1525 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 7/26 constraints, State Equation: 0/426 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1525/1525 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1525 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1525 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1525 unsolved
[2024-06-01 17:04:33] [INFO ] Deduced a trap composed of 19 places in 315 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1525 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 405/1953 variables, and 52 constraints, problems are : Problem set: 0 solved, 1525 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 44/46 constraints, Generalized P Invariants (flows): 7/26 constraints, State Equation: 0/426 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1525 constraints, Known Traps: 1/1 constraints]
After SMT, in 63471ms problems are : Problem set: 0 solved, 1525 unsolved
Search for dead transitions found 0 dead transitions in 63491ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 63590 ms. Remains : 426/474 places, 1536/1584 transitions.
[2024-06-01 17:04:49] [INFO ] Flatten gal took : 83 ms
[2024-06-01 17:04:49] [INFO ] Flatten gal took : 94 ms
[2024-06-01 17:04:50] [INFO ] Input system was already deterministic with 1536 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1584/1584 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1584
Applied a total of 10 rules in 42 ms. Remains 464 /474 variables (removed 10) and now considering 1584/1584 (removed 0) transitions.
Running 1573 sub problems to find dead transitions.
[2024-06-01 17:04:50] [INFO ] Flow matrix only has 1575 transitions (discarded 9 similar events)
// Phase 1: matrix 1575 rows 464 cols
[2024-06-01 17:04:50] [INFO ] Computed 62 invariants in 38 ms
[2024-06-01 17:04:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1573 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 1573 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1573 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (OVERLAPS) 1/454 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1573 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/2039 variables, and 52 constraints, problems are : Problem set: 0 solved, 1573 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 8/18 constraints, State Equation: 0/464 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1573/1573 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1573 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1573 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 1573 unsolved
[2024-06-01 17:05:35] [INFO ] Deduced a trap composed of 62 places in 228 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1573 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 453/2039 variables, and 52 constraints, problems are : Problem set: 0 solved, 1573 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 43/44 constraints, Generalized P Invariants (flows): 8/18 constraints, State Equation: 0/464 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1573 constraints, Known Traps: 1/1 constraints]
After SMT, in 62064ms problems are : Problem set: 0 solved, 1573 unsolved
Search for dead transitions found 0 dead transitions in 62088ms
Finished structural reductions in LTL mode , in 1 iterations and 62136 ms. Remains : 464/474 places, 1584/1584 transitions.
[2024-06-01 17:05:52] [INFO ] Flatten gal took : 92 ms
[2024-06-01 17:05:52] [INFO ] Flatten gal took : 107 ms
[2024-06-01 17:05:52] [INFO ] Input system was already deterministic with 1584 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1584/1584 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1584
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1583
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1583
Applied a total of 12 rules in 44 ms. Remains 463 /474 variables (removed 11) and now considering 1583/1584 (removed 1) transitions.
Running 1572 sub problems to find dead transitions.
[2024-06-01 17:05:52] [INFO ] Flow matrix only has 1574 transitions (discarded 9 similar events)
// Phase 1: matrix 1574 rows 463 cols
[2024-06-01 17:05:53] [INFO ] Computed 62 invariants in 39 ms
[2024-06-01 17:05:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 452/2037 variables, and 51 constraints, problems are : Problem set: 0 solved, 1572 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 44/45 constraints, Generalized P Invariants (flows): 7/17 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1572/1572 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1572 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 3 (OVERLAPS) 1/453 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 453/2037 variables, and 52 constraints, problems are : Problem set: 0 solved, 1572 unsolved in 20104 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 7/17 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1572 constraints, Known Traps: 0/0 constraints]
After SMT, in 62515ms problems are : Problem set: 0 solved, 1572 unsolved
Search for dead transitions found 0 dead transitions in 62540ms
Finished structural reductions in LTL mode , in 1 iterations and 62591 ms. Remains : 463/474 places, 1583/1584 transitions.
[2024-06-01 17:06:55] [INFO ] Flatten gal took : 84 ms
[2024-06-01 17:06:55] [INFO ] Flatten gal took : 84 ms
[2024-06-01 17:06:55] [INFO ] Input system was already deterministic with 1583 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 1584/1584 transitions.
Ensure Unique test removed 10 places
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 464 transition count 1559
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 439 transition count 1559
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 50 place count 439 transition count 1535
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 98 place count 415 transition count 1535
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 414 transition count 1534
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 414 transition count 1534
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 104 place count 412 transition count 1532
Applied a total of 104 rules in 127 ms. Remains 412 /474 variables (removed 62) and now considering 1532/1584 (removed 52) transitions.
Running 1521 sub problems to find dead transitions.
[2024-06-01 17:06:56] [INFO ] Flow matrix only has 1523 transitions (discarded 9 similar events)
// Phase 1: matrix 1523 rows 412 cols
[2024-06-01 17:06:56] [INFO ] Computed 62 invariants in 34 ms
[2024-06-01 17:06:56] [INFO ] State equation strengthened by 1 read => feed constraints.
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 : PolyORBNT-PT-S10J20-CTLFireability-2024-00
Could not compute solution for formula : PolyORBNT-PT-S10J20-CTLFireability-2024-01
Could not compute solution for formula : PolyORBNT-PT-S10J20-CTLFireability-2024-02
Could not compute solution for formula : PolyORBNT-PT-S10J20-CTLFireability-2024-03
Could not compute solution for formula : PolyORBNT-PT-S10J20-CTLFireability-2024-04
Could not compute solution for formula : PolyORBNT-PT-S10J20-CTLFireability-2024-05
Could not compute solution for formula : PolyORBNT-PT-S10J20-CTLFireability-2024-06
Could not compute solution for formula : PolyORBNT-PT-S10J20-CTLFireability-2024-07
Could not compute solution for formula : PolyORBNT-PT-S10J20-CTLFireability-2024-08
Could not compute solution for formula : PolyORBNT-PT-S10J20-CTLFireability-2024-09
Could not compute solution for formula : PolyORBNT-PT-S10J20-CTLFireability-2024-10
Could not compute solution for formula : PolyORBNT-PT-S10J20-CTLFireability-2024-11
Could not compute solution for formula : PolyORBNT-PT-S10J20-CTLFireability-2024-12
Could not compute solution for formula : PolyORBNT-PT-S10J20-CTLFireability-2024-13
Could not compute solution for formula : PolyORBNT-PT-S10J20-CTLFireability-2024-14
Could not compute solution for formula : PolyORBNT-PT-S10J20-CTLFireability-2024-15

BK_STOP 1717261625365

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name PolyORBNT-PT-S10J20-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/663/ctl_0_
ctl formula name PolyORBNT-PT-S10J20-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/663/ctl_1_
ctl formula name PolyORBNT-PT-S10J20-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/663/ctl_2_
ctl formula name PolyORBNT-PT-S10J20-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/663/ctl_3_
ctl formula name PolyORBNT-PT-S10J20-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/663/ctl_4_
ctl formula name PolyORBNT-PT-S10J20-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/663/ctl_5_
ctl formula name PolyORBNT-PT-S10J20-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/663/ctl_6_
ctl formula name PolyORBNT-PT-S10J20-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/663/ctl_7_
ctl formula name PolyORBNT-PT-S10J20-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/663/ctl_8_
ctl formula name PolyORBNT-PT-S10J20-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/663/ctl_9_
ctl formula name PolyORBNT-PT-S10J20-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/663/ctl_10_
ctl formula name PolyORBNT-PT-S10J20-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/663/ctl_11_
ctl formula name PolyORBNT-PT-S10J20-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/663/ctl_12_
ctl formula name PolyORBNT-PT-S10J20-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/663/ctl_13_
ctl formula name PolyORBNT-PT-S10J20-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/663/ctl_14_
ctl formula name PolyORBNT-PT-S10J20-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/663/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="PolyORBNT-PT-S10J20"
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 PolyORBNT-PT-S10J20, 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-171654447200482"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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