fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r189-tajo-162089432400033
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for QuasiCertifProtocol-PT-02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4280.212 3600000.00 12853.00 53.00 FTFTFFFFTTFFFFFT 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/mcc2021-input.r189-tajo-162089432400033.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is QuasiCertifProtocol-PT-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-tajo-162089432400033
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 26K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 209K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Mar 28 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 28 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 28 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Mar 27 09:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 27 09:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 25 13:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 13:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K Mar 22 08:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 55K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1621408785648

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 07:19:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-19 07:19:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 07:19:47] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2021-05-19 07:19:47] [INFO ] Transformed 86 places.
[2021-05-19 07:19:47] [INFO ] Transformed 56 transitions.
[2021-05-19 07:19:47] [INFO ] Parsed PT model containing 86 places and 56 transitions in 73 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 16409 resets, run finished after 280 ms. (steps per millisecond=357 ) properties seen :[0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0]
// Phase 1: matrix 56 rows 86 cols
[2021-05-19 07:19:47] [INFO ] Computed 31 place invariants in 6 ms
[2021-05-19 07:19:47] [INFO ] [Real]Absence check using 3 positive place invariants in 15 ms returned unsat
[2021-05-19 07:19:47] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2021-05-19 07:19:47] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 9 ms returned sat
[2021-05-19 07:19:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:47] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2021-05-19 07:19:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 07:19:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-19 07:19:48] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 7 ms returned sat
[2021-05-19 07:19:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:48] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2021-05-19 07:19:48] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 6 ms.
[2021-05-19 07:19:48] [INFO ] Added : 28 causal constraints over 6 iterations in 43 ms. Result :sat
[2021-05-19 07:19:48] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned unsat
[2021-05-19 07:19:48] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-19 07:19:48] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2021-05-19 07:19:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:48] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2021-05-19 07:19:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 07:19:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-19 07:19:48] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2021-05-19 07:19:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:48] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2021-05-19 07:19:48] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2021-05-19 07:19:48] [INFO ] Added : 27 causal constraints over 6 iterations in 37 ms. Result :sat
[2021-05-19 07:19:48] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-19 07:19:48] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 7 ms returned sat
[2021-05-19 07:19:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:48] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2021-05-19 07:19:48] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2021-05-19 07:19:48] [INFO ] Added : 10 causal constraints over 2 iterations in 16 ms. Result :sat
[2021-05-19 07:19:48] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-19 07:19:48] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2021-05-19 07:19:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:48] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2021-05-19 07:19:48] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2021-05-19 07:19:48] [INFO ] Added : 24 causal constraints over 5 iterations in 32 ms. Result :sat
[2021-05-19 07:19:48] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-19 07:19:48] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2021-05-19 07:19:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:48] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2021-05-19 07:19:48] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2021-05-19 07:19:48] [INFO ] Added : 27 causal constraints over 6 iterations in 33 ms. Result :sat
[2021-05-19 07:19:48] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-19 07:19:48] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-19 07:19:48] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 10 ms returned sat
[2021-05-19 07:19:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:48] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2021-05-19 07:19:48] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 7 ms.
[2021-05-19 07:19:48] [INFO ] Added : 17 causal constraints over 4 iterations in 27 ms. Result :sat
[2021-05-19 07:19:48] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-19 07:19:48] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2021-05-19 07:19:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:48] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2021-05-19 07:19:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 07:19:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-19 07:19:48] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2021-05-19 07:19:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:48] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2021-05-19 07:19:48] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2021-05-19 07:19:48] [INFO ] Added : 15 causal constraints over 3 iterations in 17 ms. Result :sat
[2021-05-19 07:19:48] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-19 07:19:48] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2021-05-19 07:19:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:48] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2021-05-19 07:19:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 07:19:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-19 07:19:48] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2021-05-19 07:19:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:48] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2021-05-19 07:19:48] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 2 ms.
[2021-05-19 07:19:48] [INFO ] Added : 18 causal constraints over 4 iterations in 23 ms. Result :sat
[2021-05-19 07:19:48] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-19 07:19:48] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2021-05-19 07:19:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:48] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2021-05-19 07:19:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 07:19:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-19 07:19:49] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2021-05-19 07:19:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:49] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2021-05-19 07:19:49] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2021-05-19 07:19:49] [INFO ] Added : 29 causal constraints over 6 iterations in 29 ms. Result :sat
[2021-05-19 07:19:49] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned unsat
[2021-05-19 07:19:49] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-19 07:19:49] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2021-05-19 07:19:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:49] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2021-05-19 07:19:49] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2021-05-19 07:19:49] [INFO ] Added : 12 causal constraints over 3 iterations in 18 ms. Result :sat
[2021-05-19 07:19:49] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-19 07:19:49] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 14 ms returned sat
[2021-05-19 07:19:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:49] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
[2021-05-19 07:19:49] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-19 07:19:49] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 8 ms returned sat
[2021-05-19 07:19:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:49] [INFO ] [Real]Absence check using state equation in 32 ms returned unsat
[2021-05-19 07:19:49] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
[2021-05-19 07:19:49] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-19 07:19:49] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 11 ms returned sat
[2021-05-19 07:19:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:49] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2021-05-19 07:19:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 07:19:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2021-05-19 07:19:49] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2021-05-19 07:19:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:49] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2021-05-19 07:19:49] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2021-05-19 07:19:49] [INFO ] Added : 20 causal constraints over 4 iterations in 25 ms. Result :sat
[2021-05-19 07:19:49] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-19 07:19:49] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 7 ms returned sat
[2021-05-19 07:19:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:49] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2021-05-19 07:19:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 07:19:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-19 07:19:49] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2021-05-19 07:19:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:49] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2021-05-19 07:19:49] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2021-05-19 07:19:49] [INFO ] Added : 9 causal constraints over 2 iterations in 15 ms. Result :sat
[2021-05-19 07:19:49] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-19 07:19:49] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2021-05-19 07:19:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:49] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2021-05-19 07:19:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 07:19:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-19 07:19:49] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 12 ms returned sat
[2021-05-19 07:19:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:49] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2021-05-19 07:19:49] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2021-05-19 07:19:49] [INFO ] Added : 25 causal constraints over 5 iterations in 36 ms. Result :sat
[2021-05-19 07:19:49] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-19 07:19:49] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-19 07:19:49] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 9 ms returned sat
[2021-05-19 07:19:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:49] [INFO ] [Real]Absence check using state equation in 40 ms returned unsat
[2021-05-19 07:19:49] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2021-05-19 07:19:49] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 14 ms returned sat
[2021-05-19 07:19:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:49] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
[2021-05-19 07:19:50] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-19 07:19:50] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2021-05-19 07:19:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:50] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-19 07:19:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 07:19:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-19 07:19:50] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 8 ms returned sat
[2021-05-19 07:19:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:50] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2021-05-19 07:19:50] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2021-05-19 07:19:50] [INFO ] Added : 25 causal constraints over 5 iterations in 32 ms. Result :sat
[2021-05-19 07:19:50] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned unsat
Successfully simplified 11 atomic propositions for a total of 13 simplifications.
[2021-05-19 07:19:50] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-19 07:19:50] [INFO ] Flatten gal took : 31 ms
FORMULA QuasiCertifProtocol-PT-02-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 07:19:50] [INFO ] Flatten gal took : 9 ms
[2021-05-19 07:19:50] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-19 07:19:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ QuasiCertifProtocol-PT-02 @ 3570 seconds

