About the Execution of LTSMin+red for PolyORBLF-PT-S04J04T10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15733.495 | 466618.00 | 642872.00 | 124.90 | ???????FTTTTTFF? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654446800282.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-S04J04T10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446800282
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.7M
-rw-r--r-- 1 mcc users 27K Apr 11 17:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 11 17:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 111K Apr 11 17:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 530K Apr 11 17:12 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 12K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 45K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 11 17:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 11 17:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 263K Apr 11 17:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 11 17:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.7K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 4.2M 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-S04J04T10-CTLFireability-2024-00
FORMULA_NAME PolyORBLF-PT-S04J04T10-CTLFireability-2024-01
FORMULA_NAME PolyORBLF-PT-S04J04T10-CTLFireability-2024-02
FORMULA_NAME PolyORBLF-PT-S04J04T10-CTLFireability-2024-03
FORMULA_NAME PolyORBLF-PT-S04J04T10-CTLFireability-2024-04
FORMULA_NAME PolyORBLF-PT-S04J04T10-CTLFireability-2024-05
FORMULA_NAME PolyORBLF-PT-S04J04T10-CTLFireability-2024-06
FORMULA_NAME PolyORBLF-PT-S04J04T10-CTLFireability-2024-07
FORMULA_NAME PolyORBLF-PT-S04J04T10-CTLFireability-2024-08
FORMULA_NAME PolyORBLF-PT-S04J04T10-CTLFireability-2024-09
FORMULA_NAME PolyORBLF-PT-S04J04T10-CTLFireability-2024-10
FORMULA_NAME PolyORBLF-PT-S04J04T10-CTLFireability-2024-11
FORMULA_NAME PolyORBLF-PT-S04J04T10-CTLFireability-2024-12
FORMULA_NAME PolyORBLF-PT-S04J04T10-CTLFireability-2024-13
FORMULA_NAME PolyORBLF-PT-S04J04T10-CTLFireability-2024-14
FORMULA_NAME PolyORBLF-PT-S04J04T10-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717254121952
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-S04J04T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:02:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 15:02:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:02:03] [INFO ] Load time of PNML (sax parser for PT used): 302 ms
[2024-06-01 15:02:03] [INFO ] Transformed 870 places.
[2024-06-01 15:02:03] [INFO ] Transformed 5034 transitions.
[2024-06-01 15:02:03] [INFO ] Parsed PT model containing 870 places and 5034 transitions and 34774 arcs in 475 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 35 ms.
[2024-06-01 15:02:03] [INFO ] Reduced 440 identical enabling conditions.
[2024-06-01 15:02:03] [INFO ] Reduced 2210 identical enabling conditions.
[2024-06-01 15:02:03] [INFO ] Reduced 60 identical enabling conditions.
Ensure Unique test removed 2710 transitions
Reduce redundant transitions removed 2710 transitions.
Support contains 750 out of 870 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 867 transition count 2324
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 13 place count 857 transition count 2314
Iterating global reduction 1 with 10 rules applied. Total rules applied 23 place count 857 transition count 2314
Applied a total of 23 rules in 93 ms. Remains 857 /870 variables (removed 13) and now considering 2314/2324 (removed 10) transitions.
Running 2310 sub problems to find dead transitions.
[2024-06-01 15:02:04] [INFO ] Flow matrix only has 2274 transitions (discarded 40 similar events)
// Phase 1: matrix 2274 rows 857 cols
[2024-06-01 15:02:04] [INFO ] Computed 55 invariants in 200 ms
[2024-06-01 15:02:04] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/852 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2310 unsolved
SMT process timed out in 31448ms, After SMT, problems are : Problem set: 0 solved, 2310 unsolved
Search for dead transitions found 0 dead transitions in 31506ms
[2024-06-01 15:02:35] [INFO ] Flow matrix only has 2274 transitions (discarded 40 similar events)
[2024-06-01 15:02:35] [INFO ] Invariant cache hit.
[2024-06-01 15:02:35] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-06-01 15:02:35] [INFO ] Flow matrix only has 2274 transitions (discarded 40 similar events)
[2024-06-01 15:02:35] [INFO ] Invariant cache hit.
[2024-06-01 15:02:38] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 15:02:43] [INFO ] Implicit Places using invariants and state equation in 7489 ms returned []
Implicit Place search using SMT with State Equation took 7745 ms to find 0 implicit places.
Running 2310 sub problems to find dead transitions.
[2024-06-01 15:02:43] [INFO ] Flow matrix only has 2274 transitions (discarded 40 similar events)
[2024-06-01 15:02:43] [INFO ] Invariant cache hit.
[2024-06-01 15:02:43] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/852 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/852 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 2310 unsolved
[2024-06-01 15:03:18] [INFO ] Deduced a trap composed of 74 places in 150 ms of which 17 ms to minimize.
[2024-06-01 15:03:18] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 2 ms to minimize.
[2024-06-01 15:03:18] [INFO ] Deduced a trap composed of 74 places in 79 ms of which 2 ms to minimize.
[2024-06-01 15:03:18] [INFO ] Deduced a trap composed of 75 places in 86 ms of which 1 ms to minimize.
[2024-06-01 15:03:18] [INFO ] Deduced a trap composed of 74 places in 69 ms of which 1 ms to minimize.
[2024-06-01 15:03:18] [INFO ] Deduced a trap composed of 75 places in 86 ms of which 2 ms to minimize.
[2024-06-01 15:03:19] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 2 ms to minimize.
[2024-06-01 15:03:19] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 1 ms to minimize.
[2024-06-01 15:03:19] [INFO ] Deduced a trap composed of 75 places in 73 ms of which 1 ms to minimize.
[2024-06-01 15:03:19] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 2 ms to minimize.
[2024-06-01 15:03:20] [INFO ] Deduced a trap composed of 245 places in 690 ms of which 7 ms to minimize.
[2024-06-01 15:03:23] [INFO ] Deduced a trap composed of 109 places in 347 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 852/3131 variables, and 62 constraints, problems are : Problem set: 0 solved, 2310 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 40/44 constraints, State Equation: 0/857 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2310/2310 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2310 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/852 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/852 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 2310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/852 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 2310 unsolved
[2024-06-01 15:03:47] [INFO ] Deduced a trap composed of 515 places in 554 ms of which 6 ms to minimize.
[2024-06-01 15:03:47] [INFO ] Deduced a trap composed of 402 places in 567 ms of which 6 ms to minimize.
[2024-06-01 15:03:48] [INFO ] Deduced a trap composed of 480 places in 566 ms of which 6 ms to minimize.
[2024-06-01 15:03:49] [INFO ] Deduced a trap composed of 451 places in 544 ms of which 5 ms to minimize.
[2024-06-01 15:03:49] [INFO ] Deduced a trap composed of 470 places in 465 ms of which 6 ms to minimize.
[2024-06-01 15:03:50] [INFO ] Deduced a trap composed of 488 places in 434 ms of which 6 ms to minimize.
[2024-06-01 15:03:50] [INFO ] Deduced a trap composed of 452 places in 511 ms of which 6 ms to minimize.
[2024-06-01 15:03:51] [INFO ] Deduced a trap composed of 382 places in 457 ms of which 4 ms to minimize.
[2024-06-01 15:03:51] [INFO ] Deduced a trap composed of 536 places in 492 ms of which 5 ms to minimize.
[2024-06-01 15:03:52] [INFO ] Deduced a trap composed of 520 places in 530 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 852/3131 variables, and 72 constraints, problems are : Problem set: 0 solved, 2310 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 40/44 constraints, State Equation: 0/857 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2310 constraints, Known Traps: 22/22 constraints]
After SMT, in 70905ms problems are : Problem set: 0 solved, 2310 unsolved
Search for dead transitions found 0 dead transitions in 70940ms
Starting structural reductions in LTL mode, iteration 1 : 857/870 places, 2314/2324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110361 ms. Remains : 857/870 places, 2314/2324 transitions.
Support contains 750 out of 857 places after structural reductions.
[2024-06-01 15:03:54] [INFO ] Flatten gal took : 371 ms
[2024-06-01 15:03:55] [INFO ] Flatten gal took : 189 ms
[2024-06-01 15:03:55] [INFO ] Input system was already deterministic with 2314 transitions.
Reduction of identical properties reduced properties to check from 82 to 81
RANDOM walk for 40000 steps (8 resets) in 3715 ms. (10 steps per ms) remains 31/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 214 ms. (18 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 63 ms. (62 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (8 resets) in 48 ms. (81 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 113 ms. (35 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
[2024-06-01 15:03:57] [INFO ] Flow matrix only has 2274 transitions (discarded 40 similar events)
[2024-06-01 15:03:57] [INFO ] Invariant cache hit.
[2024-06-01 15:03:57] [INFO ] State equation strengthened by 200 read => feed constraints.
Problem AtomicPropp9 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 29 unsolved
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp80 is UNSAT
At refinement iteration 3 (OVERLAPS) 126/468 variables, 8/11 constraints. Problems are: Problem set: 9 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 0/11 constraints. Problems are: Problem set: 9 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 4/472 variables, 1/12 constraints. Problems are: Problem set: 9 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 0/12 constraints. Problems are: Problem set: 9 solved, 21 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp81 is UNSAT
At refinement iteration 7 (OVERLAPS) 385/857 variables, 43/55 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/857 variables, 0/55 constraints. Problems are: Problem set: 29 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3131/3131 variables, and 912 constraints, problems are : Problem set: 29 solved, 1 unsolved in 4929 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 857/857 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 29 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 477/480 variables, 5/5 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 0/5 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 83/563 variables, 9/14 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/14 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 291/854 variables, 39/53 constraints. Problems are: Problem set: 29 solved, 1 unsolved
[2024-06-01 15:04:03] [INFO ] Deduced a trap composed of 75 places in 321 ms of which 4 ms to minimize.
[2024-06-01 15:04:04] [INFO ] Deduced a trap composed of 75 places in 258 ms of which 4 ms to minimize.
[2024-06-01 15:04:04] [INFO ] Deduced a trap composed of 75 places in 193 ms of which 3 ms to minimize.
[2024-06-01 15:04:04] [INFO ] Deduced a trap composed of 74 places in 181 ms of which 3 ms to minimize.
[2024-06-01 15:04:04] [INFO ] Deduced a trap composed of 74 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:04:04] [INFO ] Deduced a trap composed of 75 places in 148 ms of which 5 ms to minimize.
[2024-06-01 15:04:05] [INFO ] Deduced a trap composed of 76 places in 132 ms of which 2 ms to minimize.
[2024-06-01 15:04:05] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/854 variables, 8/61 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/854 variables, 0/61 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/855 variables, 1/62 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/855 variables, 0/62 constraints. Problems are: Problem set: 29 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3129/3131 variables, and 917 constraints, problems are : Problem set: 29 solved, 1 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 855/857 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/30 constraints, Known Traps: 8/8 constraints]
After SMT, in 10610ms problems are : Problem set: 29 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 857 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 857/857 places, 2314/2314 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 856 transition count 2254
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 121 place count 796 transition count 2254
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 121 place count 796 transition count 2154
Deduced a syphon composed of 100 places in 3 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 321 place count 696 transition count 2154
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 2 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 220 rules applied. Total rules applied 541 place count 586 transition count 2044
Free-agglomeration rule (complex) applied 29 times.
Iterating global reduction 2 with 29 rules applied. Total rules applied 570 place count 586 transition count 2015
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 599 place count 557 transition count 2015
Applied a total of 599 rules in 475 ms. Remains 557 /857 variables (removed 300) and now considering 2015/2314 (removed 299) transitions.
Running 2011 sub problems to find dead transitions.
[2024-06-01 15:04:08] [INFO ] Flow matrix only has 1975 transitions (discarded 40 similar events)
// Phase 1: matrix 1975 rows 557 cols
[2024-06-01 15:04:08] [INFO ] Computed 54 invariants in 107 ms
[2024-06-01 15:04:08] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/553 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2011 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/553 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 2011 unsolved
[2024-06-01 15:04:38] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 2 ms to minimize.
[2024-06-01 15:04:39] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 2 ms to minimize.
[2024-06-01 15:04:40] [INFO ] Deduced a trap composed of 42 places in 197 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 553/2532 variables, and 48 constraints, problems are : Problem set: 0 solved, 2011 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 35/42 constraints, State Equation: 0/557 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2011/2011 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2011 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/553 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2011 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/553 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 2011 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/553 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 2011 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/553 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2011 unsolved
Problem TDEAD17 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1382 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1403 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1409 is UNSAT
Problem TDEAD1410 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1421 is UNSAT
Problem TDEAD1427 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1432 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1451 is UNSAT
Problem TDEAD1454 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1464 is UNSAT
Problem TDEAD1465 is UNSAT
Problem TDEAD1466 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1476 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1505 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1530 is UNSAT
Problem TDEAD1532 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1536 is UNSAT
Problem TDEAD1538 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1553 is UNSAT
Problem TDEAD1554 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1556 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1576 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1614 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1646 is UNSAT
Problem TDEAD1648 is UNSAT
Problem TDEAD1650 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1663 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1666 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1669 is UNSAT
Problem TDEAD1674 is UNSAT
Problem TDEAD1675 is UNSAT
Problem TDEAD1678 is UNSAT
Problem TDEAD1680 is UNSAT
Problem TDEAD1683 is UNSAT
Problem TDEAD1684 is UNSAT
Problem TDEAD1685 is UNSAT
Problem TDEAD1686 is UNSAT
Problem TDEAD1687 is UNSAT
Problem TDEAD1690 is UNSAT
Problem TDEAD1691 is UNSAT
Problem TDEAD1692 is UNSAT
Problem TDEAD1693 is UNSAT
Problem TDEAD1697 is UNSAT
Problem TDEAD1698 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1702 is UNSAT
Problem TDEAD1705 is UNSAT
Problem TDEAD1707 is UNSAT
Problem TDEAD1713 is UNSAT
Problem TDEAD1715 is UNSAT
Problem TDEAD1716 is UNSAT
Problem TDEAD1717 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1722 is UNSAT
Problem TDEAD1725 is UNSAT
Problem TDEAD1727 is UNSAT
Problem TDEAD1733 is UNSAT
Problem TDEAD1735 is UNSAT
Problem TDEAD1737 is UNSAT
Problem TDEAD1738 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1744 is UNSAT
Problem TDEAD1745 is UNSAT
Problem TDEAD1747 is UNSAT
Problem TDEAD1751 is UNSAT
Problem TDEAD1756 is UNSAT
Problem TDEAD1757 is UNSAT
Problem TDEAD1758 is UNSAT
Problem TDEAD1759 is UNSAT
Problem TDEAD1760 is UNSAT
Problem TDEAD1761 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1765 is UNSAT
Problem TDEAD1767 is UNSAT
Problem TDEAD1769 is UNSAT
Problem TDEAD1772 is UNSAT
Problem TDEAD1777 is UNSAT
Problem TDEAD1785 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1796 is UNSAT
Problem TDEAD1797 is UNSAT
Problem TDEAD1798 is UNSAT
Problem TDEAD1799 is UNSAT
Problem TDEAD1800 is UNSAT
Problem TDEAD1803 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1812 is UNSAT
Problem TDEAD1813 is UNSAT
Problem TDEAD1816 is UNSAT
Problem TDEAD1817 is UNSAT
Problem TDEAD1819 is UNSAT
Problem TDEAD1823 is UNSAT
Problem TDEAD1828 is UNSAT
Problem TDEAD1829 is UNSAT
Problem TDEAD1832 is UNSAT
Problem TDEAD1833 is UNSAT
Problem TDEAD1836 is UNSAT
Problem TDEAD1837 is UNSAT
Problem TDEAD1840 is UNSAT
Problem TDEAD1843 is UNSAT
Problem TDEAD1844 is UNSAT
Problem TDEAD1845 is UNSAT
Problem TDEAD1847 is UNSAT
Problem TDEAD1850 is UNSAT
Problem TDEAD1851 is UNSAT
Problem TDEAD1864 is UNSAT
Problem TDEAD1871 is UNSAT
Problem TDEAD1873 is UNSAT
Problem TDEAD1874 is UNSAT
Problem TDEAD1876 is UNSAT
Problem TDEAD1880 is UNSAT
Problem TDEAD1885 is UNSAT
Problem TDEAD1886 is UNSAT
Problem TDEAD1887 is UNSAT
Problem TDEAD1891 is UNSAT
Problem TDEAD1893 is UNSAT
Problem TDEAD1895 is UNSAT
Problem TDEAD1897 is UNSAT
Problem TDEAD1898 is UNSAT
Problem TDEAD1902 is UNSAT
Problem TDEAD1903 is UNSAT
Problem TDEAD1907 is UNSAT
Problem TDEAD1908 is UNSAT
Problem TDEAD1909 is UNSAT
Problem TDEAD1913 is UNSAT
Problem TDEAD1914 is UNSAT
Problem TDEAD1916 is UNSAT
Problem TDEAD1917 is UNSAT
Problem TDEAD1918 is UNSAT
Problem TDEAD1919 is UNSAT
Problem TDEAD1922 is UNSAT
Problem TDEAD1924 is UNSAT
Problem TDEAD1929 is UNSAT
Problem TDEAD1930 is UNSAT
Problem TDEAD1942 is UNSAT
Problem TDEAD1944 is UNSAT
Problem TDEAD1945 is UNSAT
Problem TDEAD1948 is UNSAT
Problem TDEAD1953 is UNSAT
Problem TDEAD1954 is UNSAT
Problem TDEAD1959 is UNSAT
Problem TDEAD1960 is UNSAT
Problem TDEAD1962 is UNSAT
Problem TDEAD1965 is UNSAT
Problem TDEAD1966 is UNSAT
Problem TDEAD1968 is UNSAT
Problem TDEAD1969 is UNSAT
Problem TDEAD1971 is UNSAT
Problem TDEAD1973 is UNSAT
Problem TDEAD1977 is UNSAT
Problem TDEAD1978 is UNSAT
Problem TDEAD1979 is UNSAT
Problem TDEAD1986 is UNSAT
Problem TDEAD1987 is UNSAT
Problem TDEAD1994 is UNSAT
Problem TDEAD1997 is UNSAT
Problem TDEAD1998 is UNSAT
Problem TDEAD1999 is UNSAT
Problem TDEAD2001 is UNSAT
Problem TDEAD2004 is UNSAT
Problem TDEAD2005 is UNSAT
Problem TDEAD2007 is UNSAT
Problem TDEAD2008 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/555 variables, 2/50 constraints. Problems are: Problem set: 290 solved, 1721 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 5/55 constraints. Problems are: Problem set: 290 solved, 1721 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 555/2532 variables, and 55 constraints, problems are : Problem set: 290 solved, 1721 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 40/42 constraints, State Equation: 0/557 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2011 constraints, Known Traps: 3/3 constraints]
After SMT, in 56250ms problems are : Problem set: 290 solved, 1721 unsolved
Search for dead transitions found 290 dead transitions in 56279ms
Found 290 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 290 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 290 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 557/857 places, 1725/2314 transitions.
Applied a total of 0 rules in 40 ms. Remains 557 /557 variables (removed 0) and now considering 1725/1725 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56802 ms. Remains : 557/857 places, 1725/2314 transitions.
RANDOM walk for 40000 steps (8 resets) in 543 ms. (73 steps per ms) remains 1/1 properties
BEST_FIRST walk for 33801 steps (7 resets) in 179 ms. (187 steps per ms) remains 0/1 properties
Successfully simplified 29 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA PolyORBLF-PT-S04J04T10-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T10-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T10-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T10-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T10-CTLFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T10-CTLFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:05:05] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 15:05:05] [INFO ] Flatten gal took : 135 ms
FORMULA PolyORBLF-PT-S04J04T10-CTLFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T10-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:05:05] [INFO ] Flatten gal took : 110 ms
[2024-06-01 15:05:06] [INFO ] Input system was already deterministic with 2314 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 857/857 places, 2314/2314 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 856 transition count 2314
Applied a total of 1 rules in 22 ms. Remains 856 /857 variables (removed 1) and now considering 2314/2314 (removed 0) transitions.
Running 2310 sub problems to find dead transitions.
[2024-06-01 15:05:06] [INFO ] Flow matrix only has 2274 transitions (discarded 40 similar events)
// Phase 1: matrix 2274 rows 856 cols
[2024-06-01 15:05:06] [INFO ] Computed 54 invariants in 76 ms
[2024-06-01 15:05:06] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 2.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 3.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.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 3.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 4.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 0.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 0.0)
(s81 1.0)
(s82 3.0)
(s83 0.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 0.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.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 0.0)
(s110 2.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 0.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 0.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 2.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 0.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 0.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 1.0)
(s182 0.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 0.0)
(s196 1.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 1.0)
(s202 0.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 0.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 0.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 0.0)
(s224 1.0)
(s225 1.0)
(s226 4.0)
(s227 1.0)
(s228 2.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 0.0)
(s236 1.0)
(s237 1.0)
(s238 0.0)
(s239 1.0)
(s240 2.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 0.0)
(s251 1.0)
(s252 1.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 1.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 1.0)
(s262 4.0)
(s263 1.0)
(s264 4.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 3.0)
(s271 0.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 0.0)
(s301 1.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 1.0)
(s306 0.0)
(s307 1.0)
(s308 0.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 0.0)
(s314 1.0)
(s315 1.0)
(s316 0.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 0.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 0.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 2.0)
(s337 1.0)
(s338 1.0)
(s339 0.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 9.0)
(s346 1.0)
(s347 0.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 0.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 4.0)
(s356 0.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 4.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 2.0)
(s369 1.0)
(s370 1.0)
(s371 3.0)
(s372 1.0)
(s373 0.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/852 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2310 unsolved
SMT process timed out in 32310ms, After SMT, problems are : Problem set: 0 solved, 2310 unsolved
Search for dead transitions found 0 dead transitions in 32333ms
Finished structural reductions in LTL mode , in 1 iterations and 32361 ms. Remains : 856/857 places, 2314/2314 transitions.
[2024-06-01 15:05:38] [INFO ] Flatten gal took : 78 ms
[2024-06-01 15:05:38] [INFO ] Flatten gal took : 94 ms
[2024-06-01 15:05:38] [INFO ] Input system was already deterministic with 2314 transitions.
Starting structural reductions in LTL mode, iteration 0 : 857/857 places, 2314/2314 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 856 transition count 2314
Applied a total of 1 rules in 31 ms. Remains 856 /857 variables (removed 1) and now considering 2314/2314 (removed 0) transitions.
Running 2310 sub problems to find dead transitions.
[2024-06-01 15:05:38] [INFO ] Flow matrix only has 2274 transitions (discarded 40 similar events)
[2024-06-01 15:05:38] [INFO ] Invariant cache hit.
[2024-06-01 15:05:38] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/852 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2310 unsolved
SMT process timed out in 32196ms, After SMT, problems are : Problem set: 0 solved, 2310 unsolved
Search for dead transitions found 0 dead transitions in 32241ms
Finished structural reductions in LTL mode , in 1 iterations and 32277 ms. Remains : 856/857 places, 2314/2314 transitions.
[2024-06-01 15:06:11] [INFO ] Flatten gal took : 77 ms
[2024-06-01 15:06:11] [INFO ] Flatten gal took : 82 ms
[2024-06-01 15:06:11] [INFO ] Input system was already deterministic with 2314 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 857/857 places, 2314/2314 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 856 transition count 2294
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 836 transition count 2294
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 40 place count 836 transition count 2234
Deduced a syphon composed of 60 places in 3 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 160 place count 776 transition count 2234
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 2 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 340 place count 686 transition count 2144
Applied a total of 340 rules in 139 ms. Remains 686 /857 variables (removed 171) and now considering 2144/2314 (removed 170) transitions.
Running 2140 sub problems to find dead transitions.
[2024-06-01 15:06:11] [INFO ] Flow matrix only has 2104 transitions (discarded 40 similar events)
// Phase 1: matrix 2104 rows 686 cols
[2024-06-01 15:06:11] [INFO ] Computed 54 invariants in 84 ms
[2024-06-01 15:06:11] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/682 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 2140 unsolved
[2024-06-01 15:06:40] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 2 ms to minimize.
[2024-06-01 15:06:43] [INFO ] Deduced a trap composed of 92 places in 187 ms of which 7 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 682/2790 variables, and 47 constraints, problems are : Problem set: 0 solved, 2140 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 11/13 constraints, Generalized P Invariants (flows): 34/41 constraints, State Equation: 0/686 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2140/2140 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/682 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 2140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/682 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 2140 unsolved
[2024-06-01 15:06:48] [INFO ] Deduced a trap composed of 55 places in 447 ms of which 4 ms to minimize.
[2024-06-01 15:06:48] [INFO ] Deduced a trap composed of 57 places in 500 ms of which 4 ms to minimize.
[2024-06-01 15:06:49] [INFO ] Deduced a trap composed of 57 places in 520 ms of which 4 ms to minimize.
[2024-06-01 15:06:49] [INFO ] Deduced a trap composed of 39 places in 439 ms of which 5 ms to minimize.
[2024-06-01 15:06:49] [INFO ] Deduced a trap composed of 58 places in 88 ms of which 2 ms to minimize.
[2024-06-01 15:06:49] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 1 ms to minimize.
[2024-06-01 15:06:49] [INFO ] Deduced a trap composed of 57 places in 42 ms of which 1 ms to minimize.
[2024-06-01 15:06:50] [INFO ] Deduced a trap composed of 58 places in 49 ms of which 1 ms to minimize.
[2024-06-01 15:06:50] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 3 ms to minimize.
[2024-06-01 15:06:50] [INFO ] Deduced a trap composed of 58 places in 56 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 682/2790 variables, and 57 constraints, problems are : Problem set: 0 solved, 2140 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/13 constraints, Generalized P Invariants (flows): 34/41 constraints, State Equation: 0/686 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2140 constraints, Known Traps: 12/12 constraints]
After SMT, in 52454ms problems are : Problem set: 0 solved, 2140 unsolved
Search for dead transitions found 0 dead transitions in 52473ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 52617 ms. Remains : 686/857 places, 2144/2314 transitions.
[2024-06-01 15:07:04] [INFO ] Flatten gal took : 66 ms
[2024-06-01 15:07:04] [INFO ] Flatten gal took : 74 ms
[2024-06-01 15:07:04] [INFO ] Input system was already deterministic with 2144 transitions.
Starting structural reductions in LTL mode, iteration 0 : 857/857 places, 2314/2314 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 856 transition count 2314
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 846 transition count 2304
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 846 transition count 2304
Applied a total of 21 rules in 159 ms. Remains 846 /857 variables (removed 11) and now considering 2304/2314 (removed 10) transitions.
Running 2300 sub problems to find dead transitions.
[2024-06-01 15:07:04] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 846 cols
[2024-06-01 15:07:04] [INFO ] Computed 54 invariants in 83 ms
[2024-06-01 15:07:04] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/842 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
SMT process timed out in 32004ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 32026ms
Finished structural reductions in LTL mode , in 1 iterations and 32190 ms. Remains : 846/857 places, 2304/2314 transitions.
[2024-06-01 15:07:36] [INFO ] Flatten gal took : 68 ms
[2024-06-01 15:07:36] [INFO ] Flatten gal took : 77 ms
[2024-06-01 15:07:36] [INFO ] Input system was already deterministic with 2304 transitions.
Starting structural reductions in LTL mode, iteration 0 : 857/857 places, 2314/2314 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 856 transition count 2314
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 846 transition count 2304
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 846 transition count 2304
Applied a total of 21 rules in 36 ms. Remains 846 /857 variables (removed 11) and now considering 2304/2314 (removed 10) transitions.
Running 2300 sub problems to find dead transitions.
[2024-06-01 15:07:36] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 15:07:36] [INFO ] Invariant cache hit.
[2024-06-01 15:07:36] [INFO ] State equation strengthened by 200 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/842 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
SMT process timed out in 31768ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 31790ms
Finished structural reductions in LTL mode , in 1 iterations and 31831 ms. Remains : 846/857 places, 2304/2314 transitions.
[2024-06-01 15:08:08] [INFO ] Flatten gal took : 120 ms
[2024-06-01 15:08:08] [INFO ] Flatten gal took : 108 ms
[2024-06-01 15:08:09] [INFO ] Input system was already deterministic with 2304 transitions.
Starting structural reductions in LTL mode, iteration 0 : 857/857 places, 2314/2314 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 856 transition count 2314
Applied a total of 1 rules in 24 ms. Remains 856 /857 variables (removed 1) and now considering 2314/2314 (removed 0) transitions.
Running 2310 sub problems to find dead transitions.
[2024-06-01 15:08:09] [INFO ] Flow matrix only has 2274 transitions (discarded 40 similar events)
// Phase 1: matrix 2274 rows 856 cols
[2024-06-01 15:08:09] [INFO ] Computed 54 invariants in 77 ms
[2024-06-01 15:08:09] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/852 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2310 unsolved
SMT process timed out in 32894ms, After SMT, problems are : Problem set: 0 solved, 2310 unsolved
Search for dead transitions found 0 dead transitions in 32920ms
Finished structural reductions in LTL mode , in 1 iterations and 32951 ms. Remains : 856/857 places, 2314/2314 transitions.
[2024-06-01 15:08:42] [INFO ] Flatten gal took : 73 ms
[2024-06-01 15:08:42] [INFO ] Flatten gal took : 83 ms
[2024-06-01 15:08:42] [INFO ] Input system was already deterministic with 2314 transitions.
Starting structural reductions in LTL mode, iteration 0 : 857/857 places, 2314/2314 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 856 transition count 2314
Applied a total of 1 rules in 18 ms. Remains 856 /857 variables (removed 1) and now considering 2314/2314 (removed 0) transitions.
Running 2310 sub problems to find dead transitions.
[2024-06-01 15:08:42] [INFO ] Flow matrix only has 2274 transitions (discarded 40 similar events)
[2024-06-01 15:08:42] [INFO ] Invariant cache hit.
[2024-06-01 15:08:42] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/852 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2310 unsolved
SMT process timed out in 31902ms, After SMT, problems are : Problem set: 0 solved, 2310 unsolved
Search for dead transitions found 0 dead transitions in 31924ms
Finished structural reductions in LTL mode , in 1 iterations and 31947 ms. Remains : 856/857 places, 2314/2314 transitions.
[2024-06-01 15:09:14] [INFO ] Flatten gal took : 77 ms
[2024-06-01 15:09:14] [INFO ] Flatten gal took : 77 ms
[2024-06-01 15:09:14] [INFO ] Input system was already deterministic with 2314 transitions.
Starting structural reductions in LTL mode, iteration 0 : 857/857 places, 2314/2314 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 856 transition count 2314
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 846 transition count 2304
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 846 transition count 2304
Applied a total of 21 rules in 35 ms. Remains 846 /857 variables (removed 11) and now considering 2304/2314 (removed 10) transitions.
Running 2300 sub problems to find dead transitions.
[2024-06-01 15:09:14] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 846 cols
[2024-06-01 15:09:14] [INFO ] Computed 54 invariants in 70 ms
[2024-06-01 15:09:14] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/842 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
SMT process timed out in 32499ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 32520ms
Finished structural reductions in LTL mode , in 1 iterations and 32560 ms. Remains : 846/857 places, 2304/2314 transitions.
[2024-06-01 15:09:47] [INFO ] Flatten gal took : 74 ms
[2024-06-01 15:09:47] [INFO ] Flatten gal took : 87 ms
[2024-06-01 15:09:47] [INFO ] Input system was already deterministic with 2304 transitions.
[2024-06-01 15:09:47] [INFO ] Flatten gal took : 96 ms
[2024-06-01 15:09:47] [INFO ] Flatten gal took : 98 ms
[2024-06-01 15:09:48] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLFireability.sr.xml took 19 ms.
[2024-06-01 15:09:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 857 places, 2314 transitions and 11791 arcs took 14 ms.
Total runtime 464954 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : PolyORBLF-PT-S04J04T10-CTLFireability-2024-00
Could not compute solution for formula : PolyORBLF-PT-S04J04T10-CTLFireability-2024-01
Could not compute solution for formula : PolyORBLF-PT-S04J04T10-CTLFireability-2024-02
Could not compute solution for formula : PolyORBLF-PT-S04J04T10-CTLFireability-2024-03
Could not compute solution for formula : PolyORBLF-PT-S04J04T10-CTLFireability-2024-04
Could not compute solution for formula : PolyORBLF-PT-S04J04T10-CTLFireability-2024-05
Could not compute solution for formula : PolyORBLF-PT-S04J04T10-CTLFireability-2024-06
Could not compute solution for formula : PolyORBLF-PT-S04J04T10-CTLFireability-2024-15
BK_STOP 1717254588570
--------------------
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 PolyORBLF-PT-S04J04T10-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/740/ctl_0_
ctl formula name PolyORBLF-PT-S04J04T10-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/740/ctl_1_
ctl formula name PolyORBLF-PT-S04J04T10-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/740/ctl_2_
ctl formula name PolyORBLF-PT-S04J04T10-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/740/ctl_3_
ctl formula name PolyORBLF-PT-S04J04T10-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/740/ctl_4_
ctl formula name PolyORBLF-PT-S04J04T10-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/740/ctl_5_
ctl formula name PolyORBLF-PT-S04J04T10-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/740/ctl_6_
ctl formula name PolyORBLF-PT-S04J04T10-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/740/ctl_7_
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-S04J04T10"
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-S04J04T10, 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-171654446800282"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S04J04T10.tgz
mv PolyORBLF-PT-S04J04T10 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;