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.r105-tall-167814481000259.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 ltsminxred
Input is DBSingleClientW-PT-d1m07, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481000259
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 900K
-rw-r--r-- 1 mcc users 8.9K Feb 26 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 15:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 15:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 26 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:49 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-d1m07-LTLCardinality-00
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLCardinality-01
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLCardinality-02
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLCardinality-03
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLCardinality-04
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLCardinality-05
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLCardinality-06
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLCardinality-07
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLCardinality-08
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLCardinality-09
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLCardinality-10
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLCardinality-11
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLCardinality-12
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLCardinality-13
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLCardinality-14
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678266477976

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m07
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 09:07:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 09:07:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 09:07:59] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2023-03-08 09:07:59] [INFO ] Transformed 1440 places.
[2023-03-08 09:07:59] [INFO ] Transformed 672 transitions.
[2023-03-08 09:07:59] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1093 places in 6 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m07-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-LTLCardinality-09 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 95 places :
Symmetric choice reduction at 1 with 95 rule applications. Total rules 196 place count 231 transition count 332
Iterating global reduction 1 with 95 rules applied. Total rules applied 291 place count 231 transition count 332
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 295 place count 231 transition count 328
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 367 place count 159 transition count 256
Iterating global reduction 2 with 72 rules applied. Total rules applied 439 place count 159 transition count 256
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 445 place count 159 transition count 250
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 482 place count 122 transition count 190
Iterating global reduction 3 with 37 rules applied. Total rules applied 519 place count 122 transition count 190
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 537 place count 122 transition count 172
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 549 place count 110 transition count 151
Iterating global reduction 4 with 12 rules applied. Total rules applied 561 place count 110 transition count 151
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 563 place count 110 transition count 149
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 570 place count 103 transition count 142
Iterating global reduction 5 with 7 rules applied. Total rules applied 577 place count 103 transition count 142
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 580 place count 103 transition count 139
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 585 place count 98 transition count 134
Iterating global reduction 6 with 5 rules applied. Total rules applied 590 place count 98 transition count 134
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 591 place count 97 transition count 132
Iterating global reduction 6 with 1 rules applied. Total rules applied 592 place count 97 transition count 132
Applied a total of 592 rules in 102 ms. Remains 97 /347 variables (removed 250) and now considering 132/672 (removed 540) transitions.
// Phase 1: matrix 132 rows 97 cols
[2023-03-08 09:08:00] [INFO ] Computed 2 place invariants in 17 ms
[2023-03-08 09:08:00] [INFO ] Implicit Places using invariants in 284 ms returned []
[2023-03-08 09:08:00] [INFO ] Invariant cache hit.
[2023-03-08 09:08:00] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-08 09:08:00] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
[2023-03-08 09:08:00] [INFO ] Invariant cache hit.
[2023-03-08 09:08:00] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/347 places, 132/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 723 ms. Remains : 97/347 places, 132/672 transitions.
Support contains 6 out of 97 places after structural reductions.
[2023-03-08 09:08:00] [INFO ] Flatten gal took : 36 ms
[2023-03-08 09:08:00] [INFO ] Flatten gal took : 14 ms
[2023-03-08 09:08:00] [INFO ] Input system was already deterministic with 132 transitions.
Incomplete random walk after 10000 steps, including 2303 resets, run finished after 324 ms. (steps per millisecond=30 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 1012 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 916 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 982 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 966 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 948 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Finished probabilistic random walk after 30112 steps, run visited all 5 properties in 153 ms. (steps per millisecond=196 )
Probabilistic random walk after 30112 steps, saw 13650 distinct states, run finished after 154 ms. (steps per millisecond=195 ) properties seen :5
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 336 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 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 U G(!p1))))'
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 132/132 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 93 transition count 128
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 93 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 93 transition count 126
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 91 transition count 123
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 91 transition count 123
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 91 transition count 121
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 90 transition count 120
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 90 transition count 120
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 89 transition count 119
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 89 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 22 place count 89 transition count 117
Applied a total of 22 rules in 9 ms. Remains 89 /97 variables (removed 8) and now considering 117/132 (removed 15) transitions.
// Phase 1: matrix 117 rows 89 cols
[2023-03-08 09:08:01] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 09:08:02] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-08 09:08:02] [INFO ] Invariant cache hit.
[2023-03-08 09:08:02] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-08 09:08:02] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2023-03-08 09:08:02] [INFO ] Invariant cache hit.
[2023-03-08 09:08:02] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 89/97 places, 117/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 468 ms. Remains : 89/97 places, 117/132 transitions.
Stuttering acceptance computed with spot in 251 ms :[p1, p1, true, p1]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (LEQ 1 s7) (LEQ 2 s76)), p0:(LEQ 1 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 22868 reset in 256 ms.
Product exploration explored 100000 steps with 22997 reset in 187 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 306 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 537 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[true, p1, p1]
Incomplete random walk after 10000 steps, including 2338 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 967 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 23881 steps, run visited all 1 properties in 61 ms. (steps per millisecond=391 )
Probabilistic random walk after 23881 steps, saw 11111 distinct states, run finished after 61 ms. (steps per millisecond=391 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 11 factoid took 498 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[true, p1, p1]
Stuttering acceptance computed with spot in 112 ms :[true, p1, p1]
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 117/117 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2023-03-08 09:08:04] [INFO ] Invariant cache hit.
[2023-03-08 09:08:04] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-08 09:08:04] [INFO ] Invariant cache hit.
[2023-03-08 09:08:04] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-08 09:08:04] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2023-03-08 09:08:04] [INFO ] Invariant cache hit.
[2023-03-08 09:08:04] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 372 ms. Remains : 89/89 places, 117/117 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 306 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 163 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[true, p1, p1]
Incomplete random walk after 10000 steps, including 2295 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 964 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Finished probabilistic random walk after 23881 steps, run visited all 1 properties in 49 ms. (steps per millisecond=487 )
Probabilistic random walk after 23881 steps, saw 11111 distinct states, run finished after 49 ms. (steps per millisecond=487 ) properties seen :1
Knowledge obtained : [(NOT p1), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 195 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[true, p1, p1]
Stuttering acceptance computed with spot in 88 ms :[true, p1, p1]
Stuttering acceptance computed with spot in 81 ms :[true, p1, p1]
Product exploration explored 100000 steps with 22967 reset in 121 ms.
Product exploration explored 100000 steps with 23007 reset in 153 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 97 ms :[true, p1, p1]
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 117/117 transitions.
Applied a total of 0 rules in 30 ms. Remains 89 /89 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2023-03-08 09:08:06] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 09:08:06] [INFO ] Invariant cache hit.
[2023-03-08 09:08:06] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 110 ms. Remains : 89/89 places, 117/117 transitions.
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 117/117 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2023-03-08 09:08:06] [INFO ] Invariant cache hit.
[2023-03-08 09:08:06] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-08 09:08:06] [INFO ] Invariant cache hit.
[2023-03-08 09:08:06] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-08 09:08:06] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2023-03-08 09:08:06] [INFO ] Invariant cache hit.
[2023-03-08 09:08:06] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 261 ms. Remains : 89/89 places, 117/117 transitions.
Treatment of property DBSingleClientW-PT-d1m07-LTLCardinality-04 finished in 4872 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(p0)&&F(p1)))'
Support contains 3 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 132/132 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 94 transition count 128
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 94 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 94 transition count 127
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 91 transition count 122
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 91 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 91 transition count 120
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 17 place count 89 transition count 118
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 89 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 89 transition count 117
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 21 place count 88 transition count 116
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 88 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 24 place count 88 transition count 114
Applied a total of 24 rules in 21 ms. Remains 88 /97 variables (removed 9) and now considering 114/132 (removed 18) transitions.
// Phase 1: matrix 114 rows 88 cols
[2023-03-08 09:08:06] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-08 09:08:06] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-08 09:08:06] [INFO ] Invariant cache hit.
[2023-03-08 09:08:06] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-08 09:08:06] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2023-03-08 09:08:06] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 09:08:06] [INFO ] Invariant cache hit.
[2023-03-08 09:08:07] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/97 places, 114/132 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 333 ms. Remains : 88/97 places, 114/132 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(GT s47 s7), p0:(GT 1 s42)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m07-LTLCardinality-07 finished in 471 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' '!(G(F(p0)))'
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 132/132 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 92 transition count 126
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 92 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 92 transition count 123
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 89 transition count 119
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 89 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 89 transition count 117
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 23 place count 87 transition count 110
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 87 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 87 transition count 109
Applied a total of 26 rules in 19 ms. Remains 87 /97 variables (removed 10) and now considering 109/132 (removed 23) transitions.
// Phase 1: matrix 109 rows 87 cols
[2023-03-08 09:08:07] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-08 09:08:07] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-08 09:08:07] [INFO ] Invariant cache hit.
[2023-03-08 09:08:07] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-08 09:08:07] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2023-03-08 09:08:07] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 09:08:07] [INFO ] Invariant cache hit.
[2023-03-08 09:08:07] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/97 places, 109/132 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 281 ms. Remains : 87/97 places, 109/132 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s26 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m07-LTLCardinality-13 finished in 390 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 U G(!p1))))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d1m07-LTLCardinality-04
Stuttering acceptance computed with spot in 117 ms :[p1, p1, true, p1]
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 97/97 places, 132/132 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 93 transition count 128
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 93 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 93 transition count 126
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 91 transition count 123
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 91 transition count 123
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 91 transition count 121
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 90 transition count 120
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 90 transition count 120
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 89 transition count 119
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 89 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 22 place count 89 transition count 117
Applied a total of 22 rules in 17 ms. Remains 89 /97 variables (removed 8) and now considering 117/132 (removed 15) transitions.
// Phase 1: matrix 117 rows 89 cols
[2023-03-08 09:08:07] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 09:08:07] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-08 09:08:07] [INFO ] Invariant cache hit.
[2023-03-08 09:08:08] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-08 09:08:08] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2023-03-08 09:08:08] [INFO ] Invariant cache hit.
[2023-03-08 09:08:08] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 89/97 places, 117/132 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 375 ms. Remains : 89/97 places, 117/132 transitions.
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (LEQ 1 s7) (LEQ 2 s76)), p0:(LEQ 1 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 22968 reset in 109 ms.
Product exploration explored 100000 steps with 22938 reset in 115 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 306 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 504 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[true, p1, p1]
Incomplete random walk after 10000 steps, including 2274 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 975 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 23881 steps, run visited all 1 properties in 36 ms. (steps per millisecond=663 )
Probabilistic random walk after 23881 steps, saw 11111 distinct states, run finished after 36 ms. (steps per millisecond=663 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 11 factoid took 444 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[true, p1, p1]
Stuttering acceptance computed with spot in 93 ms :[true, p1, p1]
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 117/117 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2023-03-08 09:08:09] [INFO ] Invariant cache hit.
[2023-03-08 09:08:09] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-08 09:08:09] [INFO ] Invariant cache hit.
[2023-03-08 09:08:09] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-08 09:08:09] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2023-03-08 09:08:09] [INFO ] Invariant cache hit.
[2023-03-08 09:08:10] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 286 ms. Remains : 89/89 places, 117/117 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 306 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[true, p1, p1]
Incomplete random walk after 10000 steps, including 2300 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1034 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 23881 steps, run visited all 1 properties in 36 ms. (steps per millisecond=663 )
Probabilistic random walk after 23881 steps, saw 11111 distinct states, run finished after 36 ms. (steps per millisecond=663 ) properties seen :1
Knowledge obtained : [(NOT p1), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 212 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[true, p1, p1]
Stuttering acceptance computed with spot in 106 ms :[true, p1, p1]
Stuttering acceptance computed with spot in 101 ms :[true, p1, p1]
Product exploration explored 100000 steps with 22871 reset in 106 ms.
Product exploration explored 100000 steps with 22976 reset in 108 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 88 ms :[true, p1, p1]
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 117/117 transitions.
Applied a total of 0 rules in 12 ms. Remains 89 /89 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2023-03-08 09:08:11] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 09:08:11] [INFO ] Invariant cache hit.
[2023-03-08 09:08:11] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91 ms. Remains : 89/89 places, 117/117 transitions.
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 117/117 transitions.
Applied a total of 0 rules in 0 ms. Remains 89 /89 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2023-03-08 09:08:11] [INFO ] Invariant cache hit.
[2023-03-08 09:08:11] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-08 09:08:11] [INFO ] Invariant cache hit.
[2023-03-08 09:08:11] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-08 09:08:11] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2023-03-08 09:08:11] [INFO ] Invariant cache hit.
[2023-03-08 09:08:11] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 267 ms. Remains : 89/89 places, 117/117 transitions.
Treatment of property DBSingleClientW-PT-d1m07-LTLCardinality-04 finished in 4060 ms.
[2023-03-08 09:08:11] [INFO ] Flatten gal took : 9 ms
[2023-03-08 09:08:11] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-08 09:08:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 97 places, 132 transitions and 520 arcs took 2 ms.
Total runtime 12179 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/980/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DBSingleClientW-PT-d1m07-LTLCardinality-04

BK_STOP 1678266492911

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name DBSingleClientW-PT-d1m07-LTLCardinality-04
ltl formula formula --ltl=/tmp/980/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 97 places, 132 transitions and 520 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/980/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/980/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/980/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/980/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-d1m07"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DBSingleClientW-PT-d1m07, 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 r105-tall-167814481000259"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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