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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 90K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 630K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 31K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 186K 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 13K Mar 28 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Mar 28 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 27 09:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K Mar 27 09:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Mar 25 13:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Mar 25 13:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 22 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.3K 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 290K 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-10-00
FORMULA_NAME QuasiCertifProtocol-PT-10-01
FORMULA_NAME QuasiCertifProtocol-PT-10-02
FORMULA_NAME QuasiCertifProtocol-PT-10-03
FORMULA_NAME QuasiCertifProtocol-PT-10-04
FORMULA_NAME QuasiCertifProtocol-PT-10-05
FORMULA_NAME QuasiCertifProtocol-PT-10-06
FORMULA_NAME QuasiCertifProtocol-PT-10-07
FORMULA_NAME QuasiCertifProtocol-PT-10-08
FORMULA_NAME QuasiCertifProtocol-PT-10-09
FORMULA_NAME QuasiCertifProtocol-PT-10-10
FORMULA_NAME QuasiCertifProtocol-PT-10-11
FORMULA_NAME QuasiCertifProtocol-PT-10-12
FORMULA_NAME QuasiCertifProtocol-PT-10-13
FORMULA_NAME QuasiCertifProtocol-PT-10-14
FORMULA_NAME QuasiCertifProtocol-PT-10-15

=== Now, execution of the tool begins

BK_START 1621235777139

