Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r425-tajo-167905978100395.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is SieveSingleMsgMbox-PT-d0m96, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905978100395
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 5.4K Feb 26 10:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Feb 26 10:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 10:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 10:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 10:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 10:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 10:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 10:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 57K Mar 5 18:23 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 SieveSingleMsgMbox-PT-d0m96-LTLCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679314123281

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=SieveSingleMsgMbox-PT-d0m96
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 12:08:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 12:08:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 12:08:44] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2023-03-20 12:08:44] [INFO ] Transformed 262 places.
[2023-03-20 12:08:44] [INFO ] Transformed 73 transitions.
[2023-03-20 12:08:44] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 95 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 190 places in 1 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 7 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 73/73 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 73
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 63 transition count 66
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 63 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 62 transition count 65
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 61 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 61 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 61 transition count 63
Applied a total of 21 rules in 20 ms. Remains 61 /72 variables (removed 11) and now considering 63/73 (removed 10) transitions.
// Phase 1: matrix 63 rows 61 cols
[2023-03-20 12:08:44] [INFO ] Computed 5 place invariants in 8 ms
[2023-03-20 12:08:45] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-20 12:08:45] [INFO ] Invariant cache hit.
[2023-03-20 12:08:45] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-20 12:08:45] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2023-03-20 12:08:45] [INFO ] Invariant cache hit.
[2023-03-20 12:08:45] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/72 places, 63/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 371 ms. Remains : 61/72 places, 63/73 transitions.
Support contains 7 out of 61 places after structural reductions.
[2023-03-20 12:08:45] [INFO ] Flatten gal took : 20 ms
[2023-03-20 12:08:45] [INFO ] Flatten gal took : 9 ms
[2023-03-20 12:08:45] [INFO ] Input system was already deterministic with 63 transitions.
Incomplete random walk after 10000 steps, including 2218 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10000 steps, including 1034 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 1068 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 1024 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 1041 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-20 12:08:46] [INFO ] Invariant cache hit.
[2023-03-20 12:08:46] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 12:08:46] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 12:08:46] [INFO ] After 23ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1
[2023-03-20 12:08:46] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-20 12:08:46] [INFO ] After 11ms SMT Verify possible using 26 Read/Feed constraints in real domain returned unsat :2 sat :0 real:1
[2023-03-20 12:08:46] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2023-03-20 12:08:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-20 12:08:46] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 12:08:46] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2023-03-20 12:08:46] [INFO ] After 7ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2023-03-20 12:08:46] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-20 12:08:46] [INFO ] After 108ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 63/63 transitions.
Graph (complete) has 166 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 60 transition count 61
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 58 transition count 59
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 58 transition count 59
Applied a total of 7 rules in 10 ms. Remains 58 /61 variables (removed 3) and now considering 59/63 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 58/61 places, 59/63 transitions.
Incomplete random walk after 10000 steps, including 2263 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1031 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 288 steps, run visited all 1 properties in 13 ms. (steps per millisecond=22 )
Probabilistic random walk after 288 steps, saw 153 distinct states, run finished after 13 ms. (steps per millisecond=22 ) properties seen :1
Successfully simplified 2 atomic propositions for a total of 4 simplifications.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 8 stabilizing places and 11 stable transitions
Graph (complete) has 188 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 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 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 63/63 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 60 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 62
Applied a total of 2 rules in 8 ms. Remains 60 /61 variables (removed 1) and now considering 62/63 (removed 1) transitions.
// Phase 1: matrix 62 rows 60 cols
[2023-03-20 12:08:46] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 12:08:46] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-20 12:08:46] [INFO ] Invariant cache hit.
[2023-03-20 12:08:46] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:08:46] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2023-03-20 12:08:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:08:46] [INFO ] Invariant cache hit.
[2023-03-20 12:08:46] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/61 places, 62/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 233 ms. Remains : 60/61 places, 62/63 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s45 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLCardinality-03 finished in 395 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 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 63/63 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 59 transition count 61
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 59 transition count 61
Applied a total of 4 rules in 7 ms. Remains 59 /61 variables (removed 2) and now considering 61/63 (removed 2) transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-20 12:08:46] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 12:08:46] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-20 12:08:46] [INFO ] Invariant cache hit.
[2023-03-20 12:08:46] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:08:46] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2023-03-20 12:08:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:08:46] [INFO ] Invariant cache hit.
[2023-03-20 12:08:46] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/61 places, 61/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 169 ms. Remains : 59/61 places, 61/63 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLCardinality-08 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:(LEQ s12 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 126 steps with 27 reset in 5 ms.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLCardinality-08 finished in 243 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(X((!p0&&X((!p0 U (F(!p1)||G(!p0))))))))'
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 63/63 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 60 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 62
Applied a total of 2 rules in 6 ms. Remains 60 /61 variables (removed 1) and now considering 62/63 (removed 1) transitions.
// Phase 1: matrix 62 rows 60 cols
[2023-03-20 12:08:47] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:08:47] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-20 12:08:47] [INFO ] Invariant cache hit.
[2023-03-20 12:08:47] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-20 12:08:47] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2023-03-20 12:08:47] [INFO ] Invariant cache hit.
[2023-03-20 12:08:47] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/61 places, 62/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 177 ms. Remains : 60/61 places, 62/63 transitions.
Stuttering acceptance computed with spot in 155 ms :[true, p1, p0, (AND p1 p0), p0, p0]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(GT s25 0), p0:(LEQ 1 s39)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 28574 reset in 215 ms.
Product exploration explored 100000 steps with 28511 reset in 128 ms.
Computed a total of 8 stabilizing places and 11 stable transitions
Graph (complete) has 185 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 11 stable transitions
Detected a total of 8/60 stabilizing places and 11/62 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[p1, (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 2191 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 1026 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 12:08:47] [INFO ] Invariant cache hit.
[2023-03-20 12:08:47] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 12:08:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:08:47] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 12:08:47] [INFO ] After 21ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F p1), (F (AND (NOT p0) p1))]
Property proved to be true thanks to knowledge :(G (NOT (AND p0 p1)))
Knowledge based reduction with 4 factoid took 101 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLCardinality-14 finished in 1095 ms.
All properties solved by simple procedures.
Total runtime 3384 ms.
ITS solved all properties within timeout

BK_STOP 1679314128243

--------------------
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

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="SieveSingleMsgMbox-PT-d0m96"
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 SieveSingleMsgMbox-PT-d0m96, 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 r425-tajo-167905978100395"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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