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-171654445700313.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-S06J04T04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445700313
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 13K Apr 11 17:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 11 17:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 221K Apr 11 17:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 912K Apr 11 17:32 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 8.9K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 112K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 343K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 11 17:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 17:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 291K Apr 11 17:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 11 17:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K 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.8M 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-S06J04T04-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716869856251

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J04T04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 04:17:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 04:17:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 04:17:38] [INFO ] Load time of PNML (sax parser for PT used): 468 ms
[2024-05-28 04:17:38] [INFO ] Transformed 454 places.
[2024-05-28 04:17:38] [INFO ] Transformed 6994 transitions.
[2024-05-28 04:17:38] [INFO ] Parsed PT model containing 454 places and 6994 transitions and 59152 arcs in 637 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Support contains 237 out of 454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 1614/1614 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 451 transition count 1611
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 451 transition count 1611
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 449 transition count 1609
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 449 transition count 1609
Applied a total of 10 rules in 119 ms. Remains 449 /454 variables (removed 5) and now considering 1609/1614 (removed 5) transitions.
Running 1603 sub problems to find dead transitions.
[2024-05-28 04:17:38] [INFO ] Flow matrix only has 1585 transitions (discarded 24 similar events)
// Phase 1: matrix 1585 rows 449 cols
[2024-05-28 04:17:38] [INFO ] Computed 50 invariants in 86 ms
[2024-05-28 04:17:38] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/437 variables, 22/37 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
[2024-05-28 04:18:05] [INFO ] Deduced a trap composed of 106 places in 379 ms of which 33 ms to minimize.
[2024-05-28 04:18:05] [INFO ] Deduced a trap composed of 102 places in 321 ms of which 3 ms to minimize.
[2024-05-28 04:18:06] [INFO ] Deduced a trap composed of 11 places in 254 ms of which 2 ms to minimize.
[2024-05-28 04:18:07] [INFO ] Deduced a trap composed of 199 places in 302 ms of which 3 ms to minimize.
[2024-05-28 04:18:07] [INFO ] Deduced a trap composed of 207 places in 276 ms of which 3 ms to minimize.
[2024-05-28 04:18:07] [INFO ] Deduced a trap composed of 47 places in 243 ms of which 2 ms to minimize.
[2024-05-28 04:18:08] [INFO ] Deduced a trap composed of 198 places in 287 ms of which 3 ms to minimize.
[2024-05-28 04:18:12] [INFO ] Deduced a trap composed of 183 places in 284 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 437/2034 variables, and 45 constraints, problems are : Problem set: 0 solved, 1603 unsolved in 20125 ms.
Refiners :[Positive P Invariants (semi-flows): 15/21 constraints, Generalized P Invariants (flows): 22/29 constraints, State Equation: 0/449 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1603/1603 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1603 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/437 variables, 22/37 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
[2024-05-28 04:18:18] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 2 ms to minimize.
[2024-05-28 04:18:23] [INFO ] Deduced a trap composed of 77 places in 268 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 437/2034 variables, and 47 constraints, problems are : Problem set: 0 solved, 1603 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/21 constraints, Generalized P Invariants (flows): 22/29 constraints, State Equation: 0/449 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1603 constraints, Known Traps: 10/10 constraints]
After SMT, in 55453ms problems are : Problem set: 0 solved, 1603 unsolved
Search for dead transitions found 0 dead transitions in 55501ms
[2024-05-28 04:18:33] [INFO ] Flow matrix only has 1585 transitions (discarded 24 similar events)
[2024-05-28 04:18:33] [INFO ] Invariant cache hit.
[2024-05-28 04:18:34] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-05-28 04:18:34] [INFO ] Flow matrix only has 1585 transitions (discarded 24 similar events)
[2024-05-28 04:18:34] [INFO ] Invariant cache hit.
[2024-05-28 04:18:35] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 04:18:39] [INFO ] Implicit Places using invariants and state equation in 5226 ms returned []
Implicit Place search using SMT with State Equation took 5574 ms to find 0 implicit places.
Running 1603 sub problems to find dead transitions.
[2024-05-28 04:18:39] [INFO ] Flow matrix only has 1585 transitions (discarded 24 similar events)
[2024-05-28 04:18:39] [INFO ] Invariant cache hit.
[2024-05-28 04:18:39] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/437 variables, 22/37 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
[2024-05-28 04:19:05] [INFO ] Deduced a trap composed of 106 places in 249 ms of which 2 ms to minimize.
[2024-05-28 04:19:05] [INFO ] Deduced a trap composed of 102 places in 261 ms of which 3 ms to minimize.
[2024-05-28 04:19:06] [INFO ] Deduced a trap composed of 61 places in 201 ms of which 2 ms to minimize.
[2024-05-28 04:19:06] [INFO ] Deduced a trap composed of 11 places in 250 ms of which 2 ms to minimize.
[2024-05-28 04:19:07] [INFO ] Deduced a trap composed of 210 places in 280 ms of which 2 ms to minimize.
[2024-05-28 04:19:07] [INFO ] Deduced a trap composed of 47 places in 227 ms of which 2 ms to minimize.
[2024-05-28 04:19:08] [INFO ] Deduced a trap composed of 201 places in 344 ms of which 3 ms to minimize.
[2024-05-28 04:19:13] [INFO ] Deduced a trap composed of 198 places in 264 ms of which 2 ms to minimize.
[2024-05-28 04:19:15] [INFO ] Deduced a trap composed of 77 places in 289 ms of which 3 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 437/2034 variables, and 46 constraints, problems are : Problem set: 0 solved, 1603 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 15/21 constraints, Generalized P Invariants (flows): 22/29 constraints, State Equation: 0/449 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1603/1603 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1603 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/437 variables, 22/37 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 9/46 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/437 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
Problem TDEAD35 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD63 is UNSAT
At refinement iteration 4 (OVERLAPS) 6/443 variables, 6/52 constraints. Problems are: Problem set: 3 solved, 1600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 443/2034 variables, and 52 constraints, problems are : Problem set: 3 solved, 1600 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 22/29 constraints, State Equation: 0/449 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1603 constraints, Known Traps: 9/9 constraints]
After SMT, in 75156ms problems are : Problem set: 3 solved, 1600 unsolved
Search for dead transitions found 3 dead transitions in 75189ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 449/454 places, 1606/1614 transitions.
Applied a total of 0 rules in 28 ms. Remains 449 /449 variables (removed 0) and now considering 1606/1606 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 136478 ms. Remains : 449/454 places, 1606/1614 transitions.
Support contains 237 out of 449 places after structural reductions.
[2024-05-28 04:19:55] [INFO ] Flatten gal took : 184 ms
[2024-05-28 04:19:55] [INFO ] Flatten gal took : 131 ms
[2024-05-28 04:19:55] [INFO ] Input system was already deterministic with 1606 transitions.
Support contains 236 out of 449 places (down from 237) after GAL structural reductions.
RANDOM walk for 40000 steps (221 resets) in 3400 ms. (11 steps per ms) remains 53/86 properties
BEST_FIRST walk for 4004 steps (17 resets) in 99 ms. (40 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (16 resets) in 60 ms. (65 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (14 resets) in 34 ms. (114 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (12 resets) in 45 ms. (87 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4000 steps (15 resets) in 30 ms. (129 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (20 resets) in 37 ms. (105 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (9 resets) in 56 ms. (70 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (9 resets) in 45 ms. (87 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (16 resets) in 29 ms. (133 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (18 resets) in 35 ms. (111 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (27 resets) in 28 ms. (138 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (19 resets) in 33 ms. (117 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (10 resets) in 31 ms. (125 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (15 resets) in 32 ms. (121 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (13 resets) in 31 ms. (125 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (17 resets) in 28 ms. (137 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4000 steps (112 resets) in 50 ms. (78 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (15 resets) in 41 ms. (95 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (14 resets) in 38 ms. (102 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (15 resets) in 43 ms. (90 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (21 resets) in 33 ms. (117 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (9 resets) in 41 ms. (95 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (15 resets) in 31 ms. (125 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (11 resets) in 32 ms. (121 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (24 resets) in 30 ms. (129 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (16 resets) in 28 ms. (138 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (12 resets) in 37 ms. (105 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (10 resets) in 29 ms. (133 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (10 resets) in 47 ms. (83 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (13 resets) in 36 ms. (108 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (22 resets) in 56 ms. (70 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (12 resets) in 34 ms. (114 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (15 resets) in 44 ms. (88 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (13 resets) in 47 ms. (83 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (22 resets) in 34 ms. (114 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (16 resets) in 40 ms. (97 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (21 resets) in 31 ms. (125 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (14 resets) in 32 ms. (121 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (17 resets) in 37 ms. (105 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (20 resets) in 37 ms. (105 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (13 resets) in 32 ms. (121 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (12 resets) in 33 ms. (117 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (16 resets) in 45 ms. (87 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4000 steps (12 resets) in 47 ms. (83 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (12 resets) in 36 ms. (108 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (14 resets) in 28 ms. (138 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (13 resets) in 25 ms. (153 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (13 resets) in 28 ms. (138 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4000 steps (15 resets) in 29 ms. (133 steps per ms) remains 53/53 properties
[2024-05-28 04:19:57] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
// Phase 1: matrix 1582 rows 449 cols
[2024-05-28 04:19:57] [INFO ] Computed 50 invariants in 50 ms
[2024-05-28 04:19:57] [INFO ] State equation strengthened by 112 read => feed constraints.
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp28 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 3/3 constraints. Problems are: Problem set: 5 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 48 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp80 is UNSAT
At refinement iteration 2 (OVERLAPS) 138/311 variables, 13/16 constraints. Problems are: Problem set: 26 solved, 27 unsolved
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 2/18 constraints. Problems are: Problem set: 28 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/18 constraints. Problems are: Problem set: 28 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 11/322 variables, 4/22 constraints. Problems are: Problem set: 28 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/22 constraints. Problems are: Problem set: 28 solved, 25 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp77 is UNSAT
At refinement iteration 7 (OVERLAPS) 126/448 variables, 27/49 constraints. Problems are: Problem set: 52 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 0/49 constraints. Problems are: Problem set: 52 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/449 variables, 1/50 constraints. Problems are: Problem set: 52 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/449 variables, 0/50 constraints. Problems are: Problem set: 52 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2031/2031 variables, and 499 constraints, problems are : Problem set: 52 solved, 1 unsolved in 1437 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 449/449 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 52 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 52 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 78/84 variables, 3/3 constraints. Problems are: Problem set: 52 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/3 constraints. Problems are: Problem set: 52 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/113 variables, 5/8 constraints. Problems are: Problem set: 52 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 52 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 71/184 variables, 5/13 constraints. Problems are: Problem set: 52 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/13 constraints. Problems are: Problem set: 52 solved, 1 unsolved
Problem AtomicPropp78 is UNSAT
After SMT solving in domain Int declared 426/2031 variables, and 32 constraints, problems are : Problem set: 53 solved, 0 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 13/21 constraints, Generalized P Invariants (flows): 19/29 constraints, State Equation: 0/449 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/53 constraints, Known Traps: 0/0 constraints]
After SMT, in 1724ms problems are : Problem set: 53 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 53 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 04:19:59] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-28 04:19:59] [INFO ] Flatten gal took : 80 ms
[2024-05-28 04:19:59] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 04:19:59] [INFO ] Flatten gal took : 87 ms
[2024-05-28 04:19:59] [INFO ] Input system was already deterministic with 1606 transitions.
Support contains 50 out of 449 places (down from 74) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 449/449 places, 1606/1606 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 443 transition count 1576
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 413 transition count 1576
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 60 place count 413 transition count 1528
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 156 place count 365 transition count 1528
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 246 place count 320 transition count 1483
Applied a total of 246 rules in 192 ms. Remains 320 /449 variables (removed 129) and now considering 1483/1606 (removed 123) transitions.
Running 1477 sub problems to find dead transitions.
[2024-05-28 04:19:59] [INFO ] Flow matrix only has 1459 transitions (discarded 24 similar events)
// Phase 1: matrix 1459 rows 320 cols
[2024-05-28 04:19:59] [INFO ] Computed 44 invariants in 45 ms
[2024-05-28 04:19:59] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1477 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 1477 unsolved
[2024-05-28 04:20:22] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-05-28 04:20:22] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 1 ms to minimize.
[2024-05-28 04:20:23] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1477 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 314/1779 variables, and 36 constraints, problems are : Problem set: 0 solved, 1477 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/18 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/320 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1477/1477 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1477 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1477 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 1477 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1477 unsolved
[2024-05-28 04:20:46] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1477 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1477 unsolved
SMT process timed out in 55968ms, After SMT, problems are : Problem set: 0 solved, 1477 unsolved
Search for dead transitions found 0 dead transitions in 55989ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 56188 ms. Remains : 320/449 places, 1483/1606 transitions.
[2024-05-28 04:20:55] [INFO ] Flatten gal took : 79 ms
[2024-05-28 04:20:55] [INFO ] Flatten gal took : 89 ms
[2024-05-28 04:20:56] [INFO ] Input system was already deterministic with 1483 transitions.
RANDOM walk for 428 steps (2 resets) in 15 ms. (26 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 1606/1606 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 443 transition count 1606
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 441 transition count 1604
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 441 transition count 1604
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 440 transition count 1603
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 440 transition count 1603
Applied a total of 12 rules in 48 ms. Remains 440 /449 variables (removed 9) and now considering 1603/1606 (removed 3) transitions.
Running 1597 sub problems to find dead transitions.
[2024-05-28 04:20:56] [INFO ] Flow matrix only has 1579 transitions (discarded 24 similar events)
// Phase 1: matrix 1579 rows 440 cols
[2024-05-28 04:20:56] [INFO ] Computed 44 invariants in 57 ms
[2024-05-28 04:20:56] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1597 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1597 unsolved
[2024-05-28 04:21:25] [INFO ] Deduced a trap composed of 99 places in 280 ms of which 2 ms to minimize.
[2024-05-28 04:21:26] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 1 ms to minimize.
[2024-05-28 04:21:27] [INFO ] Deduced a trap composed of 195 places in 315 ms of which 3 ms to minimize.
[2024-05-28 04:21:27] [INFO ] Deduced a trap composed of 198 places in 341 ms of which 3 ms to minimize.
[2024-05-28 04:21:28] [INFO ] Deduced a trap composed of 31 places in 253 ms of which 2 ms to minimize.
[2024-05-28 04:21:30] [INFO ] Deduced a trap composed of 179 places in 289 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 434/2019 variables, and 43 constraints, problems are : Problem set: 0 solved, 1597 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 17/21 constraints, Generalized P Invariants (flows): 20/23 constraints, State Equation: 0/440 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1597/1597 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1597 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1597 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1597 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 1597 unsolved
[2024-05-28 04:21:44] [INFO ] Deduced a trap composed of 74 places in 322 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/2019 variables, and 44 constraints, problems are : Problem set: 0 solved, 1597 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 17/21 constraints, Generalized P Invariants (flows): 20/23 constraints, State Equation: 0/440 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1597 constraints, Known Traps: 7/7 constraints]
After SMT, in 58288ms problems are : Problem set: 0 solved, 1597 unsolved
Search for dead transitions found 0 dead transitions in 58311ms
Finished structural reductions in LTL mode , in 1 iterations and 58366 ms. Remains : 440/449 places, 1603/1606 transitions.
[2024-05-28 04:21:54] [INFO ] Flatten gal took : 108 ms
[2024-05-28 04:21:54] [INFO ] Flatten gal took : 76 ms
[2024-05-28 04:21:54] [INFO ] Input system was already deterministic with 1603 transitions.
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 1606/1606 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 443 transition count 1606
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 441 transition count 1604
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 441 transition count 1604
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 440 transition count 1603
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 440 transition count 1603
Applied a total of 12 rules in 50 ms. Remains 440 /449 variables (removed 9) and now considering 1603/1606 (removed 3) transitions.
Running 1597 sub problems to find dead transitions.
[2024-05-28 04:21:54] [INFO ] Flow matrix only has 1579 transitions (discarded 24 similar events)
[2024-05-28 04:21:54] [INFO ] Invariant cache hit.
[2024-05-28 04:21:54] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1597 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1597 unsolved
[2024-05-28 04:22:23] [INFO ] Deduced a trap composed of 99 places in 363 ms of which 3 ms to minimize.
[2024-05-28 04:22:24] [INFO ] Deduced a trap composed of 12 places in 270 ms of which 1 ms to minimize.
[2024-05-28 04:22:25] [INFO ] Deduced a trap composed of 195 places in 318 ms of which 3 ms to minimize.
[2024-05-28 04:22:26] [INFO ] Deduced a trap composed of 198 places in 315 ms of which 3 ms to minimize.
[2024-05-28 04:22:28] [INFO ] Deduced a trap composed of 31 places in 213 ms of which 1 ms to minimize.
[2024-05-28 04:22:30] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 2 ms to minimize.
[2024-05-28 04:22:32] [INFO ] Deduced a trap composed of 182 places in 270 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 434/2019 variables, and 44 constraints, problems are : Problem set: 0 solved, 1597 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 17/21 constraints, Generalized P Invariants (flows): 20/23 constraints, State Equation: 0/440 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1597/1597 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1597 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1597 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1597 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 7/44 constraints. Problems are: Problem set: 0 solved, 1597 unsolved
[2024-05-28 04:22:38] [INFO ] Deduced a trap composed of 74 places in 341 ms of which 3 ms to minimize.
[2024-05-28 04:22:39] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 1 ms to minimize.
[2024-05-28 04:22:40] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 2 ms to minimize.
[2024-05-28 04:22:41] [INFO ] Deduced a trap composed of 85 places in 88 ms of which 1 ms to minimize.
[2024-05-28 04:22:43] [INFO ] Deduced a trap composed of 84 places in 82 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/2019 variables, and 49 constraints, problems are : Problem set: 0 solved, 1597 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 17/21 constraints, Generalized P Invariants (flows): 20/23 constraints, State Equation: 0/440 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1597 constraints, Known Traps: 12/12 constraints]
After SMT, in 58260ms problems are : Problem set: 0 solved, 1597 unsolved
Search for dead transitions found 0 dead transitions in 58280ms
Finished structural reductions in LTL mode , in 1 iterations and 58335 ms. Remains : 440/449 places, 1603/1606 transitions.
[2024-05-28 04:22:53] [INFO ] Flatten gal took : 117 ms
[2024-05-28 04:22:53] [INFO ] Flatten gal took : 75 ms
[2024-05-28 04:22:53] [INFO ] Input system was already deterministic with 1603 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 449/449 places, 1606/1606 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 443 transition count 1577
Reduce places removed 29 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 30 rules applied. Total rules applied 59 place count 414 transition count 1576
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 413 transition count 1576
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 60 place count 413 transition count 1528
Deduced a syphon composed of 48 places in 3 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 156 place count 365 transition count 1528
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 3 with 96 rules applied. Total rules applied 252 place count 317 transition count 1480
Applied a total of 252 rules in 148 ms. Remains 317 /449 variables (removed 132) and now considering 1480/1606 (removed 126) transitions.
Running 1474 sub problems to find dead transitions.
[2024-05-28 04:22:53] [INFO ] Flow matrix only has 1456 transitions (discarded 24 similar events)
// Phase 1: matrix 1456 rows 317 cols
[2024-05-28 04:22:53] [INFO ] Computed 44 invariants in 22 ms
[2024-05-28 04:22:53] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 19/33 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
[2024-05-28 04:23:19] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-28 04:23:19] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
[2024-05-28 04:23:27] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 311/1773 variables, and 36 constraints, problems are : Problem set: 0 solved, 1474 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 19/28 constraints, State Equation: 0/317 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1474/1474 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1474 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 19/33 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
Problem TDEAD35 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/313 variables, 2/38 constraints. Problems are: Problem set: 219 solved, 1255 unsolved
[2024-05-28 04:23:43] [INFO ] Deduced a trap composed of 52 places in 360 ms of which 2 ms to minimize.
[2024-05-28 04:23:44] [INFO ] Deduced a trap composed of 25 places in 319 ms of which 2 ms to minimize.
[2024-05-28 04:23:44] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 3/41 constraints. Problems are: Problem set: 219 solved, 1255 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/1773 variables, and 41 constraints, problems are : Problem set: 219 solved, 1255 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 19/28 constraints, State Equation: 0/317 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1474 constraints, Known Traps: 6/6 constraints]
After SMT, in 58085ms problems are : Problem set: 219 solved, 1255 unsolved
Search for dead transitions found 219 dead transitions in 58105ms
Found 219 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 219 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 219 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 317/449 places, 1261/1606 transitions.
Applied a total of 0 rules in 22 ms. Remains 317 /317 variables (removed 0) and now considering 1261/1261 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 58282 ms. Remains : 317/449 places, 1261/1606 transitions.
[2024-05-28 04:23:51] [INFO ] Flatten gal took : 52 ms
[2024-05-28 04:23:51] [INFO ] Flatten gal took : 54 ms
[2024-05-28 04:23:51] [INFO ] Input system was already deterministic with 1261 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 449/449 places, 1606/1606 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 443 transition count 1576
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 413 transition count 1576
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 60 place count 413 transition count 1529
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 154 place count 366 transition count 1529
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 2 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 252 place count 317 transition count 1480
Applied a total of 252 rules in 131 ms. Remains 317 /449 variables (removed 132) and now considering 1480/1606 (removed 126) transitions.
Running 1474 sub problems to find dead transitions.
[2024-05-28 04:23:52] [INFO ] Flow matrix only has 1456 transitions (discarded 24 similar events)
// Phase 1: matrix 1456 rows 317 cols
[2024-05-28 04:23:52] [INFO ] Computed 44 invariants in 47 ms
[2024-05-28 04:23:52] [INFO ] State equation strengthened by 112 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-PT-S06J04T04

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: 454
TRANSITIONS: 6994
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.390s, Sys 0.030s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.064s, 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: 812
MODEL NAME: /home/mcc/execution/model
454 places, 6994 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 CTLCardinality -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-S06J04T04"
export BK_EXAMINATION="CTLCardinality"
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-S06J04T04, examination is CTLCardinality"
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-171654445700313"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S06J04T04.tgz
mv PolyORBLF-PT-S06J04T04 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;