Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r132-tall-165271820300019.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is HypercubeGrid-PT-C5K3P3B15, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271820300019
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 8.7K Apr 29 22:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 29 22:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 29 18:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 29 18:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.3K May 9 08:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 08:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 9 08:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 08:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 10 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rwxr-xr-x 1 mcc users 14M May 10 09:34 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 HypercubeGrid-PT-C5K3P3B15-LTLCardinality-00
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-LTLCardinality-01
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-LTLCardinality-02
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-LTLCardinality-03
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-LTLCardinality-04
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-LTLCardinality-05
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-LTLCardinality-06
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-LTLCardinality-07
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-LTLCardinality-08
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-LTLCardinality-09
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-LTLCardinality-10
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-LTLCardinality-11
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-LTLCardinality-12
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-LTLCardinality-13
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-LTLCardinality-14
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652731170737

Running Version 202205111006
[2022-05-16 19:59:31] [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]
[2022-05-16 19:59:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 19:59:32] [INFO ] Load time of PNML (sax parser for PT used): 871 ms
[2022-05-16 19:59:33] [INFO ] Transformed 9153 places.
[2022-05-16 19:59:33] [INFO ] Transformed 25110 transitions.
[2022-05-16 19:59:33] [INFO ] Parsed PT model containing 9153 places and 25110 transitions in 1118 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA HypercubeGrid-PT-C5K3P3B15-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HypercubeGrid-PT-C5K3P3B15-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HypercubeGrid-PT-C5K3P3B15-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HypercubeGrid-PT-C5K3P3B15-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HypercubeGrid-PT-C5K3P3B15-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 9153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9153/9153 places, 25110/25110 transitions.
Applied a total of 0 rules in 2175 ms. Remains 9153 /9153 variables (removed 0) and now considering 25110/25110 (removed 0) transitions.
// Phase 1: matrix 25110 rows 9153 cols
[2022-05-16 19:59:36] [INFO ] Computed 3484 place invariants in 1107 ms
[2022-05-16 19:59:37] [INFO ] Implicit Places using invariants in 2287 ms returned []
Implicit Place search using SMT only with invariants took 2321 ms to find 0 implicit places.
// Phase 1: matrix 25110 rows 9153 cols
[2022-05-16 19:59:38] [INFO ] Computed 3484 place invariants in 950 ms
[2022-05-16 19:59:39] [INFO ] Dead Transitions using invariants and state equation in 2032 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9153/9153 places, 25110/25110 transitions.
Support contains 44 out of 9153 places after structural reductions.
[2022-05-16 19:59:41] [INFO ] Flatten gal took : 1223 ms
[2022-05-16 19:59:42] [INFO ] Flatten gal took : 1005 ms
[2022-05-16 19:59:44] [INFO ] Input system was already deterministic with 25110 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8497 ms. (steps per millisecond=1 ) properties (out of 26) seen :11
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 87 ms. (steps per millisecond=11 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 82 ms. (steps per millisecond=12 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 86 ms. (steps per millisecond=11 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 89 ms. (steps per millisecond=11 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 82 ms. (steps per millisecond=12 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 84 ms. (steps per millisecond=11 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 129 ms. (steps per millisecond=7 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 90 ms. (steps per millisecond=11 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 89 ms. (steps per millisecond=11 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 90 ms. (steps per millisecond=11 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 89 ms. (steps per millisecond=11 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 89 ms. (steps per millisecond=11 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 88 ms. (steps per millisecond=11 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 88 ms. (steps per millisecond=11 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 90 ms. (steps per millisecond=11 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 25110 rows 9153 cols
[2022-05-16 19:59:55] [INFO ] Computed 3484 place invariants in 910 ms
[2022-05-16 19:59:59] [INFO ] [Real]Absence check using 3483 positive place invariants in 1174 ms returned sat
[2022-05-16 20:00:00] [INFO ] [Real]Absence check using 3483 positive and 1 generalized place invariants in 1433 ms returned sat
[2022-05-16 20:00:20] [INFO ] After 19296ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:12
[2022-05-16 20:00:20] [INFO ] After 19337ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :1 real:12
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-05-16 20:00:20] [INFO ] After 25101ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :1 real:12
[2022-05-16 20:00:24] [INFO ] [Nat]Absence check using 3483 positive place invariants in 1336 ms returned sat
[2022-05-16 20:00:25] [INFO ] [Nat]Absence check using 3483 positive and 1 generalized place invariants in 1401 ms returned sat
[2022-05-16 20:00:45] [INFO ] After 18595ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :8
[2022-05-16 20:00:45] [INFO ] After 18598ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :8
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-16 20:00:45] [INFO ] After 25055ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :8
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 18 out of 9153 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 9153/9153 places, 25110/25110 transitions.
Applied a total of 0 rules in 2080 ms. Remains 9153 /9153 variables (removed 0) and now considering 25110/25110 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 9153/9153 places, 25110/25110 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8067 ms. (steps per millisecond=1 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 798 ms. (steps per millisecond=12 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 734 ms. (steps per millisecond=13 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 718 ms. (steps per millisecond=13 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 687 ms. (steps per millisecond=14 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 635 ms. (steps per millisecond=15 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 710 ms. (steps per millisecond=14 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 25110 rows 9153 cols
[2022-05-16 20:01:00] [INFO ] Computed 3484 place invariants in 930 ms
[2022-05-16 20:01:03] [INFO ] [Real]Absence check using 3483 positive place invariants in 1109 ms returned sat
[2022-05-16 20:01:05] [INFO ] [Real]Absence check using 3483 positive and 1 generalized place invariants in 1400 ms returned sat
[2022-05-16 20:01:26] [INFO ] After 20891ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2022-05-16 20:01:26] [INFO ] After 20918ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:5
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-16 20:01:26] [INFO ] After 25146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:5
[2022-05-16 20:01:28] [INFO ] [Nat]Absence check using 3483 positive place invariants in 1098 ms returned sat
[2022-05-16 20:01:30] [INFO ] [Nat]Absence check using 3483 positive and 1 generalized place invariants in 1374 ms returned sat
[2022-05-16 20:01:51] [INFO ] After 20273ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-16 20:01:51] [INFO ] After 20279ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-16 20:01:51] [INFO ] After 25054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 2021 ms.
Support contains 11 out of 9153 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 9153/9153 places, 25110/25110 transitions.
Applied a total of 0 rules in 1569 ms. Remains 9153 /9153 variables (removed 0) and now considering 25110/25110 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 9153/9153 places, 25110/25110 transitions.
Successfully simplified 6 atomic propositions for a total of 11 simplifications.
FORMULA HypercubeGrid-PT-C5K3P3B15-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HypercubeGrid-PT-C5K3P3B15-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HypercubeGrid-PT-C5K3P3B15-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA HypercubeGrid-PT-C5K3P3B15-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U F(p1))&&G(p2))))'
Support contains 5 out of 9153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9153/9153 places, 25110/25110 transitions.
Applied a total of 0 rules in 1293 ms. Remains 9153 /9153 variables (removed 0) and now considering 25110/25110 (removed 0) transitions.
// Phase 1: matrix 25110 rows 9153 cols
[2022-05-16 20:01:57] [INFO ] Computed 3484 place invariants in 903 ms
[2022-05-16 20:01:58] [INFO ] Implicit Places using invariants in 1802 ms returned []
Implicit Place search using SMT only with invariants took 1804 ms to find 0 implicit places.
// Phase 1: matrix 25110 rows 9153 cols
[2022-05-16 20:01:59] [INFO ] Computed 3484 place invariants in 967 ms
[2022-05-16 20:01:59] [INFO ] Dead Transitions using invariants and state equation in 1790 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9153/9153 places, 25110/25110 transitions.
Stuttering acceptance computed with spot in 273 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), true, (OR (NOT p2) (NOT p1))]
Running random walk in product with property : HypercubeGrid-PT-C5K3P3B15-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p2), acceptance={0} source=3 dest: 0}, { cond=(NOT p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p2:(GT s995 s86), p1:(OR (LEQ s8401 s8151) (LEQ 1 s6581))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 8 ms.
FORMULA HypercubeGrid-PT-C5K3P3B15-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HypercubeGrid-PT-C5K3P3B15-LTLCardinality-01 finished in 5303 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(X(p0)))||X((G((X(F(p1))||p2))&&p0)))))'
Support contains 4 out of 9153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9153/9153 places, 25110/25110 transitions.
Applied a total of 0 rules in 1268 ms. Remains 9153 /9153 variables (removed 0) and now considering 25110/25110 (removed 0) transitions.
// Phase 1: matrix 25110 rows 9153 cols
[2022-05-16 20:02:02] [INFO ] Computed 3484 place invariants in 906 ms
[2022-05-16 20:02:03] [INFO ] Implicit Places using invariants in 1831 ms returned []
Implicit Place search using SMT only with invariants took 1852 ms to find 0 implicit places.
// Phase 1: matrix 25110 rows 9153 cols
[2022-05-16 20:02:04] [INFO ] Computed 3484 place invariants in 891 ms
[2022-05-16 20:02:05] [INFO ] Dead Transitions using invariants and state equation in 1747 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9153/9153 places, 25110/25110 transitions.
Stuttering acceptance computed with spot in 239 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HypercubeGrid-PT-C5K3P3B15-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 1 s1313), p2:(LEQ s8769 s3804), p1:(LEQ 1 s57)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 12200 steps with 354 reset in 10003 ms.
Product exploration timeout after 12550 steps with 801 reset in 10003 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p0)]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 182 ms. Reduced automaton from 6 states, 11 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 7766 ms. (steps per millisecond=1 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 635 ms. (steps per millisecond=15 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 713 ms. (steps per millisecond=14 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 753 ms. (steps per millisecond=13 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 25110 rows 9153 cols
[2022-05-16 20:02:36] [INFO ] Computed 3484 place invariants in 928 ms
[2022-05-16 20:02:39] [INFO ] [Real]Absence check using 3483 positive place invariants in 1060 ms returned sat
[2022-05-16 20:02:40] [INFO ] [Real]Absence check using 3483 positive and 1 generalized place invariants in 1380 ms returned sat
[2022-05-16 20:02:40] [INFO ] After 3833ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-16 20:02:43] [INFO ] [Nat]Absence check using 3483 positive place invariants in 1143 ms returned sat
[2022-05-16 20:02:44] [INFO ] [Nat]Absence check using 3483 positive and 1 generalized place invariants in 1442 ms returned sat
[2022-05-16 20:03:05] [INFO ] After 20898ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-16 20:03:05] [INFO ] After 20918ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-16 20:03:05] [INFO ] After 25047ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2010 ms.
Support contains 4 out of 9153 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 9153/9153 places, 25110/25110 transitions.
Applied a total of 0 rules in 1446 ms. Remains 9153 /9153 variables (removed 0) and now considering 25110/25110 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 9153/9153 places, 25110/25110 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 7889 ms. (steps per millisecond=1 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 795 ms. (steps per millisecond=12 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 782 ms. (steps per millisecond=12 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 780 ms. (steps per millisecond=12 ) properties (out of 3) seen :0
Probabilistic random walk exhausted memory after 178361 steps, saw 178268 distinct states, run finished after 24729 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 25110 rows 9153 cols
[2022-05-16 20:03:45] [INFO ] Computed 3484 place invariants in 894 ms
[2022-05-16 20:03:47] [INFO ] [Real]Absence check using 3483 positive place invariants in 1094 ms returned sat
[2022-05-16 20:03:49] [INFO ] [Real]Absence check using 3483 positive and 1 generalized place invariants in 1420 ms returned sat
[2022-05-16 20:03:49] [INFO ] After 3809ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-16 20:03:51] [INFO ] [Nat]Absence check using 3483 positive place invariants in 1131 ms returned sat
[2022-05-16 20:03:52] [INFO ] [Nat]Absence check using 3483 positive and 1 generalized place invariants in 1445 ms returned sat
[2022-05-16 20:04:14] [INFO ] After 20909ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 20:04:14] [INFO ] After 20928ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-16 20:04:14] [INFO ] After 25062ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 9153 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 9153/9153 places, 25110/25110 transitions.
Applied a total of 0 rules in 1539 ms. Remains 9153 /9153 variables (removed 0) and now considering 25110/25110 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 9153/9153 places, 25110/25110 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 9153/9153 places, 25110/25110 transitions.
Applied a total of 0 rules in 1499 ms. Remains 9153 /9153 variables (removed 0) and now considering 25110/25110 (removed 0) transitions.
// Phase 1: matrix 25110 rows 9153 cols
[2022-05-16 20:04:18] [INFO ] Computed 3484 place invariants in 900 ms
[2022-05-16 20:04:18] [INFO ] Implicit Places using invariants in 1715 ms returned []
Implicit Place search using SMT only with invariants took 1718 ms to find 0 implicit places.
// Phase 1: matrix 25110 rows 9153 cols
[2022-05-16 20:04:19] [INFO ] Computed 3484 place invariants in 897 ms
[2022-05-16 20:04:20] [INFO ] Dead Transitions using invariants and state equation in 1802 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9153/9153 places, 25110/25110 transitions.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p0)]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (F (NOT (AND p0 (NOT p2))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 185 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 9153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9153/9153 places, 25110/25110 transitions.
Applied a total of 0 rules in 1450 ms. Remains 9153 /9153 variables (removed 0) and now considering 25110/25110 (removed 0) transitions.
// Phase 1: matrix 25110 rows 9153 cols
[2022-05-16 20:04:23] [INFO ] Computed 3484 place invariants in 918 ms
[2022-05-16 20:04:24] [INFO ] Implicit Places using invariants in 1740 ms returned []
Implicit Place search using SMT only with invariants took 1744 ms to find 0 implicit places.
// Phase 1: matrix 25110 rows 9153 cols
[2022-05-16 20:04:25] [INFO ] Computed 3484 place invariants in 918 ms
[2022-05-16 20:04:26] [INFO ] Dead Transitions using invariants and state equation in 1751 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9153/9153 places, 25110/25110 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2)))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 202 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 7858 ms. (steps per millisecond=1 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 793 ms. (steps per millisecond=12 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 782 ms. (steps per millisecond=12 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 781 ms. (steps per millisecond=12 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 25110 rows 9153 cols
[2022-05-16 20:04:38] [INFO ] Computed 3484 place invariants in 922 ms
[2022-05-16 20:04:40] [INFO ] [Real]Absence check using 3483 positive place invariants in 1132 ms returned sat
[2022-05-16 20:04:41] [INFO ] [Real]Absence check using 3483 positive and 1 generalized place invariants in 1481 ms returned sat
[2022-05-16 20:04:42] [INFO ] After 3993ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-16 20:04:44] [INFO ] [Nat]Absence check using 3483 positive place invariants in 1155 ms returned sat
[2022-05-16 20:04:45] [INFO ] [Nat]Absence check using 3483 positive and 1 generalized place invariants in 1426 ms returned sat
[2022-05-16 20:05:07] [INFO ] After 20930ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-16 20:05:07] [INFO ] After 20943ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-16 20:05:07] [INFO ] After 25066ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2008 ms.
Support contains 4 out of 9153 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 9153/9153 places, 25110/25110 transitions.
Applied a total of 0 rules in 1600 ms. Remains 9153 /9153 variables (removed 0) and now considering 25110/25110 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 9153/9153 places, 25110/25110 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 7971 ms. (steps per millisecond=1 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 778 ms. (steps per millisecond=12 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 786 ms. (steps per millisecond=12 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 777 ms. (steps per millisecond=12 ) properties (out of 3) seen :0

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="HypercubeGrid-PT-C5K3P3B15"
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 HypercubeGrid-PT-C5K3P3B15, 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 r132-tall-165271820300019"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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