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-171620397400071.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-V50P20N10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397400071
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 7.7K Apr 13 00:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 13 00:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 13 00:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 13 00:33 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 4.4K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 13 01:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 13 01:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 13 01:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 13 01:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:29 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-V50P20N10-ReachabilityFireability-2024-00
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityFireability-2024-01
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityFireability-2024-02
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityFireability-2024-03
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityFireability-2024-04
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityFireability-2024-05
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityFireability-2024-06
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityFireability-2024-07
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityFireability-2024-08
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityFireability-2024-09
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityFireability-2024-10
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityFireability-2024-11
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityFireability-2024-12
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityFireability-2024-13
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityFireability-2024-14
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716276968247

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V50P20N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 07:36:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 07:36:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 07:36:09] [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 07:36:10] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 07:36:10] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 594 ms
[2024-05-21 07:36:10] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 128 PT places and 114798.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Reduction of identical properties reduced properties to check from 16 to 14
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 07:36:10] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 5 ms.
[2024-05-21 07:36:10] [INFO ] Skeletonized 13 HLPN properties in 1 ms.
Remains 2 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 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.3 ms
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
RANDOM walk for 367 steps (0 resets) in 14 ms. (24 steps per ms) remains 0/2 properties
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-05-21 07:36:10] [INFO ] Flatten gal took : 13 ms
[2024-05-21 07:36:10] [INFO ] Flatten gal took : 2 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
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 07:36:10] [INFO ] Unfolded HLPN to a Petri net with 128 places and 1328 transitions 10010 arcs in 101 ms.
[2024-05-21 07:36:10] [INFO ] Unfolded 13 HLPN properties in 5 ms.
RANDOM walk for 40000 steps (88 resets) in 3377 ms. (11 steps per ms) remains 4/13 properties
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (32 resets) in 5980 ms. (6 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (40 resets) in 1352 ms. (29 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (40 resets) in 2056 ms. (19 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (32 resets) in 2833 ms. (14 steps per ms) remains 4/4 properties
[2024-05-21 07:36:15] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2024-05-21 07:36:15] [INFO ] Computed 7 invariants in 14 ms
[2024-05-21 07:36:15] [INFO ] State equation strengthened by 22 read => feed constraints.
Problem BridgeAndVehicles-COL-V50P20N10-ReachabilityFireability-2024-00 is UNSAT
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-COL-V50P20N10-ReachabilityFireability-2024-03 is UNSAT
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-COL-V50P20N10-ReachabilityFireability-2024-05 is UNSAT
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 3/128 variables, 2/7 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 250/378 variables, 128/135 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 22/157 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 0/157 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/378 variables, 0/157 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 157 constraints, problems are : Problem set: 3 solved, 1 unsolved in 1144 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 9/128 variables, 4/7 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 250/378 variables, 128/135 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 22/157 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 1/158 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-05-21 07:36:23] [INFO ] Deduced a trap composed of 5 places in 181 ms of which 15 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 1/159 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/159 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/378 variables, 0/159 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/378 variables, and 159 constraints, problems are : Problem set: 3 solved, 1 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 10079ms problems are : Problem set: 3 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 119 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Graph (complete) has 1222 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 125 transition count 1327
Applied a total of 3 rules in 314 ms. Remains 125 /128 variables (removed 3) and now considering 1327/1328 (removed 1) transitions.
Running 1324 sub problems to find dead transitions.
[2024-05-21 07:36:26] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2024-05-21 07:36:26] [INFO ] Computed 5 invariants in 7 ms
[2024-05-21 07:36:26] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
[2024-05-21 07:36:39] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 2 ms to minimize.
[2024-05-21 07:36:43] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 0 ms to minimize.
Problem TDEAD727 is UNSAT
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
[2024-05-21 07:36:47] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 1 ms to minimize.
Problem TDEAD177 is UNSAT
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
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 3/8 constraints. Problems are: Problem set: 100 solved, 1224 unsolved
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 125/374 variables, and 8 constraints, problems are : Problem set: 100 solved, 1224 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1324/1324 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 100 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 100 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 3/8 constraints. Problems are: Problem set: 100 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/8 constraints. Problems are: Problem set: 100 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 3 (OVERLAPS) 249/374 variables, 125/133 constraints. Problems are: Problem set: 102 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 22/155 constraints. Problems are: Problem set: 102 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/374 variables, and 1377 constraints, problems are : Problem set: 102 solved, 1222 unsolved in 21487 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 125/125 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1222/1324 constraints, Known Traps: 3/3 constraints]
After SMT, in 49046ms problems are : Problem set: 102 solved, 1222 unsolved
Search for dead transitions found 102 dead transitions in 49078ms
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.
Starting structural reductions in REACHABILITY mode, iteration 1 : 125/128 places, 1225/1328 transitions.
Applied a total of 0 rules in 94 ms. Remains 125 /125 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49527 ms. Remains : 125/128 places, 1225/1328 transitions.
RANDOM walk for 40000 steps (104 resets) in 962 ms. (41 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (41 resets) in 2667 ms. (14 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 332971 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 1
Probabilistic random walk after 332971 steps, saw 95438 distinct states, run finished after 3004 ms. (steps per millisecond=110 ) properties seen :0
[2024-05-21 07:37:19] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 125 cols
[2024-05-21 07:37:19] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 07:37:19] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 5/124 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 245/370 variables, 125/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/370 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 460 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: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 5/124 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 07:37:20] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/125 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 245/370 variables, 125/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/370 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/370 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 154 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4079 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: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 4856ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 632 ms.
Support contains 119 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1225/1225 transitions.
Applied a total of 0 rules in 53 ms. Remains 125 /125 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 125/125 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1225/1225 transitions.
Applied a total of 0 rules in 49 ms. Remains 125 /125 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2024-05-21 07:37:24] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 07:37:24] [INFO ] Invariant cache hit.
[2024-05-21 07:37:25] [INFO ] Implicit Places using invariants in 167 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 176 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 123/125 places, 1225/1225 transitions.
Applied a total of 0 rules in 64 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 290 ms. Remains : 123/125 places, 1225/1225 transitions.
RANDOM walk for 40000 steps (104 resets) in 839 ms. (47 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (44 resets) in 2279 ms. (17 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 360324 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :0 out of 1
Probabilistic random walk after 360324 steps, saw 102746 distinct states, run finished after 3001 ms. (steps per millisecond=120 ) properties seen :0
[2024-05-21 07:37:29] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 123 cols
[2024-05-21 07:37:29] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 07:37:29] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 4/123 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 07:37:29] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/368 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 149 constraints, problems are : Problem set: 0 solved, 1 unsolved in 522 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 4/123 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3797 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 4641ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 220 ms.
Support contains 119 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 45 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 123/123 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 43 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2024-05-21 07:37:34] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 07:37:34] [INFO ] Invariant cache hit.
[2024-05-21 07:37:34] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-21 07:37:34] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 07:37:34] [INFO ] Invariant cache hit.
[2024-05-21 07:37:34] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 07:37:34] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2024-05-21 07:37:34] [INFO ] Redundant transitions in 63 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-21 07:37:34] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2024-05-21 07:37:34] [INFO ] Invariant cache hit.
[2024-05-21 07:37:34] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 07:37:42] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-21 07:38:06] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 368/368 variables, and 150 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/130 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 1222/1372 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1372 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 2/2 constraints]
After SMT, in 64647ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 64661ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65158 ms. Remains : 123/123 places, 1225/1225 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 980 transitions
Reduce isomorphic transitions removed 980 transitions.
Iterating post reduction 0 with 980 rules applied. Total rules applied 980 place count 123 transition count 245
Applied a total of 980 rules in 7 ms. Remains 123 /123 variables (removed 0) and now considering 245/1225 (removed 980) transitions.
Running SMT prover for 1 properties.
[2024-05-21 07:38:39] [INFO ] Invariant cache hit.
[2024-05-21 07:38:39] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 07:38:39] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 07:38:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 07:38:41] [INFO ] After 1507ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 07:38:42] [INFO ] After 3397ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 07:38:44] [INFO ] After 5117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 5441 ms.
[2024-05-21 07:38:44] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 26 ms.
[2024-05-21 07:38:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 123 places, 1225 transitions and 8998 arcs took 25 ms.
[2024-05-21 07:38:44] [INFO ] Flatten gal took : 143 ms
Total runtime 155171 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-COL-V50P20N10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/420/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 123
TRANSITIONS: 1225
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.066s, Sys 0.008s]


SAVING FILE /home/mcc/execution/420/model (.net / .def) ...
EXPORT TIME: [User 0.007s, 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: 657
MODEL NAME: /home/mcc/execution/420/model
123 places, 1225 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-V50P20N10-ReachabilityFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716277132526

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-COL-V50P20N10"
export BK_EXAMINATION="ReachabilityFireability"
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-V50P20N10, examination is ReachabilityFireability"
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-171620397400071"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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