fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r290-tajo-171654446800313
Last Updated
July 7, 2024

About the Execution of ITS-Tools for PolyORBLF-PT-S06J04T04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 160011.00 0.00 0.00 ?FFTF?TFF????T?? normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446800313.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 itstools
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 r290-tajo-171654446800313
=====================================================================

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

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J04T04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-28 18:05:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 18:05:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 18:05:25] [INFO ] Load time of PNML (sax parser for PT used): 409 ms
[2024-05-28 18:05:25] [INFO ] Transformed 454 places.
[2024-05-28 18:05:25] [INFO ] Transformed 6994 transitions.
[2024-05-28 18:05:25] [INFO ] Parsed PT model containing 454 places and 6994 transitions and 59152 arcs in 620 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 32 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 128 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 18:05:25] [INFO ] Flow matrix only has 1585 transitions (discarded 24 similar events)
// Phase 1: matrix 1585 rows 449 cols
[2024-05-28 18:05:26] [INFO ] Computed 50 invariants in 82 ms
[2024-05-28 18:05:26] [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 18:05:55] [INFO ] Deduced a trap composed of 106 places in 352 ms of which 21 ms to minimize.
[2024-05-28 18:05:55] [INFO ] Deduced a trap composed of 102 places in 397 ms of which 3 ms to minimize.
[2024-05-28 18:05:56] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 6 ms to minimize.
[2024-05-28 18:05:56] [INFO ] Deduced a trap composed of 199 places in 227 ms of which 2 ms to minimize.
[2024-05-28 18:05:56] [INFO ] Deduced a trap composed of 207 places in 236 ms of which 11 ms to minimize.
[2024-05-28 18:05:57] [INFO ] Deduced a trap composed of 47 places in 178 ms of which 1 ms to minimize.
[2024-05-28 18:05:57] [INFO ] Deduced a trap composed of 198 places in 224 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 437/2034 variables, and 44 constraints, problems are : Problem set: 0 solved, 1603 unsolved in 20135 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: 7/7 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, 7/44 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
[2024-05-28 18:06:09] [INFO ] Deduced a trap composed of 182 places in 255 ms of which 4 ms to minimize.
[2024-05-28 18:06:11] [INFO ] Deduced a trap composed of 77 places in 286 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 437/2034 variables, and 46 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: 9/9 constraints]
After SMT, in 56120ms problems are : Problem set: 0 solved, 1603 unsolved
Search for dead transitions found 0 dead transitions in 56162ms
[2024-05-28 18:06:22] [INFO ] Flow matrix only has 1585 transitions (discarded 24 similar events)
[2024-05-28 18:06:22] [INFO ] Invariant cache hit.
[2024-05-28 18:06:22] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-28 18:06:22] [INFO ] Flow matrix only has 1585 transitions (discarded 24 similar events)
[2024-05-28 18:06:22] [INFO ] Invariant cache hit.
[2024-05-28 18:06:23] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 18:06:27] [INFO ] Implicit Places using invariants and state equation in 4908 ms returned []
Implicit Place search using SMT with State Equation took 5181 ms to find 0 implicit places.
Running 1603 sub problems to find dead transitions.
[2024-05-28 18:06:27] [INFO ] Flow matrix only has 1585 transitions (discarded 24 similar events)
[2024-05-28 18:06:27] [INFO ] Invariant cache hit.
[2024-05-28 18:06:27] [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 18:06:53] [INFO ] Deduced a trap composed of 106 places in 281 ms of which 2 ms to minimize.
[2024-05-28 18:06:53] [INFO ] Deduced a trap composed of 102 places in 236 ms of which 2 ms to minimize.
[2024-05-28 18:06:54] [INFO ] Deduced a trap composed of 61 places in 201 ms of which 2 ms to minimize.
[2024-05-28 18:06:54] [INFO ] Deduced a trap composed of 11 places in 260 ms of which 2 ms to minimize.
[2024-05-28 18:06:55] [INFO ] Deduced a trap composed of 210 places in 310 ms of which 3 ms to minimize.
[2024-05-28 18:06:55] [INFO ] Deduced a trap composed of 47 places in 286 ms of which 2 ms to minimize.
[2024-05-28 18:06:56] [INFO ] Deduced a trap composed of 201 places in 291 ms of which 3 ms to minimize.
[2024-05-28 18:07:00] [INFO ] Deduced a trap composed of 198 places in 237 ms of which 2 ms to minimize.
[2024-05-28 18:07:02] [INFO ] Deduced a trap composed of 77 places in 269 ms of which 2 ms to minimize.
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 30032 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
SMT process timed out in 74921ms, After SMT, problems are : Problem set: 0 solved, 1603 unsolved
Search for dead transitions found 0 dead transitions in 74955ms
Starting structural reductions in LTL mode, iteration 1 : 449/454 places, 1609/1614 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 136492 ms. Remains : 449/454 places, 1609/1614 transitions.
Support contains 237 out of 449 places after structural reductions.
[2024-05-28 18:07:42] [INFO ] Flatten gal took : 242 ms
[2024-05-28 18:07:42] [INFO ] Flatten gal took : 192 ms
[2024-05-28 18:07:43] [INFO ] Input system was already deterministic with 1609 transitions.
Support contains 236 out of 449 places (down from 237) after GAL structural reductions.
RANDOM walk for 40000 steps (211 resets) in 2445 ms. (16 steps per ms) remains 53/86 properties
BEST_FIRST walk for 4002 steps (18 resets) in 67 ms. (58 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (14 resets) in 30 ms. (129 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (11 resets) in 30 ms. (129 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (20 resets) in 56 ms. (70 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (16 resets) in 32 ms. (121 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (13 resets) in 38 ms. (102 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (16 resets) in 50 ms. (78 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (19 resets) in 51 ms. (76 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (14 resets) in 31 ms. (125 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (14 resets) in 27 ms. (142 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (29 resets) in 37 ms. (105 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (14 resets) in 31 ms. (125 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (14 resets) in 25 ms. (153 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (16 resets) in 27 ms. (142 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (15 resets) in 33 ms. (117 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (18 resets) in 26 ms. (148 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4000 steps (112 resets) in 28 ms. (137 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (10 resets) in 65 ms. (60 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4000 steps (13 resets) in 26 ms. (148 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (16 resets) in 25 ms. (153 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (15 resets) in 46 ms. (85 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 4002 steps (15 resets) in 24 ms. (160 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (13 resets) in 23 ms. (166 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (14 resets) in 29 ms. (133 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (16 resets) in 34 ms. (114 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (16 resets) in 25 ms. (153 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (19 resets) in 25 ms. (153 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (16 resets) in 30 ms. (129 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (14 resets) in 23 ms. (166 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (14 resets) in 50 ms. (78 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (17 resets) in 40 ms. (97 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (19 resets) in 42 ms. (93 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (12 resets) in 24 ms. (160 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (16 resets) in 23 ms. (166 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (17 resets) in 25 ms. (154 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (14 resets) in 26 ms. (148 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (16 resets) in 24 ms. (160 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (14 resets) in 24 ms. (160 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (15 resets) in 27 ms. (142 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (13 resets) in 28 ms. (138 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (17 resets) in 37 ms. (105 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (14 resets) in 24 ms. (160 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (9 resets) in 45 ms. (86 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (17 resets) in 26 ms. (148 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (12 resets) in 36 ms. (108 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (14 resets) in 31 ms. (125 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (17 resets) in 27 ms. (142 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (9 resets) in 24 ms. (160 steps per ms) remains 53/53 properties
[2024-05-28 18:07:44] [INFO ] Flow matrix only has 1585 transitions (discarded 24 similar events)
[2024-05-28 18:07:44] [INFO ] Invariant cache hit.
[2024-05-28 18:07:44] [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 2034/2034 variables, and 499 constraints, problems are : Problem set: 52 solved, 1 unsolved in 1506 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/2034 variables, and 32 constraints, problems are : Problem set: 53 solved, 0 unsolved in 155 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 1783ms 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 18:07:46] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-28 18:07:46] [INFO ] Flatten gal took : 96 ms
[2024-05-28 18:07:46] [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 18:07:46] [INFO ] Flatten gal took : 98 ms
[2024-05-28 18:07:47] [INFO ] Input system was already deterministic with 1609 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, 1609/1609 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 1579
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 1579
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 1531
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 156 place count 365 transition count 1531
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 2 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 1486
Applied a total of 246 rules in 175 ms. Remains 320 /449 variables (removed 129) and now considering 1486/1609 (removed 123) transitions.
Running 1480 sub problems to find dead transitions.
[2024-05-28 18:07:47] [INFO ] Flow matrix only has 1462 transitions (discarded 24 similar events)
// Phase 1: matrix 1462 rows 320 cols
[2024-05-28 18:07:47] [INFO ] Computed 44 invariants in 25 ms
[2024-05-28 18:07:47] [INFO ] State equation strengthened by 112 read => feed constraints.

BK_STOP 1716919683747

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
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 itstools"
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 r290-tajo-171654446800313"
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 ;