Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r333-tall-171679078400425.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is SafeBus-PT-10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r333-tall-171679078400425
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 21K Apr 12 15:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 147K Apr 12 15:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 145K Apr 12 15:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 605K Apr 12 15:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.4K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 79K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 245K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 25K Apr 12 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 218K Apr 12 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 989K Apr 12 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.1K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.2M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716856789229

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 00:39:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 00:39:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 00:39:50] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2024-05-28 00:39:50] [INFO ] Transformed 316 places.
[2024-05-28 00:39:50] [INFO ] Transformed 1631 transitions.
[2024-05-28 00:39:50] [INFO ] Found NUPN structural information;
[2024-05-28 00:39:50] [INFO ] Parsed PT model containing 316 places and 1631 transitions and 11384 arcs in 289 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 21 ms.
Reduce places removed 10 places and 0 transitions.
Support contains 288 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 22 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2024-05-28 00:39:50] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-05-28 00:39:50] [INFO ] Computed 45 invariants in 33 ms
[2024-05-28 00:39:51] [INFO ] Implicit Places using invariants in 460 ms returned []
[2024-05-28 00:39:51] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-05-28 00:39:51] [INFO ] Invariant cache hit.
[2024-05-28 00:39:51] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-28 00:39:52] [INFO ] Implicit Places using invariants and state equation in 764 ms returned []
Implicit Place search using SMT with State Equation took 1255 ms to find 0 implicit places.
Running 1621 sub problems to find dead transitions.
[2024-05-28 00:39:52] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-05-28 00:39:52] [INFO ] Invariant cache hit.
[2024-05-28 00:39:52] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 1621 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1621 unsolved
Problem TDEAD91 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1090 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2024-05-28 00:40:06] [INFO ] Deduced a trap composed of 41 places in 331 ms of which 21 ms to minimize.
[2024-05-28 00:40:16] [INFO ] Deduced a trap composed of 21 places in 252 ms of which 3 ms to minimize.
[2024-05-28 00:40:16] [INFO ] Deduced a trap composed of 21 places in 235 ms of which 2 ms to minimize.
[2024-05-28 00:40:16] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 3 ms to minimize.
[2024-05-28 00:40:17] [INFO ] Deduced a trap composed of 21 places in 260 ms of which 2 ms to minimize.
[2024-05-28 00:40:17] [INFO ] Deduced a trap composed of 30 places in 236 ms of which 2 ms to minimize.
[2024-05-28 00:40:17] [INFO ] Deduced a trap composed of 30 places in 210 ms of which 3 ms to minimize.
[2024-05-28 00:40:17] [INFO ] Deduced a trap composed of 31 places in 235 ms of which 2 ms to minimize.
[2024-05-28 00:40:17] [INFO ] Deduced a trap composed of 30 places in 234 ms of which 2 ms to minimize.
[2024-05-28 00:40:18] [INFO ] Deduced a trap composed of 21 places in 233 ms of which 1 ms to minimize.
[2024-05-28 00:40:19] [INFO ] Deduced a trap composed of 49 places in 207 ms of which 2 ms to minimize.
[2024-05-28 00:40:19] [INFO ] Deduced a trap composed of 41 places in 214 ms of which 2 ms to minimize.
[2024-05-28 00:40:19] [INFO ] Deduced a trap composed of 49 places in 234 ms of which 2 ms to minimize.
[2024-05-28 00:40:20] [INFO ] Deduced a trap composed of 49 places in 232 ms of which 2 ms to minimize.
[2024-05-28 00:40:20] [INFO ] Deduced a trap composed of 49 places in 220 ms of which 2 ms to minimize.
[2024-05-28 00:40:23] [INFO ] Deduced a trap composed of 38 places in 212 ms of which 2 ms to minimize.
[2024-05-28 00:40:23] [INFO ] Deduced a trap composed of 51 places in 240 ms of which 2 ms to minimize.
[2024-05-28 00:40:23] [INFO ] Deduced a trap composed of 37 places in 233 ms of which 2 ms to minimize.
[2024-05-28 00:40:24] [INFO ] Deduced a trap composed of 39 places in 219 ms of which 2 ms to minimize.
[2024-05-28 00:40:24] [INFO ] Deduced a trap composed of 38 places in 226 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 371 constraints, problems are : Problem set: 100 solved, 1521 unsolved in 30047 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1621/1621 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 100 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2024-05-28 00:40:40] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 2 ms to minimize.
[2024-05-28 00:40:40] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 2 ms to minimize.
[2024-05-28 00:40:40] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 2 ms to minimize.
[2024-05-28 00:40:40] [INFO ] Deduced a trap composed of 49 places in 142 ms of which 1 ms to minimize.
[2024-05-28 00:40:40] [INFO ] Deduced a trap composed of 53 places in 157 ms of which 2 ms to minimize.
[2024-05-28 00:40:44] [INFO ] Deduced a trap composed of 37 places in 251 ms of which 2 ms to minimize.
[2024-05-28 00:40:44] [INFO ] Deduced a trap composed of 37 places in 232 ms of which 2 ms to minimize.
[2024-05-28 00:40:44] [INFO ] Deduced a trap composed of 44 places in 235 ms of which 2 ms to minimize.
[2024-05-28 00:40:44] [INFO ] Deduced a trap composed of 37 places in 232 ms of which 2 ms to minimize.
[2024-05-28 00:40:45] [INFO ] Deduced a trap composed of 35 places in 247 ms of which 3 ms to minimize.
[2024-05-28 00:40:45] [INFO ] Deduced a trap composed of 57 places in 154 ms of which 2 ms to minimize.
[2024-05-28 00:40:45] [INFO ] Deduced a trap composed of 49 places in 147 ms of which 2 ms to minimize.
[2024-05-28 00:40:45] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 1 ms to minimize.
[2024-05-28 00:40:45] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 2 ms to minimize.
[2024-05-28 00:40:46] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 2 ms to minimize.
[2024-05-28 00:40:46] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 1 ms to minimize.
[2024-05-28 00:40:46] [INFO ] Deduced a trap composed of 49 places in 88 ms of which 1 ms to minimize.
[2024-05-28 00:40:46] [INFO ] Deduced a trap composed of 70 places in 158 ms of which 2 ms to minimize.
[2024-05-28 00:40:46] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 2 ms to minimize.
[2024-05-28 00:40:46] [INFO ] Deduced a trap composed of 69 places in 217 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 20/391 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 391 constraints, problems are : Problem set: 100 solved, 1521 unsolved in 30031 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1621 constraints, Known Traps: 40/40 constraints]
After SMT, in 64334ms problems are : Problem set: 100 solved, 1521 unsolved
Search for dead transitions found 100 dead transitions in 64369ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions
Starting structural reductions in LTL mode, iteration 1 : 306/306 places, 1531/1631 transitions.
Applied a total of 0 rules in 7 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65693 ms. Remains : 306/306 places, 1531/1631 transitions.
Support contains 288 out of 306 places after structural reductions.
[2024-05-28 00:40:56] [INFO ] Flatten gal took : 156 ms
[2024-05-28 00:40:56] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SafeBus-PT-10-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 00:40:56] [INFO ] Flatten gal took : 105 ms
[2024-05-28 00:40:57] [INFO ] Input system was already deterministic with 1531 transitions.
FORMULA SafeBus-PT-10-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 3005 ms. (13 steps per ms) remains 22/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 88 ms. (44 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
[2024-05-28 00:40:58] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-05-28 00:40:58] [INFO ] Computed 45 invariants in 11 ms
[2024-05-28 00:40:58] [INFO ] State equation strengthened by 111 read => feed constraints.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 262/262 constraints. Problems are: Problem set: 16 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/262 variables, 0/262 constraints. Problems are: Problem set: 16 solved, 5 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp34 is UNSAT
At refinement iteration 2 (OVERLAPS) 21/283 variables, 22/284 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 21/305 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 10/315 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/315 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 20/303 variables, 11/326 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 20/346 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 0/346 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/304 variables, 1/347 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/304 variables, 1/348 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/304 variables, 0/348 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 641/945 variables, 304/652 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/945 variables, 110/762 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/945 variables, 0/762 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/948 variables, 2/764 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/948 variables, 2/766 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/948 variables, 1/767 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/948 variables, 1/768 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/948 variables, 0/768 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/948 variables, 0/768 constraints. Problems are: Problem set: 20 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 948/948 variables, and 768 constraints, problems are : Problem set: 20 solved, 1 unsolved in 401 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 306/306 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 230/240 variables, 10/20 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 230/250 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/250 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/261 variables, 11/261 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 21/282 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 0/282 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/262 variables, 1/283 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 1/284 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 0/284 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 41/303 variables, 21/305 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/303 variables, 41/346 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/303 variables, 0/346 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/304 variables, 1/347 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/304 variables, 1/348 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/304 variables, 0/348 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 641/945 variables, 304/652 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/945 variables, 110/762 constraints. Problems are: Problem set: 20 solved, 1 unsolved
Problem AtomicPropp8 is UNSAT
After SMT solving in domain Int declared 945/948 variables, and 763 constraints, problems are : Problem set: 21 solved, 0 unsolved in 579 ms.
Refiners :[Domain max(s): 304/306 constraints, Positive P Invariants (semi-flows): 23/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 304/306 constraints, ReadFeed: 110/111 constraints, PredecessorRefiner: 1/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 1164ms problems are : Problem set: 21 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 21 atomic propositions for a total of 14 simplifications.
FORMULA SafeBus-PT-10-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 00:40:59] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-28 00:40:59] [INFO ] Flatten gal took : 91 ms
FORMULA SafeBus-PT-10-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-10-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 00:40:59] [INFO ] Flatten gal took : 76 ms
[2024-05-28 00:40:59] [INFO ] Input system was already deterministic with 1531 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 28 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 306/306 places, 1531/1531 transitions.
[2024-05-28 00:41:00] [INFO ] Flatten gal took : 61 ms
[2024-05-28 00:41:00] [INFO ] Flatten gal took : 66 ms
[2024-05-28 00:41:00] [INFO ] Input system was already deterministic with 1531 transitions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 10 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 306/306 places, 1531/1531 transitions.
[2024-05-28 00:41:00] [INFO ] Flatten gal took : 60 ms
[2024-05-28 00:41:00] [INFO ] Flatten gal took : 64 ms
[2024-05-28 00:41:00] [INFO ] Input system was already deterministic with 1531 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 234 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 235 ms. Remains : 306/306 places, 1531/1531 transitions.
[2024-05-28 00:41:00] [INFO ] Flatten gal took : 52 ms
[2024-05-28 00:41:00] [INFO ] Flatten gal took : 58 ms
[2024-05-28 00:41:00] [INFO ] Input system was already deterministic with 1531 transitions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 9 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 306/306 places, 1531/1531 transitions.
[2024-05-28 00:41:01] [INFO ] Flatten gal took : 51 ms
[2024-05-28 00:41:01] [INFO ] Flatten gal took : 56 ms
[2024-05-28 00:41:01] [INFO ] Input system was already deterministic with 1531 transitions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 9 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 306/306 places, 1531/1531 transitions.
[2024-05-28 00:41:01] [INFO ] Flatten gal took : 48 ms
[2024-05-28 00:41:01] [INFO ] Flatten gal took : 52 ms
[2024-05-28 00:41:01] [INFO ] Input system was already deterministic with 1531 transitions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 6 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 306/306 places, 1531/1531 transitions.
[2024-05-28 00:41:01] [INFO ] Flatten gal took : 47 ms
[2024-05-28 00:41:01] [INFO ] Flatten gal took : 51 ms
[2024-05-28 00:41:01] [INFO ] Input system was already deterministic with 1531 transitions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 6 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 306/306 places, 1531/1531 transitions.
[2024-05-28 00:41:01] [INFO ] Flatten gal took : 49 ms
[2024-05-28 00:41:01] [INFO ] Flatten gal took : 56 ms
[2024-05-28 00:41:01] [INFO ] Input system was already deterministic with 1531 transitions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 5 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 306/306 places, 1531/1531 transitions.
[2024-05-28 00:41:01] [INFO ] Flatten gal took : 47 ms
[2024-05-28 00:41:01] [INFO ] Flatten gal took : 53 ms
[2024-05-28 00:41:02] [INFO ] Input system was already deterministic with 1531 transitions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 5 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 306/306 places, 1531/1531 transitions.
[2024-05-28 00:41:02] [INFO ] Flatten gal took : 49 ms
[2024-05-28 00:41:02] [INFO ] Flatten gal took : 53 ms
[2024-05-28 00:41:02] [INFO ] Input system was already deterministic with 1531 transitions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 5 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 306/306 places, 1531/1531 transitions.
[2024-05-28 00:41:02] [INFO ] Flatten gal took : 47 ms
[2024-05-28 00:41:02] [INFO ] Flatten gal took : 51 ms
[2024-05-28 00:41:02] [INFO ] Input system was already deterministic with 1531 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 166 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 166 ms. Remains : 306/306 places, 1531/1531 transitions.
[2024-05-28 00:41:02] [INFO ] Flatten gal took : 49 ms
[2024-05-28 00:41:02] [INFO ] Flatten gal took : 54 ms
[2024-05-28 00:41:02] [INFO ] Input system was already deterministic with 1531 transitions.
[2024-05-28 00:41:02] [INFO ] Flatten gal took : 55 ms
[2024-05-28 00:41:02] [INFO ] Flatten gal took : 58 ms
[2024-05-28 00:41:02] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-28 00:41:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 306 places, 1531 transitions and 10404 arcs took 13 ms.
Total runtime 72668 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SafeBus-PT-10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 306
TRANSITIONS: 1531
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.047s, Sys 0.003s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.005s, 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: 685
MODEL NAME: /home/mcc/execution/413/model
306 places, 1531 transitions.

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..
No place bound informations found.
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="SafeBus-PT-10"
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 SafeBus-PT-10, 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 r333-tall-171679078400425"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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