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.r037-tajo-167813690500523.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 itstools
Input is BusinessProcesses-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690500523
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 25 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 131K 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 BusinessProcesses-PT-10-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678361379034

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-10
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-09 11:29:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 11:29:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 11:29:41] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2023-03-09 11:29:41] [INFO ] Transformed 518 places.
[2023-03-09 11:29:41] [INFO ] Transformed 471 transitions.
[2023-03-09 11:29:41] [INFO ] Found NUPN structural information;
[2023-03-09 11:29:41] [INFO ] Parsed PT model containing 518 places and 471 transitions and 1415 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA BusinessProcesses-PT-10-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 471/471 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 517 transition count 471
Discarding 73 places :
Symmetric choice reduction at 1 with 73 rule applications. Total rules 74 place count 444 transition count 398
Iterating global reduction 1 with 73 rules applied. Total rules applied 147 place count 444 transition count 398
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 180 place count 411 transition count 365
Iterating global reduction 1 with 33 rules applied. Total rules applied 213 place count 411 transition count 365
Applied a total of 213 rules in 110 ms. Remains 411 /518 variables (removed 107) and now considering 365/471 (removed 106) transitions.
// Phase 1: matrix 365 rows 411 cols
[2023-03-09 11:29:41] [INFO ] Computed 84 place invariants in 31 ms
[2023-03-09 11:29:41] [INFO ] Implicit Places using invariants in 314 ms returned []
[2023-03-09 11:29:41] [INFO ] Invariant cache hit.
[2023-03-09 11:29:42] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 720 ms to find 0 implicit places.
[2023-03-09 11:29:42] [INFO ] Invariant cache hit.
[2023-03-09 11:29:42] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 411/518 places, 365/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1082 ms. Remains : 411/518 places, 365/471 transitions.
Support contains 18 out of 411 places after structural reductions.
[2023-03-09 11:29:42] [INFO ] Flatten gal took : 56 ms
[2023-03-09 11:29:42] [INFO ] Flatten gal took : 24 ms
[2023-03-09 11:29:42] [INFO ] Input system was already deterministic with 365 transitions.
Incomplete random walk after 10000 steps, including 84 resets, run finished after 419 ms. (steps per millisecond=23 ) properties (out of 12) seen :6
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 11:29:43] [INFO ] Invariant cache hit.
[2023-03-09 11:29:43] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 11:29:43] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2023-03-09 11:29:43] [INFO ] [Nat]Absence check using 45 positive and 39 generalized place invariants in 9 ms returned sat
[2023-03-09 11:29:43] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 11:29:43] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 5 ms to minimize.
[2023-03-09 11:29:43] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 1 ms to minimize.
[2023-03-09 11:29:43] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2023-03-09 11:29:43] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2023-03-09 11:29:43] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2023-03-09 11:29:43] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2023-03-09 11:29:43] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 389 ms
[2023-03-09 11:29:43] [INFO ] After 559ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-09 11:29:43] [INFO ] After 687ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 365/365 transitions.
Graph (trivial) has 186 edges and 411 vertex of which 6 / 411 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 936 edges and 406 vertex of which 405 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 41 place count 405 transition count 318
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 80 place count 366 transition count 318
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 86 Pre rules applied. Total rules applied 80 place count 366 transition count 232
Deduced a syphon composed of 86 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 185 rules applied. Total rules applied 265 place count 267 transition count 232
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 270 place count 262 transition count 227
Iterating global reduction 2 with 5 rules applied. Total rules applied 275 place count 262 transition count 227
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 218 rules applied. Total rules applied 493 place count 151 transition count 120
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 495 place count 150 transition count 123
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 497 place count 150 transition count 121
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 499 place count 148 transition count 121
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 500 place count 148 transition count 121
Applied a total of 500 rules in 69 ms. Remains 148 /411 variables (removed 263) and now considering 121/365 (removed 244) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 148/411 places, 121/365 transitions.
Finished random walk after 43 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=21 )
Computed a total of 202 stabilizing places and 207 stable transitions
Graph (complete) has 943 edges and 411 vertex of which 410 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 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 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 365/365 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 404 transition count 358
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 404 transition count 358
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 400 transition count 354
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 400 transition count 354
Applied a total of 22 rules in 32 ms. Remains 400 /411 variables (removed 11) and now considering 354/365 (removed 11) transitions.
// Phase 1: matrix 354 rows 400 cols
[2023-03-09 11:29:44] [INFO ] Computed 84 place invariants in 10 ms
[2023-03-09 11:29:44] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-09 11:29:44] [INFO ] Invariant cache hit.
[2023-03-09 11:29:44] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
[2023-03-09 11:29:44] [INFO ] Invariant cache hit.
[2023-03-09 11:29:45] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 400/411 places, 354/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 782 ms. Remains : 400/411 places, 354/365 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s289 1)], 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]]
Stuttering criterion allowed to conclude after 237 steps with 1 reset in 4 ms.
FORMULA BusinessProcesses-PT-10-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLCardinality-01 finished in 1013 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((p0 U (G(p0)||(X(G(p0))&&p1)))))'
Support contains 1 out of 411 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 365/365 transitions.
Graph (trivial) has 186 edges and 411 vertex of which 6 / 411 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 937 edges and 406 vertex of which 405 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 404 transition count 317
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 82 place count 364 transition count 317
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 82 place count 364 transition count 232
Deduced a syphon composed of 85 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 183 rules applied. Total rules applied 265 place count 266 transition count 232
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 272 place count 259 transition count 225
Iterating global reduction 2 with 7 rules applied. Total rules applied 279 place count 259 transition count 225
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 2 with 211 rules applied. Total rules applied 490 place count 151 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 492 place count 150 transition count 125
Applied a total of 492 rules in 49 ms. Remains 150 /411 variables (removed 261) and now considering 125/365 (removed 240) transitions.
// Phase 1: matrix 125 rows 150 cols
[2023-03-09 11:29:45] [INFO ] Computed 66 place invariants in 3 ms
[2023-03-09 11:29:45] [INFO ] Implicit Places using invariants in 153 ms returned [1, 2, 3, 4, 5, 6, 7, 21, 22, 23, 24, 25, 26, 49, 50]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 157 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 135/411 places, 125/365 transitions.
Applied a total of 0 rules in 7 ms. Remains 135 /135 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 215 ms. Remains : 135/411 places, 125/365 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3128 steps with 397 reset in 15 ms.
FORMULA BusinessProcesses-PT-10-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLCardinality-05 finished in 289 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(G(p0))))'
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 365/365 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 405 transition count 359
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 405 transition count 359
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 401 transition count 355
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 401 transition count 355
Applied a total of 20 rules in 28 ms. Remains 401 /411 variables (removed 10) and now considering 355/365 (removed 10) transitions.
// Phase 1: matrix 355 rows 401 cols
[2023-03-09 11:29:45] [INFO ] Computed 84 place invariants in 8 ms
[2023-03-09 11:29:45] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-09 11:29:45] [INFO ] Invariant cache hit.
[2023-03-09 11:29:46] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
[2023-03-09 11:29:46] [INFO ] Invariant cache hit.
[2023-03-09 11:29:46] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 401/411 places, 355/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 851 ms. Remains : 401/411 places, 355/365 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (NEQ s208 0) (NEQ s280 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-10-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLCardinality-07 finished in 1004 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(G((!p0 U (F(p2)||p1))))))'
Support contains 4 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 365/365 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 407 transition count 361
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 407 transition count 361
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 404 transition count 358
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 404 transition count 358
Applied a total of 14 rules in 18 ms. Remains 404 /411 variables (removed 7) and now considering 358/365 (removed 7) transitions.
// Phase 1: matrix 358 rows 404 cols
[2023-03-09 11:29:46] [INFO ] Computed 84 place invariants in 3 ms
[2023-03-09 11:29:46] [INFO ] Implicit Places using invariants in 181 ms returned []
[2023-03-09 11:29:46] [INFO ] Invariant cache hit.
[2023-03-09 11:29:47] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
[2023-03-09 11:29:47] [INFO ] Invariant cache hit.
[2023-03-09 11:29:47] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 404/411 places, 358/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 926 ms. Remains : 404/411 places, 358/365 transitions.
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s323 0) (EQ s326 1)), p2:(OR (EQ s339 0) (EQ s196 1)), p0:(OR (EQ s323 0) (EQ s326 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 816 reset in 239 ms.
Product exploration explored 100000 steps with 831 reset in 293 ms.
Computed a total of 195 stabilizing places and 200 stable transitions
Graph (complete) has 936 edges and 404 vertex of which 403 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 195 stabilizing places and 200 stable transitions
Knowledge obtained : [(AND p1 p2 p0), true, (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 234 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 81 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-03-09 11:29:48] [INFO ] Invariant cache hit.
[2023-03-09 11:29:48] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-09 11:29:49] [INFO ] [Nat]Absence check using 45 positive place invariants in 12 ms returned sat
[2023-03-09 11:29:49] [INFO ] [Nat]Absence check using 45 positive and 39 generalized place invariants in 12 ms returned sat
[2023-03-09 11:29:49] [INFO ] After 86ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), true, (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT p2))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))
Knowledge based reduction with 6 factoid took 238 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-10-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-10-LTLCardinality-08 finished in 2798 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((G(p0)||(G(p2)&&p1)))))'
Support contains 4 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 365/365 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 405 transition count 359
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 405 transition count 359
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 402 transition count 356
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 402 transition count 356
Applied a total of 18 rules in 28 ms. Remains 402 /411 variables (removed 9) and now considering 356/365 (removed 9) transitions.
// Phase 1: matrix 356 rows 402 cols
[2023-03-09 11:29:49] [INFO ] Computed 84 place invariants in 5 ms
[2023-03-09 11:29:49] [INFO ] Implicit Places using invariants in 157 ms returned []
[2023-03-09 11:29:49] [INFO ] Invariant cache hit.
[2023-03-09 11:29:49] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
[2023-03-09 11:29:49] [INFO ] Invariant cache hit.
[2023-03-09 11:29:50] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 402/411 places, 356/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 725 ms. Remains : 402/411 places, 356/365 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : BusinessProcesses-PT-10-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={1} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (EQ s360 0) (EQ s99 1)), p1:(AND (EQ s99 0) (EQ s360 1)), p2:(OR (EQ s299 0) (EQ s6 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 819 reset in 263 ms.
Product exploration explored 100000 steps with 825 reset in 448 ms.
Computed a total of 197 stabilizing places and 202 stable transitions
Graph (complete) has 929 edges and 402 vertex of which 401 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 197 stabilizing places and 202 stable transitions
Detected a total of 197/402 stabilizing places and 202/356 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p0) p1 p2))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 790 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Incomplete random walk after 10000 steps, including 80 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-09 11:29:52] [INFO ] Invariant cache hit.
[2023-03-09 11:29:52] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-09 11:29:52] [INFO ] [Nat]Absence check using 45 positive place invariants in 13 ms returned sat
[2023-03-09 11:29:52] [INFO ] [Nat]Absence check using 45 positive and 39 generalized place invariants in 11 ms returned sat
[2023-03-09 11:29:52] [INFO ] After 257ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p0) p1 p2))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND p0 p2 p1))), (G (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F (AND (NOT p0) p2 p1)), (F (NOT (AND p0 p2))), (F (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))), (F (AND (NOT p0) p2))]
Property proved to be true thanks to knowledge :(F (OR (G p0) (G (NOT p0))))
Knowledge based reduction with 19 factoid took 1096 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-10-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-10-LTLCardinality-09 finished in 4421 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((p1 U F((X(X(p1))||X(p1)))))||p0)))'
Support contains 4 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 365/365 transitions.
Graph (trivial) has 183 edges and 411 vertex of which 6 / 411 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 937 edges and 406 vertex of which 405 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 404 transition count 321
Reduce places removed 36 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 368 transition count 319
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 78 place count 366 transition count 319
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 78 place count 366 transition count 234
Deduced a syphon composed of 85 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 260 place count 269 transition count 234
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 265 place count 264 transition count 229
Iterating global reduction 3 with 5 rules applied. Total rules applied 270 place count 264 transition count 229
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 215 rules applied. Total rules applied 485 place count 154 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 487 place count 153 transition count 127
Applied a total of 487 rules in 58 ms. Remains 153 /411 variables (removed 258) and now considering 127/365 (removed 238) transitions.
// Phase 1: matrix 127 rows 153 cols
[2023-03-09 11:29:53] [INFO ] Computed 67 place invariants in 2 ms
[2023-03-09 11:29:53] [INFO ] Implicit Places using invariants in 119 ms returned [1, 2, 3, 4, 5, 6, 7, 21, 22, 23, 26, 27, 28, 51, 52, 116]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 121 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 137/411 places, 127/365 transitions.
Applied a total of 0 rules in 6 ms. Remains 137 /137 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 185 ms. Remains : 137/411 places, 127/365 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s105 0) (EQ s8 1)), p1:(OR (EQ s15 0) (EQ s108 1))], 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 20256 reset in 253 ms.
Product exploration explored 100000 steps with 20349 reset in 200 ms.
Computed a total of 66 stabilizing places and 81 stable transitions
Computed a total of 66 stabilizing places and 81 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 2546 steps, including 566 resets, run visited all 2 properties in 14 ms. (steps per millisecond=181 )
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 194 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 127/127 transitions.
Applied a total of 0 rules in 10 ms. Remains 137 /137 variables (removed 0) and now considering 127/127 (removed 0) transitions.
// Phase 1: matrix 127 rows 137 cols
[2023-03-09 11:29:55] [INFO ] Computed 51 place invariants in 2 ms
[2023-03-09 11:29:55] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-09 11:29:55] [INFO ] Invariant cache hit.
[2023-03-09 11:29:55] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 11:29:55] [INFO ] Implicit Places using invariants and state equation in 162 ms returned [16, 73, 79, 85, 87]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 287 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/137 places, 127/127 transitions.
Graph (complete) has 485 edges and 132 vertex of which 123 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 123 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 122 transition count 122
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 12 place count 113 transition count 86
Iterating global reduction 2 with 9 rules applied. Total rules applied 21 place count 113 transition count 86
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 111 transition count 84
Applied a total of 25 rules in 12 ms. Remains 111 /132 variables (removed 21) and now considering 84/127 (removed 43) transitions.
// Phase 1: matrix 84 rows 111 cols
[2023-03-09 11:29:55] [INFO ] Computed 41 place invariants in 2 ms
[2023-03-09 11:29:55] [INFO ] Implicit Places using invariants in 98 ms returned [16, 17, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 100 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 108/137 places, 84/127 transitions.
Applied a total of 0 rules in 12 ms. Remains 108 /108 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 423 ms. Remains : 108/137 places, 84/127 transitions.
Computed a total of 37 stabilizing places and 38 stable transitions
Computed a total of 37 stabilizing places and 38 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 561 steps, including 129 resets, run visited all 2 properties in 8 ms. (steps per millisecond=70 )
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 215 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 20819 reset in 213 ms.
Product exploration explored 100000 steps with 20829 reset in 247 ms.
Built C files in :
/tmp/ltsmin5080487819734578632
[2023-03-09 11:29:56] [INFO ] Computing symmetric may disable matrix : 84 transitions.
[2023-03-09 11:29:56] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 11:29:56] [INFO ] Computing symmetric may enable matrix : 84 transitions.
[2023-03-09 11:29:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 11:29:57] [INFO ] Computing Do-Not-Accords matrix : 84 transitions.
[2023-03-09 11:29:57] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 11:29:57] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5080487819734578632
Running compilation step : cd /tmp/ltsmin5080487819734578632;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 423 ms.
Running link step : cd /tmp/ltsmin5080487819734578632;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin5080487819734578632;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1826685067133308384.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 84/84 transitions.
Applied a total of 0 rules in 12 ms. Remains 108 /108 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 108 cols
[2023-03-09 11:30:12] [INFO ] Computed 38 place invariants in 2 ms
[2023-03-09 11:30:12] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-09 11:30:12] [INFO ] Invariant cache hit.
[2023-03-09 11:30:12] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 11:30:12] [INFO ] Implicit Places using invariants and state equation in 118 ms returned [54, 57, 59]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 262 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/108 places, 84/84 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 105 transition count 81
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 102 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 101 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 101 transition count 79
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 31 place count 87 transition count 70
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 34 place count 84 transition count 67
Iterating global reduction 2 with 3 rules applied. Total rules applied 37 place count 84 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 83 transition count 66
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 83 transition count 65
Applied a total of 40 rules in 15 ms. Remains 83 /105 variables (removed 22) and now considering 65/84 (removed 19) transitions.
// Phase 1: matrix 65 rows 83 cols
[2023-03-09 11:30:12] [INFO ] Computed 30 place invariants in 1 ms
[2023-03-09 11:30:12] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-09 11:30:12] [INFO ] Invariant cache hit.
[2023-03-09 11:30:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 11:30:12] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 83/108 places, 65/84 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 421 ms. Remains : 83/108 places, 65/84 transitions.
Built C files in :
/tmp/ltsmin17650383600929456107
[2023-03-09 11:30:12] [INFO ] Computing symmetric may disable matrix : 65 transitions.
[2023-03-09 11:30:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 11:30:12] [INFO ] Computing symmetric may enable matrix : 65 transitions.
[2023-03-09 11:30:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 11:30:12] [INFO ] Computing Do-Not-Accords matrix : 65 transitions.
[2023-03-09 11:30:12] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 11:30:12] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17650383600929456107
Running compilation step : cd /tmp/ltsmin17650383600929456107;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 158 ms.
Running link step : cd /tmp/ltsmin17650383600929456107;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin17650383600929456107;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1534823605225515875.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-09 11:30:27] [INFO ] Flatten gal took : 9 ms
[2023-03-09 11:30:27] [INFO ] Flatten gal took : 7 ms
[2023-03-09 11:30:27] [INFO ] Time to serialize gal into /tmp/LTL4357189759201935254.gal : 2 ms
[2023-03-09 11:30:27] [INFO ] Time to serialize properties into /tmp/LTL8597482030968111665.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4357189759201935254.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6511159059888780116.hoa' '-atoms' '/tmp/LTL8597482030968111665.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL8597482030968111665.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6511159059888780116.hoa
Detected timeout of ITS tools.
[2023-03-09 11:30:42] [INFO ] Flatten gal took : 14 ms
[2023-03-09 11:30:42] [INFO ] Flatten gal took : 13 ms
[2023-03-09 11:30:42] [INFO ] Time to serialize gal into /tmp/LTL9100486111733776502.gal : 2 ms
[2023-03-09 11:30:42] [INFO ] Time to serialize properties into /tmp/LTL7814333929079149249.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9100486111733776502.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7814333929079149249.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(((F(("((p131==0)||(p468==1))")U(F((X(X("((p131==0)||(p468==1))")))||(X("((p131==0)||(p468==1))"))))))||("(p465==0)"))||("(p90==1)...160
Formula 0 simplified : F(!"(p90==1)" & !"(p465==0)" & XG(!"((p131==0)||(p468==1))" & X!"((p131==0)||(p468==1))"))
Detected timeout of ITS tools.
[2023-03-09 11:30:57] [INFO ] Flatten gal took : 14 ms
[2023-03-09 11:30:57] [INFO ] Applying decomposition
[2023-03-09 11:30:57] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10777772712023936794.txt' '-o' '/tmp/graph10777772712023936794.bin' '-w' '/tmp/graph10777772712023936794.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10777772712023936794.bin' '-l' '-1' '-v' '-w' '/tmp/graph10777772712023936794.weights' '-q' '0' '-e' '0.001'
[2023-03-09 11:30:58] [INFO ] Decomposing Gal with order
[2023-03-09 11:30:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 11:30:58] [INFO ] Removed a total of 82 redundant transitions.
[2023-03-09 11:30:58] [INFO ] Flatten gal took : 55 ms
[2023-03-09 11:30:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 29 ms.
[2023-03-09 11:30:58] [INFO ] Time to serialize gal into /tmp/LTL9331424937699738003.gal : 6 ms
[2023-03-09 11:30:58] [INFO ] Time to serialize properties into /tmp/LTL5355517121872955161.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9331424937699738003.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5355517121872955161.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(((F(("((i3.u6.p131==0)||(i9.u31.p468==1))")U(F((X(X("((i3.u6.p131==0)||(i9.u31.p468==1))")))||(X("((i3.u6.p131==0)||(i9.u31.p468=...218
Formula 0 simplified : F(!"(i6.i0.u30.p465==0)" & !"(i7.i1.u4.p90==1)" & XG(!"((i3.u6.p131==0)||(i9.u31.p468==1))" & X!"((i3.u6.p131==0)||(i9.u31.p468==1))...158
Reverse transition relation is NOT exact ! Due to transitions t16, t18, t41_t43_t44_t6, t29_t31_t32_t7, t26_t27_t8, t23_t24_t9, t20_t21_t10, t49_t119_t230_...1214
Computing Next relation with stutter on 4.98893e+07 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
748 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.50319,146452,1,0,199168,26826,1947,518686,347,181233,269770
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-10-LTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BusinessProcesses-PT-10-LTLCardinality-10 finished in 72902 ms.
All properties solved by simple procedures.
Total runtime 85755 ms.

BK_STOP 1678361466869

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="BusinessProcesses-PT-10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BusinessProcesses-PT-10, 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 r037-tajo-167813690500523"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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