fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r425-tajo-167905978100387
Last Updated
May 14, 2023

About the Execution of LTSMin+red for SieveSingleMsgMbox-PT-d0m64

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
533.899 12887.00 24750.00 99.90 TFFFTFFTFTFT?FFT normal

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-167905978100387.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-d0m64, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905978100387
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.0K Feb 26 10:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 10:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 10:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 10:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 10:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 10:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 10:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 10:30 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-d0m64-LTLCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679313926435

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-d0m64
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 12:05:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 12:05:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 12:05:28] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2023-03-20 12:05:28] [INFO ] Transformed 262 places.
[2023-03-20 12:05:28] [INFO ] Transformed 73 transitions.
[2023-03-20 12:05:28] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 99 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 190 places in 0 ms
Reduce places removed 190 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 4 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 29 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:05:28] [INFO ] Computed 5 place invariants in 9 ms
[2023-03-20 12:05:28] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-20 12:05:28] [INFO ] Invariant cache hit.
[2023-03-20 12:05:28] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-20 12:05:28] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2023-03-20 12:05:28] [INFO ] Invariant cache hit.
[2023-03-20 12:05:28] [INFO ] Dead Transitions using invariants and state equation in 127 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 505 ms. Remains : 61/72 places, 63/73 transitions.
Support contains 4 out of 61 places after structural reductions.
[2023-03-20 12:05:28] [INFO ] Flatten gal took : 25 ms
[2023-03-20 12:05:28] [INFO ] Flatten gal took : 10 ms
[2023-03-20 12:05:28] [INFO ] Input system was already deterministic with 63 transitions.
Incomplete random walk after 10000 steps, including 2230 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 1045 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 1048 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 1027 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 1020 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 612316 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :{1=1, 3=1}
Probabilistic random walk after 612316 steps, saw 325898 distinct states, run finished after 3002 ms. (steps per millisecond=203 ) properties seen :2
Running SMT prover for 2 properties.
[2023-03-20 12:05:32] [INFO ] Invariant cache hit.
[2023-03-20 12:05:32] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-20 12:05:32] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 12:05:32] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-20 12:05:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:05:32] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 12:05:32] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-20 12:05:32] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-20 12:05:32] [INFO ] After 7ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-20 12:05:32] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-20 12:05:32] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 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 12 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 12 ms. Remains : 58/61 places, 59/63 transitions.
Incomplete random walk after 10000 steps, including 2268 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1039 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2631674 steps, run timeout after 3001 ms. (steps per millisecond=876 ) properties seen :{}
Probabilistic random walk after 2631674 steps, saw 1342561 distinct states, run finished after 3001 ms. (steps per millisecond=876 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 59 rows 58 cols
[2023-03-20 12:05:35] [INFO ] Computed 4 place invariants in 11 ms
[2023-03-20 12:05:35] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 12:05:35] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-20 12:05:35] [INFO ] After 17ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 12:05:35] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-20 12:05:35] [INFO ] After 8ms SMT Verify possible using 23 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 12:05:35] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 12:05:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 12:05:35] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-20 12:05:35] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 12:05:35] [INFO ] After 5ms SMT Verify possible using 23 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 12:05:35] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-20 12:05:35] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 59/59 transitions.
Applied a total of 0 rules in 4 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 58/58 places, 59/59 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 59/59 transitions.
Applied a total of 0 rules in 4 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2023-03-20 12:05:35] [INFO ] Invariant cache hit.
[2023-03-20 12:05:35] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-20 12:05:35] [INFO ] Invariant cache hit.
[2023-03-20 12:05:36] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-20 12:05:36] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2023-03-20 12:05:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:05:36] [INFO ] Invariant cache hit.
[2023-03-20 12:05:36] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 58/58 places, 59/59 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 58 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 57 transition count 56
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 4 place count 57 transition count 47
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 22 place count 48 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 47 transition count 46
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 44 transition count 46
Applied a total of 30 rules in 17 ms. Remains 44 /58 variables (removed 14) and now considering 46/59 (removed 13) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 46 rows 44 cols
[2023-03-20 12:05:36] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-20 12:05:36] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 12:05:36] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 12:05:36] [INFO ] After 24ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 12:05:36] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 2 ms to minimize.
[2023-03-20 12:05:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-20 12:05:36] [INFO ] After 67ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 12:05:36] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 12:05:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 12:05:36] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 12:05:36] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 12:05:36] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2023-03-20 12:05:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-03-20 12:05:36] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-20 12:05:36] [INFO ] After 97ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 1 atomic propositions for a total of 3 simplifications.
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLCardinality-03 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.2 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((G(p0) U (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 4 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:05:36] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 12:05:36] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-20 12:05:36] [INFO ] Invariant cache hit.
[2023-03-20 12:05:36] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-20 12:05:36] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2023-03-20 12:05:36] [INFO ] Invariant cache hit.
[2023-03-20 12:05:36] [INFO ] Dead Transitions using invariants and state equation in 47 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 193 ms. Remains : 60/61 places, 62/63 transitions.
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m64-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(GT s27 0), p1:(LEQ 3 s59)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d0m64-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m64-LTLCardinality-08 finished in 482 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 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:05:36] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:05:36] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-20 12:05:36] [INFO ] Invariant cache hit.
[2023-03-20 12:05:36] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:05:36] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2023-03-20 12:05:37] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:05:37] [INFO ] Invariant cache hit.
[2023-03-20 12:05:37] [INFO ] Dead Transitions using invariants and state equation in 40 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 175 ms. Remains : 60/61 places, 62/63 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m64-LTLCardinality-12 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 s14 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]]
Product exploration explored 100000 steps with 22428 reset in 199 ms.
Product exploration explored 100000 steps with 22377 reset in 142 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 186 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 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2220 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1008 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1352 steps, run visited all 1 properties in 10 ms. (steps per millisecond=135 )
Probabilistic random walk after 1352 steps, saw 684 distinct states, run finished after 10 ms. (steps per millisecond=135 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 62/62 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2023-03-20 12:05:37] [INFO ] Invariant cache hit.
[2023-03-20 12:05:37] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-20 12:05:37] [INFO ] Invariant cache hit.
[2023-03-20 12:05:37] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:05:37] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2023-03-20 12:05:37] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:05:37] [INFO ] Invariant cache hit.
[2023-03-20 12:05:38] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 171 ms. Remains : 60/60 places, 62/62 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 186 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 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2239 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 1009 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1352 steps, run visited all 1 properties in 7 ms. (steps per millisecond=193 )
Probabilistic random walk after 1352 steps, saw 684 distinct states, run finished after 7 ms. (steps per millisecond=193 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22322 reset in 78 ms.
Product exploration explored 100000 steps with 22297 reset in 99 ms.
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 62/62 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2023-03-20 12:05:38] [INFO ] Invariant cache hit.
[2023-03-20 12:05:38] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-20 12:05:38] [INFO ] Invariant cache hit.
[2023-03-20 12:05:38] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 12:05:38] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2023-03-20 12:05:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:05:38] [INFO ] Invariant cache hit.
[2023-03-20 12:05:38] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 178 ms. Remains : 60/60 places, 62/62 transitions.
Treatment of property SieveSingleMsgMbox-PT-d0m64-LTLCardinality-12 finished in 1997 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)))'
[2023-03-20 12:05:39] [INFO ] Flatten gal took : 6 ms
[2023-03-20 12:05:39] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-20 12:05:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 61 places, 63 transitions and 249 arcs took 1 ms.
Total runtime 11035 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/704/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : SieveSingleMsgMbox-PT-d0m64-LTLCardinality-12

BK_STOP 1679313939322

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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 SieveSingleMsgMbox-PT-d0m64-LTLCardinality-12
ltl formula formula --ltl=/tmp/704/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 61 places, 63 transitions and 249 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.010 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/704/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/704/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/704/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/704/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
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="SieveSingleMsgMbox-PT-d0m64"
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-d0m64, 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-167905978100387"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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