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

About the Execution of ITS-Tools for SieveSingleMsgMbox-PT-d1m36

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
615.432 13157.00 27105.00 114.60 FFFFFFFFTFTTFTFT 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.r421-tajo-167905975200427.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 itstools
Input is SieveSingleMsgMbox-PT-d1m36, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-tajo-167905975200427
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 900K
-rw-r--r-- 1 mcc users 7.5K Feb 26 10:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 10:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 10:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 10:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 10:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Feb 26 10:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 10:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 10:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 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 450K 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-d1m36-LTLCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679179461616

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m36
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-18 22:44:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 22:44:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 22:44:24] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2023-03-18 22:44:24] [INFO ] Transformed 1295 places.
[2023-03-18 22:44:24] [INFO ] Transformed 749 transitions.
[2023-03-18 22:44:24] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 261 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 2 formulas.
Deduced a syphon composed of 1036 places in 10 ms
Reduce places removed 1036 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 5 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 224 transitions
Reduce isomorphic transitions removed 224 transitions.
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 243 transition count 525
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 300 place count 183 transition count 235
Iterating global reduction 1 with 60 rules applied. Total rules applied 360 place count 183 transition count 235
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 367 place count 183 transition count 228
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 410 place count 140 transition count 185
Iterating global reduction 2 with 43 rules applied. Total rules applied 453 place count 140 transition count 185
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 469 place count 140 transition count 169
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 493 place count 116 transition count 143
Iterating global reduction 3 with 24 rules applied. Total rules applied 517 place count 116 transition count 143
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 531 place count 116 transition count 129
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 536 place count 111 transition count 122
Iterating global reduction 4 with 5 rules applied. Total rules applied 541 place count 111 transition count 122
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 546 place count 106 transition count 117
Iterating global reduction 4 with 5 rules applied. Total rules applied 551 place count 106 transition count 117
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 553 place count 104 transition count 115
Iterating global reduction 4 with 2 rules applied. Total rules applied 555 place count 104 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 556 place count 104 transition count 114
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 558 place count 102 transition count 112
Iterating global reduction 5 with 2 rules applied. Total rules applied 560 place count 102 transition count 112
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 561 place count 101 transition count 111
Iterating global reduction 5 with 1 rules applied. Total rules applied 562 place count 101 transition count 111
Applied a total of 562 rules in 126 ms. Remains 101 /259 variables (removed 158) and now considering 111/749 (removed 638) transitions.
// Phase 1: matrix 111 rows 101 cols
[2023-03-18 22:44:24] [INFO ] Computed 5 place invariants in 12 ms
[2023-03-18 22:44:24] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-18 22:44:24] [INFO ] Invariant cache hit.
[2023-03-18 22:44:24] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-18 22:44:25] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
[2023-03-18 22:44:25] [INFO ] Invariant cache hit.
[2023-03-18 22:44:25] [INFO ] Dead Transitions using invariants and state equation in 378 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 101/259 places, 111/749 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1142 ms. Remains : 101/259 places, 111/749 transitions.
Support contains 5 out of 101 places after structural reductions.
[2023-03-18 22:44:25] [INFO ] Flatten gal took : 57 ms
[2023-03-18 22:44:25] [INFO ] Flatten gal took : 14 ms
[2023-03-18 22:44:25] [INFO ] Input system was already deterministic with 111 transitions.
Support contains 4 out of 101 places (down from 5) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2235 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 986 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 1049 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 1044 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 1070 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 1226021 steps, run timeout after 3001 ms. (steps per millisecond=408 ) properties seen :{1=1, 3=1}
Probabilistic random walk after 1226021 steps, saw 577521 distinct states, run finished after 3002 ms. (steps per millisecond=408 ) properties seen :2
Running SMT prover for 2 properties.
[2023-03-18 22:44:29] [INFO ] Invariant cache hit.
[2023-03-18 22:44:29] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:44:29] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 22:44:29] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-18 22:44:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:44:29] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 10 ms returned sat
[2023-03-18 22:44:29] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-18 22:44:29] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-18 22:44:29] [INFO ] After 10ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-18 22:44:29] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-18 22:44:29] [INFO ] After 115ms 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 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 111/111 transitions.
Graph (complete) has 278 edges and 101 vertex of which 99 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 99 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 7 place count 96 transition count 104
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 96 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 96 transition count 103
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 14 place count 93 transition count 100
Iterating global reduction 2 with 3 rules applied. Total rules applied 17 place count 93 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 93 transition count 99
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 20 place count 91 transition count 97
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 91 transition count 97
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 24 place count 89 transition count 95
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 89 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 27 place count 89 transition count 94
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 29 place count 87 transition count 92
Iterating global reduction 4 with 2 rules applied. Total rules applied 31 place count 87 transition count 92
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 32 place count 86 transition count 90
Iterating global reduction 4 with 1 rules applied. Total rules applied 33 place count 86 transition count 90
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 34 place count 85 transition count 89
Iterating global reduction 4 with 1 rules applied. Total rules applied 35 place count 85 transition count 89
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 36 place count 84 transition count 88
Iterating global reduction 4 with 1 rules applied. Total rules applied 37 place count 84 transition count 88
Applied a total of 37 rules in 43 ms. Remains 84 /101 variables (removed 17) and now considering 88/111 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 84/101 places, 88/111 transitions.
Incomplete random walk after 10000 steps, including 2232 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1004 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2959870 steps, run timeout after 3001 ms. (steps per millisecond=986 ) properties seen :{}
Probabilistic random walk after 2959870 steps, saw 1341454 distinct states, run finished after 3002 ms. (steps per millisecond=985 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 88 rows 84 cols
[2023-03-18 22:44:32] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-18 22:44:32] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:44:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-18 22:44:32] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 36 ms returned sat
[2023-03-18 22:44:32] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 22:44:32] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-18 22:44:32] [INFO ] After 15ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 22:44:32] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-18 22:44:32] [INFO ] After 209ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 88/88 transitions.
Applied a total of 0 rules in 4 ms. Remains 84 /84 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 84/84 places, 88/88 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 88/88 transitions.
Applied a total of 0 rules in 4 ms. Remains 84 /84 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2023-03-18 22:44:32] [INFO ] Invariant cache hit.
[2023-03-18 22:44:33] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-03-18 22:44:33] [INFO ] Invariant cache hit.
[2023-03-18 22:44:33] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-18 22:44:33] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2023-03-18 22:44:33] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 22:44:33] [INFO ] Invariant cache hit.
[2023-03-18 22:44:33] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 473 ms. Remains : 84/84 places, 88/88 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 84 transition count 81
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 79 transition count 81
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 12 place count 79 transition count 65
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 44 place count 63 transition count 65
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 54 place count 58 transition count 60
Applied a total of 54 rules in 8 ms. Remains 58 /84 variables (removed 26) and now considering 60/88 (removed 28) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 60 rows 58 cols
[2023-03-18 22:44:33] [INFO ] Computed 6 place invariants in 6 ms
[2023-03-18 22:44:33] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:44:33] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-18 22:44:33] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:44:33] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 22:44:33] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-18 22:44:33] [INFO ] After 156ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 3 simplifications.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 27 stabilizing places and 32 stable transitions
Graph (complete) has 315 edges and 101 vertex of which 99 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 111/111 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 100 transition count 110
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 97 transition count 107
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 97 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 97 transition count 106
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 12 place count 94 transition count 103
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 94 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 94 transition count 102
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 18 place count 92 transition count 100
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 92 transition count 100
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 22 place count 90 transition count 98
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 90 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 25 place count 90 transition count 97
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 27 place count 88 transition count 95
Iterating global reduction 4 with 2 rules applied. Total rules applied 29 place count 88 transition count 95
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 30 place count 87 transition count 93
Iterating global reduction 4 with 1 rules applied. Total rules applied 31 place count 87 transition count 93
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 32 place count 86 transition count 92
Iterating global reduction 4 with 1 rules applied. Total rules applied 33 place count 86 transition count 92
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 34 place count 85 transition count 91
Iterating global reduction 4 with 1 rules applied. Total rules applied 35 place count 85 transition count 91
Applied a total of 35 rules in 15 ms. Remains 85 /101 variables (removed 16) and now considering 91/111 (removed 20) transitions.
// Phase 1: matrix 91 rows 85 cols
[2023-03-18 22:44:33] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-18 22:44:33] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-18 22:44:33] [INFO ] Invariant cache hit.
[2023-03-18 22:44:33] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-18 22:44:33] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2023-03-18 22:44:33] [INFO ] Invariant cache hit.
[2023-03-18 22:44:34] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/101 places, 91/111 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 421 ms. Remains : 85/101 places, 91/111 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 s51)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLCardinality-02 finished in 646 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 111/111 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 100 transition count 110
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 97 transition count 106
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 97 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 97 transition count 105
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 12 place count 94 transition count 102
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 94 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 94 transition count 101
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 18 place count 92 transition count 99
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 92 transition count 99
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 22 place count 90 transition count 97
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 90 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 25 place count 90 transition count 96
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 27 place count 88 transition count 94
Iterating global reduction 4 with 2 rules applied. Total rules applied 29 place count 88 transition count 94
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 30 place count 87 transition count 92
Iterating global reduction 4 with 1 rules applied. Total rules applied 31 place count 87 transition count 92
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 32 place count 86 transition count 91
Iterating global reduction 4 with 1 rules applied. Total rules applied 33 place count 86 transition count 91
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 34 place count 85 transition count 90
Iterating global reduction 4 with 1 rules applied. Total rules applied 35 place count 85 transition count 90
Applied a total of 35 rules in 7 ms. Remains 85 /101 variables (removed 16) and now considering 90/111 (removed 21) transitions.
// Phase 1: matrix 90 rows 85 cols
[2023-03-18 22:44:34] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:44:34] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-18 22:44:34] [INFO ] Invariant cache hit.
[2023-03-18 22:44:34] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-18 22:44:34] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2023-03-18 22:44:34] [INFO ] Invariant cache hit.
[2023-03-18 22:44:34] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/101 places, 90/111 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 313 ms. Remains : 85/101 places, 90/111 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GT s55 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLCardinality-05 finished in 383 ms.
All properties solved by simple procedures.
Total runtime 10797 ms.

BK_STOP 1679179474773

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SieveSingleMsgMbox-PT-d1m36"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is SieveSingleMsgMbox-PT-d1m36, 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 r421-tajo-167905975200427"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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