About the Execution of GreatSPN+red for BridgeAndVehicles-COL-V50P50N10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16128.720 | 2255463.00 | 7537916.00 | 416.70 | ??FF???????????? | normal |
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-171620397500090.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-COL-V50P50N10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397500090
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 8.4K Apr 13 02:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 13 02:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 13 02:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 13 02:25 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 3.9K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 13 02:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Apr 13 02:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 13 02:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 13 02:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 42K 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-COL-V50P50N10-CTLFireability-2024-00
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-CTLFireability-2024-01
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-CTLFireability-2024-02
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-CTLFireability-2024-03
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-CTLFireability-2024-04
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-CTLFireability-2024-05
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-CTLFireability-2024-06
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-CTLFireability-2024-07
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-CTLFireability-2024-08
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-CTLFireability-2024-09
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-CTLFireability-2024-10
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-CTLFireability-2024-11
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-CTLFireability-2024-12
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-CTLFireability-2024-13
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-CTLFireability-2024-14
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716278414431
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V50P50N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 08:00:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 08:00:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 08:00:16] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-21 08:00:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 08:00:17] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 649 ms
[2024-05-21 08:00:17] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 128 PT places and 114798.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 34 ms.
[2024-05-21 08:00:17] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 15 ms.
[2024-05-21 08:00:17] [INFO ] Skeletonized 4 HLPN properties in 1 ms. Removed 12 properties that had guard overlaps.
Computed a total of 12 stabilizing places and 6 stable transitions
Graph (complete) has 51 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Remains 1 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
RANDOM walk for 525 steps (0 resets) in 14 ms. (35 steps per ms) remains 0/1 properties
[2024-05-21 08:00:17] [INFO ] Flatten gal took : 21 ms
[2024-05-21 08:00:17] [INFO ] Flatten gal took : 16 ms
Arc [1:1*[(MOD (ADD $cA 1) 51)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 51) 51) 51)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 11)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-05-21 08:00:17] [INFO ] Unfolded HLPN to a Petri net with 128 places and 1328 transitions 10010 arcs in 138 ms.
[2024-05-21 08:00:17] [INFO ] Unfolded 16 HLPN properties in 3 ms.
Support contains 126 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 1328
Applied a total of 2 rules in 55 ms. Remains 126 /128 variables (removed 2) and now considering 1328/1328 (removed 0) transitions.
Running 1325 sub problems to find dead transitions.
[2024-05-21 08:00:18] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2024-05-21 08:00:18] [INFO ] Computed 5 invariants in 17 ms
[2024-05-21 08:00:18] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1325 unsolved
[2024-05-21 08:00:31] [INFO ] Deduced a trap composed of 5 places in 261 ms of which 19 ms to minimize.
[2024-05-21 08:00:37] [INFO ] Deduced a trap composed of 15 places in 433 ms of which 28 ms to minimize.
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
[2024-05-21 08:00:40] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 2 ms to minimize.
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 3/8 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/376 variables, and 8 constraints, problems are : Problem set: 100 solved, 1225 unsolved in 20103 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/126 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1325/1325 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 100 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 3/8 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 3 (OVERLAPS) 250/376 variables, 126/134 constraints. Problems are: Problem set: 102 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 22/156 constraints. Problems are: Problem set: 102 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/376 variables, and 1379 constraints, problems are : Problem set: 102 solved, 1223 unsolved in 21888 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 126/126 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1223/1325 constraints, Known Traps: 3/3 constraints]
After SMT, in 48922ms problems are : Problem set: 102 solved, 1223 unsolved
Search for dead transitions found 102 dead transitions in 48988ms
Found 102 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 102 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 102 transitions.
[2024-05-21 08:01:07] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 126 cols
[2024-05-21 08:01:07] [INFO ] Computed 7 invariants in 6 ms
[2024-05-21 08:01:07] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-21 08:01:07] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 08:01:07] [INFO ] Invariant cache hit.
[2024-05-21 08:01:07] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 08:01:07] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 126/128 places, 1226/1328 transitions.
Applied a total of 0 rules in 11 ms. Remains 126 /126 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49409 ms. Remains : 126/128 places, 1226/1328 transitions.
Support contains 126 out of 126 places after structural reductions.
[2024-05-21 08:01:08] [INFO ] Flatten gal took : 242 ms
[2024-05-21 08:01:10] [INFO ] Flatten gal took : 305 ms
[2024-05-21 08:01:12] [INFO ] Input system was already deterministic with 1226 transitions.
Reduction of identical properties reduced properties to check from 38 to 32
RANDOM walk for 40001 steps (88 resets) in 10353 ms. (3 steps per ms) remains 6/32 properties
BEST_FIRST walk for 40001 steps (36 resets) in 4421 ms. (9 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (40 resets) in 3308 ms. (12 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (36 resets) in 1659 ms. (24 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (32 resets) in 3911 ms. (10 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (40 resets) in 1658 ms. (24 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (32 resets) in 4142 ms. (9 steps per ms) remains 6/6 properties
[2024-05-21 08:01:22] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 08:01:22] [INFO ] Invariant cache hit.
[2024-05-21 08:01:22] [INFO ] State equation strengthened by 20 read => feed constraints.
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp37 is UNSAT
After SMT solving in domain Real declared 123/372 variables, and 5 constraints, problems are : Problem set: 6 solved, 0 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 2068ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
[2024-05-21 08:01:24] [INFO ] Flatten gal took : 140 ms
[2024-05-21 08:01:24] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V50P50N10-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 08:01:25] [INFO ] Flatten gal took : 144 ms
[2024-05-21 08:01:26] [INFO ] Input system was already deterministic with 1226 transitions.
Computed a total of 109 stabilizing places and 202 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1226/1226 transitions.
Applied a total of 0 rules in 7 ms. Remains 126 /126 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Running 1223 sub problems to find dead transitions.
[2024-05-21 08:01:26] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 08:01:26] [INFO ] Invariant cache hit.
[2024-05-21 08:01:26] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/372 variables, and 7 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20082 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-05-21 08:01:54] [INFO ] Deduced a trap composed of 5 places in 186 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 126/372 variables, and 8 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/1223 constraints, Known Traps: 1/1 constraints]
After SMT, in 46278ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 46293ms
Finished structural reductions in LTL mode , in 1 iterations and 46305 ms. Remains : 126/126 places, 1226/1226 transitions.
[2024-05-21 08:02:12] [INFO ] Flatten gal took : 44 ms
[2024-05-21 08:02:12] [INFO ] Flatten gal took : 79 ms
[2024-05-21 08:02:13] [INFO ] Input system was already deterministic with 1226 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1226/1226 transitions.
Applied a total of 0 rules in 5 ms. Remains 126 /126 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Running 1223 sub problems to find dead transitions.
[2024-05-21 08:02:13] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 08:02:13] [INFO ] Invariant cache hit.
[2024-05-21 08:02:13] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-05-21 08:02:23] [INFO ] Deduced a trap composed of 5 places in 190 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/372 variables, and 8 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (OVERLAPS) 246/372 variables, 126/134 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 1377 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20355 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
After SMT, in 45518ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 45542ms
Finished structural reductions in LTL mode , in 1 iterations and 45562 ms. Remains : 126/126 places, 1226/1226 transitions.
[2024-05-21 08:02:58] [INFO ] Flatten gal took : 73 ms
[2024-05-21 08:02:58] [INFO ] Flatten gal took : 63 ms
[2024-05-21 08:02:58] [INFO ] Input system was already deterministic with 1226 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1226/1226 transitions.
Applied a total of 0 rules in 11 ms. Remains 126 /126 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Running 1223 sub problems to find dead transitions.
[2024-05-21 08:02:59] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 08:02:59] [INFO ] Invariant cache hit.
[2024-05-21 08:02:59] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-05-21 08:03:08] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/372 variables, and 8 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (OVERLAPS) 246/372 variables, 126/134 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 1377 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20730 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
After SMT, in 44680ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 44695ms
Finished structural reductions in LTL mode , in 1 iterations and 44710 ms. Remains : 126/126 places, 1226/1226 transitions.
[2024-05-21 08:03:43] [INFO ] Flatten gal took : 33 ms
[2024-05-21 08:03:43] [INFO ] Flatten gal took : 41 ms
[2024-05-21 08:03:43] [INFO ] Input system was already deterministic with 1226 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 1226/1226 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1225
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1225
Applied a total of 2 rules in 149 ms. Remains 125 /126 variables (removed 1) and now considering 1225/1226 (removed 1) transitions.
Running 1222 sub problems to find dead transitions.
[2024-05-21 08:03:44] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 125 cols
[2024-05-21 08:03:44] [INFO ] Computed 7 invariants in 5 ms
[2024-05-21 08:03:44] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 08:03:54] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/370 variables, and 8 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (OVERLAPS) 245/370 variables, 125/133 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1375 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20440 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 46241ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 46257ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 46411 ms. Remains : 125/126 places, 1225/1226 transitions.
[2024-05-21 08:04:30] [INFO ] Flatten gal took : 49 ms
[2024-05-21 08:04:30] [INFO ] Flatten gal took : 43 ms
[2024-05-21 08:04:30] [INFO ] Input system was already deterministic with 1225 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1226/1226 transitions.
Applied a total of 0 rules in 9 ms. Remains 126 /126 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Running 1223 sub problems to find dead transitions.
[2024-05-21 08:04:30] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 126 cols
[2024-05-21 08:04:30] [INFO ] Computed 7 invariants in 3 ms
[2024-05-21 08:04:30] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-05-21 08:04:42] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/372 variables, and 8 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 126/372 variables, and 8 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/1223 constraints, Known Traps: 1/1 constraints]
After SMT, in 46282ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 46297ms
Finished structural reductions in LTL mode , in 1 iterations and 46311 ms. Remains : 126/126 places, 1226/1226 transitions.
[2024-05-21 08:05:16] [INFO ] Flatten gal took : 50 ms
[2024-05-21 08:05:16] [INFO ] Flatten gal took : 64 ms
[2024-05-21 08:05:17] [INFO ] Input system was already deterministic with 1226 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1226/1226 transitions.
Applied a total of 0 rules in 6 ms. Remains 126 /126 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Running 1223 sub problems to find dead transitions.
[2024-05-21 08:05:17] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 08:05:17] [INFO ] Invariant cache hit.
[2024-05-21 08:05:17] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-05-21 08:05:27] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/372 variables, and 8 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (OVERLAPS) 246/372 variables, 126/134 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 1377 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 21226 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 1/1 constraints]
After SMT, in 46991ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 47010ms
Finished structural reductions in LTL mode , in 1 iterations and 47021 ms. Remains : 126/126 places, 1226/1226 transitions.
[2024-05-21 08:06:04] [INFO ] Flatten gal took : 46 ms
[2024-05-21 08:06:04] [INFO ] Flatten gal took : 45 ms
[2024-05-21 08:06:04] [INFO ] Input system was already deterministic with 1226 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 1226/1226 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1225
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1225
Applied a total of 2 rules in 10 ms. Remains 125 /126 variables (removed 1) and now considering 1225/1226 (removed 1) transitions.
Running 1222 sub problems to find dead transitions.
[2024-05-21 08:06:04] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 125 cols
[2024-05-21 08:06:04] [INFO ] Computed 7 invariants in 4 ms
[2024-05-21 08:06:04] [INFO ] State equation strengthened by 20 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running BridgeAndVehicles-COL-V50P50N10
IS_COLORED=1
IS_NUPN=
LOADING model.pnml ...
MODEL CLASS: SYMMETRIC NET
PLACES: 15
TRANSITIONS: 11
CONSTANTS: 0
TEMPLATE VARS: 0
COLOR CLASSES: 4
COLOR VARS: 4
ARCS: 56
LOADING TIME: 0.31
UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 128
TRANSITIONS: 1328
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 10010
UNFOLDING TIME: 3.053
SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.098
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 3.795
OK.
----------------------------------------------------------------------
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: 682
MODEL NAME: /home/mcc/execution/model
128 places, 1328 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-COL-V50P50N10-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P50N10-CTLFireability-2024-00 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V50P50N10-CTLFireability-2024-01 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V50P50N10-CTLFireability-2024-03 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V50P50N10-CTLFireability-2024-04 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V50P50N10-CTLFireability-2024-05 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V50P50N10-CTLFireability-2024-06 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V50P50N10-CTLFireability-2024-07 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V50P50N10-CTLFireability-2024-08 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V50P50N10-CTLFireability-2024-09 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V50P50N10-CTLFireability-2024-10 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V50P50N10-CTLFireability-2024-11 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V50P50N10-CTLFireability-2024-12 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V50P50N10-CTLFireability-2024-13 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V50P50N10-CTLFireability-2024-14 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V50P50N10-CTLFireability-2024-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716280669894
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
Error in allocating array of size 8388608 at unique_table.cc, line 313
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
Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
Error in allocating array of size 8388608 at unique_table.cc, line 313
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-COL-V50P50N10"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is BridgeAndVehicles-COL-V50P50N10, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r047-tajo-171620397500090"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V50P50N10.tgz
mv BridgeAndVehicles-COL-V50P50N10 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;