fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r246-tall-171654352100668
Last Updated
July 7, 2024

About the Execution of ITS-Tools for NoC3x3-PT-8A

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
619.224 486731.00 562307.00 1265.30 TFFFFFFFFFFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r246-tall-171654352100668.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is NoC3x3-PT-8A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-tall-171654352100668
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 07:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 12 07:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 07:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 12 07:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 745K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716713994095

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-8A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-26 08:59:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 08:59:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 08:59:55] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2024-05-26 08:59:55] [INFO ] Transformed 317 places.
[2024-05-26 08:59:55] [INFO ] Transformed 4293 transitions.
[2024-05-26 08:59:55] [INFO ] Found NUPN structural information;
[2024-05-26 08:59:55] [INFO ] Parsed PT model containing 317 places and 4293 transitions and 9691 arcs in 281 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 3607 transitions
Reduce redundant transitions removed 3607 transitions.
FORMULA NoC3x3-PT-8A-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8A-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8A-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8A-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 686/686 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 261 transition count 562
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 261 transition count 562
Drop transitions (Redundant composition of simpler transitions.) removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 0 with 52 rules applied. Total rules applied 164 place count 261 transition count 510
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 173 place count 252 transition count 510
Applied a total of 173 rules in 62 ms. Remains 252 /317 variables (removed 65) and now considering 510/686 (removed 176) transitions.
// Phase 1: matrix 510 rows 252 cols
[2024-05-26 08:59:55] [INFO ] Computed 57 invariants in 18 ms
[2024-05-26 08:59:56] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-05-26 08:59:56] [INFO ] Invariant cache hit.
[2024-05-26 08:59:56] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
Running 509 sub problems to find dead transitions.
[2024-05-26 08:59:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (OVERLAPS) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Real declared 762/762 variables, and 309 constraints, problems are : Problem set: 0 solved, 509 unsolved in 18778 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 509/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (OVERLAPS) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Int declared 762/762 variables, and 818 constraints, problems are : Problem set: 0 solved, 509 unsolved in 24504 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
After SMT, in 43520ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 43542ms
Starting structural reductions in LTL mode, iteration 1 : 252/317 places, 510/686 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44231 ms. Remains : 252/317 places, 510/686 transitions.
Support contains 23 out of 252 places after structural reductions.
[2024-05-26 09:00:40] [INFO ] Flatten gal took : 73 ms
[2024-05-26 09:00:40] [INFO ] Flatten gal took : 38 ms
[2024-05-26 09:00:40] [INFO ] Input system was already deterministic with 510 transitions.
Reduction of identical properties reduced properties to check from 23 to 22
RANDOM walk for 11763 steps (2 resets) in 716 ms. (16 steps per ms) remains 0/22 properties
FORMULA NoC3x3-PT-8A-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(p0))&&F(p1))))'
Support contains 2 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 510/510 transitions.
Applied a total of 0 rules in 4 ms. Remains 252 /252 variables (removed 0) and now considering 510/510 (removed 0) transitions.
[2024-05-26 09:00:40] [INFO ] Invariant cache hit.
[2024-05-26 09:00:41] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-26 09:00:41] [INFO ] Invariant cache hit.
[2024-05-26 09:00:41] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Running 509 sub problems to find dead transitions.
[2024-05-26 09:00:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (OVERLAPS) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Real declared 762/762 variables, and 309 constraints, problems are : Problem set: 0 solved, 509 unsolved in 18398 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 509/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (OVERLAPS) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Int declared 762/762 variables, and 818 constraints, problems are : Problem set: 0 solved, 509 unsolved in 24537 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
After SMT, in 43110ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 43116ms
Finished structural reductions in LTL mode , in 1 iterations and 43503 ms. Remains : 252/252 places, 510/510 transitions.
Stuttering acceptance computed with spot in 365 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-00
Product exploration explored 100000 steps with 33333 reset in 756 ms.
Product exploration explored 100000 steps with 33333 reset in 585 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 84 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-8A-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-8A-LTLFireability-00 finished in 45395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(p1)))'
Support contains 3 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 510/510 transitions.
Applied a total of 0 rules in 6 ms. Remains 252 /252 variables (removed 0) and now considering 510/510 (removed 0) transitions.
[2024-05-26 09:01:26] [INFO ] Invariant cache hit.
[2024-05-26 09:01:26] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-26 09:01:26] [INFO ] Invariant cache hit.
[2024-05-26 09:01:26] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 509 sub problems to find dead transitions.
[2024-05-26 09:01:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (OVERLAPS) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Real declared 762/762 variables, and 309 constraints, problems are : Problem set: 0 solved, 509 unsolved in 18274 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 509/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (OVERLAPS) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Int declared 762/762 variables, and 818 constraints, problems are : Problem set: 0 solved, 509 unsolved in 23466 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
After SMT, in 41880ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 41885ms
Finished structural reductions in LTL mode , in 1 iterations and 42239 ms. Remains : 252/252 places, 510/510 transitions.
Stuttering acceptance computed with spot in 189 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-01 finished in 42446 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&(p0 U X(p1)))))))'
Support contains 2 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 510/510 transitions.
Applied a total of 0 rules in 6 ms. Remains 252 /252 variables (removed 0) and now considering 510/510 (removed 0) transitions.
[2024-05-26 09:02:08] [INFO ] Invariant cache hit.
[2024-05-26 09:02:08] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-26 09:02:08] [INFO ] Invariant cache hit.
[2024-05-26 09:02:09] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Running 509 sub problems to find dead transitions.
[2024-05-26 09:02:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (OVERLAPS) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Real declared 762/762 variables, and 309 constraints, problems are : Problem set: 0 solved, 509 unsolved in 18233 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 509/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (OVERLAPS) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Int declared 762/762 variables, and 818 constraints, problems are : Problem set: 0 solved, 509 unsolved in 24144 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
After SMT, in 42515ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 42519ms
Finished structural reductions in LTL mode , in 1 iterations and 42879 ms. Remains : 252/252 places, 510/510 transitions.
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-02
Product exploration explored 100000 steps with 77 reset in 360 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-02 finished in 43495 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 510/510 transitions.
Applied a total of 0 rules in 5 ms. Remains 252 /252 variables (removed 0) and now considering 510/510 (removed 0) transitions.
[2024-05-26 09:02:52] [INFO ] Invariant cache hit.
[2024-05-26 09:02:52] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-26 09:02:52] [INFO ] Invariant cache hit.
[2024-05-26 09:02:52] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Running 509 sub problems to find dead transitions.
[2024-05-26 09:02:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (OVERLAPS) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Real declared 762/762 variables, and 309 constraints, problems are : Problem set: 0 solved, 509 unsolved in 18517 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 509/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (OVERLAPS) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Int declared 762/762 variables, and 818 constraints, problems are : Problem set: 0 solved, 509 unsolved in 23751 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
After SMT, in 42403ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 42408ms
Finished structural reductions in LTL mode , in 1 iterations and 42726 ms. Remains : 252/252 places, 510/510 transitions.
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-03 finished in 42849 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&(p1 U (p2||G(p1))))))'
Support contains 3 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 510/510 transitions.
Applied a total of 0 rules in 11 ms. Remains 252 /252 variables (removed 0) and now considering 510/510 (removed 0) transitions.
[2024-05-26 09:03:35] [INFO ] Invariant cache hit.
[2024-05-26 09:03:35] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-26 09:03:35] [INFO ] Invariant cache hit.
[2024-05-26 09:03:35] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 509 sub problems to find dead transitions.
[2024-05-26 09:03:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (OVERLAPS) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Real declared 762/762 variables, and 309 constraints, problems are : Problem set: 0 solved, 509 unsolved in 18164 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 509/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (OVERLAPS) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Int declared 762/762 variables, and 818 constraints, problems are : Problem set: 0 solved, 509 unsolved in 23847 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
After SMT, in 42133ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 42138ms
Finished structural reductions in LTL mode , in 1 iterations and 42471 ms. Remains : 252/252 places, 510/510 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-04 finished in 42685 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(G(p0)) U (p1 U (p0&&F(p1)))))))'
Support contains 2 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 510/510 transitions.
Applied a total of 0 rules in 7 ms. Remains 252 /252 variables (removed 0) and now considering 510/510 (removed 0) transitions.
[2024-05-26 09:04:17] [INFO ] Invariant cache hit.
[2024-05-26 09:04:17] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-26 09:04:17] [INFO ] Invariant cache hit.
[2024-05-26 09:04:18] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
Running 509 sub problems to find dead transitions.
[2024-05-26 09:04:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (OVERLAPS) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Real declared 762/762 variables, and 309 constraints, problems are : Problem set: 0 solved, 509 unsolved in 18145 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 509/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (OVERLAPS) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Int declared 762/762 variables, and 818 constraints, problems are : Problem set: 0 solved, 509 unsolved in 24236 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
After SMT, in 42516ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 42521ms
Finished structural reductions in LTL mode , in 1 iterations and 42844 ms. Remains : 252/252 places, 510/510 transitions.
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 356 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 0 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-06 finished in 43480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(X(G(p0)))&&(p1 U (p2||G(p1)))))))'
Support contains 3 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 510/510 transitions.
Applied a total of 0 rules in 5 ms. Remains 252 /252 variables (removed 0) and now considering 510/510 (removed 0) transitions.
[2024-05-26 09:05:01] [INFO ] Invariant cache hit.
[2024-05-26 09:05:01] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-26 09:05:01] [INFO ] Invariant cache hit.
[2024-05-26 09:05:01] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 509 sub problems to find dead transitions.
[2024-05-26 09:05:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (OVERLAPS) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Real declared 762/762 variables, and 309 constraints, problems are : Problem set: 0 solved, 509 unsolved in 18169 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 509/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (OVERLAPS) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Int declared 762/762 variables, and 818 constraints, problems are : Problem set: 0 solved, 509 unsolved in 23528 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
After SMT, in 41851ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 41856ms
Finished structural reductions in LTL mode , in 1 iterations and 42184 ms. Remains : 252/252 places, 510/510 transitions.
Stuttering acceptance computed with spot in 335 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-08
Product exploration explored 100000 steps with 345 reset in 447 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 0 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-08 finished in 42994 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 510/510 transitions.
Graph (trivial) has 164 edges and 252 vertex of which 75 / 252 are part of one of the 33 SCC in 7 ms
Free SCC test removed 42 places
Ensure Unique test removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 200 transition count 345
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 66 place count 176 transition count 345
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 112 place count 153 transition count 322
Drop transitions (Redundant composition of simpler transitions.) removed 136 transitions
Redundant transition composition rules discarded 136 transitions
Iterating global reduction 2 with 136 rules applied. Total rules applied 248 place count 153 transition count 186
Applied a total of 248 rules in 59 ms. Remains 153 /252 variables (removed 99) and now considering 186/510 (removed 324) transitions.
// Phase 1: matrix 186 rows 153 cols
[2024-05-26 09:05:44] [INFO ] Computed 48 invariants in 1 ms
[2024-05-26 09:05:44] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-26 09:05:44] [INFO ] Invariant cache hit.
[2024-05-26 09:05:44] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-26 09:05:44] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2024-05-26 09:05:44] [INFO ] Redundant transitions in 6 ms returned []
Running 161 sub problems to find dead transitions.
[2024-05-26 09:05:44] [INFO ] Invariant cache hit.
[2024-05-26 09:05:44] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 185/338 variables, 153/201 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 112/313 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (OVERLAPS) 0/338 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/339 variables, and 313 constraints, problems are : Problem set: 0 solved, 161 unsolved in 3152 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 153/153 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 185/338 variables, 153/201 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 112/313 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 161/474 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 0/338 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 338/339 variables, and 474 constraints, problems are : Problem set: 0 solved, 161 unsolved in 2995 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 153/153 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints]
After SMT, in 6172ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 6174ms
Starting structural reductions in SI_LTL mode, iteration 1 : 153/252 places, 186/510 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6454 ms. Remains : 153/252 places, 186/510 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-09 finished in 6555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(p1||F(G(p2))))))'
Support contains 3 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 510/510 transitions.
Applied a total of 0 rules in 11 ms. Remains 252 /252 variables (removed 0) and now considering 510/510 (removed 0) transitions.
// Phase 1: matrix 510 rows 252 cols
[2024-05-26 09:05:50] [INFO ] Computed 57 invariants in 3 ms
[2024-05-26 09:05:50] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-26 09:05:50] [INFO ] Invariant cache hit.
[2024-05-26 09:05:51] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
Running 509 sub problems to find dead transitions.
[2024-05-26 09:05:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (OVERLAPS) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Real declared 762/762 variables, and 309 constraints, problems are : Problem set: 0 solved, 509 unsolved in 18813 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 509/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (OVERLAPS) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Int declared 762/762 variables, and 818 constraints, problems are : Problem set: 0 solved, 509 unsolved in 24004 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
After SMT, in 42961ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 42965ms
Finished structural reductions in LTL mode , in 1 iterations and 43293 ms. Remains : 252/252 places, 510/510 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p2)]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 365 ms.
Stack based approach found an accepted trace after 802 steps with 0 reset with depth 803 and stack size 789 in 4 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-10 finished in 43857 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F((p1||G(p2))))&&p0)))'
Support contains 3 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 510/510 transitions.
Applied a total of 0 rules in 3 ms. Remains 252 /252 variables (removed 0) and now considering 510/510 (removed 0) transitions.
[2024-05-26 09:06:34] [INFO ] Invariant cache hit.
[2024-05-26 09:06:34] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-26 09:06:34] [INFO ] Invariant cache hit.
[2024-05-26 09:06:35] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 509 sub problems to find dead transitions.
[2024-05-26 09:06:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (OVERLAPS) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Real declared 762/762 variables, and 309 constraints, problems are : Problem set: 0 solved, 509 unsolved in 18646 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 509/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (OVERLAPS) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Int declared 762/762 variables, and 818 constraints, problems are : Problem set: 0 solved, 509 unsolved in 23768 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
After SMT, in 42552ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 42558ms
Finished structural reductions in LTL mode , in 1 iterations and 42871 ms. Remains : 252/252 places, 510/510 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-14 finished in 43094 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 510/510 transitions.
Applied a total of 0 rules in 5 ms. Remains 252 /252 variables (removed 0) and now considering 510/510 (removed 0) transitions.
[2024-05-26 09:07:17] [INFO ] Invariant cache hit.
[2024-05-26 09:07:17] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-26 09:07:17] [INFO ] Invariant cache hit.
[2024-05-26 09:07:18] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
Running 509 sub problems to find dead transitions.
[2024-05-26 09:07:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (OVERLAPS) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Real declared 762/762 variables, and 309 constraints, problems are : Problem set: 0 solved, 509 unsolved in 18423 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 509/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (OVERLAPS) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Int declared 762/762 variables, and 818 constraints, problems are : Problem set: 0 solved, 509 unsolved in 23595 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
After SMT, in 42152ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 42156ms
Finished structural reductions in LTL mode , in 1 iterations and 42478 ms. Remains : 252/252 places, 510/510 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-15
Product exploration explored 100000 steps with 825 reset in 393 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-15 finished in 43019 ms.
All properties solved by simple procedures.
Total runtime 485522 ms.

BK_STOP 1716714480826

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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="NoC3x3-PT-8A"
export BK_EXAMINATION="LTLFireability"
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-5568"
echo " Executing tool itstools"
echo " Input is NoC3x3-PT-8A, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r246-tall-171654352100668"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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