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.r289-tajo-171654445700338.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 greatspnxred
Input is PolyORBLF-PT-S06J06T04, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445700338
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 16K Apr 11 17:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 11 17:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 221K Apr 11 17:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 855K Apr 11 17:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.5K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 113K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 341K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Apr 11 17:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 11 17:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 483K Apr 11 17:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.1M Apr 11 17:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.8K 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 6.9M 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-S06J06T04-CTLFireability-2024-00
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLFireability-2024-01
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLFireability-2024-02
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLFireability-2024-03
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLFireability-2024-04
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLFireability-2024-05
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLFireability-2024-06
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLFireability-2024-07
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLFireability-2024-08
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLFireability-2024-09
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLFireability-2024-10
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLFireability-2024-11
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLFireability-2024-12
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLFireability-2024-13
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLFireability-2024-14
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716871353605

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J06T04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 04:42:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 04:42:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 04:42:35] [INFO ] Load time of PNML (sax parser for PT used): 420 ms
[2024-05-28 04:42:35] [INFO ] Transformed 506 places.
[2024-05-28 04:42:35] [INFO ] Transformed 7154 transitions.
[2024-05-28 04:42:35] [INFO ] Parsed PT model containing 506 places and 7154 transitions and 59824 arcs in 601 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 52 ms.
[2024-05-28 04:42:35] [INFO ] Reduced 4680 identical enabling conditions.
[2024-05-28 04:42:35] [INFO ] Reduced 4680 identical enabling conditions.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Support contains 316 out of 506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 1774/1774 transitions.
Applied a total of 0 rules in 64 ms. Remains 506 /506 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
Running 1768 sub problems to find dead transitions.
[2024-05-28 04:42:36] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
// Phase 1: matrix 1750 rows 506 cols
[2024-05-28 04:42:36] [INFO ] Computed 54 invariants in 108 ms
[2024-05-28 04:42:36] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 21/41 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
[2024-05-28 04:43:07] [INFO ] Deduced a trap composed of 30 places in 391 ms of which 32 ms to minimize.
[2024-05-28 04:43:08] [INFO ] Deduced a trap composed of 226 places in 355 ms of which 4 ms to minimize.
[2024-05-28 04:43:08] [INFO ] Deduced a trap composed of 3 places in 251 ms of which 4 ms to minimize.
[2024-05-28 04:43:09] [INFO ] Deduced a trap composed of 82 places in 196 ms of which 2 ms to minimize.
[2024-05-28 04:43:09] [INFO ] Deduced a trap composed of 107 places in 210 ms of which 3 ms to minimize.
[2024-05-28 04:43:10] [INFO ] Deduced a trap composed of 11 places in 257 ms of which 2 ms to minimize.
[2024-05-28 04:43:11] [INFO ] Deduced a trap composed of 207 places in 343 ms of which 4 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 494/2256 variables, and 48 constraints, problems are : Problem set: 0 solved, 1768 unsolved in 20085 ms.
Refiners :[Positive P Invariants (semi-flows): 20/23 constraints, Generalized P Invariants (flows): 21/31 constraints, State Equation: 0/506 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1768/1768 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1768 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 21/41 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/494 variables, 7/48 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
[2024-05-28 04:43:20] [INFO ] Deduced a trap composed of 222 places in 386 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 494/2256 variables, and 49 constraints, problems are : Problem set: 0 solved, 1768 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 20/23 constraints, Generalized P Invariants (flows): 21/31 constraints, State Equation: 0/506 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1768 constraints, Known Traps: 8/8 constraints]
After SMT, in 56082ms problems are : Problem set: 0 solved, 1768 unsolved
Search for dead transitions found 0 dead transitions in 56139ms
[2024-05-28 04:43:32] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
[2024-05-28 04:43:32] [INFO ] Invariant cache hit.
[2024-05-28 04:43:32] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-05-28 04:43:32] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
[2024-05-28 04:43:32] [INFO ] Invariant cache hit.
[2024-05-28 04:43:33] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 04:43:39] [INFO ] Implicit Places using invariants and state equation in 6998 ms returned []
Implicit Place search using SMT with State Equation took 7281 ms to find 0 implicit places.
Running 1768 sub problems to find dead transitions.
[2024-05-28 04:43:39] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
[2024-05-28 04:43:39] [INFO ] Invariant cache hit.
[2024-05-28 04:43:39] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 21/41 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
[2024-05-28 04:44:09] [INFO ] Deduced a trap composed of 30 places in 386 ms of which 2 ms to minimize.
[2024-05-28 04:44:10] [INFO ] Deduced a trap composed of 215 places in 349 ms of which 3 ms to minimize.
[2024-05-28 04:44:10] [INFO ] Deduced a trap composed of 223 places in 296 ms of which 4 ms to minimize.
[2024-05-28 04:44:11] [INFO ] Deduced a trap composed of 82 places in 266 ms of which 2 ms to minimize.
[2024-05-28 04:44:11] [INFO ] Deduced a trap composed of 107 places in 270 ms of which 3 ms to minimize.
[2024-05-28 04:44:12] [INFO ] Deduced a trap composed of 208 places in 327 ms of which 3 ms to minimize.
[2024-05-28 04:44:13] [INFO ] Deduced a trap composed of 11 places in 219 ms of which 2 ms to minimize.
[2024-05-28 04:44:14] [INFO ] Deduced a trap composed of 222 places in 251 ms of which 3 ms to minimize.
[2024-05-28 04:44:15] [INFO ] Deduced a trap composed of 47 places in 203 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 494/2256 variables, and 50 constraints, problems are : Problem set: 0 solved, 1768 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 20/23 constraints, Generalized P Invariants (flows): 21/31 constraints, State Equation: 0/506 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1768/1768 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1768 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 21/41 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/494 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 494/2256 variables, and 50 constraints, problems are : Problem set: 0 solved, 1768 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 20/23 constraints, Generalized P Invariants (flows): 21/31 constraints, State Equation: 0/506 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1768 constraints, Known Traps: 9/9 constraints]
After SMT, in 77455ms problems are : Problem set: 0 solved, 1768 unsolved
Search for dead transitions found 0 dead transitions in 77496ms
Finished structural reductions in LTL mode , in 1 iterations and 141047 ms. Remains : 506/506 places, 1774/1774 transitions.
Support contains 316 out of 506 places after structural reductions.
[2024-05-28 04:44:57] [INFO ] Flatten gal took : 524 ms
[2024-05-28 04:44:58] [INFO ] Flatten gal took : 361 ms
[2024-05-28 04:44:59] [INFO ] Input system was already deterministic with 1774 transitions.
Reduction of identical properties reduced properties to check from 91 to 90
RANDOM walk for 40000 steps (180 resets) in 3440 ms. (11 steps per ms) remains 48/90 properties
BEST_FIRST walk for 4001 steps (13 resets) in 197 ms. (20 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (11 resets) in 77 ms. (51 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (16 resets) in 174 ms. (22 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (15 resets) in 62 ms. (63 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 44 ms. (88 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 52 ms. (75 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4000 steps (8 resets) in 103 ms. (38 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 93 ms. (42 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 44 ms. (88 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 49 ms. (80 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 67 ms. (58 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4000 steps (8 resets) in 58 ms. (67 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4000 steps (8 resets) in 38 ms. (102 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 61 ms. (64 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4000 steps (8 resets) in 60 ms. (65 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 81 ms. (48 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4000 steps (8 resets) in 42 ms. (93 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 50 ms. (78 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 48/48 properties
[2024-05-28 04:45:02] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
[2024-05-28 04:45:02] [INFO ] Invariant cache hit.
[2024-05-28 04:45:02] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp84 is UNSAT
Problem AtomicPropp90 is UNSAT
At refinement iteration 1 (OVERLAPS) 177/293 variables, 17/17 constraints. Problems are: Problem set: 24 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 0/17 constraints. Problems are: Problem set: 24 solved, 24 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 15/308 variables, 4/21 constraints. Problems are: Problem set: 24 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 0/21 constraints. Problems are: Problem set: 24 solved, 24 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp86 is UNSAT
Problem AtomicPropp88 is UNSAT
At refinement iteration 5 (OVERLAPS) 183/491 variables, 22/43 constraints. Problems are: Problem set: 43 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 0/43 constraints. Problems are: Problem set: 43 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 5/496 variables, 2/45 constraints. Problems are: Problem set: 43 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/45 constraints. Problems are: Problem set: 43 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 10/506 variables, 9/54 constraints. Problems are: Problem set: 43 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/506 variables, 0/54 constraints. Problems are: Problem set: 43 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1750/2256 variables, 506/560 constraints. Problems are: Problem set: 43 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2256 variables, 112/672 constraints. Problems are: Problem set: 43 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2256 variables, 0/672 constraints. Problems are: Problem set: 43 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2256/2256 variables, and 672 constraints, problems are : Problem set: 43 solved, 5 unsolved in 5023 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 506/506 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 43 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 43 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 116/127 variables, 5/5 constraints. Problems are: Problem set: 43 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/5 constraints. Problems are: Problem set: 43 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 20/147 variables, 5/10 constraints. Problems are: Problem set: 43 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/10 constraints. Problems are: Problem set: 43 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 47/194 variables, 4/14 constraints. Problems are: Problem set: 43 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/14 constraints. Problems are: Problem set: 43 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 288/482 variables, 21/35 constraints. Problems are: Problem set: 43 solved, 5 unsolved
[2024-05-28 04:45:08] [INFO ] Deduced a trap composed of 93 places in 158 ms of which 2 ms to minimize.
[2024-05-28 04:45:08] [INFO ] Deduced a trap composed of 94 places in 130 ms of which 1 ms to minimize.
[2024-05-28 04:45:08] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 3/38 constraints. Problems are: Problem set: 43 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 0/38 constraints. Problems are: Problem set: 43 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 11/493 variables, 8/46 constraints. Problems are: Problem set: 43 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/493 variables, 0/46 constraints. Problems are: Problem set: 43 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 11/504 variables, 10/56 constraints. Problems are: Problem set: 43 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/504 variables, 0/56 constraints. Problems are: Problem set: 43 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 1750/2254 variables, 504/560 constraints. Problems are: Problem set: 43 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2254/2256 variables, and 672 constraints, problems are : Problem set: 43 solved, 5 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 22/23 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 504/506 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 0/48 constraints, Known Traps: 3/3 constraints]
After SMT, in 11181ms problems are : Problem set: 43 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 11 out of 506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 506/506 places, 1774/1774 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 500 transition count 1742
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 70 place count 468 transition count 1742
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 70 place count 468 transition count 1686
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 182 place count 412 transition count 1686
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 278 place count 364 transition count 1638
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 286 place count 364 transition count 1630
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 294 place count 356 transition count 1630
Applied a total of 294 rules in 470 ms. Remains 356 /506 variables (removed 150) and now considering 1630/1774 (removed 144) transitions.
Running 1624 sub problems to find dead transitions.
[2024-05-28 04:45:13] [INFO ] Flow matrix only has 1606 transitions (discarded 24 similar events)
// Phase 1: matrix 1606 rows 356 cols
[2024-05-28 04:45:13] [INFO ] Computed 48 invariants in 57 ms
[2024-05-28 04:45:13] [INFO ] State equation strengthened by 112 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-PT-S06J06T04

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 506
TRANSITIONS: 7154
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.348s, Sys 0.027s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.049s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 657
MODEL NAME: /home/mcc/execution/model
506 places, 7154 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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

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-S06J06T04"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is PolyORBLF-PT-S06J06T04, 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 r289-tajo-171654445700338"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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