Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.7K Apr 13 03:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 13 03:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 13 03:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 13 03:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 03:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 13 03:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 13 03:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 13 03:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 61K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716646341239

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 14:12:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-25 14:12:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 14:12:22] [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-25 14:12:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 14:12:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 619 ms
[2024-05-25 14:12:23] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 270 PT places and 116.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 14:12:23] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 11 ms.
[2024-05-25 14:12:23] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 40001 steps (3053 resets) in 1274 ms. (31 steps per ms) remains 6/29 properties
BEST_FIRST walk for 40002 steps (1388 resets) in 152 ms. (261 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1388 resets) in 195 ms. (204 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1392 resets) in 230 ms. (173 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1477 resets) in 118 ms. (336 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1376 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1387 resets) in 85 ms. (465 steps per ms) remains 6/6 properties
// Phase 1: matrix 26 rows 30 cols
[2024-05-25 14:12:24] [INFO ] Computed 5 invariants in 11 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 1 (OVERLAPS) 8/15 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/23 variables, 2/5 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 26/49 variables, 23/28 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/28 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 7/56 variables, 7/35 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 3 solved, 3 unsolved in 240 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/23 variables, 2/5 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 26/49 variables, 23/28 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 1/29 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/49 variables, 0/29 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 7/56 variables, 7/36 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 2/38 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/56 variables, 0/38 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/56 variables, 0/38 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 38 constraints, problems are : Problem set: 3 solved, 3 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 3/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 375ms problems are : Problem set: 3 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 54 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=18 )
Parikh walk visited 3 properties in 6 ms.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 14:12:24] [INFO ] Flatten gal took : 17 ms
[2024-05-25 14:12:24] [INFO ] Flatten gal took : 5 ms
Domain [tsid(7), tsid(7)] of place n9 breaks symmetries in sort tsid
[2024-05-25 14:12:24] [INFO ] Unfolded HLPN to a Petri net with 270 places and 116 transitions 659 arcs in 13 ms.
[2024-05-25 14:12:24] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Support contains 246 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 255 transition count 116
Applied a total of 15 rules in 14 ms. Remains 255 /270 variables (removed 15) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 255 cols
[2024-05-25 14:12:24] [INFO ] Computed 140 invariants in 23 ms
[2024-05-25 14:12:24] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-25 14:12:24] [INFO ] Invariant cache hit.
[2024-05-25 14:12:25] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-05-25 14:12:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/253 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 7/140 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 116/369 variables, 253/393 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 2/371 variables, 2/395 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/371 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 395 constraints, problems are : Problem set: 0 solved, 108 unsolved in 5496 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 139/139 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/253 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 7/140 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 116/369 variables, 253/393 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 98/491 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 2/371 variables, 2/493 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 10/503 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 11 (OVERLAPS) 0/371 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 371/371 variables, and 503 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7910 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 139/139 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 13495ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 13500ms
Starting structural reductions in LTL mode, iteration 1 : 255/270 places, 116/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13811 ms. Remains : 255/270 places, 116/116 transitions.
Support contains 246 out of 255 places after structural reductions.
[2024-05-25 14:12:38] [INFO ] Flatten gal took : 21 ms
[2024-05-25 14:12:38] [INFO ] Flatten gal took : 16 ms
[2024-05-25 14:12:38] [INFO ] Input system was already deterministic with 116 transitions.
RANDOM walk for 40000 steps (3931 resets) in 1496 ms. (26 steps per ms) remains 13/24 properties
BEST_FIRST walk for 40004 steps (711 resets) in 168 ms. (236 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (708 resets) in 174 ms. (228 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (704 resets) in 95 ms. (416 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (699 resets) in 185 ms. (215 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (698 resets) in 143 ms. (277 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (699 resets) in 155 ms. (256 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (712 resets) in 123 ms. (322 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (888 resets) in 164 ms. (242 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (707 resets) in 133 ms. (298 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (689 resets) in 104 ms. (380 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (702 resets) in 143 ms. (277 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (706 resets) in 137 ms. (289 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (701 resets) in 147 ms. (270 steps per ms) remains 13/13 properties
[2024-05-25 14:12:39] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 2/188 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 35/223 variables, 7/128 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 115/338 variables, 223/351 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 8 (OVERLAPS) 33/371 variables, 32/383 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 12/395 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/395 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/371 variables, 0/395 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 395 constraints, problems are : Problem set: 1 solved, 12 unsolved in 617 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 139/139 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 120/120 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/120 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 2/188 variables, 1/121 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/121 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 35/223 variables, 7/128 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 0/128 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 115/338 variables, 223/351 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 7/358 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 0/358 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 33/371 variables, 32/390 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 12/402 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/371 variables, 5/407 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/371 variables, 0/407 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 0/371 variables, 0/407 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 371/371 variables, and 407 constraints, problems are : Problem set: 1 solved, 12 unsolved in 3795 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 139/139 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 12/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 4440ms problems are : Problem set: 1 solved, 12 unsolved
Fused 12 Parikh solutions to 10 different solutions.
Finished Parikh walk after 43 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=21 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 12 properties in 187 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 255 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 255 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (p1&&G(F(p2)))))'
Support contains 65 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 116/116 transitions.
Graph (complete) has 789 edges and 255 vertex of which 253 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 252 transition count 115
Applied a total of 2 rules in 41 ms. Remains 252 /255 variables (removed 3) and now considering 115/116 (removed 1) transitions.
// Phase 1: matrix 115 rows 252 cols
[2024-05-25 14:12:44] [INFO ] Computed 138 invariants in 6 ms
[2024-05-25 14:12:44] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-25 14:12:44] [INFO ] Invariant cache hit.
[2024-05-25 14:12:45] [INFO ] Implicit Places using invariants and state equation in 249 ms returned [184, 185, 186, 187, 188, 189, 190, 198, 199, 200, 201, 202, 203, 204]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 389 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 238/255 places, 115/116 transitions.
Applied a total of 0 rules in 9 ms. Remains 238 /238 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 439 ms. Remains : 238/255 places, 115/116 transitions.
Stuttering acceptance computed with spot in 338 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLCardinality-00
Product exploration explored 100000 steps with 10243 reset in 317 ms.
Product exploration explored 100000 steps with 10244 reset in 226 ms.
Computed a total of 238 stabilizing places and 115 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 238 transition count 115
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 571 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (4096 resets) in 246 ms. (161 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (499 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 552 steps, run visited all 1 properties in 8 ms. (steps per millisecond=69 )
Probabilistic random walk after 552 steps, saw 514 distinct states, run finished after 13 ms. (steps per millisecond=42 ) properties seen :1
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 14 factoid took 653 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p2), (NOT p2)]
Support contains 50 out of 238 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 115/115 transitions.
Applied a total of 0 rules in 16 ms. Remains 238 /238 variables (removed 0) and now considering 115/115 (removed 0) transitions.
// Phase 1: matrix 115 rows 238 cols
[2024-05-25 14:12:47] [INFO ] Computed 126 invariants in 11 ms
[2024-05-25 14:12:47] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-25 14:12:47] [INFO ] Invariant cache hit.
[2024-05-25 14:12:48] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2024-05-25 14:12:48] [INFO ] Redundant transitions in 2 ms returned []
Running 100 sub problems to find dead transitions.
[2024-05-25 14:12:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 115/345 variables, 230/356 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/345 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 8/353 variables, 8/364 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 0/353 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 364 constraints, problems are : Problem set: 0 solved, 100 unsolved in 3562 ms.
Refiners :[Generalized P Invariants (flows): 126/126 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 115/345 variables, 230/356 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/345 variables, 91/447 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/345 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 8/353 variables, 8/455 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 9/464 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/353 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 353/353 variables, and 464 constraints, problems are : Problem set: 0 solved, 100 unsolved in 6300 ms.
Refiners :[Generalized P Invariants (flows): 126/126 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
After SMT, in 9911ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 9912ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10295 ms. Remains : 238/238 places, 115/115 transitions.
Computed a total of 238 stabilizing places and 115 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 238 transition count 115
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p2, (X p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 136 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (4097 resets) in 164 ms. (242 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (492 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 552 steps, run visited all 1 properties in 5 ms. (steps per millisecond=110 )
Probabilistic random walk after 552 steps, saw 514 distinct states, run finished after 5 ms. (steps per millisecond=110 ) properties seen :1
Knowledge obtained : [p2, (X p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 4 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 10254 reset in 164 ms.
Product exploration explored 100000 steps with 10256 reset in 182 ms.
Support contains 50 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 115/115 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 238 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 237 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 237 transition count 114
Applied a total of 3 rules in 26 ms. Remains 237 /238 variables (removed 1) and now considering 114/115 (removed 1) transitions.
// Phase 1: matrix 114 rows 237 cols
[2024-05-25 14:12:59] [INFO ] Computed 126 invariants in 8 ms
[2024-05-25 14:12:59] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-25 14:12:59] [INFO ] Invariant cache hit.
[2024-05-25 14:12:59] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2024-05-25 14:12:59] [INFO ] Redundant transitions in 2 ms returned []
Running 99 sub problems to find dead transitions.
[2024-05-25 14:12:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 114/343 variables, 229/355 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 8/351 variables, 8/363 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 0/351 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 363 constraints, problems are : Problem set: 0 solved, 99 unsolved in 3386 ms.
Refiners :[Generalized P Invariants (flows): 126/126 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 114/343 variables, 229/355 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 91/446 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 8/351 variables, 8/454 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 8/462 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 0/351 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 351/351 variables, and 462 constraints, problems are : Problem set: 0 solved, 99 unsolved in 5949 ms.
Refiners :[Generalized P Invariants (flows): 126/126 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
After SMT, in 9377ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 9379ms
Starting structural reductions in SI_LTL mode, iteration 1 : 237/238 places, 114/115 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9749 ms. Remains : 237/238 places, 114/115 transitions.
Treatment of property QuasiCertifProtocol-COL-06-LTLCardinality-00 finished in 24226 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 49 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 116/116 transitions.
Graph (complete) has 789 edges and 255 vertex of which 244 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 241 transition count 111
Applied a total of 5 rules in 19 ms. Remains 241 /255 variables (removed 14) and now considering 111/116 (removed 5) transitions.
// Phase 1: matrix 111 rows 241 cols
[2024-05-25 14:13:09] [INFO ] Computed 132 invariants in 6 ms
[2024-05-25 14:13:09] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-25 14:13:09] [INFO ] Invariant cache hit.
[2024-05-25 14:13:09] [INFO ] Implicit Places using invariants and state equation in 242 ms returned [176, 177, 178, 179, 180, 181, 182, 190, 191, 192, 193, 194, 195, 196]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 375 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 227/255 places, 111/116 transitions.
Applied a total of 0 rules in 6 ms. Remains 227 /227 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 401 ms. Remains : 227/255 places, 111/116 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLCardinality-01
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLCardinality-01 finished in 451 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((p1 U (G(p1)||(p1&&G(p0))))))))'
Support contains 15 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 116/116 transitions.
Graph (complete) has 789 edges and 255 vertex of which 125 are kept as prefixes of interest. Removing 130 places using SCC suffix rule.1 ms
Discarding 130 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 124 transition count 72
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 124 transition count 72
Applied a total of 22 rules in 14 ms. Remains 124 /255 variables (removed 131) and now considering 72/116 (removed 44) transitions.
// Phase 1: matrix 72 rows 124 cols
[2024-05-25 14:13:09] [INFO ] Computed 54 invariants in 0 ms
[2024-05-25 14:13:09] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-25 14:13:09] [INFO ] Invariant cache hit.
[2024-05-25 14:13:09] [INFO ] Implicit Places using invariants and state equation in 95 ms returned [78, 79, 80, 81, 82, 83, 84]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 166 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/255 places, 72/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 117 /117 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 183 ms. Remains : 117/255 places, 72/116 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLCardinality-02
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLCardinality-02 finished in 374 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((!p0&&X(G((!p0||G(p1)))))) U (p2||X(X(p3)))))'
Support contains 66 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 116/116 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 253 transition count 116
Applied a total of 2 rules in 4 ms. Remains 253 /255 variables (removed 2) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 253 cols
[2024-05-25 14:13:09] [INFO ] Computed 139 invariants in 3 ms
[2024-05-25 14:13:09] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-25 14:13:09] [INFO ] Invariant cache hit.
[2024-05-25 14:13:10] [INFO ] Implicit Places using invariants and state equation in 239 ms returned [198, 199, 200, 201, 202, 203, 204]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 370 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 246/255 places, 116/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 246 /246 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 375 ms. Remains : 246/255 places, 116/116 transitions.
Stuttering acceptance computed with spot in 385 ms :[(AND (NOT p2) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (NOT p3), (AND (NOT p1) p0 (NOT p3)), true, (AND p0 (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLCardinality-04
Product exploration explored 100000 steps with 33333 reset in 213 ms.
Product exploration explored 100000 steps with 33333 reset in 173 ms.
Computed a total of 246 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 246 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p0) p3 p1), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 (NOT p3) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT p2)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 14 ms. Reduced automaton from 9 states, 19 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-06-LTLCardinality-04 finished in 1247 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X(G(p1)))))'
Support contains 64 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 116/116 transitions.
Graph (complete) has 789 edges and 255 vertex of which 125 are kept as prefixes of interest. Removing 130 places using SCC suffix rule.1 ms
Discarding 130 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 125 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 124 transition count 72
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 124 transition count 72
Applied a total of 24 rules in 13 ms. Remains 124 /255 variables (removed 131) and now considering 72/116 (removed 44) transitions.
// Phase 1: matrix 72 rows 124 cols
[2024-05-25 14:13:11] [INFO ] Computed 54 invariants in 1 ms
[2024-05-25 14:13:11] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-25 14:13:11] [INFO ] Invariant cache hit.
[2024-05-25 14:13:11] [INFO ] Implicit Places using invariants and state equation in 81 ms returned [85, 86, 87, 88, 89, 90, 91]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 136 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/255 places, 72/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 117 /117 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 151 ms. Remains : 117/255 places, 72/116 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLCardinality-05
Stuttering criterion allowed to conclude after 235 steps with 22 reset in 2 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLCardinality-05 finished in 345 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(F(p0))||(F(p0)&&G(p1))))))'
Support contains 2 out of 255 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 116/116 transitions.
Graph (complete) has 789 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 253 transition count 115
Applied a total of 2 rules in 17 ms. Remains 253 /255 variables (removed 2) and now considering 115/116 (removed 1) transitions.
// Phase 1: matrix 115 rows 253 cols
[2024-05-25 14:13:11] [INFO ] Computed 139 invariants in 17 ms
[2024-05-25 14:13:11] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-25 14:13:11] [INFO ] Invariant cache hit.
[2024-05-25 14:13:11] [INFO ] Implicit Places using invariants and state equation in 276 ms returned [185, 186, 187, 188, 189, 190, 191, 199, 200, 201, 202, 203, 204, 205]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 441 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 239/255 places, 115/116 transitions.
Applied a total of 0 rules in 6 ms. Remains 239 /239 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 464 ms. Remains : 239/255 places, 115/116 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLCardinality-07
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLCardinality-07 finished in 556 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X((p0 U (p1||G(p0))))))))'
Support contains 49 out of 255 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 116/116 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 252 transition count 116
Applied a total of 3 rules in 2 ms. Remains 252 /255 variables (removed 3) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2024-05-25 14:13:11] [INFO ] Computed 138 invariants in 3 ms
[2024-05-25 14:13:12] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-25 14:13:12] [INFO ] Invariant cache hit.
[2024-05-25 14:13:12] [INFO ] Implicit Places using invariants and state equation in 262 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 372 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/255 places, 116/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 378 ms. Remains : 245/255 places, 116/116 transitions.
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLCardinality-08 finished in 457 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 56 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 116/116 transitions.
Graph (complete) has 789 edges and 255 vertex of which 244 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 241 transition count 111
Applied a total of 5 rules in 16 ms. Remains 241 /255 variables (removed 14) and now considering 111/116 (removed 5) transitions.
// Phase 1: matrix 111 rows 241 cols
[2024-05-25 14:13:12] [INFO ] Computed 132 invariants in 4 ms
[2024-05-25 14:13:12] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-25 14:13:12] [INFO ] Invariant cache hit.
[2024-05-25 14:13:12] [INFO ] Implicit Places using invariants and state equation in 256 ms returned [176, 177, 178, 179, 180, 181, 182, 190, 191, 192, 193, 194, 195, 196]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 381 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 227/255 places, 111/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 227 /227 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 401 ms. Remains : 227/255 places, 111/116 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLCardinality-10
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLCardinality-10 finished in 451 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||G(F(p1))))))'
Support contains 63 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 116/116 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 252 transition count 116
Applied a total of 3 rules in 2 ms. Remains 252 /255 variables (removed 3) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2024-05-25 14:13:12] [INFO ] Computed 138 invariants in 2 ms
[2024-05-25 14:13:12] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-25 14:13:12] [INFO ] Invariant cache hit.
[2024-05-25 14:13:13] [INFO ] Implicit Places using invariants and state equation in 275 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 401 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/255 places, 116/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 404 ms. Remains : 245/255 places, 116/116 transitions.
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLCardinality-15
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLCardinality-15 finished in 611 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (p1&&G(F(p2)))))'
[2024-05-25 14:13:13] [INFO ] Flatten gal took : 16 ms
[2024-05-25 14:13:13] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-05-25 14:13:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 255 places, 116 transitions and 644 arcs took 4 ms.
Total runtime 51292 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running QuasiCertifProtocol-COL-06

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.001s, 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: 935
MODEL NAME: /home/mcc/execution/413/model
255 places, 116 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 QuasiCertifProtocol-COL-06-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716646436880

--------------------
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 LTLCardinality -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="QuasiCertifProtocol-COL-06"
export BK_EXAMINATION="LTLCardinality"
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 QuasiCertifProtocol-COL-06, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r311-tall-171662335700011"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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