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.r047-tajo-171620397700193.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 BridgeAndVehicles-PT-V20P10N50, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397700193
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.8M
-rw-r--r-- 1 mcc users 16K Apr 13 02:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 13 02:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 400K Apr 13 02:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M Apr 13 02:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.4K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 144K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 406K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 30K Apr 13 03:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 206K Apr 13 03:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 227K Apr 13 03:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 886K Apr 13 03:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.8M May 18 16:42 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 BridgeAndVehicles-PT-V20P10N50-CTLCardinality-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716284958405

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V20P10N50
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 09:49:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 09:49:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 09:49:20] [INFO ] Load time of PNML (sax parser for PT used): 190 ms
[2024-05-21 09:49:20] [INFO ] Transformed 108 places.
[2024-05-21 09:49:20] [INFO ] Transformed 2228 transitions.
[2024-05-21 09:49:20] [INFO ] Parsed PT model containing 108 places and 2228 transitions and 17190 arcs in 345 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Support contains 58 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Applied a total of 0 rules in 32 ms. Remains 108 /108 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Running 2225 sub problems to find dead transitions.
[2024-05-21 09:49:20] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2024-05-21 09:49:20] [INFO ] Computed 7 invariants in 20 ms
[2024-05-21 09:49:20] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-21 09:49:42] [INFO ] Deduced a trap composed of 5 places in 322 ms of which 18 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 106/398 variables, and 6 constraints, problems are : Problem set: 0 solved, 2225 unsolved in 20106 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/108 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2225/2225 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-21 09:50:11] [INFO ] Deduced a trap composed of 55 places in 204 ms of which 2 ms to minimize.
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/398 variables, and 7 constraints, problems are : Problem set: 20 solved, 2205 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/108 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2225 constraints, Known Traps: 2/2 constraints]
After SMT, in 55589ms problems are : Problem set: 20 solved, 2205 unsolved
Search for dead transitions found 20 dead transitions in 55648ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 20 transitions.
[2024-05-21 09:50:15] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
// Phase 1: matrix 289 rows 108 cols
[2024-05-21 09:50:15] [INFO ] Computed 7 invariants in 9 ms
[2024-05-21 09:50:16] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-21 09:50:16] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-05-21 09:50:16] [INFO ] Invariant cache hit.
[2024-05-21 09:50:16] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-05-21 09:50:16] [INFO ] Implicit Places using invariants and state equation in 710 ms returned []
Implicit Place search using SMT with State Equation took 994 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 108/108 places, 2208/2228 transitions.
Applied a total of 0 rules in 28 ms. Remains 108 /108 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56763 ms. Remains : 108/108 places, 2208/2228 transitions.
Support contains 58 out of 108 places after structural reductions.
[2024-05-21 09:50:17] [INFO ] Flatten gal took : 198 ms
[2024-05-21 09:50:17] [INFO ] Flatten gal took : 144 ms
[2024-05-21 09:50:17] [INFO ] Input system was already deterministic with 2208 transitions.
RANDOM walk for 40005 steps (228 resets) in 2451 ms. (16 steps per ms) remains 43/67 properties
BEST_FIRST walk for 4001 steps (8 resets) in 94 ms. (42 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 42/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 41/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (8 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (8 resets) in 36 ms. (108 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 41/41 properties
[2024-05-21 09:50:19] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-05-21 09:50:19] [INFO ] Invariant cache hit.
[2024-05-21 09:50:19] [INFO ] State equation strengthened by 101 read => feed constraints.
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp32 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 3/3 constraints. Problems are: Problem set: 17 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 17 solved, 24 unsolved
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp66 is UNSAT
At refinement iteration 2 (OVERLAPS) 63/108 variables, 4/7 constraints. Problems are: Problem set: 38 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 38 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 289/397 variables, 108/115 constraints. Problems are: Problem set: 38 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 101/216 constraints. Problems are: Problem set: 38 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/216 constraints. Problems are: Problem set: 38 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/397 variables, 0/216 constraints. Problems are: Problem set: 38 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 397/397 variables, and 216 constraints, problems are : Problem set: 38 solved, 3 unsolved in 214 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 108/108 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 38 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 38 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 45/51 variables, 1/1 constraints. Problems are: Problem set: 38 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 38 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 202/253 variables, 51/52 constraints. Problems are: Problem set: 38 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/52 constraints. Problems are: Problem set: 38 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 49/302 variables, 6/58 constraints. Problems are: Problem set: 38 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 1/59 constraints. Problems are: Problem set: 38 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/59 constraints. Problems are: Problem set: 38 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 91/393 variables, 47/106 constraints. Problems are: Problem set: 38 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 3/109 constraints. Problems are: Problem set: 38 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/393 variables, 101/210 constraints. Problems are: Problem set: 38 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/393 variables, 3/213 constraints. Problems are: Problem set: 38 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/393 variables, 0/213 constraints. Problems are: Problem set: 38 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 4/397 variables, 2/215 constraints. Problems are: Problem set: 38 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/397 variables, 4/219 constraints. Problems are: Problem set: 38 solved, 3 unsolved
[2024-05-21 09:50:20] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/397 variables, 1/220 constraints. Problems are: Problem set: 38 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/397 variables, 0/220 constraints. Problems are: Problem set: 38 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/397 variables, 0/220 constraints. Problems are: Problem set: 38 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 397/397 variables, and 220 constraints, problems are : Problem set: 38 solved, 3 unsolved in 1372 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 108/108 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 3/41 constraints, Known Traps: 1/1 constraints]
After SMT, in 1722ms problems are : Problem set: 38 solved, 3 unsolved
Parikh walk visited 0 properties in 5090 ms.
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 2208/2208 transitions.
Graph (complete) has 881 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 105 transition count 2207
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 105 transition count 2207
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 103 transition count 2206
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 101 transition count 2204
Applied a total of 10 rules in 384 ms. Remains 101 /108 variables (removed 7) and now considering 2204/2208 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 385 ms. Remains : 101/108 places, 2204/2208 transitions.
RANDOM walk for 40000 steps (320 resets) in 706 ms. (56 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (132 resets) in 316 ms. (126 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (131 resets) in 219 ms. (181 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (130 resets) in 278 ms. (143 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 215705 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 3
Probabilistic random walk after 215705 steps, saw 62251 distinct states, run finished after 3005 ms. (steps per millisecond=71 ) properties seen :0
[2024-05-21 09:50:29] [INFO ] Flow matrix only has 285 transitions (discarded 1919 similar events)
// Phase 1: matrix 285 rows 101 cols
[2024-05-21 09:50:29] [INFO ] Computed 4 invariants in 3 ms
[2024-05-21 09:50:29] [INFO ] State equation strengthened by 101 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 45/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 202/253 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 45/298 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 86/384 variables, 44/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/384 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/384 variables, 101/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/384 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/386 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/386 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/386 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 206 constraints, problems are : Problem set: 0 solved, 3 unsolved in 286 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 45/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 202/253 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 45/298 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 86/384 variables, 44/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/384 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/384 variables, 101/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/384 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/384 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/386 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/386 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/386 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 209 constraints, problems are : Problem set: 0 solved, 3 unsolved in 764 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1090ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1450 ms.
Support contains 6 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 2204/2204 transitions.
Applied a total of 0 rules in 265 ms. Remains 101 /101 variables (removed 0) and now considering 2204/2204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 265 ms. Remains : 101/101 places, 2204/2204 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 2204/2204 transitions.
Applied a total of 0 rules in 208 ms. Remains 101 /101 variables (removed 0) and now considering 2204/2204 (removed 0) transitions.
[2024-05-21 09:50:32] [INFO ] Flow matrix only has 285 transitions (discarded 1919 similar events)
[2024-05-21 09:50:32] [INFO ] Invariant cache hit.
[2024-05-21 09:50:33] [INFO ] Implicit Places using invariants in 380 ms returned []
[2024-05-21 09:50:33] [INFO ] Flow matrix only has 285 transitions (discarded 1919 similar events)
[2024-05-21 09:50:33] [INFO ] Invariant cache hit.
[2024-05-21 09:50:33] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-05-21 09:50:34] [INFO ] Implicit Places using invariants and state equation in 983 ms returned [22, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1374 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 99/101 places, 2204/2204 transitions.
Applied a total of 0 rules in 289 ms. Remains 99 /99 variables (removed 0) and now considering 2204/2204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1872 ms. Remains : 99/101 places, 2204/2204 transitions.
RANDOM walk for 40000 steps (320 resets) in 689 ms. (57 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (132 resets) in 351 ms. (113 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (130 resets) in 288 ms. (138 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (130 resets) in 205 ms. (194 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 254294 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 3
Probabilistic random walk after 254294 steps, saw 72705 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
[2024-05-21 09:50:38] [INFO ] Flow matrix only has 285 transitions (discarded 1919 similar events)
// Phase 1: matrix 285 rows 99 cols
[2024-05-21 09:50:38] [INFO ] Computed 4 invariants in 7 ms
[2024-05-21 09:50:38] [INFO ] State equation strengthened by 101 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 45/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 202/253 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 45/298 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 84/382 variables, 42/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/382 variables, 101/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/384 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/384 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 204 constraints, problems are : Problem set: 0 solved, 3 unsolved in 235 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 99/99 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 45/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 202/253 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 45/298 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 84/382 variables, 42/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/382 variables, 101/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/384 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/384 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 207 constraints, problems are : Problem set: 0 solved, 3 unsolved in 604 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 99/99 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 869ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 3311 ms.
Support contains 6 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 2204/2204 transitions.
Applied a total of 0 rules in 175 ms. Remains 99 /99 variables (removed 0) and now considering 2204/2204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 99/99 places, 2204/2204 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 2204/2204 transitions.
Applied a total of 0 rules in 162 ms. Remains 99 /99 variables (removed 0) and now considering 2204/2204 (removed 0) transitions.
[2024-05-21 09:50:42] [INFO ] Flow matrix only has 285 transitions (discarded 1919 similar events)
[2024-05-21 09:50:42] [INFO ] Invariant cache hit.
[2024-05-21 09:50:42] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-05-21 09:50:42] [INFO ] Flow matrix only has 285 transitions (discarded 1919 similar events)
[2024-05-21 09:50:42] [INFO ] Invariant cache hit.
[2024-05-21 09:50:43] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-05-21 09:50:43] [INFO ] Implicit Places using invariants and state equation in 939 ms returned []
Implicit Place search using SMT with State Equation took 1280 ms to find 0 implicit places.
[2024-05-21 09:50:43] [INFO ] Redundant transitions in 152 ms returned []
Running 2201 sub problems to find dead transitions.
[2024-05-21 09:50:44] [INFO ] Flow matrix only has 285 transitions (discarded 1919 similar events)
[2024-05-21 09:50:44] [INFO ] Invariant cache hit.
[2024-05-21 09:50:44] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 99/384 variables, and 4 constraints, problems are : Problem set: 0 solved, 2201 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/99 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2201/2201 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2201 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD41 is UNSAT
At refinement iteration 2 (OVERLAPS) 285/384 variables, 99/103 constraints. Problems are: Problem set: 2 solved, 2199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 101/204 constraints. Problems are: Problem set: 2 solved, 2199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/384 variables, and 2403 constraints, problems are : Problem set: 2 solved, 2199 unsolved in 34847 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 99/99 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 2199/2201 constraints, Known Traps: 0/0 constraints]
After SMT, in 81338ms problems are : Problem set: 2 solved, 2199 unsolved
Search for dead transitions found 2 dead transitions in 81363ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 99/99 places, 2202/2204 transitions.
Applied a total of 0 rules in 191 ms. Remains 99 /99 variables (removed 0) and now considering 2202/2202 (removed 0) transitions.
[2024-05-21 09:52:05] [INFO ] Redundant transitions in 40 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 83218 ms. Remains : 99/99 places, 2202/2204 transitions.
Successfully simplified 38 atomic propositions for a total of 16 simplifications.
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 09:52:05] [INFO ] Flatten gal took : 68 ms
[2024-05-21 09:52:05] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 09:52:05] [INFO ] Flatten gal took : 74 ms
[2024-05-21 09:52:05] [INFO ] Input system was already deterministic with 2208 transitions.
Support contains 27 out of 108 places (down from 37) after GAL structural reductions.
Computed a total of 51 stabilizing places and 84 stable transitions
Graph (complete) has 3168 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 ms
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2208/2208 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 2208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 105 transition count 2207
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 105 transition count 2207
Applied a total of 4 rules in 27 ms. Remains 105 /108 variables (removed 3) and now considering 2207/2208 (removed 1) transitions.
Running 2204 sub problems to find dead transitions.
[2024-05-21 09:52:06] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
// Phase 1: matrix 288 rows 105 cols
[2024-05-21 09:52:06] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 09:52:06] [INFO ] State equation strengthened by 101 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-PT-V20P10N50

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: 108
TRANSITIONS: 2228
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.069s, Sys 0.011s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.008s, 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: 637
MODEL NAME: /home/mcc/execution/model
108 places, 2228 transitions.

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.
Building monolithic NSF...
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-2024-01 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-2024-02 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-2024-04 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-2024-06 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-2024-07 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-2024-13 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLCardinality-2024-14 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716286817827

--------------------
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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="BridgeAndVehicles-PT-V20P10N50"
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 BridgeAndVehicles-PT-V20P10N50, 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 r047-tajo-171620397700193"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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