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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.0M
-rw-r--r-- 1 mcc users 21K Apr 11 16:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 11 16:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 69K Apr 11 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 339K Apr 11 16:56 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 14K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 21K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 50K Apr 11 17:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 256K Apr 11 17:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113K Apr 11 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 540K Apr 11 17:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.6K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.6K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 4.3M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-PT-S04J06T10-CTLFireability-2024-00
FORMULA_NAME PolyORBLF-PT-S04J06T10-CTLFireability-2024-01
FORMULA_NAME PolyORBLF-PT-S04J06T10-CTLFireability-2024-02
FORMULA_NAME PolyORBLF-PT-S04J06T10-CTLFireability-2024-03
FORMULA_NAME PolyORBLF-PT-S04J06T10-CTLFireability-2024-04
FORMULA_NAME PolyORBLF-PT-S04J06T10-CTLFireability-2024-05
FORMULA_NAME PolyORBLF-PT-S04J06T10-CTLFireability-2024-06
FORMULA_NAME PolyORBLF-PT-S04J06T10-CTLFireability-2024-07
FORMULA_NAME PolyORBLF-PT-S04J06T10-CTLFireability-2024-08
FORMULA_NAME PolyORBLF-PT-S04J06T10-CTLFireability-2024-09
FORMULA_NAME PolyORBLF-PT-S04J06T10-CTLFireability-2024-10
FORMULA_NAME PolyORBLF-PT-S04J06T10-CTLFireability-2024-11
FORMULA_NAME PolyORBLF-PT-S04J06T10-CTLFireability-2024-12
FORMULA_NAME PolyORBLF-PT-S04J06T10-CTLFireability-2024-13
FORMULA_NAME PolyORBLF-PT-S04J06T10-CTLFireability-2024-14
FORMULA_NAME PolyORBLF-PT-S04J06T10-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717254992398

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-S04J06T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:16:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 15:16:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:16:34] [INFO ] Load time of PNML (sax parser for PT used): 382 ms
[2024-06-01 15:16:34] [INFO ] Transformed 966 places.
[2024-06-01 15:16:34] [INFO ] Transformed 5354 transitions.
[2024-06-01 15:16:34] [INFO ] Parsed PT model containing 966 places and 5354 transitions and 36134 arcs in 570 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 34 ms.
[2024-06-01 15:16:34] [INFO ] Reduced 440 identical enabling conditions.
[2024-06-01 15:16:34] [INFO ] Reduced 60 identical enabling conditions.
Ensure Unique test removed 2710 transitions
Reduce redundant transitions removed 2710 transitions.
Support contains 807 out of 966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 966/966 places, 2644/2644 transitions.
Applied a total of 0 rules in 65 ms. Remains 966 /966 variables (removed 0) and now considering 2644/2644 (removed 0) transitions.
Running 2640 sub problems to find dead transitions.
[2024-06-01 15:16:35] [INFO ] Flow matrix only has 2604 transitions (discarded 40 similar events)
// Phase 1: matrix 2604 rows 966 cols
[2024-06-01 15:16:35] [INFO ] Computed 62 invariants in 273 ms
[2024-06-01 15:16:35] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2640 unsolved
SMT process timed out in 33675ms, After SMT, problems are : Problem set: 0 solved, 2640 unsolved
Search for dead transitions found 0 dead transitions in 33734ms
[2024-06-01 15:17:08] [INFO ] Flow matrix only has 2604 transitions (discarded 40 similar events)
[2024-06-01 15:17:08] [INFO ] Invariant cache hit.
[2024-06-01 15:17:09] [INFO ] Implicit Places using invariants in 648 ms returned [103, 228, 348, 476, 532, 567, 674, 728, 844]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 678 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 957/966 places, 2644/2644 transitions.
Applied a total of 0 rules in 22 ms. Remains 957 /957 variables (removed 0) and now considering 2644/2644 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34565 ms. Remains : 957/966 places, 2644/2644 transitions.
Support contains 807 out of 957 places after structural reductions.
[2024-06-01 15:17:10] [INFO ] Flatten gal took : 502 ms
[2024-06-01 15:17:10] [INFO ] Flatten gal took : 324 ms
[2024-06-01 15:17:11] [INFO ] Input system was already deterministic with 2644 transitions.
Support contains 797 out of 957 places (down from 807) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 94 to 91
RANDOM walk for 40000 steps (9 resets) in 3533 ms. (11 steps per ms) remains 35/91 properties
BEST_FIRST walk for 4003 steps (8 resets) in 118 ms. (33 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 88 ms. (44 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 156 ms. (25 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (8 resets) in 87 ms. (45 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 102 ms. (38 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 119 ms. (33 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4001 steps (8 resets) in 75 ms. (52 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 73 ms. (54 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 59 ms. (66 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (8 resets) in 56 ms. (70 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 60 ms. (65 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (8 resets) in 86 ms. (45 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 77 ms. (51 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 68 ms. (58 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 93 ms. (42 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 76 ms. (51 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 80 ms. (49 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 78 ms. (50 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 99 ms. (40 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 92 ms. (43 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 73 ms. (54 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 93 ms. (42 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 76 ms. (51 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 94 ms. (42 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 89 ms. (44 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 87 ms. (45 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 110 ms. (36 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (8 resets) in 91 ms. (43 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (8 resets) in 74 ms. (53 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 67 ms. (58 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (8 resets) in 65 ms. (60 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 73 ms. (54 steps per ms) remains 34/34 properties
[2024-06-01 15:17:13] [INFO ] Flow matrix only has 2604 transitions (discarded 40 similar events)
// Phase 1: matrix 2604 rows 957 cols
[2024-06-01 15:17:14] [INFO ] Computed 53 invariants in 79 ms
[2024-06-01 15:17:14] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp83 is UNSAT
Problem AtomicPropp84 is UNSAT
At refinement iteration 2 (OVERLAPS) 182/566 variables, 15/17 constraints. Problems are: Problem set: 7 solved, 27 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/566 variables, 2/19 constraints. Problems are: Problem set: 7 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 0/19 constraints. Problems are: Problem set: 7 solved, 27 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp87 is UNSAT
Problem AtomicPropp88 is UNSAT
Problem AtomicPropp90 is UNSAT
Problem AtomicPropp92 is UNSAT
At refinement iteration 5 (OVERLAPS) 374/940 variables, 23/42 constraints. Problems are: Problem set: 30 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/940 variables, 0/42 constraints. Problems are: Problem set: 30 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/941 variables, 1/43 constraints. Problems are: Problem set: 30 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/941 variables, 0/43 constraints. Problems are: Problem set: 30 solved, 4 unsolved
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp54 is UNSAT
At refinement iteration 9 (OVERLAPS) 16/957 variables, 10/53 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/957 variables, 0/53 constraints. Problems are: Problem set: 32 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3561/3561 variables, and 1010 constraints, problems are : Problem set: 32 solved, 2 unsolved in 5022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 957/957 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 34/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 32 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 60/70 variables, 2/2 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/90 variables, 5/7 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/7 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 172/262 variables, 4/11 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/11 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 668/930 variables, 22/33 constraints. Problems are: Problem set: 32 solved, 2 unsolved
[2024-06-01 15:17:20] [INFO ] Deduced a trap composed of 84 places in 368 ms of which 38 ms to minimize.
[2024-06-01 15:17:21] [INFO ] Deduced a trap composed of 84 places in 345 ms of which 4 ms to minimize.
[2024-06-01 15:17:21] [INFO ] Deduced a trap composed of 84 places in 261 ms of which 3 ms to minimize.
[2024-06-01 15:17:21] [INFO ] Deduced a trap composed of 84 places in 184 ms of which 2 ms to minimize.
[2024-06-01 15:17:21] [INFO ] Deduced a trap composed of 84 places in 147 ms of which 2 ms to minimize.
[2024-06-01 15:17:21] [INFO ] Deduced a trap composed of 84 places in 229 ms of which 2 ms to minimize.
[2024-06-01 15:17:22] [INFO ] Deduced a trap composed of 84 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:17:22] [INFO ] Deduced a trap composed of 84 places in 59 ms of which 3 ms to minimize.
[2024-06-01 15:17:22] [INFO ] Deduced a trap composed of 84 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/930 variables, 9/42 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/930 variables, 0/42 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 6/936 variables, 6/48 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/936 variables, 0/48 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 19/955 variables, 13/61 constraints. Problems are: Problem set: 32 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/955 variables, 0/61 constraints. Problems are: Problem set: 32 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3559/3561 variables, and 1016 constraints, problems are : Problem set: 32 solved, 2 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 955/957 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/33 constraints, Known Traps: 9/9 constraints]
After SMT, in 10941ms problems are : Problem set: 32 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 957 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 957/957 places, 2644/2644 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 953 transition count 2564
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 164 place count 873 transition count 2564
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 120 Pre rules applied. Total rules applied 164 place count 873 transition count 2444
Deduced a syphon composed of 120 places in 3 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 404 place count 753 transition count 2444
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 410 place count 747 transition count 2438
Iterating global reduction 2 with 6 rules applied. Total rules applied 416 place count 747 transition count 2438
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 616 place count 647 transition count 2338
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 2 with 27 rules applied. Total rules applied 643 place count 647 transition count 2311
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 670 place count 620 transition count 2311
Applied a total of 670 rules in 402 ms. Remains 620 /957 variables (removed 337) and now considering 2311/2644 (removed 333) transitions.
Running 2307 sub problems to find dead transitions.
[2024-06-01 15:17:25] [INFO ] Flow matrix only has 2271 transitions (discarded 40 similar events)
// Phase 1: matrix 2271 rows 620 cols
[2024-06-01 15:17:25] [INFO ] Computed 49 invariants in 57 ms
[2024-06-01 15:17:25] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/616 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/616 variables, 30/45 constraints. Problems are: Problem set: 0 solved, 2307 unsolved
[2024-06-01 15:18:00] [INFO ] Deduced a trap composed of 23 places in 593 ms of which 5 ms to minimize.
[2024-06-01 15:18:01] [INFO ] Deduced a trap composed of 51 places in 702 ms of which 5 ms to minimize.
[2024-06-01 15:18:02] [INFO ] Deduced a trap composed of 52 places in 496 ms of which 4 ms to minimize.
[2024-06-01 15:18:02] [INFO ] Deduced a trap composed of 272 places in 462 ms of which 3 ms to minimize.
[2024-06-01 15:18:02] [INFO ] Deduced a trap composed of 50 places in 257 ms of which 2 ms to minimize.
[2024-06-01 15:18:03] [INFO ] Deduced a trap composed of 51 places in 242 ms of which 2 ms to minimize.
[2024-06-01 15:18:03] [INFO ] Deduced a trap composed of 39 places in 234 ms of which 2 ms to minimize.
SMT process timed out in 38079ms, After SMT, problems are : Problem set: 0 solved, 2307 unsolved
Search for dead transitions found 0 dead transitions in 38134ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38557 ms. Remains : 620/957 places, 2311/2644 transitions.
RANDOM walk for 40000 steps (11 resets) in 951 ms. (42 steps per ms) remains 0/2 properties
Successfully simplified 32 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBLF-PT-S04J06T10-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:18:03] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 15:18:03] [INFO ] Flatten gal took : 129 ms
[2024-06-01 15:18:03] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBLF-PT-S04J06T10-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:18:04] [INFO ] Flatten gal took : 140 ms
FORMULA PolyORBLF-PT-S04J06T10-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:18:04] [INFO ] Input system was already deterministic with 2644 transitions.
Support contains 672 out of 957 places (down from 693) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 957/957 places, 2644/2644 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 953 transition count 2644
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 943 transition count 2634
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 943 transition count 2634
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 933 transition count 2624
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 933 transition count 2624
Applied a total of 44 rules in 87 ms. Remains 933 /957 variables (removed 24) and now considering 2624/2644 (removed 20) transitions.
Running 2620 sub problems to find dead transitions.
[2024-06-01 15:18:04] [INFO ] Flow matrix only has 2584 transitions (discarded 40 similar events)
// Phase 1: matrix 2584 rows 933 cols
[2024-06-01 15:18:04] [INFO ] Computed 49 invariants in 48 ms
[2024-06-01 15:18:04] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/929 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2620 unsolved
SMT process timed out in 35890ms, After SMT, problems are : Problem set: 0 solved, 2620 unsolved
Search for dead transitions found 0 dead transitions in 35940ms
Finished structural reductions in LTL mode , in 1 iterations and 36039 ms. Remains : 933/957 places, 2624/2644 transitions.
[2024-06-01 15:18:40] [INFO ] Flatten gal took : 89 ms
[2024-06-01 15:18:40] [INFO ] Flatten gal took : 107 ms
[2024-06-01 15:18:41] [INFO ] Input system was already deterministic with 2624 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 957/957 places, 2644/2644 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 953 transition count 2554
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 863 transition count 2554
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 180 place count 863 transition count 2504
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 280 place count 813 transition count 2504
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 286 place count 807 transition count 2498
Iterating global reduction 2 with 6 rules applied. Total rules applied 292 place count 807 transition count 2498
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 492 place count 707 transition count 2398
Applied a total of 492 rules in 190 ms. Remains 707 /957 variables (removed 250) and now considering 2398/2644 (removed 246) transitions.
Running 2394 sub problems to find dead transitions.
[2024-06-01 15:18:41] [INFO ] Flow matrix only has 2358 transitions (discarded 40 similar events)
// Phase 1: matrix 2358 rows 707 cols
[2024-06-01 15:18:41] [INFO ] Computed 49 invariants in 34 ms
[2024-06-01 15:18:41] [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/703 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2394 unsolved
SMT process timed out in 34268ms, After SMT, problems are : Problem set: 0 solved, 2394 unsolved
Search for dead transitions found 0 dead transitions in 34291ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 34485 ms. Remains : 707/957 places, 2398/2644 transitions.
[2024-06-01 15:19:17] [INFO ] Flatten gal took : 1353 ms
[2024-06-01 15:19:18] [INFO ] Flatten gal took : 731 ms
[2024-06-01 15:19:22] [INFO ] Input system was already deterministic with 2398 transitions.
RANDOM walk for 166 steps (0 resets) in 84 ms. (1 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-PT-S04J06T10-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 957/957 places, 2644/2644 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 953 transition count 2644
Applied a total of 4 rules in 498 ms. Remains 953 /957 variables (removed 4) and now considering 2644/2644 (removed 0) transitions.
Running 2640 sub problems to find dead transitions.
[2024-06-01 15:19:24] [INFO ] Flow matrix only has 2604 transitions (discarded 40 similar events)
// Phase 1: matrix 2604 rows 953 cols
[2024-06-01 15:19:24] [INFO ] Computed 49 invariants in 101 ms
[2024-06-01 15:19:25] [INFO ] State equation strengthened by 200 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 : PolyORBLF-PT-S04J06T10-CTLFireability-2024-00
Could not compute solution for formula : PolyORBLF-PT-S04J06T10-CTLFireability-2024-01
Could not compute solution for formula : PolyORBLF-PT-S04J06T10-CTLFireability-2024-02
Could not compute solution for formula : PolyORBLF-PT-S04J06T10-CTLFireability-2024-03
Could not compute solution for formula : PolyORBLF-PT-S04J06T10-CTLFireability-2024-04
Could not compute solution for formula : PolyORBLF-PT-S04J06T10-CTLFireability-2024-05
Could not compute solution for formula : PolyORBLF-PT-S04J06T10-CTLFireability-2024-06
Could not compute solution for formula : PolyORBLF-PT-S04J06T10-CTLFireability-2024-07
Could not compute solution for formula : PolyORBLF-PT-S04J06T10-CTLFireability-2024-08
Could not compute solution for formula : PolyORBLF-PT-S04J06T10-CTLFireability-2024-09
Could not compute solution for formula : PolyORBLF-PT-S04J06T10-CTLFireability-2024-10
Could not compute solution for formula : PolyORBLF-PT-S04J06T10-CTLFireability-2024-11
Could not compute solution for formula : PolyORBLF-PT-S04J06T10-CTLFireability-2024-12
Could not compute solution for formula : PolyORBLF-PT-S04J06T10-CTLFireability-2024-13
Could not compute solution for formula : PolyORBLF-PT-S04J06T10-CTLFireability-2024-14
Could not compute solution for formula : PolyORBLF-PT-S04J06T10-CTLFireability-2024-15

BK_STOP 1717255172939

--------------------
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-S04J06T10-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/601/ctl_0_
ctl formula name PolyORBLF-PT-S04J06T10-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/601/ctl_1_
ctl formula name PolyORBLF-PT-S04J06T10-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/601/ctl_2_
ctl formula name PolyORBLF-PT-S04J06T10-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/601/ctl_3_
ctl formula name PolyORBLF-PT-S04J06T10-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/601/ctl_4_
ctl formula name PolyORBLF-PT-S04J06T10-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/601/ctl_5_
ctl formula name PolyORBLF-PT-S04J06T10-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/601/ctl_6_
ctl formula name PolyORBLF-PT-S04J06T10-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/601/ctl_7_
ctl formula name PolyORBLF-PT-S04J06T10-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/601/ctl_8_
ctl formula name PolyORBLF-PT-S04J06T10-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/601/ctl_9_
ctl formula name PolyORBLF-PT-S04J06T10-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/601/ctl_10_
ctl formula name PolyORBLF-PT-S04J06T10-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/601/ctl_11_
ctl formula name PolyORBLF-PT-S04J06T10-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/601/ctl_12_
ctl formula name PolyORBLF-PT-S04J06T10-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/601/ctl_13_
ctl formula name PolyORBLF-PT-S04J06T10-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/601/ctl_14_
ctl formula name PolyORBLF-PT-S04J06T10-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/601/ctl_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S04J06T10"
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-S04J06T10, 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-171654446800306"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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