Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813695000675.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is CANConstruction-PT-080, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813695000675
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 10M
-rw-r--r-- 1 mcc users 11K Feb 25 22:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 22:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 21:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 21:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 22:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 25 22:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 22:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 22:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.5M Mar 5 18:22 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 CANConstruction-PT-080-LTLCardinality-00
FORMULA_NAME CANConstruction-PT-080-LTLCardinality-01
FORMULA_NAME CANConstruction-PT-080-LTLCardinality-02
FORMULA_NAME CANConstruction-PT-080-LTLCardinality-03
FORMULA_NAME CANConstruction-PT-080-LTLCardinality-04
FORMULA_NAME CANConstruction-PT-080-LTLCardinality-05
FORMULA_NAME CANConstruction-PT-080-LTLCardinality-06
FORMULA_NAME CANConstruction-PT-080-LTLCardinality-07
FORMULA_NAME CANConstruction-PT-080-LTLCardinality-08
FORMULA_NAME CANConstruction-PT-080-LTLCardinality-09
FORMULA_NAME CANConstruction-PT-080-LTLCardinality-10
FORMULA_NAME CANConstruction-PT-080-LTLCardinality-11
FORMULA_NAME CANConstruction-PT-080-LTLCardinality-12
FORMULA_NAME CANConstruction-PT-080-LTLCardinality-13
FORMULA_NAME CANConstruction-PT-080-LTLCardinality-14
FORMULA_NAME CANConstruction-PT-080-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678655671222

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-080
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 21:14:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 21:14:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 21:14:35] [INFO ] Load time of PNML (sax parser for PT used): 802 ms
[2023-03-12 21:14:35] [INFO ] Transformed 13762 places.
[2023-03-12 21:14:35] [INFO ] Transformed 26240 transitions.
[2023-03-12 21:14:35] [INFO ] Parsed PT model containing 13762 places and 26240 transitions and 78400 arcs in 1116 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 37 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CANConstruction-PT-080-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-080-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-080-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 13762 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13762/13762 places, 26240/26240 transitions.
Discarding 6215 places :
Symmetric choice reduction at 0 with 6215 rule applications. Total rules 6215 place count 7547 transition count 13810
Iterating global reduction 0 with 6215 rules applied. Total rules applied 12430 place count 7547 transition count 13810
Applied a total of 12430 rules in 4884 ms. Remains 7547 /13762 variables (removed 6215) and now considering 13810/26240 (removed 12430) transitions.
// Phase 1: matrix 13810 rows 7547 cols
[2023-03-12 21:14:41] [INFO ] Computed 161 place invariants in 262 ms
[2023-03-12 21:14:43] [INFO ] Implicit Places using invariants in 2115 ms returned []
Implicit Place search using SMT only with invariants took 2799 ms to find 0 implicit places.
[2023-03-12 21:14:43] [INFO ] Invariant cache hit.
[2023-03-12 21:14:44] [INFO ] Dead Transitions using invariants and state equation in 1443 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7547/13762 places, 13810/26240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9147 ms. Remains : 7547/13762 places, 13810/26240 transitions.
Support contains 40 out of 7547 places after structural reductions.
[2023-03-12 21:14:46] [INFO ] Flatten gal took : 1076 ms
[2023-03-12 21:14:47] [INFO ] Flatten gal took : 470 ms
[2023-03-12 21:14:48] [INFO ] Input system was already deterministic with 13810 transitions.
Support contains 39 out of 7547 places (down from 40) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 968 ms. (steps per millisecond=10 ) properties (out of 26) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Interrupted probabilistic random walk after 70499 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70499 steps, saw 69311 distinct states, run finished after 3003 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 24 properties.
[2023-03-12 21:14:52] [INFO ] Invariant cache hit.
[2023-03-12 21:14:57] [INFO ] [Real]Absence check using 81 positive place invariants in 325 ms returned sat
[2023-03-12 21:14:57] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 193 ms returned sat
[2023-03-12 21:14:57] [INFO ] After 5108ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:22
[2023-03-12 21:15:02] [INFO ] [Nat]Absence check using 81 positive place invariants in 303 ms returned sat
[2023-03-12 21:15:02] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 135 ms returned sat
[2023-03-12 21:15:18] [INFO ] After 14510ms SMT Verify possible using state equation in natural domain returned unsat :10 sat :14
[2023-03-12 21:15:18] [INFO ] State equation strengthened by 12720 read => feed constraints.
[2023-03-12 21:15:22] [INFO ] After 4351ms SMT Verify possible using 12720 Read/Feed constraints in natural domain returned unsat :10 sat :13
[2023-03-12 21:15:22] [INFO ] After 4354ms SMT Verify possible using trap constraints in natural domain returned unsat :10 sat :13
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-12 21:15:22] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :10 sat :13
Fused 24 Parikh solutions to 13 different solutions.
Parikh walk visited 1 properties in 295 ms.
Support contains 23 out of 7547 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7547/7547 places, 13810/13810 transitions.
Drop transitions removed 559 transitions
Trivial Post-agglo rules discarded 559 transitions
Performed 559 trivial Post agglomeration. Transition count delta: 559
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 7547 transition count 13251
Reduce places removed 559 places and 0 transitions.
Iterating post reduction 1 with 559 rules applied. Total rules applied 1118 place count 6988 transition count 13251
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1118 place count 6988 transition count 13250
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1120 place count 6987 transition count 13250
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1129 place count 6978 transition count 13232
Iterating global reduction 2 with 9 rules applied. Total rules applied 1138 place count 6978 transition count 13232
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 4 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 1296 place count 6899 transition count 13153
Free-agglomeration rule applied 132 times.
Iterating global reduction 2 with 132 rules applied. Total rules applied 1428 place count 6899 transition count 13021
Reduce places removed 132 places and 0 transitions.
Iterating post reduction 2 with 132 rules applied. Total rules applied 1560 place count 6767 transition count 13021
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 3 with 29 rules applied. Total rules applied 1589 place count 6767 transition count 13021
Applied a total of 1589 rules in 9860 ms. Remains 6767 /7547 variables (removed 780) and now considering 13021/13810 (removed 789) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9863 ms. Remains : 6767/7547 places, 13021/13810 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 546 ms. (steps per millisecond=18 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 13021 rows 6767 cols
[2023-03-12 21:15:33] [INFO ] Computed 161 place invariants in 107 ms
[2023-03-12 21:15:35] [INFO ] After 1981ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 21:15:38] [INFO ] [Nat]Absence check using 81 positive place invariants in 216 ms returned sat
[2023-03-12 21:15:38] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 84 ms returned sat
[2023-03-12 21:15:50] [INFO ] After 10547ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-12 21:15:50] [INFO ] State equation strengthened by 12814 read => feed constraints.
[2023-03-12 21:15:56] [INFO ] After 6731ms SMT Verify possible using 12814 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-12 21:16:01] [INFO ] After 10766ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-12 21:16:01] [INFO ] After 25037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 5 properties in 80 ms.
Support contains 11 out of 6767 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6767/6767 places, 13021/13021 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 6760 transition count 13014
Applied a total of 14 rules in 3963 ms. Remains 6760 /6767 variables (removed 7) and now considering 13014/13021 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3964 ms. Remains : 6760/6767 places, 13014/13021 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 13014 rows 6760 cols
[2023-03-12 21:16:05] [INFO ] Computed 161 place invariants in 106 ms
[2023-03-12 21:16:06] [INFO ] [Real]Absence check using 81 positive place invariants in 189 ms returned sat
[2023-03-12 21:16:06] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 83 ms returned sat
[2023-03-12 21:16:07] [INFO ] After 1428ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 21:16:08] [INFO ] [Nat]Absence check using 81 positive place invariants in 180 ms returned sat
[2023-03-12 21:16:08] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 76 ms returned sat
[2023-03-12 21:16:15] [INFO ] After 6812ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 21:16:15] [INFO ] State equation strengthened by 12820 read => feed constraints.
[2023-03-12 21:16:17] [INFO ] After 2239ms SMT Verify possible using 12820 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 21:16:19] [INFO ] After 4048ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1147 ms.
[2023-03-12 21:16:20] [INFO ] After 13699ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 5 out of 6760 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6760/6760 places, 13014/13014 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 6754 transition count 13008
Applied a total of 12 rules in 4033 ms. Remains 6754 /6760 variables (removed 6) and now considering 13008/13014 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4033 ms. Remains : 6754/6760 places, 13008/13014 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 86070 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86070 steps, saw 75174 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 13008 rows 6754 cols
[2023-03-12 21:16:28] [INFO ] Computed 161 place invariants in 80 ms
[2023-03-12 21:16:29] [INFO ] [Real]Absence check using 81 positive place invariants in 201 ms returned sat
[2023-03-12 21:16:29] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 83 ms returned sat
[2023-03-12 21:16:29] [INFO ] After 1370ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 21:16:30] [INFO ] [Nat]Absence check using 81 positive place invariants in 188 ms returned sat
[2023-03-12 21:16:30] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 83 ms returned sat
[2023-03-12 21:16:37] [INFO ] After 6434ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 21:16:37] [INFO ] State equation strengthened by 12826 read => feed constraints.
[2023-03-12 21:16:41] [INFO ] After 3724ms SMT Verify possible using 12826 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 21:16:43] [INFO ] After 5699ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1214 ms.
[2023-03-12 21:16:44] [INFO ] After 15023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 14 ms.
Support contains 1 out of 6754 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6754/6754 places, 13008/13008 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 6750 transition count 13004
Applied a total of 8 rules in 3762 ms. Remains 6750 /6754 variables (removed 4) and now considering 13004/13008 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3762 ms. Remains : 6750/6754 places, 13004/13008 transitions.
Successfully simplified 10 atomic propositions for a total of 13 simplifications.
FORMULA CANConstruction-PT-080-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-080-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-080-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-080-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-080-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 321 stabilizing places and 400 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F((p1&&X(G(p2))))))))'
Support contains 3 out of 7547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7547/7547 places, 13810/13810 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 7525 transition count 13766
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 7525 transition count 13766
Applied a total of 44 rules in 4354 ms. Remains 7525 /7547 variables (removed 22) and now considering 13766/13810 (removed 44) transitions.
// Phase 1: matrix 13766 rows 7525 cols
[2023-03-12 21:16:53] [INFO ] Computed 161 place invariants in 86 ms
[2023-03-12 21:16:58] [INFO ] Implicit Places using invariants in 5878 ms returned []
Implicit Place search using SMT only with invariants took 5880 ms to find 0 implicit places.
[2023-03-12 21:16:58] [INFO ] Invariant cache hit.
[2023-03-12 21:17:07] [INFO ] Dead Transitions using invariants and state equation in 8499 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7525/7547 places, 13766/13810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18743 ms. Remains : 7525/7547 places, 13766/13810 transitions.
Stuttering acceptance computed with spot in 339 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : CANConstruction-PT-080-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 1 s6964), p1:(LEQ 1 s4563), p2:(LEQ 1 s2484)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA CANConstruction-PT-080-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLCardinality-00 finished in 19227 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 7547 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7547/7547 places, 13810/13810 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 7547 transition count 13250
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 6987 transition count 13250
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 1142 place count 6965 transition count 13206
Iterating global reduction 2 with 22 rules applied. Total rules applied 1164 place count 6965 transition count 13206
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 4 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 1324 place count 6885 transition count 13126
Applied a total of 1324 rules in 5686 ms. Remains 6885 /7547 variables (removed 662) and now considering 13126/13810 (removed 684) transitions.
// Phase 1: matrix 13126 rows 6885 cols
[2023-03-12 21:17:13] [INFO ] Computed 161 place invariants in 135 ms
[2023-03-12 21:17:18] [INFO ] Implicit Places using invariants in 5079 ms returned []
Implicit Place search using SMT only with invariants took 5097 ms to find 0 implicit places.
[2023-03-12 21:17:18] [INFO ] Invariant cache hit.
[2023-03-12 21:17:26] [INFO ] Dead Transitions using invariants and state equation in 8303 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6885/7547 places, 13126/13810 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19092 ms. Remains : 6885/7547 places, 13126/13810 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-080-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ 3 s1451) (LEQ s1984 s1156))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 139 reset in 2032 ms.
Product exploration explored 100000 steps with 141 reset in 1957 ms.
Computed a total of 242 stabilizing places and 240 stable transitions
Computed a total of 242 stabilizing places and 240 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 140 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 79 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 13 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 336764 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :{}
Probabilistic random walk after 336764 steps, saw 325498 distinct states, run finished after 3002 ms. (steps per millisecond=112 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 21:17:34] [INFO ] Invariant cache hit.
[2023-03-12 21:17:35] [INFO ] After 891ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 21:17:36] [INFO ] [Nat]Absence check using 81 positive place invariants in 173 ms returned sat
[2023-03-12 21:17:36] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 87 ms returned sat
[2023-03-12 21:17:43] [INFO ] After 6699ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 21:17:43] [INFO ] State equation strengthened by 12800 read => feed constraints.
[2023-03-12 21:17:45] [INFO ] After 1617ms SMT Verify possible using 12800 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 21:17:45] [INFO ] After 2246ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 495 ms.
[2023-03-12 21:17:46] [INFO ] After 10763ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 8 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=2 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 150 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 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 6885 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6885/6885 places, 13126/13126 transitions.
Applied a total of 0 rules in 1677 ms. Remains 6885 /6885 variables (removed 0) and now considering 13126/13126 (removed 0) transitions.
[2023-03-12 21:17:48] [INFO ] Invariant cache hit.
[2023-03-12 21:17:53] [INFO ] Implicit Places using invariants in 4938 ms returned []
Implicit Place search using SMT only with invariants took 4940 ms to find 0 implicit places.
[2023-03-12 21:17:53] [INFO ] Invariant cache hit.
[2023-03-12 21:18:01] [INFO ] Dead Transitions using invariants and state equation in 8338 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14957 ms. Remains : 6885/6885 places, 13126/13126 transitions.
Computed a total of 242 stabilizing places and 240 stable transitions
Computed a total of 242 stabilizing places and 240 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 142 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 79 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 341637 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :{}
Probabilistic random walk after 341637 steps, saw 330264 distinct states, run finished after 3003 ms. (steps per millisecond=113 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 21:18:05] [INFO ] Invariant cache hit.
[2023-03-12 21:18:05] [INFO ] After 723ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 21:18:06] [INFO ] [Nat]Absence check using 81 positive place invariants in 146 ms returned sat
[2023-03-12 21:18:06] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 77 ms returned sat
[2023-03-12 21:18:13] [INFO ] After 6122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 21:18:13] [INFO ] State equation strengthened by 12800 read => feed constraints.
[2023-03-12 21:18:14] [INFO ] After 1534ms SMT Verify possible using 12800 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 21:18:15] [INFO ] After 2149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 432 ms.
[2023-03-12 21:18:15] [INFO ] After 9860ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 7 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 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 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 142 reset in 1833 ms.
Product exploration explored 100000 steps with 142 reset in 1890 ms.
Support contains 3 out of 6885 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6885/6885 places, 13126/13126 transitions.
Applied a total of 0 rules in 1579 ms. Remains 6885 /6885 variables (removed 0) and now considering 13126/13126 (removed 0) transitions.
[2023-03-12 21:18:21] [INFO ] Invariant cache hit.
[2023-03-12 21:18:26] [INFO ] Implicit Places using invariants in 4880 ms returned []
Implicit Place search using SMT only with invariants took 4881 ms to find 0 implicit places.
[2023-03-12 21:18:26] [INFO ] Invariant cache hit.
[2023-03-12 21:18:33] [INFO ] Dead Transitions using invariants and state equation in 7649 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14113 ms. Remains : 6885/6885 places, 13126/13126 transitions.
Treatment of property CANConstruction-PT-080-LTLCardinality-01 finished in 86651 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X((p0&&X(X(p1))))&&F(p2))))))'
Support contains 4 out of 7547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7547/7547 places, 13810/13810 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 7523 transition count 13762
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 7523 transition count 13762
Applied a total of 48 rules in 3428 ms. Remains 7523 /7547 variables (removed 24) and now considering 13762/13810 (removed 48) transitions.
// Phase 1: matrix 13762 rows 7523 cols
[2023-03-12 21:18:38] [INFO ] Computed 161 place invariants in 127 ms
[2023-03-12 21:18:43] [INFO ] Implicit Places using invariants in 5298 ms returned []
Implicit Place search using SMT only with invariants took 5312 ms to find 0 implicit places.
[2023-03-12 21:18:43] [INFO ] Invariant cache hit.
[2023-03-12 21:18:52] [INFO ] Dead Transitions using invariants and state equation in 8954 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7523/7547 places, 13762/13810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17696 ms. Remains : 7523/7547 places, 13762/13810 transitions.
Stuttering acceptance computed with spot in 401 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), (AND (NOT p2) p0 (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : CANConstruction-PT-080-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 8}, { cond=p0, acceptance={} source=5 dest: 9}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 10}], [{ cond=(AND (NOT p2) p0), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=7 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=9 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=9 dest: 10}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=10 dest: 8}]], initial=0, aps=[p2:(GT 1 s7211), p0:(GT s4089 s4717), p1:(GT 1 s5832)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1525 steps with 0 reset in 24 ms.
FORMULA CANConstruction-PT-080-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLCardinality-07 finished in 18172 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 7547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7547/7547 places, 13810/13810 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 7526 transition count 13768
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 7526 transition count 13768
Applied a total of 42 rules in 3223 ms. Remains 7526 /7547 variables (removed 21) and now considering 13768/13810 (removed 42) transitions.
// Phase 1: matrix 13768 rows 7526 cols
[2023-03-12 21:18:56] [INFO ] Computed 161 place invariants in 149 ms
[2023-03-12 21:18:56] [INFO ] Implicit Places using invariants in 887 ms returned []
Implicit Place search using SMT only with invariants took 893 ms to find 0 implicit places.
[2023-03-12 21:18:56] [INFO ] Invariant cache hit.
[2023-03-12 21:19:05] [INFO ] Dead Transitions using invariants and state equation in 8849 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7526/7547 places, 13768/13810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12970 ms. Remains : 7526/7547 places, 13768/13810 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-080-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ s4699 s2267) (LEQ s4109 s3916))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 5895 ms.
Product exploration explored 100000 steps with 50000 reset in 5837 ms.
Computed a total of 321 stabilizing places and 400 stable transitions
Computed a total of 321 stabilizing places and 400 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-080-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-080-LTLCardinality-10 finished in 24937 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 7547 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7547/7547 places, 13810/13810 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 7547 transition count 13250
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 6987 transition count 13250
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 1143 place count 6964 transition count 13204
Iterating global reduction 2 with 23 rules applied. Total rules applied 1166 place count 6964 transition count 13204
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 4 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 1326 place count 6884 transition count 13124
Applied a total of 1326 rules in 4774 ms. Remains 6884 /7547 variables (removed 663) and now considering 13124/13810 (removed 686) transitions.
// Phase 1: matrix 13124 rows 6884 cols
[2023-03-12 21:19:22] [INFO ] Computed 161 place invariants in 76 ms
[2023-03-12 21:19:28] [INFO ] Implicit Places using invariants in 6203 ms returned []
Implicit Place search using SMT only with invariants took 6204 ms to find 0 implicit places.
[2023-03-12 21:19:28] [INFO ] Invariant cache hit.
[2023-03-12 21:19:37] [INFO ] Dead Transitions using invariants and state equation in 9168 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6884/7547 places, 13124/13810 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20149 ms. Remains : 6884/7547 places, 13124/13810 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-080-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s5785 s6542)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 696 steps with 0 reset in 16 ms.
FORMULA CANConstruction-PT-080-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLCardinality-11 finished in 20266 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p0))&&G(p1))))'
Support contains 3 out of 7547 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7547/7547 places, 13810/13810 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 7547 transition count 13250
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 6987 transition count 13250
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 1143 place count 6964 transition count 13204
Iterating global reduction 2 with 23 rules applied. Total rules applied 1166 place count 6964 transition count 13204
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 4 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 1326 place count 6884 transition count 13124
Applied a total of 1326 rules in 4700 ms. Remains 6884 /7547 variables (removed 663) and now considering 13124/13810 (removed 686) transitions.
// Phase 1: matrix 13124 rows 6884 cols
[2023-03-12 21:19:42] [INFO ] Computed 161 place invariants in 76 ms
[2023-03-12 21:19:47] [INFO ] Implicit Places using invariants in 5257 ms returned []
Implicit Place search using SMT only with invariants took 5271 ms to find 0 implicit places.
[2023-03-12 21:19:47] [INFO ] Invariant cache hit.
[2023-03-12 21:19:55] [INFO ] Dead Transitions using invariants and state equation in 7783 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6884/7547 places, 13124/13810 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17759 ms. Remains : 6884/7547 places, 13124/13810 transitions.
Stuttering acceptance computed with spot in 65 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-080-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s2056 s1501), p0:(LEQ 1 s4719)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 668 steps with 0 reset in 13 ms.
FORMULA CANConstruction-PT-080-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLCardinality-12 finished in 17873 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(p0) U G(p0))||X(F(p1)))))'
Support contains 3 out of 7547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7547/7547 places, 13810/13810 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 7524 transition count 13764
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 7524 transition count 13764
Applied a total of 46 rules in 3449 ms. Remains 7524 /7547 variables (removed 23) and now considering 13764/13810 (removed 46) transitions.
// Phase 1: matrix 13764 rows 7524 cols
[2023-03-12 21:19:59] [INFO ] Computed 161 place invariants in 131 ms
[2023-03-12 21:20:04] [INFO ] Implicit Places using invariants in 5416 ms returned []
Implicit Place search using SMT only with invariants took 5430 ms to find 0 implicit places.
[2023-03-12 21:20:04] [INFO ] Invariant cache hit.
[2023-03-12 21:20:13] [INFO ] Dead Transitions using invariants and state equation in 8396 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7524/7547 places, 13764/13810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17291 ms. Remains : 7524/7547 places, 13764/13810 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-080-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s6002 s11), p1:(GT 1 s3748)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 5955 ms.
Product exploration explored 100000 steps with 50000 reset in 5646 ms.
Computed a total of 321 stabilizing places and 400 stable transitions
Computed a total of 321 stabilizing places and 400 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1)
Knowledge based reduction with 5 factoid took 178 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-080-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-080-LTLCardinality-13 finished in 29218 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 7547 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7547/7547 places, 13810/13810 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 7547 transition count 13250
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 6987 transition count 13250
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 1144 place count 6963 transition count 13202
Iterating global reduction 2 with 24 rules applied. Total rules applied 1168 place count 6963 transition count 13202
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 4 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 1328 place count 6883 transition count 13122
Applied a total of 1328 rules in 4605 ms. Remains 6883 /7547 variables (removed 664) and now considering 13122/13810 (removed 688) transitions.
// Phase 1: matrix 13122 rows 6883 cols
[2023-03-12 21:20:29] [INFO ] Computed 161 place invariants in 75 ms
[2023-03-12 21:20:30] [INFO ] Implicit Places using invariants in 787 ms returned []
Implicit Place search using SMT only with invariants took 805 ms to find 0 implicit places.
[2023-03-12 21:20:30] [INFO ] Invariant cache hit.
[2023-03-12 21:20:38] [INFO ] Dead Transitions using invariants and state equation in 7763 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6883/7547 places, 13122/13810 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13184 ms. Remains : 6883/7547 places, 13122/13810 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-080-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s2964)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 744 steps with 0 reset in 15 ms.
FORMULA CANConstruction-PT-080-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLCardinality-15 finished in 13287 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-12 21:20:38] [INFO ] Flatten gal took : 332 ms
[2023-03-12 21:20:38] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 21:20:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 7547 places, 13810 transitions and 53540 arcs took 92 ms.
Total runtime 364821 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/886/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CANConstruction-PT-080-LTLCardinality-01

BK_STOP 1678656053781

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name CANConstruction-PT-080-LTLCardinality-01
ltl formula formula --ltl=/tmp/886/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 7547 places, 13810 transitions and 53540 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.830 real 0.430 user 0.340 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/886/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/886/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/886/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/886/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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="CANConstruction-PT-080"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is CANConstruction-PT-080, 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 r041-tajo-167813695000675"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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