FORMULA QuasiCertifProtocol-PT-02-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-02-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-02-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-02-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-02-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-02-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-02-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-02-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-02-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLCardinality @ QuasiCertifProtocol-PT-02

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed May 19 07:19:50 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((1 <= p77 + p78 + p80))",
"processed_size": 26,
"rewrites": 53
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "X (G ((p9 + p10 + p11 <= p55 + p53 + p54 + p57 + p58 + p59 + p60 + p65 + p66)))",
"processed_size": 79,
"rewrites": 53
},
"result":
{
"edges": 144,
"markings": 88,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 3,
"U": 0,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "X (X (G ((G ((p1 + p2 + p3 <= p61 + p67 + p68)) AND X (X (G ((2 <= p43 + p38 + p37))))))))",
"processed_size": 90,
"rewrites": 53
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p26 <= p66)",
"processed_size": 12,
"rewrites": 53
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G ((((p66 + 1 <= p26) R F ((p66 + 1 <= p26))) AND G ((p51 <= p23)))))",
"processed_size": 72,
"rewrites": 53
},
"result":
{
"edges": 404,
"markings": 230,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (((p0 <= p74)))",
"processed_size": 17,
"rewrites": 53
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((p85 + 1 <= p69)))",
"processed_size": 24,
"rewrites": 53
},
"result":
{
"edges": 8,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F (((p25 + 1 <= p69) AND (p8 <= 0))))",
"processed_size": 40,
"rewrites": 53
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G (((p22 <= 0) OR (G ((1 <= p76)) AND F ((p22 <= 0))))))",
"processed_size": 59,
"rewrites": 53
},
"result":
{
"edges": 10748,
"markings": 2154,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "((p25 <= p64 + p63 + p62) AND (p1 + p2 + p3 <= p55 + p53 + p54 + p57 + p58 + p59 + p60 + p65 + p66))",
"processed_size": 100,
"rewrites": 54
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "G (F ((p1 + p2 + p3 <= p55 + p53 + p54 + p57 + p58 + p59 + p60 + p65 + p66)))",
"processed_size": 77,
"rewrites": 53
},
"result":
{
"edges": 429,
"markings": 284,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "((p25 <= p64 + p63 + p62) AND (p1 + p2 + p3 <= p55 + p53 + p54 + p57 + p58 + p59 + p60 + p65 + p66))",
"processed_size": 100,
"rewrites": 54
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "F (G ((p1 + p2 + p3 <= p55 + p53 + p54 + p57 + p58 + p59 + p60 + p65 + p66)))",
"processed_size": 77,
"rewrites": 53
},
"result":
{
"edges": 452,
"markings": 285,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "G (F ((p1 + p2 + p3 <= p55 + p53 + p54 + p57 + p58 + p59 + p60 + p65 + p66)))",
"processed_size": 77,
"rewrites": 53
},
"result":
{
"edges": 429,
"markings": 284,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 19836,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(**) : (G(F(**)) OR (F(G(**)) AND (** AND **))) : X(G(**)) : X(X(G((G(**) AND X(X(G(**))))))) : F(G((** OR (G(**) AND F(**))))) : (X(G(((* R F(*)) AND G(*)))) AND **) : G(F(*)) : F(G(*)) : X(**)"
},
"net":
{
"arcs": 223,
"conflict_clusters": 20,
"places": 86,
"places_significant": 55,
"singleton_clusters": 0,
"transitions": 56
},
"result":
{
"preliminary_value": "no no no no yes no no no no ",
"value": "no no no no yes no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 142/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2752
lola: finding significant places
lola: 86 places, 56 transitions, 55 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: X ((1 <= p77 + p78 + p80)) : (G (((0 <= 0) U (p1 + p2 + p3 <= p55 + p53 + p54 + p57 + p58 + p59 + p60 + p65 + p66))) OR ((F (G ((p1 + p2 + p3 <= p55 + p53 + p54 + p57 + p58 + p59 + p60 + p65 + p66))) AND (p25 <= p64 + p63 + p62)) AND (p1 + p2 + p3 <= p55 + p53 + p54 + p57 + p58 + p59 + p60 + p65 + p66))) : G (X ((p9 + p10 + p11 <= p55 + p53 + p54 + p57 + p58 + p59 + p60 + p65 + p66))) : X (G ((G (X ((p1 + p2 + p3 <= p61 + p67 + p68))) AND X (X (G (X ((2 <= p43 + p38 + p37)))))))) : NOT(F (X (X (G (F (NOT((G ((1 <= p76)) U (p22 <= 0))))))))) : (G (NOT(X ((((p26 <= p66) U G ((p26 <= p66))) OR F ((p23 + 1 <= p51)))))) AND (p26 <= p66)) : X (G (NOT(G (F ((NOT(G ((p27 <= p24))) U F (G (((p69 <= p25) OR (1 <= p8)))))))))) : F (G (NOT(F (((p40 <= p27) U (p69 <= p85)))))) : ((1 <= 0) U X (((p0 <= p74))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((1 <= p77 + p78 + p80))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((1 <= p77 + p78 + p80))
lola: processed formula length: 26
lola: 53 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p9 + p10 + p11 <= p55 + p53 + p54 + p57 + p58 + p59 + p60 + p65 + p66)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p9 + p10 + p11 <= p55 + p53 + p54 + p57 + p58 + p59 + p60 + p65 + p66)))
lola: processed formula length: 79
lola: 53 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 88 markings, 144 edges
lola: ========================================
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((G ((p1 + p2 + p3 <= p61 + p67 + p68)) AND X (X (G ((2 <= p43 + p38 + p37))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((G ((p1 + p2 + p3 <= p61 + p67 + p68)) AND X (X (G ((2 <= p43 + p38 + p37))))))))
lola: processed formula length: 90
lola: 53 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((((p66 + 1 <= p26) R F ((p66 + 1 <= p26))) AND G ((p51 <= p23))))) AND (p26 <= p66))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p26 <= p66)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p26 <= p66)
lola: processed formula length: 12
lola: 53 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((p66 + 1 <= p26) R F ((p66 + 1 <= p26))) AND G ((p51 <= p23)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((p66 + 1 <= p26) R F ((p66 + 1 <= p26))) AND G ((p51 <= p23)))))
lola: processed formula length: 72
lola: 53 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 230 markings, 404 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p0 <= p74)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p0 <= p74)))
lola: processed formula length: 17
lola: 53 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10 markings, 10 edges
lola: ========================================
lola: subprocess 5 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p85 + 1 <= p69)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p85 + 1 <= p69)))
lola: processed formula length: 24
lola: 53 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 8 edges
lola: ========================================
lola: subprocess 6 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p25 + 1 <= p69) AND (p8 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((p25 + 1 <= p69) AND (p8 <= 0))))
lola: processed formula length: 40
lola: 53 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 8 edges
lola: ========================================
lola: subprocess 7 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p22 <= 0) OR (G ((1 <= p76)) AND F ((p22 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p22 <= 0) OR (G ((1 <= p76)) AND F ((p22 <= 0))))))
lola: processed formula length: 59
lola: 53 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2154 markings, 10748 edges
lola: ========================================
lola: subprocess 8 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((p1 + p2 + p3 <= p55 + p53 + p54 + p57 + p58 + p59 + p60 + p65 + p66))) OR (F (G ((p1 + p2 + p3 <= p55 + p53 + p54 + p57 + p58 + p59 + p60 + p65 + p66))) AND ((p25 <= p64 + p63 + p62) AND (p1 + p2 + p3 <= p55 + p53 + p54 + p57 + p58 + p59 + p60 + p65 + p66))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p25 <= p64 + p63 + p62) AND (p1 + p2 + p3 <= p55 + p53 + p54 + p57 + p58 + p59 + p60 + p65 + p66))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: ((p25 <= p64 + p63 + p62) AND (p1 + p2 + p3 <= p55 + p53 + p54 + p57 + p58 + p59 + p60 + p65 + p66))
lola: processed formula length: 100
lola: 54 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p1 + p2 + p3 <= p55 + p53 + p54 + p57 + p58 + p59 + p60 + p65 + p66)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p1 + p2 + p3 <= p55 + p53 + p54 + p57 + p58 + p59 + p60 + p65 + p66)))
lola: processed formula length: 77
lola: 53 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 284 markings, 429 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G (F ((p1 + p2 + p3 <= p55 + p53 + p54 + p57 + p58 + p59 + p60 + p65 + p66))) OR (F (G ((p1 + p2 + p3 <= p55 + p53 + p54 + p57 + p58 + p59 + p60 + p65 + p66))) AND ((p25 <= p64 + p63 + p62) AND (p1 + p2 + p3 <= p55 + p53 + p54 + p57 + p58 + p59 + p60 + p65 + p66))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((p25 <= p64 + p63 + p62) AND (p1 + p2 + p3 <= p55 + p53 + p54 + p57 + p58 + p59 + p60 + p65 + p66))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: ((p25 <= p64 + p63 + p62) AND (p1 + p2 + p3 <= p55 + p53 + p54 + p57 + p58 + p59 + p60 + p65 + p66))
lola: processed formula length: 100
lola: 54 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((p1 + p2 + p3 <= p55 + p53 + p54 + p57 + p58 + p59 + p60 + p65 + p66)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p1 + p2 + p3 <= p55 + p53 + p54 + p57 + p58 + p59 + p60 + p65 + p66)))
lola: processed formula length: 77
lola: 53 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 285 markings, 452 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((p1 + p2 + p3 <= p55 + p53 + p54 + p57 + p58 + p59 + p60 + p65 + p66)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p1 + p2 + p3 <= p55 + p53 + p54 + p57 + p58 + p59 + p60 + p65 + p66)))
lola: processed formula length: 77
lola: 53 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 284 markings, 429 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes no no no no
lola:
preliminary result: no no no no yes no no no no
lola: memory consumption: 19836 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-02"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
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-4028"
echo " Executing tool gold2020"
echo " Input is QuasiCertifProtocol-PT-02, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r189-tajo-162089432400033"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-02.tgz
mv QuasiCertifProtocol-PT-02 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;