Running Version 0
[2021-05-17 07:16:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 07:16:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 07:16:18] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2021-05-17 07:16:18] [INFO ] Transformed 550 places.
[2021-05-17 07:16:18] [INFO ] Transformed 176 transitions.
[2021-05-17 07:16:18] [INFO ] Parsed PT model containing 550 places and 176 transitions in 89 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 07:16:18] [INFO ] Initial state test concluded for 5 properties.
FORMULA QuasiCertifProtocol-PT-10-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 342 out of 550 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 527 transition count 176
Applied a total of 23 rules in 19 ms. Remains 527 /550 variables (removed 23) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 527 cols
[2021-05-17 07:16:18] [INFO ] Computed 352 place invariants in 29 ms
[2021-05-17 07:16:19] [INFO ] Implicit Places using invariants in 326 ms returned []
// Phase 1: matrix 176 rows 527 cols
[2021-05-17 07:16:19] [INFO ] Computed 352 place invariants in 21 ms
[2021-05-17 07:16:19] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 527 cols
[2021-05-17 07:16:19] [INFO ] Computed 352 place invariants in 7 ms
[2021-05-17 07:16:19] [INFO ] Dead Transitions using invariants and state equation in 142 ms returned []
Finished structural reductions, in 1 iterations. Remains : 527/550 places, 176/176 transitions.
[2021-05-17 07:16:19] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 07:16:19] [INFO ] Flatten gal took : 54 ms
FORMULA QuasiCertifProtocol-PT-10-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 07:16:19] [INFO ] Flatten gal took : 29 ms
[2021-05-17 07:16:19] [INFO ] Input system was already deterministic with 176 transitions.
Incomplete random walk after 100000 steps, including 6926 resets, run finished after 467 ms. (steps per millisecond=214 ) properties (out of 19) seen :5
Running SMT prover for 14 properties.
// Phase 1: matrix 176 rows 527 cols
[2021-05-17 07:16:20] [INFO ] Computed 352 place invariants in 7 ms
[2021-05-17 07:16:20] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned unsat
[2021-05-17 07:16:20] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2021-05-17 07:16:20] [INFO ] [Real]Absence check using 1 positive and 351 generalized place invariants in 48 ms returned sat
[2021-05-17 07:16:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:20] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2021-05-17 07:16:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:16:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2021-05-17 07:16:20] [INFO ] [Nat]Absence check using 1 positive and 351 generalized place invariants in 52 ms returned sat
[2021-05-17 07:16:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:20] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2021-05-17 07:16:20] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 13 ms.
[2021-05-17 07:16:21] [INFO ] Added : 47 causal constraints over 10 iterations in 207 ms. Result :sat
[2021-05-17 07:16:21] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2021-05-17 07:16:21] [INFO ] [Real]Absence check using 1 positive and 351 generalized place invariants in 41 ms returned sat
[2021-05-17 07:16:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:21] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2021-05-17 07:16:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:16:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2021-05-17 07:16:21] [INFO ] [Nat]Absence check using 1 positive and 351 generalized place invariants in 41 ms returned sat
[2021-05-17 07:16:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:21] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2021-05-17 07:16:21] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 10 ms.
[2021-05-17 07:16:21] [INFO ] Added : 35 causal constraints over 7 iterations in 119 ms. Result :sat
[2021-05-17 07:16:21] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2021-05-17 07:16:21] [INFO ] [Real]Absence check using 1 positive and 351 generalized place invariants in 44 ms returned sat
[2021-05-17 07:16:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:21] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2021-05-17 07:16:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:16:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2021-05-17 07:16:21] [INFO ] [Nat]Absence check using 1 positive and 351 generalized place invariants in 42 ms returned sat
[2021-05-17 07:16:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:22] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2021-05-17 07:16:22] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 11 ms.
[2021-05-17 07:16:22] [INFO ] Added : 18 causal constraints over 4 iterations in 112 ms. Result :sat
[2021-05-17 07:16:22] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2021-05-17 07:16:22] [INFO ] [Real]Absence check using 1 positive and 351 generalized place invariants in 60 ms returned sat
[2021-05-17 07:16:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:22] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2021-05-17 07:16:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:16:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2021-05-17 07:16:22] [INFO ] [Nat]Absence check using 1 positive and 351 generalized place invariants in 57 ms returned sat
[2021-05-17 07:16:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:22] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2021-05-17 07:16:22] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 10 ms.
[2021-05-17 07:16:23] [INFO ] Added : 58 causal constraints over 12 iterations in 252 ms. Result :sat
[2021-05-17 07:16:23] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2021-05-17 07:16:23] [INFO ] [Real]Absence check using 1 positive and 351 generalized place invariants in 56 ms returned sat
[2021-05-17 07:16:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:23] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2021-05-17 07:16:23] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 12 ms.
[2021-05-17 07:16:23] [INFO ] Added : 57 causal constraints over 12 iterations in 260 ms. Result :sat
[2021-05-17 07:16:23] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2021-05-17 07:16:23] [INFO ] [Real]Absence check using 1 positive and 351 generalized place invariants in 74 ms returned sat
[2021-05-17 07:16:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:23] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2021-05-17 07:16:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:16:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2021-05-17 07:16:23] [INFO ] [Nat]Absence check using 1 positive and 351 generalized place invariants in 48 ms returned sat
[2021-05-17 07:16:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:24] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2021-05-17 07:16:24] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 9 ms.
[2021-05-17 07:16:24] [INFO ] Added : 25 causal constraints over 5 iterations in 100 ms. Result :sat
[2021-05-17 07:16:24] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2021-05-17 07:16:24] [INFO ] [Real]Absence check using 1 positive and 351 generalized place invariants in 44 ms returned sat
[2021-05-17 07:16:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:24] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2021-05-17 07:16:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:16:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2021-05-17 07:16:24] [INFO ] [Nat]Absence check using 1 positive and 351 generalized place invariants in 79 ms returned sat
[2021-05-17 07:16:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:24] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2021-05-17 07:16:24] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 13 ms.
[2021-05-17 07:16:24] [INFO ] Added : 23 causal constraints over 5 iterations in 103 ms. Result :sat
[2021-05-17 07:16:24] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2021-05-17 07:16:24] [INFO ] [Real]Absence check using 1 positive and 351 generalized place invariants in 46 ms returned sat
[2021-05-17 07:16:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:24] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2021-05-17 07:16:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:16:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2021-05-17 07:16:25] [INFO ] [Nat]Absence check using 1 positive and 351 generalized place invariants in 46 ms returned sat
[2021-05-17 07:16:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:25] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2021-05-17 07:16:25] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 9 ms.
[2021-05-17 07:16:25] [INFO ] Added : 11 causal constraints over 3 iterations in 77 ms. Result :sat
[2021-05-17 07:16:25] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2021-05-17 07:16:25] [INFO ] [Real]Absence check using 1 positive and 351 generalized place invariants in 52 ms returned sat
[2021-05-17 07:16:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:25] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2021-05-17 07:16:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:16:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2021-05-17 07:16:25] [INFO ] [Nat]Absence check using 1 positive and 351 generalized place invariants in 100 ms returned sat
[2021-05-17 07:16:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:25] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2021-05-17 07:16:25] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 8 ms.
[2021-05-17 07:16:25] [INFO ] Added : 53 causal constraints over 11 iterations in 159 ms. Result :sat
[2021-05-17 07:16:25] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2021-05-17 07:16:26] [INFO ] [Real]Absence check using 1 positive and 351 generalized place invariants in 79 ms returned sat
[2021-05-17 07:16:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:26] [INFO ] [Real]Absence check using state equation in 33 ms returned unsat
[2021-05-17 07:16:26] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2021-05-17 07:16:26] [INFO ] [Real]Absence check using 1 positive and 351 generalized place invariants in 56 ms returned sat
[2021-05-17 07:16:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:26] [INFO ] [Real]Absence check using state equation in 119 ms returned unsat
[2021-05-17 07:16:26] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2021-05-17 07:16:26] [INFO ] [Real]Absence check using 1 positive and 351 generalized place invariants in 50 ms returned sat
[2021-05-17 07:16:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:26] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2021-05-17 07:16:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:16:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2021-05-17 07:16:26] [INFO ] [Nat]Absence check using 1 positive and 351 generalized place invariants in 55 ms returned sat
[2021-05-17 07:16:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:26] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2021-05-17 07:16:26] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 13 ms.
[2021-05-17 07:16:26] [INFO ] Added : 53 causal constraints over 11 iterations in 171 ms. Result :sat
[2021-05-17 07:16:26] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 9 simplifications.
[2021-05-17 07:16:26] [INFO ] Initial state test concluded for 2 properties.
FORMULA QuasiCertifProtocol-PT-10-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&F(G(((p1||G(p2)) U p3))))))], workingDir=/home/mcc/execution]
Support contains 157 out of 527 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 527/527 places, 176/176 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 526 transition count 176
Applied a total of 1 rules in 37 ms. Remains 526 /527 variables (removed 1) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 526 cols
[2021-05-17 07:16:27] [INFO ] Computed 351 place invariants in 7 ms
[2021-05-17 07:16:27] [INFO ] Implicit Places using invariants in 269 ms returned []
// Phase 1: matrix 176 rows 526 cols
[2021-05-17 07:16:27] [INFO ] Computed 351 place invariants in 5 ms
[2021-05-17 07:16:28] [INFO ] Implicit Places using invariants and state equation in 687 ms returned [304, 305, 312, 313, 314, 315, 316, 317, 318, 319, 356]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 959 ms to find 11 implicit places.
// Phase 1: matrix 176 rows 515 cols
[2021-05-17 07:16:28] [INFO ] Computed 340 place invariants in 5 ms
[2021-05-17 07:16:28] [INFO ] Dead Transitions using invariants and state equation in 144 ms returned []
Starting structural reductions, iteration 1 : 515/527 places, 176/176 transitions.
Applied a total of 0 rules in 13 ms. Remains 515 /515 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 515 cols
[2021-05-17 07:16:28] [INFO ] Computed 340 place invariants in 5 ms
[2021-05-17 07:16:28] [INFO ] Dead Transitions using invariants and state equation in 148 ms returned []
Finished structural reductions, in 2 iterations. Remains : 515/527 places, 176/176 transitions.
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), true, (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : QuasiCertifProtocol-PT-10-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(OR (AND p0 (NOT p3) p1) (AND p0 (NOT p3) p2)), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p3) (NOT p1) p2), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 3}, { cond=(OR p3 p1 p2), acceptance={0} source=3 dest: 3}, { cond=(OR (AND (NOT p3) p1) (AND (NOT p3) p2)), acceptance={0, 1} source=3 dest: 4}, { cond=(AND (NOT p3) (NOT p1) p2), acceptance={1} source=3 dest: 5}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 3}, { cond=(OR (AND (NOT p3) p1) (AND (NOT p3) p2)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p1) p2), acceptance={1} source=4 dest: 5}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 3}, { cond=(OR (AND p3 (NOT p2)) (AND p1 (NOT p2))), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={0, 1} source=5 dest: 4}, { cond=(AND (NOT p3) (NOT p1) p2), acceptance={1} source=5 dest: 5}, { cond=(OR (AND p3 p2) (AND p1 p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p3) p1 p2), acceptance={1} source=5 dest: 6}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 3}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={0, 1} source=6 dest: 4}, { cond=(AND (NOT p3) (NOT p1) p2), acceptance={1} source=6 dest: 5}, { cond=(AND (NOT p3) p1 p2), acceptance={1} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11) (ADD s326 s327 s328 s329 s330 s331 s332 s333 s334 s335 s336 s337 s338 s339 s340 s341 s342 s343 s344 s345 s346 s347 s348 s349 s350 s351 s352 s353 s354 s355 s356 s357 s358 s359 s360 s361 s362 s363 s364 s365 s366 s367 s368 s369 s370 s371 s372 s373 s374 s375 s376 s377 s378 s379 s380 s381 s382 s383 s384 s385 s386 s387 s388 s389 s390 s391 s392 s393 s394 s395 s396 s397 s398 s399 s400 s401 s402 s403 s404 s405 s406 s407 s408 s409 s410 s411 s412 s413 s414 s415 s416 s417 s418 s419 s420 s427 s428 s429 s430 s431 s432 s433 s434 s435 s436 s437 s438 s439 s440 s441 s442 s443 s444 s445 s446 s447 s448 s449 s450 s451 s452)), p3:(LEQ (ADD s503 s504 s505 s506 s507 s509 s510 s511 s512 s513 s514) s22), p1:(LEQ s485 s76), p2:(LEQ s76 (ADD s469 s470 s471 s472 s473 s474 s475 s476 s477 s479 s480))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 6926 reset in 397 ms.
Product exploration explored 100000 steps with 6932 reset in 303 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 515 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (G p2)), p0, p3, p1, p2]
Adopting property with smaller alphabet thanks to knowledge :(F (OR (G p3) (G (NOT p3))))
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), true, p3, (NOT p3), (NOT p3)]
Support contains 144 out of 515 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 515/515 places, 176/176 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 514 transition count 176
Applied a total of 1 rules in 10 ms. Remains 514 /515 variables (removed 1) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 514 cols
[2021-05-17 07:16:29] [INFO ] Computed 340 place invariants in 7 ms
[2021-05-17 07:16:30] [INFO ] Implicit Places using invariants in 240 ms returned []
// Phase 1: matrix 176 rows 514 cols
[2021-05-17 07:16:30] [INFO ] Computed 340 place invariants in 5 ms
[2021-05-17 07:16:30] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 717 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 514 cols
[2021-05-17 07:16:30] [INFO ] Computed 340 place invariants in 9 ms
[2021-05-17 07:16:30] [INFO ] Dead Transitions using invariants and state equation in 144 ms returned []
Finished structural reductions, in 1 iterations. Remains : 514/515 places, 176/176 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), true, p3, (NOT p3), (NOT p3)]
Product exploration explored 100000 steps with 6921 reset in 175 ms.
Product exploration explored 100000 steps with 6924 reset in 198 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), true, p3, (NOT p3), (NOT p3)]
Support contains 144 out of 514 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 514/514 places, 176/176 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 514 transition count 178
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 41 ms. Remains 514 /514 variables (removed 0) and now considering 178/176 (removed -2) transitions.
[2021-05-17 07:16:31] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 178 rows 514 cols
[2021-05-17 07:16:31] [INFO ] Computed 340 place invariants in 5 ms
[2021-05-17 07:16:31] [INFO ] Dead Transitions using invariants and state equation in 140 ms returned []
Finished structural reductions, in 1 iterations. Remains : 514/514 places, 178/176 transitions.
Product exploration explored 100000 steps with 6925 reset in 474 ms.
Product exploration explored 100000 steps with 6925 reset in 356 ms.
Starting structural reductions, iteration 0 : 515/515 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 515 /515 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 515 cols
[2021-05-17 07:16:32] [INFO ] Computed 340 place invariants in 5 ms
[2021-05-17 07:16:32] [INFO ] Implicit Places using invariants in 263 ms returned []
// Phase 1: matrix 176 rows 515 cols
[2021-05-17 07:16:32] [INFO ] Computed 340 place invariants in 6 ms
[2021-05-17 07:16:33] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 728 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 515 cols
[2021-05-17 07:16:33] [INFO ] Computed 340 place invariants in 4 ms
[2021-05-17 07:16:33] [INFO ] Dead Transitions using invariants and state equation in 152 ms returned []
Finished structural reductions, in 1 iterations. Remains : 515/515 places, 176/176 transitions.
Application raised an uncaught exception null
java.lang.UnsupportedOperationException
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:879)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:835)
at fr.lip6.move.gal.application.MccTranslator.lambda$3(MccTranslator.java:862)
at fr.lip6.move.gal.structural.expr.NaryOp.forEachChild(NaryOp.java:153)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:862)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:825)
at fr.lip6.move.gal.application.MccTranslator.lambda$3(MccTranslator.java:862)
at fr.lip6.move.gal.structural.expr.NaryOp.forEachChild(NaryOp.java:153)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:862)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:760)
at fr.lip6.move.gal.application.MccTranslator.rebuildSpecification(MccTranslator.java:729)
at fr.lip6.move.gal.application.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:585)
at fr.lip6.move.gal.application.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:269)
at fr.lip6.move.gal.application.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:60)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:470)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)

BK_STOP 1621235793926

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-PT-10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-162089415200084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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