Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 844K
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 26 15:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 15:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 26 15:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 15:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 26 15:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 432K Mar 5 18:22 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 DBSingleClientW-PT-d1m04-LTLCardinality-00
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLCardinality-01
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLCardinality-02
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLCardinality-03
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLCardinality-04
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLCardinality-05
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLCardinality-06
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLCardinality-07
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLCardinality-08
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLCardinality-09
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLCardinality-10
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLCardinality-11
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLCardinality-12
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLCardinality-13
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLCardinality-14
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678239711472

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m04
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-08 01:41:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-08 01:41:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 01:41:53] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2023-03-08 01:41:53] [INFO ] Transformed 1440 places.
[2023-03-08 01:41:53] [INFO ] Transformed 672 transitions.
[2023-03-08 01:41:53] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 353 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1093 places in 5 ms
Reduce places removed 1093 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA DBSingleClientW-PT-d1m04-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 6 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 326 transition count 592
Discarding 94 places :
Symmetric choice reduction at 1 with 94 rule applications. Total rules 195 place count 232 transition count 337
Iterating global reduction 1 with 94 rules applied. Total rules applied 289 place count 232 transition count 337
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 293 place count 232 transition count 333
Discarding 70 places :
Symmetric choice reduction at 2 with 70 rule applications. Total rules 363 place count 162 transition count 263
Iterating global reduction 2 with 70 rules applied. Total rules applied 433 place count 162 transition count 263
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 438 place count 162 transition count 258
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 477 place count 123 transition count 198
Iterating global reduction 3 with 39 rules applied. Total rules applied 516 place count 123 transition count 198
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 538 place count 123 transition count 176
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 547 place count 114 transition count 160
Iterating global reduction 4 with 9 rules applied. Total rules applied 556 place count 114 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 557 place count 114 transition count 159
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 563 place count 108 transition count 153
Iterating global reduction 5 with 6 rules applied. Total rules applied 569 place count 108 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 570 place count 108 transition count 152
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 575 place count 103 transition count 147
Iterating global reduction 6 with 5 rules applied. Total rules applied 580 place count 103 transition count 147
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 581 place count 102 transition count 145
Iterating global reduction 6 with 1 rules applied. Total rules applied 582 place count 102 transition count 145
Applied a total of 582 rules in 76 ms. Remains 102 /347 variables (removed 245) and now considering 145/672 (removed 527) transitions.
// Phase 1: matrix 145 rows 102 cols
[2023-03-08 01:41:53] [INFO ] Computed 2 place invariants in 16 ms
[2023-03-08 01:41:53] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-08 01:41:53] [INFO ] Invariant cache hit.
[2023-03-08 01:41:54] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-08 01:41:54] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
[2023-03-08 01:41:54] [INFO ] Invariant cache hit.
[2023-03-08 01:41:54] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 102/347 places, 145/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 596 ms. Remains : 102/347 places, 145/672 transitions.
Support contains 6 out of 102 places after structural reductions.
[2023-03-08 01:41:54] [INFO ] Flatten gal took : 35 ms
[2023-03-08 01:41:54] [INFO ] Flatten gal took : 14 ms
[2023-03-08 01:41:54] [INFO ] Input system was already deterministic with 145 transitions.
Incomplete random walk after 10000 steps, including 2293 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 943 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 1024 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 1010 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :1
Running SMT prover for 3 properties.
[2023-03-08 01:41:54] [INFO ] Invariant cache hit.
[2023-03-08 01:41:55] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 01:41:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:41:55] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-08 01:41:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:41:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:41:55] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-08 01:41:55] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-08 01:41:55] [INFO ] After 26ms SMT Verify possible using 51 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-08 01:41:55] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-08 01:41:55] [INFO ] After 211ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 145/145 transitions.
Graph (complete) has 327 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 101 transition count 142
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 7 place count 98 transition count 138
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 98 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 98 transition count 137
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 14 place count 95 transition count 130
Iterating global reduction 2 with 3 rules applied. Total rules applied 17 place count 95 transition count 130
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 20 place count 92 transition count 127
Iterating global reduction 2 with 3 rules applied. Total rules applied 23 place count 92 transition count 127
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 25 place count 92 transition count 125
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 27 place count 90 transition count 123
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 90 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 32 place count 90 transition count 120
Applied a total of 32 rules in 45 ms. Remains 90 /102 variables (removed 12) and now considering 120/145 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 90/102 places, 120/145 transitions.
Incomplete random walk after 10000 steps, including 2331 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 1048 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 975 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Finished probabilistic random walk after 17383 steps, run visited all 2 properties in 79 ms. (steps per millisecond=220 )
Probabilistic random walk after 17383 steps, saw 7489 distinct states, run finished after 79 ms. (steps per millisecond=220 ) properties seen :2
FORMULA DBSingleClientW-PT-d1m04-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 3 simplifications.
FORMULA DBSingleClientW-PT-d1m04-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 356 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 145/145 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 98 transition count 140
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 98 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 98 transition count 139
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 13 place count 94 transition count 131
Iterating global reduction 1 with 4 rules applied. Total rules applied 17 place count 94 transition count 131
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 90 transition count 126
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 90 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 28 place count 90 transition count 123
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 31 place count 87 transition count 115
Iterating global reduction 2 with 3 rules applied. Total rules applied 34 place count 87 transition count 115
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 37 place count 87 transition count 112
Applied a total of 37 rules in 20 ms. Remains 87 /102 variables (removed 15) and now considering 112/145 (removed 33) transitions.
// Phase 1: matrix 112 rows 87 cols
[2023-03-08 01:41:56] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-08 01:41:56] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-08 01:41:56] [INFO ] Invariant cache hit.
[2023-03-08 01:41:56] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 01:41:56] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2023-03-08 01:41:56] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 01:41:56] [INFO ] Invariant cache hit.
[2023-03-08 01:41:56] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/102 places, 112/145 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 347 ms. Remains : 87/102 places, 112/145 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s79 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22942 reset in 318 ms.
Product exploration explored 100000 steps with 22920 reset in 168 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 297 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2345 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 997 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 13914 steps, run visited all 1 properties in 30 ms. (steps per millisecond=463 )
Probabilistic random walk after 13914 steps, saw 6228 distinct states, run finished after 30 ms. (steps per millisecond=463 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 112/112 transitions.
Applied a total of 0 rules in 19 ms. Remains 87 /87 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2023-03-08 01:41:57] [INFO ] Invariant cache hit.
[2023-03-08 01:41:57] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-08 01:41:57] [INFO ] Invariant cache hit.
[2023-03-08 01:41:57] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 01:41:57] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2023-03-08 01:41:57] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 01:41:57] [INFO ] Invariant cache hit.
[2023-03-08 01:41:57] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 276 ms. Remains : 87/87 places, 112/112 transitions.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 297 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2319 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 983 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 13914 steps, run visited all 1 properties in 82 ms. (steps per millisecond=169 )
Probabilistic random walk after 13914 steps, saw 6228 distinct states, run finished after 82 ms. (steps per millisecond=169 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22948 reset in 120 ms.
Product exploration explored 100000 steps with 22997 reset in 170 ms.
Built C files in :
/tmp/ltsmin3662826955704709089
[2023-03-08 01:41:58] [INFO ] Computing symmetric may disable matrix : 112 transitions.
[2023-03-08 01:41:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 01:41:58] [INFO ] Computing symmetric may enable matrix : 112 transitions.
[2023-03-08 01:41:58] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 01:41:58] [INFO ] Computing Do-Not-Accords matrix : 112 transitions.
[2023-03-08 01:41:58] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 01:41:58] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3662826955704709089
Running compilation step : cd /tmp/ltsmin3662826955704709089;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 348 ms.
Running link step : cd /tmp/ltsmin3662826955704709089;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin3662826955704709089;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15574025035890488907.hoa' '--buchi-type=spotba'
LTSmin run took 146 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLCardinality-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m04-LTLCardinality-04 finished in 3169 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 145/145 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 99 transition count 138
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 99 transition count 138
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 96 transition count 132
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 96 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 96 transition count 131
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 93 transition count 127
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 93 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 93 transition count 126
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 23 place count 90 transition count 117
Iterating global reduction 2 with 3 rules applied. Total rules applied 26 place count 90 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 90 transition count 114
Applied a total of 29 rules in 13 ms. Remains 90 /102 variables (removed 12) and now considering 114/145 (removed 31) transitions.
// Phase 1: matrix 114 rows 90 cols
[2023-03-08 01:41:59] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 01:41:59] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-08 01:41:59] [INFO ] Invariant cache hit.
[2023-03-08 01:41:59] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-08 01:41:59] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2023-03-08 01:41:59] [INFO ] Invariant cache hit.
[2023-03-08 01:41:59] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/102 places, 114/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 275 ms. Remains : 90/102 places, 114/145 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s24 s78)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 217 ms.
Product exploration explored 100000 steps with 50000 reset in 187 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 305 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m04-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m04-LTLCardinality-09 finished in 891 ms.
All properties solved by simple procedures.
Total runtime 7141 ms.

BK_STOP 1678239721213

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d1m04"
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-5348"
echo " Executing tool itstools"
echo " Input is DBSingleClientW-PT-d1m04, 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 r101-tall-167814475100235"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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