fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r289-tajo-171654445300156
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for PolyORBLF-COL-S04J06T08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16206.331 3600000.00 12061943.00 1615.50 FFF????F?F???T?F normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445300156.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBLF-COL-S04J06T08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445300156
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 11K Apr 11 16:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 11 16:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 11 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 11 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S04J06T08-LTLFireability-00
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLFireability-01
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLFireability-02
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLFireability-03
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLFireability-04
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLFireability-05
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLFireability-06
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLFireability-07
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLFireability-08
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLFireability-09
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLFireability-10
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLFireability-11
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLFireability-12
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLFireability-13
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLFireability-14
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716852607125

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J06T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 23:30:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-27 23:30:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 23:30:08] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-27 23:30:09] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 23:30:09] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 644 ms
[2024-05-27 23:30:09] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 792 PT places and 4336.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2024-05-27 23:30:09] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2024-05-27 23:30:09] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 6 formulas.
FORMULA PolyORBLF-COL-S04J06T08-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T08-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T08-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T08-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T08-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T08-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 10 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 19 to 17
RANDOM walk for 40000 steps (11 resets) in 1166 ms. (34 steps per ms) remains 1/17 properties
BEST_FIRST walk for 40000 steps (8 resets) in 413 ms. (96 steps per ms) remains 1/1 properties
[2024-05-27 23:30:10] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-27 23:30:10] [INFO ] Computed 26 invariants in 13 ms
[2024-05-27 23:30:10] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/38 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/48 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/52 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/52 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp15 is UNSAT
After SMT solving in domain Real declared 75/145 variables, and 22 constraints, problems are : Problem set: 1 solved, 0 unsolved in 181 ms.
Refiners :[Positive P Invariants (semi-flows): 9/11 constraints, Generalized P Invariants (flows): 13/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 223ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
[2024-05-27 23:30:10] [INFO ] Flatten gal took : 29 ms
[2024-05-27 23:30:10] [INFO ] Flatten gal took : 9 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-27 23:30:10] [INFO ] Unfolded HLPN to a Petri net with 792 places and 4268 transitions 28832 arcs in 108 ms.
[2024-05-27 23:30:10] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
Support contains 272 out of 792 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 788 transition count 2100
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 12 place count 780 transition count 2092
Iterating global reduction 1 with 8 rules applied. Total rules applied 20 place count 780 transition count 2092
Applied a total of 20 rules in 100 ms. Remains 780 /792 variables (removed 12) and now considering 2092/2100 (removed 8) transitions.
Running 2088 sub problems to find dead transitions.
[2024-05-27 23:30:10] [INFO ] Flow matrix only has 2060 transitions (discarded 32 similar events)
// Phase 1: matrix 2060 rows 780 cols
[2024-05-27 23:30:11] [INFO ] Computed 54 invariants in 115 ms
[2024-05-27 23:30:11] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/776 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/776 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 776/2840 variables, and 50 constraints, problems are : Problem set: 0 solved, 2088 unsolved in 20059 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/780 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2088/2088 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2088 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/776 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/776 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
[2024-05-27 23:30:42] [INFO ] Deduced a trap composed of 82 places in 257 ms of which 19 ms to minimize.
[2024-05-27 23:30:42] [INFO ] Deduced a trap composed of 82 places in 177 ms of which 2 ms to minimize.
[2024-05-27 23:30:42] [INFO ] Deduced a trap composed of 82 places in 121 ms of which 2 ms to minimize.
[2024-05-27 23:30:42] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 12 ms to minimize.
[2024-05-27 23:30:42] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 1 ms to minimize.
[2024-05-27 23:30:42] [INFO ] Deduced a trap composed of 82 places in 85 ms of which 1 ms to minimize.
[2024-05-27 23:30:42] [INFO ] Deduced a trap composed of 82 places in 83 ms of which 1 ms to minimize.
[2024-05-27 23:30:43] [INFO ] Deduced a trap composed of 228 places in 397 ms of which 6 ms to minimize.
[2024-05-27 23:30:44] [INFO ] Deduced a trap composed of 217 places in 466 ms of which 9 ms to minimize.
[2024-05-27 23:30:46] [INFO ] Deduced a trap composed of 83 places in 79 ms of which 1 ms to minimize.
[2024-05-27 23:30:58] [INFO ] Deduced a trap composed of 98 places in 198 ms of which 3 ms to minimize.
[2024-05-27 23:30:58] [INFO ] Deduced a trap composed of 47 places in 207 ms of which 4 ms to minimize.
[2024-05-27 23:30:58] [INFO ] Deduced a trap composed of 98 places in 249 ms of which 4 ms to minimize.
[2024-05-27 23:30:59] [INFO ] Deduced a trap composed of 97 places in 282 ms of which 3 ms to minimize.
[2024-05-27 23:30:59] [INFO ] Deduced a trap composed of 47 places in 298 ms of which 4 ms to minimize.
[2024-05-27 23:31:00] [INFO ] Deduced a trap composed of 48 places in 271 ms of which 4 ms to minimize.
[2024-05-27 23:31:00] [INFO ] Deduced a trap composed of 19 places in 245 ms of which 4 ms to minimize.
SMT process timed out in 49569ms, After SMT, problems are : Problem set: 0 solved, 2088 unsolved
Search for dead transitions found 0 dead transitions in 49616ms
[2024-05-27 23:31:00] [INFO ] Flow matrix only has 2060 transitions (discarded 32 similar events)
[2024-05-27 23:31:00] [INFO ] Invariant cache hit.
[2024-05-27 23:31:01] [INFO ] Implicit Places using invariants in 486 ms returned []
[2024-05-27 23:31:01] [INFO ] Flow matrix only has 2060 transitions (discarded 32 similar events)
[2024-05-27 23:31:01] [INFO ] Invariant cache hit.
[2024-05-27 23:31:01] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-27 23:31:12] [INFO ] Implicit Places using invariants and state equation in 11913 ms returned []
Implicit Place search using SMT with State Equation took 12408 ms to find 0 implicit places.
Running 2088 sub problems to find dead transitions.
[2024-05-27 23:31:12] [INFO ] Flow matrix only has 2060 transitions (discarded 32 similar events)
[2024-05-27 23:31:12] [INFO ] Invariant cache hit.
[2024-05-27 23:31:12] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/776 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/776 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
[2024-05-27 23:31:46] [INFO ] Deduced a trap composed of 82 places in 75 ms of which 2 ms to minimize.
[2024-05-27 23:31:49] [INFO ] Deduced a trap composed of 130 places in 400 ms of which 5 ms to minimize.
[2024-05-27 23:31:49] [INFO ] Deduced a trap composed of 82 places in 72 ms of which 1 ms to minimize.
[2024-05-27 23:31:50] [INFO ] Deduced a trap composed of 82 places in 433 ms of which 4 ms to minimize.
[2024-05-27 23:31:50] [INFO ] Deduced a trap composed of 83 places in 443 ms of which 4 ms to minimize.
[2024-05-27 23:31:51] [INFO ] Deduced a trap composed of 82 places in 418 ms of which 4 ms to minimize.
[2024-05-27 23:31:51] [INFO ] Deduced a trap composed of 49 places in 409 ms of which 4 ms to minimize.
[2024-05-27 23:31:51] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 2 ms to minimize.
[2024-05-27 23:31:52] [INFO ] Deduced a trap composed of 83 places in 81 ms of which 1 ms to minimize.
[2024-05-27 23:31:52] [INFO ] Deduced a trap composed of 82 places in 82 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 776/2840 variables, and 60 constraints, problems are : Problem set: 0 solved, 2088 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/780 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2088/2088 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2088 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/776 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/776 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/776 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
[2024-05-27 23:31:56] [INFO ] Deduced a trap composed of 157 places in 487 ms of which 6 ms to minimize.
[2024-05-27 23:31:56] [INFO ] Deduced a trap composed of 193 places in 436 ms of which 5 ms to minimize.
[2024-05-27 23:31:57] [INFO ] Deduced a trap composed of 387 places in 413 ms of which 5 ms to minimize.
[2024-05-27 23:31:58] [INFO ] Deduced a trap composed of 467 places in 413 ms of which 5 ms to minimize.
[2024-05-27 23:32:09] [INFO ] Deduced a trap composed of 38 places in 269 ms of which 4 ms to minimize.
[2024-05-27 23:32:13] [INFO ] Deduced a trap composed of 19 places in 252 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 776/2840 variables, and 66 constraints, problems are : Problem set: 0 solved, 2088 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/780 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2088 constraints, Known Traps: 16/16 constraints]
After SMT, in 70094ms problems are : Problem set: 0 solved, 2088 unsolved
Search for dead transitions found 0 dead transitions in 70124ms
Starting structural reductions in LTL mode, iteration 1 : 780/792 places, 2092/2100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 132294 ms. Remains : 780/792 places, 2092/2100 transitions.
Support contains 272 out of 780 places after structural reductions.
[2024-05-27 23:32:23] [INFO ] Flatten gal took : 269 ms
[2024-05-27 23:32:23] [INFO ] Flatten gal took : 197 ms
[2024-05-27 23:32:24] [INFO ] Input system was already deterministic with 2092 transitions.
Support contains 264 out of 780 places (down from 272) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 19 to 16
RANDOM walk for 40000 steps (9 resets) in 1616 ms. (24 steps per ms) remains 1/16 properties
BEST_FIRST walk for 40004 steps (8 resets) in 448 ms. (89 steps per ms) remains 1/1 properties
[2024-05-27 23:32:24] [INFO ] Flow matrix only has 2060 transitions (discarded 32 similar events)
[2024-05-27 23:32:24] [INFO ] Invariant cache hit.
[2024-05-27 23:32:24] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 28/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 98/196 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 15/211 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 529/740 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 23:32:25] [INFO ] Deduced a trap composed of 82 places in 190 ms of which 4 ms to minimize.
[2024-05-27 23:32:25] [INFO ] Deduced a trap composed of 82 places in 140 ms of which 7 ms to minimize.
[2024-05-27 23:32:25] [INFO ] Deduced a trap composed of 82 places in 139 ms of which 3 ms to minimize.
[2024-05-27 23:32:25] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
[2024-05-27 23:32:25] [INFO ] Deduced a trap composed of 83 places in 72 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/740 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/740 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 13/753 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/753 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp16 is UNSAT
After SMT solving in domain Real declared 778/2840 variables, and 58 constraints, problems are : Problem set: 1 solved, 0 unsolved in 1356 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/780 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 1424ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBLF-COL-S04J06T08-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 0 stabilizing places and 0 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(p0))'
Support contains 17 out of 780 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 780/780 places, 2092/2092 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 40 place count 780 transition count 2052
Reduce places removed 40 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 48 rules applied. Total rules applied 88 place count 740 transition count 2044
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 96 place count 732 transition count 2044
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 104 Pre rules applied. Total rules applied 96 place count 732 transition count 1940
Deduced a syphon composed of 104 places in 2 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 304 place count 628 transition count 1940
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 432 place count 564 transition count 1876
Applied a total of 432 rules in 193 ms. Remains 564 /780 variables (removed 216) and now considering 1876/2092 (removed 216) transitions.
Running 1872 sub problems to find dead transitions.
[2024-05-27 23:32:26] [INFO ] Flow matrix only has 1844 transitions (discarded 32 similar events)
// Phase 1: matrix 1844 rows 564 cols
[2024-05-27 23:32:26] [INFO ] Computed 54 invariants in 82 ms
[2024-05-27 23:32:26] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
[2024-05-27 23:32:51] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 1 ms to minimize.
[2024-05-27 23:32:51] [INFO ] Deduced a trap composed of 55 places in 53 ms of which 2 ms to minimize.
[2024-05-27 23:32:51] [INFO ] Deduced a trap composed of 55 places in 72 ms of which 1 ms to minimize.
[2024-05-27 23:32:52] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 1 ms to minimize.
[2024-05-27 23:32:52] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 1 ms to minimize.
[2024-05-27 23:32:52] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 1 ms to minimize.
[2024-05-27 23:32:52] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 2 ms to minimize.
[2024-05-27 23:32:52] [INFO ] Deduced a trap composed of 56 places in 47 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 560/2408 variables, and 58 constraints, problems are : Problem set: 0 solved, 1872 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 34/36 constraints, State Equation: 0/564 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1872/1872 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1872 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
[2024-05-27 23:33:01] [INFO ] Deduced a trap composed of 268 places in 479 ms of which 5 ms to minimize.
[2024-05-27 23:33:01] [INFO ] Deduced a trap composed of 19 places in 464 ms of which 4 ms to minimize.
[2024-05-27 23:33:02] [INFO ] Deduced a trap composed of 268 places in 485 ms of which 5 ms to minimize.
[2024-05-27 23:33:03] [INFO ] Deduced a trap composed of 235 places in 483 ms of which 5 ms to minimize.
[2024-05-27 23:33:09] [INFO ] Deduced a trap composed of 308 places in 409 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/2408 variables, and 63 constraints, problems are : Problem set: 0 solved, 1872 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 34/36 constraints, State Equation: 0/564 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1872 constraints, Known Traps: 13/13 constraints]
After SMT, in 49224ms problems are : Problem set: 0 solved, 1872 unsolved
Search for dead transitions found 0 dead transitions in 49247ms
[2024-05-27 23:33:15] [INFO ] Flow matrix only has 1844 transitions (discarded 32 similar events)
[2024-05-27 23:33:15] [INFO ] Invariant cache hit.
[2024-05-27 23:33:16] [INFO ] Implicit Places using invariants in 630 ms returned []
[2024-05-27 23:33:16] [INFO ] Flow matrix only has 1844 transitions (discarded 32 similar events)
[2024-05-27 23:33:16] [INFO ] Invariant cache hit.
[2024-05-27 23:33:17] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-27 23:33:29] [INFO ] Implicit Places using invariants and state equation in 12942 ms returned []
Implicit Place search using SMT with State Equation took 13576 ms to find 0 implicit places.
[2024-05-27 23:33:29] [INFO ] Redundant transitions in 119 ms returned []
Running 1872 sub problems to find dead transitions.
[2024-05-27 23:33:29] [INFO ] Flow matrix only has 1844 transitions (discarded 32 similar events)
[2024-05-27 23:33:29] [INFO ] Invariant cache hit.
[2024-05-27 23:33:29] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
[2024-05-27 23:33:54] [INFO ] Deduced a trap composed of 55 places in 158 ms of which 3 ms to minimize.
[2024-05-27 23:33:55] [INFO ] Deduced a trap composed of 55 places in 136 ms of which 1 ms to minimize.
[2024-05-27 23:33:55] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 2 ms to minimize.
[2024-05-27 23:33:55] [INFO ] Deduced a trap composed of 55 places in 104 ms of which 1 ms to minimize.
[2024-05-27 23:33:55] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
[2024-05-27 23:33:55] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 5 ms to minimize.
[2024-05-27 23:33:55] [INFO ] Deduced a trap composed of 55 places in 105 ms of which 2 ms to minimize.
[2024-05-27 23:33:55] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 1 ms to minimize.
[2024-05-27 23:33:56] [INFO ] Deduced a trap composed of 286 places in 477 ms of which 4 ms to minimize.
[2024-05-27 23:33:56] [INFO ] Deduced a trap composed of 258 places in 385 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 560/2408 variables, and 60 constraints, problems are : Problem set: 0 solved, 1872 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 34/36 constraints, State Equation: 0/564 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1872/1872 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1872 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
[2024-05-27 23:34:17] [INFO ] Deduced a trap composed of 308 places in 316 ms of which 4 ms to minimize.
[2024-05-27 23:34:18] [INFO ] Deduced a trap composed of 19 places in 195 ms of which 3 ms to minimize.
[2024-05-27 23:34:30] [INFO ] Deduced a trap composed of 190 places in 414 ms of which 5 ms to minimize.
[2024-05-27 23:34:31] [INFO ] Deduced a trap composed of 33 places in 298 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/2408 variables, and 64 constraints, problems are : Problem set: 0 solved, 1872 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 34/36 constraints, State Equation: 0/564 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1872 constraints, Known Traps: 14/14 constraints]
After SMT, in 70387ms problems are : Problem set: 0 solved, 1872 unsolved
Search for dead transitions found 0 dead transitions in 70414ms
Starting structural reductions in SI_LTL mode, iteration 1 : 564/780 places, 1876/2092 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 133571 ms. Remains : 564/780 places, 1876/2092 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J06T08-LTLFireability-03
Product exploration explored 100000 steps with 3622 reset in 717 ms.
Product exploration explored 100000 steps with 3632 reset in 566 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 111 steps (0 resets) in 8 ms. (12 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2024-05-27 23:34:41] [INFO ] Flow matrix only has 1844 transitions (discarded 32 similar events)
[2024-05-27 23:34:41] [INFO ] Invariant cache hit.
[2024-05-27 23:34:42] [INFO ] [Real]Absence check using 18 positive place invariants in 40 ms returned sat
[2024-05-27 23:34:42] [INFO ] [Real]Absence check using 18 positive and 36 generalized place invariants in 67 ms returned sat
[2024-05-27 23:34:44] [INFO ] [Real]Absence check using state equation in 2009 ms returned sat
[2024-05-27 23:34:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 23:34:45] [INFO ] [Nat]Absence check using 18 positive place invariants in 23 ms returned sat
[2024-05-27 23:34:46] [INFO ] [Nat]Absence check using 18 positive and 36 generalized place invariants in 272 ms returned sat
[2024-05-27 23:34:47] [INFO ] [Nat]Absence check using state equation in 1807 ms returned sat
[2024-05-27 23:34:47] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-27 23:34:48] [INFO ] [Nat]Added 160 Read/Feed constraints in 550 ms returned sat
[2024-05-27 23:34:48] [INFO ] Deduced a trap composed of 55 places in 73 ms of which 1 ms to minimize.
[2024-05-27 23:34:49] [INFO ] Deduced a trap composed of 55 places in 474 ms of which 0 ms to minimize.
[2024-05-27 23:34:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1108 ms
[2024-05-27 23:34:49] [INFO ] Computed and/alt/rep : 928/3324/904 causal constraints (skipped 936 transitions) in 143 ms.
[2024-05-27 23:34:54] [INFO ] Added : 140 causal constraints over 29 iterations in 5190 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 17 out of 564 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 564/564 places, 1876/1876 transitions.
Applied a total of 0 rules in 127 ms. Remains 564 /564 variables (removed 0) and now considering 1876/1876 (removed 0) transitions.
Running 1872 sub problems to find dead transitions.
[2024-05-27 23:34:55] [INFO ] Flow matrix only has 1844 transitions (discarded 32 similar events)
[2024-05-27 23:34:55] [INFO ] Invariant cache hit.
[2024-05-27 23:34:55] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
[2024-05-27 23:35:19] [INFO ] Deduced a trap composed of 55 places in 113 ms of which 2 ms to minimize.
[2024-05-27 23:35:20] [INFO ] Deduced a trap composed of 55 places in 98 ms of which 1 ms to minimize.
[2024-05-27 23:35:20] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 1 ms to minimize.
[2024-05-27 23:35:20] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 1 ms to minimize.
[2024-05-27 23:35:20] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 1 ms to minimize.
[2024-05-27 23:35:20] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 1 ms to minimize.
[2024-05-27 23:35:20] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 1 ms to minimize.
[2024-05-27 23:35:20] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
[2024-05-27 23:35:21] [INFO ] Deduced a trap composed of 286 places in 344 ms of which 3 ms to minimize.
[2024-05-27 23:35:21] [INFO ] Deduced a trap composed of 258 places in 361 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 560/2408 variables, and 60 constraints, problems are : Problem set: 0 solved, 1872 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 34/36 constraints, State Equation: 0/564 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1872/1872 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1872 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
[2024-05-27 23:35:32] [INFO ] Deduced a trap composed of 308 places in 296 ms of which 3 ms to minimize.
[2024-05-27 23:35:33] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 2 ms to minimize.
[2024-05-27 23:35:44] [INFO ] Deduced a trap composed of 190 places in 286 ms of which 3 ms to minimize.
[2024-05-27 23:35:44] [INFO ] Deduced a trap composed of 33 places in 297 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/2408 variables, and 64 constraints, problems are : Problem set: 0 solved, 1872 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 34/36 constraints, State Equation: 0/564 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1872 constraints, Known Traps: 14/14 constraints]
After SMT, in 50773ms problems are : Problem set: 0 solved, 1872 unsolved
Search for dead transitions found 0 dead transitions in 50835ms
[2024-05-27 23:35:45] [INFO ] Flow matrix only has 1844 transitions (discarded 32 similar events)
[2024-05-27 23:35:45] [INFO ] Invariant cache hit.
[2024-05-27 23:35:46] [INFO ] Implicit Places using invariants in 465 ms returned []
[2024-05-27 23:35:46] [INFO ] Flow matrix only has 1844 transitions (discarded 32 similar events)
[2024-05-27 23:35:46] [INFO ] Invariant cache hit.
[2024-05-27 23:35:46] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-27 23:35:58] [INFO ] Implicit Places using invariants and state equation in 12597 ms returned []
Implicit Place search using SMT with State Equation took 13090 ms to find 0 implicit places.
[2024-05-27 23:35:58] [INFO ] Redundant transitions in 30 ms returned []
Running 1872 sub problems to find dead transitions.
[2024-05-27 23:35:59] [INFO ] Flow matrix only has 1844 transitions (discarded 32 similar events)
[2024-05-27 23:35:59] [INFO ] Invariant cache hit.
[2024-05-27 23:35:59] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
[2024-05-27 23:36:23] [INFO ] Deduced a trap composed of 55 places in 99 ms of which 2 ms to minimize.
[2024-05-27 23:36:23] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 2 ms to minimize.
[2024-05-27 23:36:23] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 1 ms to minimize.
[2024-05-27 23:36:23] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 1 ms to minimize.
[2024-05-27 23:36:24] [INFO ] Deduced a trap composed of 55 places in 43 ms of which 0 ms to minimize.
[2024-05-27 23:36:24] [INFO ] Deduced a trap composed of 55 places in 48 ms of which 1 ms to minimize.
[2024-05-27 23:36:24] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 1 ms to minimize.
[2024-05-27 23:36:24] [INFO ] Deduced a trap composed of 56 places in 45 ms of which 1 ms to minimize.
[2024-05-27 23:36:24] [INFO ] Deduced a trap composed of 286 places in 318 ms of which 3 ms to minimize.
[2024-05-27 23:36:25] [INFO ] Deduced a trap composed of 258 places in 312 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 560/2408 variables, and 60 constraints, problems are : Problem set: 0 solved, 1872 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 34/36 constraints, State Equation: 0/564 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1872/1872 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1872 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
[2024-05-27 23:36:46] [INFO ] Deduced a trap composed of 308 places in 388 ms of which 4 ms to minimize.
[2024-05-27 23:36:47] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 3 ms to minimize.
[2024-05-27 23:36:59] [INFO ] Deduced a trap composed of 190 places in 375 ms of which 4 ms to minimize.
[2024-05-27 23:36:59] [INFO ] Deduced a trap composed of 33 places in 270 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/2408 variables, and 64 constraints, problems are : Problem set: 0 solved, 1872 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 34/36 constraints, State Equation: 0/564 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1872 constraints, Known Traps: 14/14 constraints]
After SMT, in 70014ms problems are : Problem set: 0 solved, 1872 unsolved
Search for dead transitions found 0 dead transitions in 70034ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 134150 ms. Remains : 564/564 places, 1876/1876 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
RANDOM walk for 99 steps (0 resets) in 5 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
[2024-05-27 23:37:09] [INFO ] Flow matrix only has 1844 transitions (discarded 32 similar events)
[2024-05-27 23:37:09] [INFO ] Invariant cache hit.
[2024-05-27 23:37:10] [INFO ] [Real]Absence check using 18 positive place invariants in 40 ms returned sat
[2024-05-27 23:37:10] [INFO ] [Real]Absence check using 18 positive and 36 generalized place invariants in 68 ms returned sat
[2024-05-27 23:37:12] [INFO ] [Real]Absence check using state equation in 1942 ms returned sat
[2024-05-27 23:37:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 23:37:13] [INFO ] [Nat]Absence check using 18 positive place invariants in 23 ms returned sat
[2024-05-27 23:37:13] [INFO ] [Nat]Absence check using 18 positive and 36 generalized place invariants in 259 ms returned sat
[2024-05-27 23:37:15] [INFO ] [Nat]Absence check using state equation in 1753 ms returned sat
[2024-05-27 23:37:15] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-27 23:37:15] [INFO ] [Nat]Added 160 Read/Feed constraints in 509 ms returned sat
[2024-05-27 23:37:15] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 2 ms to minimize.
[2024-05-27 23:37:16] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 0 ms to minimize.
[2024-05-27 23:37:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 687 ms
[2024-05-27 23:37:16] [INFO ] Computed and/alt/rep : 928/3324/904 causal constraints (skipped 936 transitions) in 170 ms.
[2024-05-27 23:37:21] [INFO ] Added : 140 causal constraints over 29 iterations in 4838 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3593 reset in 662 ms.
Product exploration explored 100000 steps with 3588 reset in 561 ms.
Support contains 17 out of 564 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 564/564 places, 1876/1876 transitions.
Applied a total of 0 rules in 31 ms. Remains 564 /564 variables (removed 0) and now considering 1876/1876 (removed 0) transitions.
Running 1872 sub problems to find dead transitions.
[2024-05-27 23:37:22] [INFO ] Flow matrix only has 1844 transitions (discarded 32 similar events)
[2024-05-27 23:37:22] [INFO ] Invariant cache hit.
[2024-05-27 23:37:22] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
[2024-05-27 23:37:45] [INFO ] Deduced a trap composed of 55 places in 145 ms of which 2 ms to minimize.
[2024-05-27 23:37:45] [INFO ] Deduced a trap composed of 55 places in 104 ms of which 1 ms to minimize.
[2024-05-27 23:37:46] [INFO ] Deduced a trap composed of 55 places in 96 ms of which 2 ms to minimize.
[2024-05-27 23:37:46] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 1 ms to minimize.
[2024-05-27 23:37:46] [INFO ] Deduced a trap composed of 55 places in 47 ms of which 1 ms to minimize.
[2024-05-27 23:37:46] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 0 ms to minimize.
[2024-05-27 23:37:46] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 2 ms to minimize.
[2024-05-27 23:37:46] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 1 ms to minimize.
[2024-05-27 23:37:47] [INFO ] Deduced a trap composed of 286 places in 454 ms of which 4 ms to minimize.
[2024-05-27 23:37:47] [INFO ] Deduced a trap composed of 258 places in 368 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 560/2408 variables, and 60 constraints, problems are : Problem set: 0 solved, 1872 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 34/36 constraints, State Equation: 0/564 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1872/1872 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1872 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
[2024-05-27 23:37:58] [INFO ] Deduced a trap composed of 308 places in 334 ms of which 3 ms to minimize.
[2024-05-27 23:37:59] [INFO ] Deduced a trap composed of 19 places in 196 ms of which 2 ms to minimize.
[2024-05-27 23:38:09] [INFO ] Deduced a trap composed of 190 places in 300 ms of which 3 ms to minimize.
[2024-05-27 23:38:09] [INFO ] Deduced a trap composed of 33 places in 308 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/2408 variables, and 64 constraints, problems are : Problem set: 0 solved, 1872 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 34/36 constraints, State Equation: 0/564 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1872 constraints, Known Traps: 14/14 constraints]
After SMT, in 49191ms problems are : Problem set: 0 solved, 1872 unsolved
Search for dead transitions found 0 dead transitions in 49207ms
[2024-05-27 23:38:11] [INFO ] Flow matrix only has 1844 transitions (discarded 32 similar events)
[2024-05-27 23:38:11] [INFO ] Invariant cache hit.
[2024-05-27 23:38:12] [INFO ] Implicit Places using invariants in 446 ms returned []
[2024-05-27 23:38:12] [INFO ] Flow matrix only has 1844 transitions (discarded 32 similar events)
[2024-05-27 23:38:12] [INFO ] Invariant cache hit.
[2024-05-27 23:38:12] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-27 23:38:23] [INFO ] Implicit Places using invariants and state equation in 11055 ms returned []
Implicit Place search using SMT with State Equation took 11514 ms to find 0 implicit places.
[2024-05-27 23:38:23] [INFO ] Redundant transitions in 136 ms returned []
Running 1872 sub problems to find dead transitions.
[2024-05-27 23:38:23] [INFO ] Flow matrix only has 1844 transitions (discarded 32 similar events)
[2024-05-27 23:38:23] [INFO ] Invariant cache hit.
[2024-05-27 23:38:23] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
[2024-05-27 23:38:46] [INFO ] Deduced a trap composed of 55 places in 151 ms of which 2 ms to minimize.
[2024-05-27 23:38:46] [INFO ] Deduced a trap composed of 55 places in 141 ms of which 2 ms to minimize.
[2024-05-27 23:38:46] [INFO ] Deduced a trap composed of 55 places in 143 ms of which 2 ms to minimize.
[2024-05-27 23:38:46] [INFO ] Deduced a trap composed of 55 places in 83 ms of which 1 ms to minimize.
[2024-05-27 23:38:46] [INFO ] Deduced a trap composed of 55 places in 76 ms of which 1 ms to minimize.
[2024-05-27 23:38:47] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
[2024-05-27 23:38:47] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 2 ms to minimize.
[2024-05-27 23:38:47] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-05-27 23:38:48] [INFO ] Deduced a trap composed of 286 places in 481 ms of which 5 ms to minimize.
[2024-05-27 23:38:48] [INFO ] Deduced a trap composed of 258 places in 453 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 560/2408 variables, and 60 constraints, problems are : Problem set: 0 solved, 1872 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 34/36 constraints, State Equation: 0/564 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1872/1872 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1872 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
[2024-05-27 23:39:09] [INFO ] Deduced a trap composed of 308 places in 330 ms of which 3 ms to minimize.
[2024-05-27 23:39:10] [INFO ] Deduced a trap composed of 19 places in 189 ms of which 15 ms to minimize.
[2024-05-27 23:39:21] [INFO ] Deduced a trap composed of 190 places in 285 ms of which 3 ms to minimize.
[2024-05-27 23:39:22] [INFO ] Deduced a trap composed of 33 places in 311 ms of which 3 ms to minimize.
[2024-05-27 23:39:30] [INFO ] Deduced a trap composed of 206 places in 306 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/560 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/2408 variables, and 65 constraints, problems are : Problem set: 0 solved, 1872 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 34/36 constraints, State Equation: 0/564 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1872 constraints, Known Traps: 15/15 constraints]
After SMT, in 68579ms problems are : Problem set: 0 solved, 1872 unsolved
Search for dead transitions found 0 dead transitions in 68600ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 129509 ms. Remains : 564/564 places, 1876/1876 transitions.
Treatment of property PolyORBLF-COL-S04J06T08-LTLFireability-03 finished in 425920 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p1&&X(p2))||p0)))'
Support contains 35 out of 780 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 780/780 places, 2092/2092 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 772 transition count 2084
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 772 transition count 2084
Applied a total of 16 rules in 112 ms. Remains 772 /780 variables (removed 8) and now considering 2084/2092 (removed 8) transitions.
Running 2080 sub problems to find dead transitions.
[2024-05-27 23:39:32] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
// Phase 1: matrix 2052 rows 772 cols
[2024-05-27 23:39:32] [INFO ] Computed 54 invariants in 39 ms
[2024-05-27 23:39:32] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-05-27 23:40:01] [INFO ] Deduced a trap composed of 334 places in 262 ms of which 5 ms to minimize.
SMT process timed out in 28964ms, After SMT, problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 28983ms
[2024-05-27 23:40:01] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-05-27 23:40:01] [INFO ] Invariant cache hit.
[2024-05-27 23:40:02] [INFO ] Implicit Places using invariants in 733 ms returned [612, 613, 614, 615, 616, 617, 618, 619]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 740 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 764/780 places, 2084/2092 transitions.
Applied a total of 0 rules in 16 ms. Remains 764 /764 variables (removed 0) and now considering 2084/2084 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29856 ms. Remains : 764/780 places, 2084/2092 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBLF-COL-S04J06T08-LTLFireability-04
Product exploration explored 100000 steps with 7347 reset in 1269 ms.
Product exploration explored 100000 steps with 7381 reset in 1148 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 133 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
RANDOM walk for 519 steps (0 resets) in 21 ms. (23 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p2), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 15 factoid took 416 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
[2024-05-27 23:40:05] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
// Phase 1: matrix 2052 rows 764 cols
[2024-05-27 23:40:05] [INFO ] Computed 46 invariants in 37 ms
[2024-05-27 23:40:06] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-27 23:40:07] [INFO ] [Real]Absence check using 13 positive and 33 generalized place invariants in 88 ms returned sat
[2024-05-27 23:40:09] [INFO ] [Real]Absence check using state equation in 2087 ms returned sat
[2024-05-27 23:40:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 23:40:10] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 23:40:10] [INFO ] [Nat]Absence check using 13 positive and 33 generalized place invariants in 69 ms returned sat
[2024-05-27 23:40:17] [INFO ] [Nat]Absence check using state equation in 6503 ms returned sat
[2024-05-27 23:40:17] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-27 23:40:18] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 23:40:19] [INFO ] [Nat]Added 160 Read/Feed constraints in 1826 ms returned sat
[2024-05-27 23:40:19] [INFO ] Deduced a trap composed of 19 places in 298 ms of which 4 ms to minimize.
[2024-05-27 23:40:20] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 1919 ms
Could not prove EG (AND (NOT p0) (NOT p1))
[2024-05-27 23:40:20] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-05-27 23:40:21] [INFO ] Invariant cache hit.
[2024-05-27 23:40:22] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 23:40:22] [INFO ] [Real]Absence check using 13 positive and 33 generalized place invariants in 42 ms returned sat
[2024-05-27 23:40:23] [INFO ] [Real]Absence check using state equation in 1544 ms returned sat
[2024-05-27 23:40:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 23:40:25] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 23:40:25] [INFO ] [Nat]Absence check using 13 positive and 33 generalized place invariants in 168 ms returned sat
[2024-05-27 23:40:32] [INFO ] [Nat]Absence check using state equation in 7208 ms returned sat
[2024-05-27 23:40:32] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-27 23:40:34] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 23:40:34] [INFO ] [Nat]Added 160 Read/Feed constraints in 1738 ms returned sat
[2024-05-27 23:40:34] [INFO ] Deduced a trap composed of 38 places in 411 ms of which 4 ms to minimize.
[2024-05-27 23:40:35] [INFO ] Deduced a trap composed of 82 places in 130 ms of which 2 ms to minimize.
[2024-05-27 23:40:36] [INFO ] Deduced a trap composed of 82 places in 119 ms of which 1 ms to minimize.
[2024-05-27 23:40:36] [INFO ] Deduced a trap composed of 82 places in 124 ms of which 1 ms to minimize.
[2024-05-27 23:40:37] [INFO ] Deduced a trap composed of 82 places in 122 ms of which 2 ms to minimize.
[2024-05-27 23:40:38] [INFO ] Deduced a trap composed of 82 places in 78 ms of which 1 ms to minimize.
[2024-05-27 23:40:38] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4382 ms
[2024-05-27 23:40:38] [INFO ] Computed and/alt/rep : 1456/6179/1432 causal constraints (skipped 616 transitions) in 215 ms.
[2024-05-27 23:40:38] [INFO ] Added : 0 causal constraints over 0 iterations in 217 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 35 out of 764 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 764/764 places, 2084/2084 transitions.
Applied a total of 0 rules in 16 ms. Remains 764 /764 variables (removed 0) and now considering 2084/2084 (removed 0) transitions.
Running 2080 sub problems to find dead transitions.
[2024-05-27 23:40:39] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-05-27 23:40:39] [INFO ] Invariant cache hit.
[2024-05-27 23:40:39] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/760 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/760 variables, 29/41 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-05-27 23:41:06] [INFO ] Deduced a trap composed of 82 places in 82 ms of which 1 ms to minimize.
[2024-05-27 23:41:06] [INFO ] Deduced a trap composed of 82 places in 83 ms of which 2 ms to minimize.
[2024-05-27 23:41:06] [INFO ] Deduced a trap composed of 82 places in 115 ms of which 2 ms to minimize.
[2024-05-27 23:41:06] [INFO ] Deduced a trap composed of 82 places in 68 ms of which 1 ms to minimize.
[2024-05-27 23:41:07] [INFO ] Deduced a trap composed of 82 places in 72 ms of which 1 ms to minimize.
[2024-05-27 23:41:07] [INFO ] Deduced a trap composed of 82 places in 65 ms of which 1 ms to minimize.
[2024-05-27 23:41:07] [INFO ] Deduced a trap composed of 82 places in 75 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 760/2816 variables, and 48 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 29/33 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/760 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/760 variables, 29/41 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/760 variables, 7/48 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-05-27 23:41:10] [INFO ] Deduced a trap composed of 172 places in 384 ms of which 5 ms to minimize.
[2024-05-27 23:41:11] [INFO ] Deduced a trap composed of 203 places in 360 ms of which 5 ms to minimize.
[2024-05-27 23:41:12] [INFO ] Deduced a trap composed of 371 places in 413 ms of which 5 ms to minimize.
[2024-05-27 23:41:12] [INFO ] Deduced a trap composed of 405 places in 398 ms of which 4 ms to minimize.
[2024-05-27 23:41:17] [INFO ] Deduced a trap composed of 82 places in 81 ms of which 2 ms to minimize.
[2024-05-27 23:41:27] [INFO ] Deduced a trap composed of 5 places in 242 ms of which 4 ms to minimize.
SMT process timed out in 48776ms, After SMT, problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 48802ms
[2024-05-27 23:41:27] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-05-27 23:41:27] [INFO ] Invariant cache hit.
[2024-05-27 23:41:28] [INFO ] Implicit Places using invariants in 605 ms returned []
[2024-05-27 23:41:28] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-05-27 23:41:28] [INFO ] Invariant cache hit.
[2024-05-27 23:41:29] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-27 23:41:39] [INFO ] Implicit Places using invariants and state equation in 11272 ms returned []
Implicit Place search using SMT with State Equation took 11879 ms to find 0 implicit places.
Running 2080 sub problems to find dead transitions.
[2024-05-27 23:41:39] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-05-27 23:41:39] [INFO ] Invariant cache hit.
[2024-05-27 23:41:39] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/760 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/760 variables, 29/41 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-05-27 23:42:12] [INFO ] Deduced a trap composed of 82 places in 83 ms of which 2 ms to minimize.
[2024-05-27 23:42:12] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 2 ms to minimize.
[2024-05-27 23:42:12] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 1 ms to minimize.
[2024-05-27 23:42:12] [INFO ] Deduced a trap composed of 82 places in 55 ms of which 1 ms to minimize.
[2024-05-27 23:42:12] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 1 ms to minimize.
[2024-05-27 23:42:12] [INFO ] Deduced a trap composed of 82 places in 70 ms of which 1 ms to minimize.
[2024-05-27 23:42:13] [INFO ] Deduced a trap composed of 82 places in 55 ms of which 0 ms to minimize.
[2024-05-27 23:42:13] [INFO ] Deduced a trap composed of 454 places in 421 ms of which 5 ms to minimize.
[2024-05-27 23:42:14] [INFO ] Deduced a trap composed of 447 places in 358 ms of which 4 ms to minimize.
[2024-05-27 23:42:14] [INFO ] Deduced a trap composed of 189 places in 351 ms of which 4 ms to minimize.
[2024-05-27 23:42:15] [INFO ] Deduced a trap composed of 82 places in 57 ms of which 1 ms to minimize.
[2024-05-27 23:42:16] [INFO ] Deduced a trap composed of 372 places in 403 ms of which 4 ms to minimize.
[2024-05-27 23:42:16] [INFO ] Deduced a trap composed of 442 places in 440 ms of which 4 ms to minimize.
[2024-05-27 23:42:18] [INFO ] Deduced a trap composed of 493 places in 565 ms of which 5 ms to minimize.
[2024-05-27 23:42:19] [INFO ] Deduced a trap composed of 460 places in 505 ms of which 11 ms to minimize.
[2024-05-27 23:42:19] [INFO ] Deduced a trap composed of 426 places in 594 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 760/2816 variables, and 57 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 29/33 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/760 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/760 variables, 29/41 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/760 variables, 16/57 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-05-27 23:42:25] [INFO ] Deduced a trap composed of 105 places in 254 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 760/2816 variables, and 58 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 29/33 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2080 constraints, Known Traps: 17/17 constraints]
After SMT, in 71670ms problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 71711ms
Finished structural reductions in LTL mode , in 1 iterations and 132424 ms. Remains : 764/764 places, 2084/2084 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p0)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 119 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 862 steps (0 resets) in 15 ms. (53 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p0)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p1) p2 p0))), (F p1), (F p0), (F p2), (F (NOT (OR (NOT p1) p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 15 factoid took 342 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 82 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
[2024-05-27 23:42:52] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-05-27 23:42:52] [INFO ] Invariant cache hit.
[2024-05-27 23:42:53] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-27 23:42:53] [INFO ] [Real]Absence check using 13 positive and 33 generalized place invariants in 110 ms returned sat
[2024-05-27 23:42:56] [INFO ] [Real]Absence check using state equation in 2451 ms returned sat
[2024-05-27 23:42:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 23:42:57] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 23:42:57] [INFO ] [Nat]Absence check using 13 positive and 33 generalized place invariants in 170 ms returned sat
[2024-05-27 23:43:01] [INFO ] [Nat]Absence check using state equation in 4021 ms returned sat
[2024-05-27 23:43:01] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-27 23:43:02] [INFO ] [Nat]Added 160 Read/Feed constraints in 746 ms returned sat
[2024-05-27 23:43:02] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 2 ms to minimize.
[2024-05-27 23:43:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 404 ms
[2024-05-27 23:43:03] [INFO ] Computed and/alt/rep : 1456/6179/1432 causal constraints (skipped 616 transitions) in 164 ms.
[2024-05-27 23:43:11] [INFO ] Added : 155 causal constraints over 31 iterations in 8254 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p1))
[2024-05-27 23:43:11] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-05-27 23:43:11] [INFO ] Invariant cache hit.
[2024-05-27 23:43:12] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-27 23:43:12] [INFO ] [Real]Absence check using 13 positive and 33 generalized place invariants in 40 ms returned sat
[2024-05-27 23:43:14] [INFO ] [Real]Absence check using state equation in 1485 ms returned sat
[2024-05-27 23:43:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 23:43:15] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-27 23:43:15] [INFO ] [Nat]Absence check using 13 positive and 33 generalized place invariants in 174 ms returned sat
[2024-05-27 23:43:22] [INFO ] [Nat]Absence check using state equation in 7215 ms returned sat
[2024-05-27 23:43:22] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-27 23:43:24] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 23:43:25] [INFO ] [Nat]Added 160 Read/Feed constraints in 2386 ms returned sat
[2024-05-27 23:43:25] [INFO ] Deduced a trap composed of 38 places in 402 ms of which 5 ms to minimize.
[2024-05-27 23:43:25] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 2 ms to minimize.
[2024-05-27 23:43:26] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 2 ms to minimize.
[2024-05-27 23:43:26] [INFO ] Deduced a trap composed of 82 places in 116 ms of which 2 ms to minimize.
[2024-05-27 23:43:27] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 2 ms to minimize.
[2024-05-27 23:43:28] [INFO ] Trap strengthening (SAT) tested/added 5/5 trap constraints in 3760 ms
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 116 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 7349 reset in 1077 ms.
Product exploration explored 100000 steps with 7390 reset in 1021 ms.
Support contains 35 out of 764 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 764/764 places, 2084/2084 transitions.
Applied a total of 0 rules in 12 ms. Remains 764 /764 variables (removed 0) and now considering 2084/2084 (removed 0) transitions.
Running 2080 sub problems to find dead transitions.
[2024-05-27 23:43:31] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-05-27 23:43:31] [INFO ] Invariant cache hit.
[2024-05-27 23:43:31] [INFO ] State equation strengthened by 160 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 0.0)
(s40 1.0)
(s41 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/760 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
SMT process timed out in 31808ms, After SMT, problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 31836ms
[2024-05-27 23:44:03] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-05-27 23:44:03] [INFO ] Invariant cache hit.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-COL-S04J06T08

IS_COLORED=1
IS_NUPN=

LOADING model.pnml ...
MODEL CLASS: SYMMETRIC NET
PLACES: 81
TRANSITIONS: 65
CONSTANTS: 0
TEMPLATE VARS: 0
COLOR CLASSES: 6
COLOR VARS: 25
ARCS: 254
LOADING TIME: 0.291

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 792
TRANSITIONS: 4268
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 28832
UNFOLDING TIME: 0.657

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.167
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 1.349
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1517
MODEL NAME: /home/mcc/execution/model
792 places, 4268 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S04J06T08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is PolyORBLF-COL-S04J06T08, 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 r289-tajo-171654445300156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S04J06T08.tgz
mv PolyORBLF-COL-S04J06T08 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 ;