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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 8.3K Feb 26 10:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 10:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 10:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 10:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 10:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 10:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Feb 26 10:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Feb 26 10:29 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 1.1M 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-d2m96-LTLCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679183210039

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-d2m96
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-18 23:46:52] [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 23:46:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:46:52] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2023-03-18 23:46:52] [INFO ] Transformed 2398 places.
[2023-03-18 23:46:52] [INFO ] Transformed 1954 transitions.
[2023-03-18 23:46:52] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 278 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1984 places in 45 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 118 places :
Symmetric choice reduction at 1 with 118 rule applications. Total rules 971 place count 271 transition count 380
Iterating global reduction 1 with 118 rules applied. Total rules applied 1089 place count 271 transition count 380
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1099 place count 271 transition count 370
Discarding 91 places :
Symmetric choice reduction at 2 with 91 rule applications. Total rules 1190 place count 180 transition count 279
Iterating global reduction 2 with 91 rules applied. Total rules applied 1281 place count 180 transition count 279
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 1320 place count 180 transition count 240
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 1358 place count 142 transition count 187
Iterating global reduction 3 with 38 rules applied. Total rules applied 1396 place count 142 transition count 187
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 1419 place count 142 transition count 164
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1428 place count 133 transition count 151
Iterating global reduction 4 with 9 rules applied. Total rules applied 1437 place count 133 transition count 151
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1446 place count 124 transition count 142
Iterating global reduction 4 with 9 rules applied. Total rules applied 1455 place count 124 transition count 142
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1459 place count 120 transition count 137
Iterating global reduction 4 with 4 rules applied. Total rules applied 1463 place count 120 transition count 137
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1464 place count 120 transition count 136
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1468 place count 116 transition count 132
Iterating global reduction 5 with 4 rules applied. Total rules applied 1472 place count 116 transition count 132
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1475 place count 113 transition count 129
Iterating global reduction 5 with 3 rules applied. Total rules applied 1478 place count 113 transition count 129
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1479 place count 112 transition count 128
Iterating global reduction 5 with 1 rules applied. Total rules applied 1480 place count 112 transition count 128
Applied a total of 1480 rules in 102 ms. Remains 112 /414 variables (removed 302) and now considering 128/1954 (removed 1826) transitions.
// Phase 1: matrix 128 rows 112 cols
[2023-03-18 23:46:52] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-18 23:46:52] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-18 23:46:52] [INFO ] Invariant cache hit.
[2023-03-18 23:46:53] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-18 23:46:53] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
[2023-03-18 23:46:53] [INFO ] Invariant cache hit.
[2023-03-18 23:46:53] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 112/414 places, 128/1954 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 733 ms. Remains : 112/414 places, 128/1954 transitions.
Support contains 3 out of 112 places after structural reductions.
[2023-03-18 23:46:53] [INFO ] Flatten gal took : 42 ms
[2023-03-18 23:46:53] [INFO ] Flatten gal took : 13 ms
[2023-03-18 23:46:53] [INFO ] Input system was already deterministic with 128 transitions.
Incomplete random walk after 10000 steps, including 2263 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 1017 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 1015 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 1075 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 662145 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :{}
Probabilistic random walk after 662145 steps, saw 312527 distinct states, run finished after 3003 ms. (steps per millisecond=220 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-18 23:46:56] [INFO ] Invariant cache hit.
[2023-03-18 23:46:56] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:46:56] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-18 23:46:57] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2023-03-18 23:46:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-18 23:46:57] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 23:46:57] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2023-03-18 23:46:57] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-18 23:46:57] [INFO ] After 9ms SMT Verify possible using 51 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2023-03-18 23:46:57] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 15 ms to minimize.
[2023-03-18 23:46:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2023-03-18 23:46:57] [INFO ] After 146ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-18 23:46:57] [INFO ] After 276ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 128/128 transitions.
Graph (complete) has 319 edges and 112 vertex of which 111 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 111 transition count 126
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 109 transition count 124
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 109 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 109 transition count 122
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 11 place count 107 transition count 119
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 107 transition count 119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 106 transition count 118
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 106 transition count 118
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 105 transition count 117
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 105 transition count 117
Applied a total of 17 rules in 19 ms. Remains 105 /112 variables (removed 7) and now considering 117/128 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 105/112 places, 117/128 transitions.
Incomplete random walk after 10000 steps, including 2275 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1023 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2295889 steps, run timeout after 3001 ms. (steps per millisecond=765 ) properties seen :{}
Probabilistic random walk after 2295889 steps, saw 1070273 distinct states, run finished after 3001 ms. (steps per millisecond=765 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 117 rows 105 cols
[2023-03-18 23:47:00] [INFO ] Computed 4 place invariants in 9 ms
[2023-03-18 23:47:00] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:47:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 23:47:00] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 23:47:00] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:47:00] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-18 23:47:00] [INFO ] After 23ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 23:47:00] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 1 ms to minimize.
[2023-03-18 23:47:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-03-18 23:47:00] [INFO ] After 142ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-18 23:47:00] [INFO ] After 268ms 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 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 13 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 105/105 places, 117/117 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 8 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2023-03-18 23:47:00] [INFO ] Invariant cache hit.
[2023-03-18 23:47:00] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-18 23:47:00] [INFO ] Invariant cache hit.
[2023-03-18 23:47:01] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-18 23:47:01] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
[2023-03-18 23:47:01] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 23:47:01] [INFO ] Invariant cache hit.
[2023-03-18 23:47:01] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 699 ms. Remains : 105/105 places, 117/117 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 105 transition count 109
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 99 transition count 109
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 14 place count 99 transition count 91
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 50 place count 81 transition count 91
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 60 place count 76 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 75 transition count 94
Applied a total of 62 rules in 33 ms. Remains 75 /105 variables (removed 30) and now considering 94/117 (removed 23) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 75 cols
[2023-03-18 23:47:01] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-18 23:47:01] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:47:01] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-18 23:47:01] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 23:47:01] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:47:01] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2023-03-18 23:47:01] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2023-03-18 23:47:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 78 ms
[2023-03-18 23:47:01] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-18 23:47:01] [INFO ] After 128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 2 atomic propositions for a total of 3 simplifications.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 31 stabilizing places and 39 stable transitions
Graph (complete) has 357 edges and 112 vertex of which 111 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(X(X(X(G(p0))))))'
Support contains 1 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 128/128 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 110 transition count 126
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 110 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 110 transition count 124
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 108 transition count 121
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 108 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 107 transition count 120
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 107 transition count 120
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 106 transition count 119
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 106 transition count 119
Applied a total of 14 rules in 6 ms. Remains 106 /112 variables (removed 6) and now considering 119/128 (removed 9) transitions.
// Phase 1: matrix 119 rows 106 cols
[2023-03-18 23:47:01] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 23:47:01] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-18 23:47:01] [INFO ] Invariant cache hit.
[2023-03-18 23:47:01] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-18 23:47:01] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2023-03-18 23:47:01] [INFO ] Invariant cache hit.
[2023-03-18 23:47:01] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/112 places, 119/128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 347 ms. Remains : 106/112 places, 119/128 transitions.
Stuttering acceptance computed with spot in 255 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(LEQ s58 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22471 reset in 224 ms.
Product exploration explored 100000 steps with 22404 reset in 135 ms.
Computed a total of 30 stabilizing places and 38 stable transitions
Graph (complete) has 337 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 30 stabilizing places and 38 stable transitions
Detected a total of 30/106 stabilizing places and 38/119 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 155 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2235 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1032 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2747594 steps, run timeout after 3009 ms. (steps per millisecond=913 ) properties seen :{}
Probabilistic random walk after 2747594 steps, saw 1279771 distinct states, run finished after 3010 ms. (steps per millisecond=912 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 23:47:05] [INFO ] Invariant cache hit.
[2023-03-18 23:47:05] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:47:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:47:06] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 23:47:06] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:47:06] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-18 23:47:06] [INFO ] After 11ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 23:47:06] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2023-03-18 23:47:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-18 23:47:06] [INFO ] After 76ms 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 23:47:06] [INFO ] After 163ms 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 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 119/119 transitions.
Graph (complete) has 301 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 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 105 transition count 117
Applied a total of 3 rules in 12 ms. Remains 105 /106 variables (removed 1) and now considering 117/119 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 105/106 places, 117/119 transitions.
Incomplete random walk after 10000 steps, including 2259 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 1063 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2320135 steps, run timeout after 3001 ms. (steps per millisecond=773 ) properties seen :{}
Probabilistic random walk after 2320135 steps, saw 1082006 distinct states, run finished after 3001 ms. (steps per millisecond=773 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 117 rows 105 cols
[2023-03-18 23:47:09] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-18 23:47:09] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:47:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:47:09] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 23:47:09] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:47:09] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-18 23:47:09] [INFO ] After 9ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 23:47:09] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2023-03-18 23:47:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-18 23:47:09] [INFO ] After 92ms 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-18 23:47:09] [INFO ] After 161ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 5 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 105/105 places, 117/117 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2023-03-18 23:47:09] [INFO ] Invariant cache hit.
[2023-03-18 23:47:09] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-18 23:47:09] [INFO ] Invariant cache hit.
[2023-03-18 23:47:09] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-18 23:47:09] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2023-03-18 23:47:09] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 23:47:09] [INFO ] Invariant cache hit.
[2023-03-18 23:47:09] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 337 ms. Remains : 105/105 places, 117/117 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 105 transition count 109
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 99 transition count 109
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 14 place count 99 transition count 91
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 50 place count 81 transition count 91
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 60 place count 76 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 75 transition count 94
Applied a total of 62 rules in 13 ms. Remains 75 /105 variables (removed 30) and now considering 94/117 (removed 23) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 75 cols
[2023-03-18 23:47:09] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-18 23:47:09] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:47:09] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-18 23:47:09] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 23:47:09] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:47:09] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2023-03-18 23:47:09] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2023-03-18 23:47:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 81 ms
[2023-03-18 23:47:09] [INFO ] After 110ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-18 23:47:09] [INFO ] After 145ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 119/119 transitions.
Applied a total of 0 rules in 3 ms. Remains 106 /106 variables (removed 0) and now considering 119/119 (removed 0) transitions.
// Phase 1: matrix 119 rows 106 cols
[2023-03-18 23:47:10] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 23:47:10] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-18 23:47:10] [INFO ] Invariant cache hit.
[2023-03-18 23:47:10] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-18 23:47:10] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2023-03-18 23:47:10] [INFO ] Invariant cache hit.
[2023-03-18 23:47:10] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 319 ms. Remains : 106/106 places, 119/119 transitions.
Computed a total of 30 stabilizing places and 38 stable transitions
Graph (complete) has 337 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 30 stabilizing places and 38 stable transitions
Detected a total of 30/106 stabilizing places and 38/119 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2235 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1020 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2698225 steps, run timeout after 3001 ms. (steps per millisecond=899 ) properties seen :{}
Probabilistic random walk after 2698225 steps, saw 1257031 distinct states, run finished after 3001 ms. (steps per millisecond=899 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 23:47:14] [INFO ] Invariant cache hit.
[2023-03-18 23:47:14] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:47:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-18 23:47:14] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 23:47:14] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:47:14] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-18 23:47:14] [INFO ] After 10ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 23:47:14] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 0 ms to minimize.
[2023-03-18 23:47:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-18 23:47:14] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-18 23:47:14] [INFO ] After 169ms 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 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 119/119 transitions.
Graph (complete) has 301 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 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 105 transition count 117
Applied a total of 3 rules in 4 ms. Remains 105 /106 variables (removed 1) and now considering 117/119 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 105/106 places, 117/119 transitions.
Incomplete random walk after 10000 steps, including 2240 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1043 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2472916 steps, run timeout after 3001 ms. (steps per millisecond=824 ) properties seen :{}
Probabilistic random walk after 2472916 steps, saw 1152041 distinct states, run finished after 3001 ms. (steps per millisecond=824 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 117 rows 105 cols
[2023-03-18 23:47:17] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-18 23:47:17] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:47:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:47:17] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 23:47:17] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:47:17] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-18 23:47:17] [INFO ] After 11ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 23:47:17] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2023-03-18 23:47:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-03-18 23:47:17] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-18 23:47:17] [INFO ] After 189ms 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 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 5 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 105/105 places, 117/117 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2023-03-18 23:47:17] [INFO ] Invariant cache hit.
[2023-03-18 23:47:17] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-18 23:47:17] [INFO ] Invariant cache hit.
[2023-03-18 23:47:17] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-18 23:47:17] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2023-03-18 23:47:17] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 23:47:17] [INFO ] Invariant cache hit.
[2023-03-18 23:47:17] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 373 ms. Remains : 105/105 places, 117/117 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 105 transition count 109
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 99 transition count 109
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 14 place count 99 transition count 91
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 50 place count 81 transition count 91
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 60 place count 76 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 75 transition count 94
Applied a total of 62 rules in 10 ms. Remains 75 /105 variables (removed 30) and now considering 94/117 (removed 23) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 75 cols
[2023-03-18 23:47:17] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-18 23:47:17] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:47:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-18 23:47:17] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 23:47:17] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:47:18] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2023-03-18 23:47:18] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 0 ms to minimize.
[2023-03-18 23:47:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 119 ms
[2023-03-18 23:47:18] [INFO ] After 151ms 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-18 23:47:18] [INFO ] After 189ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 225 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 201 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22451 reset in 168 ms.
Product exploration explored 100000 steps with 22454 reset in 149 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 197 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 119/119 transitions.
Applied a total of 0 rules in 22 ms. Remains 106 /106 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2023-03-18 23:47:19] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 119 rows 106 cols
[2023-03-18 23:47:19] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 23:47:19] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 215 ms. Remains : 106/106 places, 119/119 transitions.
Built C files in :
/tmp/ltsmin11858531249402688035
[2023-03-18 23:47:19] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11858531249402688035
Running compilation step : cd /tmp/ltsmin11858531249402688035;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 386 ms.
Running link step : cd /tmp/ltsmin11858531249402688035;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin11858531249402688035;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8274465339211709945.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 119/119 transitions.
Applied a total of 0 rules in 4 ms. Remains 106 /106 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2023-03-18 23:47:34] [INFO ] Invariant cache hit.
[2023-03-18 23:47:35] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-18 23:47:35] [INFO ] Invariant cache hit.
[2023-03-18 23:47:35] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-18 23:47:35] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2023-03-18 23:47:35] [INFO ] Invariant cache hit.
[2023-03-18 23:47:35] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 348 ms. Remains : 106/106 places, 119/119 transitions.
Built C files in :
/tmp/ltsmin17097782976720726306
[2023-03-18 23:47:35] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17097782976720726306
Running compilation step : cd /tmp/ltsmin17097782976720726306;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 201 ms.
Running link step : cd /tmp/ltsmin17097782976720726306;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin17097782976720726306;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6527087515394955920.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 23:47:50] [INFO ] Flatten gal took : 16 ms
[2023-03-18 23:47:50] [INFO ] Flatten gal took : 12 ms
[2023-03-18 23:47:50] [INFO ] Time to serialize gal into /tmp/LTL16431069244191096731.gal : 4 ms
[2023-03-18 23:47:50] [INFO ] Time to serialize properties into /tmp/LTL7692905046177523313.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16431069244191096731.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6275757617901879994.hoa' '-atoms' '/tmp/LTL7692905046177523313.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7692905046177523313.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6275757617901879994.hoa
Detected timeout of ITS tools.
[2023-03-18 23:48:05] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:48:05] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:48:05] [INFO ] Time to serialize gal into /tmp/LTL4518691242243580801.gal : 2 ms
[2023-03-18 23:48:05] [INFO ] Time to serialize properties into /tmp/LTL3654778239700717731.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4518691242243580801.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3654778239700717731.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(G("(l235<=0)")))))))
Formula 0 simplified : XXXXF!"(l235<=0)"
Detected timeout of ITS tools.
[2023-03-18 23:48:20] [INFO ] Flatten gal took : 18 ms
[2023-03-18 23:48:20] [INFO ] Applying decomposition
[2023-03-18 23:48:20] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11341721327403831635.txt' '-o' '/tmp/graph11341721327403831635.bin' '-w' '/tmp/graph11341721327403831635.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11341721327403831635.bin' '-l' '-1' '-v' '-w' '/tmp/graph11341721327403831635.weights' '-q' '0' '-e' '0.001'
[2023-03-18 23:48:20] [INFO ] Decomposing Gal with order
[2023-03-18 23:48:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 23:48:20] [INFO ] Removed a total of 106 redundant transitions.
[2023-03-18 23:48:20] [INFO ] Flatten gal took : 89 ms
[2023-03-18 23:48:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 69 labels/synchronizations in 16 ms.
[2023-03-18 23:48:20] [INFO ] Time to serialize gal into /tmp/LTL15825244856842368006.gal : 12 ms
[2023-03-18 23:48:20] [INFO ] Time to serialize properties into /tmp/LTL8282214345042637304.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15825244856842368006.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8282214345042637304.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(G("(u6.l235<=0)")))))))
Formula 0 simplified : XXXXF!"(u6.l235<=0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12317159764414358563
[2023-03-18 23:48:36] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12317159764414358563
Running compilation step : cd /tmp/ltsmin12317159764414358563;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 237 ms.
Running link step : cd /tmp/ltsmin12317159764414358563;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin12317159764414358563;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(X([]((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLCardinality-11 finished in 109568 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Found a Lengthening insensitive property : SieveSingleMsgMbox-PT-d2m96-LTLCardinality-11
Stuttering acceptance computed with spot in 248 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 112 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 112/112 places, 128/128 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 110 transition count 126
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 110 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 110 transition count 124
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 108 transition count 121
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 108 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 107 transition count 120
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 107 transition count 120
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 106 transition count 119
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 106 transition count 119
Applied a total of 14 rules in 24 ms. Remains 106 /112 variables (removed 6) and now considering 119/128 (removed 9) transitions.
[2023-03-18 23:48:51] [INFO ] Invariant cache hit.
[2023-03-18 23:48:51] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-18 23:48:51] [INFO ] Invariant cache hit.
[2023-03-18 23:48:51] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-18 23:48:51] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2023-03-18 23:48:51] [INFO ] Invariant cache hit.
[2023-03-18 23:48:51] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 106/112 places, 119/128 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 333 ms. Remains : 106/112 places, 119/128 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(LEQ s58 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22394 reset in 107 ms.
Product exploration explored 100000 steps with 22421 reset in 99 ms.
Computed a total of 30 stabilizing places and 38 stable transitions
Graph (complete) has 337 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 30 stabilizing places and 38 stable transitions
Detected a total of 30/106 stabilizing places and 38/119 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2241 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1046 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2290557 steps, run timeout after 3001 ms. (steps per millisecond=763 ) properties seen :{}
Probabilistic random walk after 2290557 steps, saw 1067315 distinct states, run finished after 3002 ms. (steps per millisecond=763 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 23:48:55] [INFO ] Invariant cache hit.
[2023-03-18 23:48:55] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:48:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-18 23:48:55] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 23:48:55] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:48:55] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-18 23:48:55] [INFO ] After 43ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 23:48:56] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2023-03-18 23:48:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2023-03-18 23:48:56] [INFO ] After 123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-18 23:48:56] [INFO ] After 233ms 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 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 119/119 transitions.
Graph (complete) has 301 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 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 105 transition count 117
Applied a total of 3 rules in 12 ms. Remains 105 /106 variables (removed 1) and now considering 117/119 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 105/106 places, 117/119 transitions.
Incomplete random walk after 10000 steps, including 2251 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1057 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2291223 steps, run timeout after 3001 ms. (steps per millisecond=763 ) properties seen :{}
Probabilistic random walk after 2291223 steps, saw 1067901 distinct states, run finished after 3001 ms. (steps per millisecond=763 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 117 rows 105 cols
[2023-03-18 23:48:59] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-18 23:48:59] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:48:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:48:59] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 23:48:59] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:48:59] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-18 23:48:59] [INFO ] After 11ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 23:48:59] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2023-03-18 23:48:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-03-18 23:48:59] [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 12 ms.
[2023-03-18 23:48:59] [INFO ] After 182ms 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 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 5 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 105/105 places, 117/117 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2023-03-18 23:48:59] [INFO ] Invariant cache hit.
[2023-03-18 23:48:59] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-18 23:48:59] [INFO ] Invariant cache hit.
[2023-03-18 23:48:59] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-18 23:48:59] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
[2023-03-18 23:48:59] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 23:48:59] [INFO ] Invariant cache hit.
[2023-03-18 23:48:59] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 536 ms. Remains : 105/105 places, 117/117 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 105 transition count 109
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 99 transition count 109
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 14 place count 99 transition count 91
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 50 place count 81 transition count 91
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 60 place count 76 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 75 transition count 94
Applied a total of 62 rules in 9 ms. Remains 75 /105 variables (removed 30) and now considering 94/117 (removed 23) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 75 cols
[2023-03-18 23:48:59] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-18 23:48:59] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:48:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-18 23:49:00] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 23:49:00] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:49:00] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2023-03-18 23:49:00] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 0 ms to minimize.
[2023-03-18 23:49:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 108 ms
[2023-03-18 23:49:00] [INFO ] After 151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-18 23:49:00] [INFO ] After 205ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 240 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 119/119 transitions.
Applied a total of 0 rules in 3 ms. Remains 106 /106 variables (removed 0) and now considering 119/119 (removed 0) transitions.
// Phase 1: matrix 119 rows 106 cols
[2023-03-18 23:49:00] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 23:49:00] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-18 23:49:00] [INFO ] Invariant cache hit.
[2023-03-18 23:49:01] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-18 23:49:01] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2023-03-18 23:49:01] [INFO ] Invariant cache hit.
[2023-03-18 23:49:01] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 454 ms. Remains : 106/106 places, 119/119 transitions.
Computed a total of 30 stabilizing places and 38 stable transitions
Graph (complete) has 337 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 30 stabilizing places and 38 stable transitions
Detected a total of 30/106 stabilizing places and 38/119 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 216 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2263 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1067 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2183615 steps, run timeout after 3001 ms. (steps per millisecond=727 ) properties seen :{}
Probabilistic random walk after 2183615 steps, saw 1017306 distinct states, run finished after 3002 ms. (steps per millisecond=727 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 23:49:04] [INFO ] Invariant cache hit.
[2023-03-18 23:49:04] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:49:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 23:49:04] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-18 23:49:04] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:49:04] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-18 23:49:04] [INFO ] After 13ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 23:49:04] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2023-03-18 23:49:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-18 23:49:04] [INFO ] After 69ms 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-18 23:49:04] [INFO ] After 178ms 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 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 119/119 transitions.
Graph (complete) has 301 edges and 106 vertex of which 105 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 105 transition count 117
Applied a total of 3 rules in 7 ms. Remains 105 /106 variables (removed 1) and now considering 117/119 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 105/106 places, 117/119 transitions.
Incomplete random walk after 10000 steps, including 2246 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1034 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2328809 steps, run timeout after 3001 ms. (steps per millisecond=776 ) properties seen :{}
Probabilistic random walk after 2328809 steps, saw 1086092 distinct states, run finished after 3001 ms. (steps per millisecond=776 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 117 rows 105 cols
[2023-03-18 23:49:08] [INFO ] Computed 4 place invariants in 5 ms
[2023-03-18 23:49:08] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:49:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:49:08] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 23:49:08] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:49:08] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-18 23:49:08] [INFO ] After 10ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 23:49:08] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2023-03-18 23:49:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-18 23:49:08] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-18 23:49:08] [INFO ] After 173ms 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 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 105/105 places, 117/117 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2023-03-18 23:49:08] [INFO ] Invariant cache hit.
[2023-03-18 23:49:08] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-18 23:49:08] [INFO ] Invariant cache hit.
[2023-03-18 23:49:08] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-18 23:49:08] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2023-03-18 23:49:08] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 23:49:08] [INFO ] Invariant cache hit.
[2023-03-18 23:49:08] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 302 ms. Remains : 105/105 places, 117/117 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 105 transition count 109
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 99 transition count 109
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 14 place count 99 transition count 91
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 50 place count 81 transition count 91
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 60 place count 76 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
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 62 place count 75 transition count 94
Applied a total of 62 rules in 8 ms. Remains 75 /105 variables (removed 30) and now considering 94/117 (removed 23) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 75 cols
[2023-03-18 23:49:08] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-18 23:49:08] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:49:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-18 23:49:08] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 23:49:08] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:49:08] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2023-03-18 23:49:08] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2023-03-18 23:49:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 110 ms
[2023-03-18 23:49:08] [INFO ] After 150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-18 23:49:08] [INFO ] After 199ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 198 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22446 reset in 141 ms.
Product exploration explored 100000 steps with 22440 reset in 142 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 195 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 119/119 transitions.
Applied a total of 0 rules in 6 ms. Remains 106 /106 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2023-03-18 23:49:10] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 119 rows 106 cols
[2023-03-18 23:49:10] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 23:49:10] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 88 ms. Remains : 106/106 places, 119/119 transitions.
Built C files in :
/tmp/ltsmin13079606262764385547
[2023-03-18 23:49:10] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13079606262764385547
Running compilation step : cd /tmp/ltsmin13079606262764385547;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 266 ms.
Running link step : cd /tmp/ltsmin13079606262764385547;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin13079606262764385547;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3241387119009988208.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 119/119 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2023-03-18 23:49:25] [INFO ] Invariant cache hit.
[2023-03-18 23:49:25] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-18 23:49:25] [INFO ] Invariant cache hit.
[2023-03-18 23:49:25] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-18 23:49:25] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2023-03-18 23:49:25] [INFO ] Invariant cache hit.
[2023-03-18 23:49:25] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 354 ms. Remains : 106/106 places, 119/119 transitions.
Built C files in :
/tmp/ltsmin3388763351642315336
[2023-03-18 23:49:25] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3388763351642315336
Running compilation step : cd /tmp/ltsmin3388763351642315336;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 218 ms.
Running link step : cd /tmp/ltsmin3388763351642315336;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin3388763351642315336;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10912884972259284470.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 23:49:40] [INFO ] Flatten gal took : 7 ms
[2023-03-18 23:49:40] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:49:40] [INFO ] Time to serialize gal into /tmp/LTL10901538664032168130.gal : 1 ms
[2023-03-18 23:49:40] [INFO ] Time to serialize properties into /tmp/LTL18237774895216034461.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10901538664032168130.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11698670042640164989.hoa' '-atoms' '/tmp/LTL18237774895216034461.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL18237774895216034461.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11698670042640164989.hoa
Detected timeout of ITS tools.
[2023-03-18 23:49:55] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:49:55] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:49:55] [INFO ] Time to serialize gal into /tmp/LTL2804854561931528363.gal : 1 ms
[2023-03-18 23:49:55] [INFO ] Time to serialize properties into /tmp/LTL2143870460380974533.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2804854561931528363.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2143870460380974533.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(G("(l235<=0)")))))))
Formula 0 simplified : XXXXF!"(l235<=0)"
Detected timeout of ITS tools.
[2023-03-18 23:50:11] [INFO ] Flatten gal took : 14 ms
[2023-03-18 23:50:11] [INFO ] Applying decomposition
[2023-03-18 23:50:11] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13835742980804525093.txt' '-o' '/tmp/graph13835742980804525093.bin' '-w' '/tmp/graph13835742980804525093.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13835742980804525093.bin' '-l' '-1' '-v' '-w' '/tmp/graph13835742980804525093.weights' '-q' '0' '-e' '0.001'
[2023-03-18 23:50:11] [INFO ] Decomposing Gal with order
[2023-03-18 23:50:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 23:50:11] [INFO ] Removed a total of 111 redundant transitions.
[2023-03-18 23:50:11] [INFO ] Flatten gal took : 19 ms
[2023-03-18 23:50:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 5 ms.
[2023-03-18 23:50:11] [INFO ] Time to serialize gal into /tmp/LTL3431145369247964139.gal : 3 ms
[2023-03-18 23:50:11] [INFO ] Time to serialize properties into /tmp/LTL11928725906212995170.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3431145369247964139.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11928725906212995170.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(G("(i3.u7.l235<=0)")))))))
Formula 0 simplified : XXXXF!"(i3.u7.l235<=0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5649326110524818723
[2023-03-18 23:50:26] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5649326110524818723
Running compilation step : cd /tmp/ltsmin5649326110524818723;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 284 ms.
Running link step : cd /tmp/ltsmin5649326110524818723;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin5649326110524818723;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(X([]((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLCardinality-11 finished in 110091 ms.
[2023-03-18 23:50:41] [INFO ] Flatten gal took : 5 ms
Using solver Z3 to compute partial order matrices.
[2023-03-18 23:50:41] [INFO ] Applying decomposition
[2023-03-18 23:50:41] [INFO ] Flatten gal took : 4 ms
Built C files in :
/tmp/ltsmin10654867201644673639
[2023-03-18 23:50:41] [INFO ] Computing symmetric may disable matrix : 128 transitions.
[2023-03-18 23:50:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 23:50:41] [INFO ] Computing symmetric may enable matrix : 128 transitions.
[2023-03-18 23:50:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 23:50:41] [INFO ] Computing Do-Not-Accords matrix : 128 transitions.
[2023-03-18 23:50:41] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 23:50:41] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10654867201644673639
Running compilation step : cd /tmp/ltsmin10654867201644673639;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph643512672257884211.txt' '-o' '/tmp/graph643512672257884211.bin' '-w' '/tmp/graph643512672257884211.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph643512672257884211.bin' '-l' '-1' '-v' '-w' '/tmp/graph643512672257884211.weights' '-q' '0' '-e' '0.001'
[2023-03-18 23:50:41] [INFO ] Decomposing Gal with order
[2023-03-18 23:50:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 23:50:41] [INFO ] Removed a total of 115 redundant transitions.
[2023-03-18 23:50:41] [INFO ] Flatten gal took : 11 ms
[2023-03-18 23:50:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 87 labels/synchronizations in 3 ms.
[2023-03-18 23:50:41] [INFO ] Time to serialize gal into /tmp/LTLCardinality9897578177353884570.gal : 2 ms
[2023-03-18 23:50:41] [INFO ] Time to serialize properties into /tmp/LTLCardinality12253614703501080480.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9897578177353884570.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12253614703501080480.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(G("(i8.u8.l235<=0)")))))))
Formula 0 simplified : XXXXF!"(i8.u8.l235<=0)"
Compilation finished in 299 ms.
Running link step : cd /tmp/ltsmin10654867201644673639;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin10654867201644673639;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(X([]((LTLAPp0==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: LTL layer: formula: X(X(X(X([]((LTLAPp0==true))))))
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: "X(X(X(X([]((LTLAPp0==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.020: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.078: DFS-FIFO for weak LTL, using special progress label 130
pins2lts-mc-linux64( 0/ 8), 0.078: There are 131 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.078: State length is 113, there are 135 groups
pins2lts-mc-linux64( 0/ 8), 0.078: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.078: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.078: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.078: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.084: ~1 levels ~960 states ~1872 transitions
pins2lts-mc-linux64( 7/ 8), 0.086: ~1 levels ~1920 states ~3632 transitions
pins2lts-mc-linux64( 7/ 8), 0.091: ~1 levels ~3840 states ~8064 transitions
pins2lts-mc-linux64( 7/ 8), 1.168: ~1 levels ~7680 states ~17000 transitions
pins2lts-mc-linux64( 1/ 8), 1.630: ~1 levels ~15360 states ~32624 transitions
pins2lts-mc-linux64( 7/ 8), 1.878: ~1 levels ~30720 states ~70296 transitions
pins2lts-mc-linux64( 1/ 8), 2.714: ~1 levels ~61440 states ~129664 transitions
pins2lts-mc-linux64( 0/ 8), 3.430: ~1 levels ~122880 states ~266488 transitions
pins2lts-mc-linux64( 1/ 8), 4.596: ~1 levels ~245760 states ~534904 transitions
pins2lts-mc-linux64( 5/ 8), 7.621: ~1 levels ~491520 states ~1151688 transitions
pins2lts-mc-linux64( 7/ 8), 11.087: ~1 levels ~983040 states ~2183528 transitions
pins2lts-mc-linux64( 2/ 8), 17.287: ~1 levels ~1966080 states ~4372136 transitions
pins2lts-mc-linux64( 5/ 8), 25.534: ~1 levels ~3932160 states ~9111896 transitions
pins2lts-mc-linux64( 5/ 8), 34.897: ~1 levels ~7864320 states ~18152864 transitions
pins2lts-mc-linux64( 5/ 8), 54.660: ~1 levels ~15728640 states ~36186576 transitions
pins2lts-mc-linux64( 5/ 8), 91.800: ~1 levels ~31457280 states ~72834616 transitions
pins2lts-mc-linux64( 5/ 8), 162.712: ~1 levels ~62914560 states ~145363224 transitions
pins2lts-mc-linux64( 5/ 8), 282.816: ~1 levels ~125829120 states ~292483984 transitions
pins2lts-mc-linux64( 7/ 8), 307.072: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 307.208:
pins2lts-mc-linux64( 0/ 8), 307.208: mean standard work distribution: 1.8% (states) 1.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 307.208:
pins2lts-mc-linux64( 0/ 8), 307.208: Explored 129181560 states 299543749 transitions, fanout: 2.319
pins2lts-mc-linux64( 0/ 8), 307.208: Total exploration time 307.110 sec (306.950 sec minimum, 307.012 sec on average)
pins2lts-mc-linux64( 0/ 8), 307.208: States per second: 420636, Transitions per second: 975363
pins2lts-mc-linux64( 0/ 8), 307.209:
pins2lts-mc-linux64( 0/ 8), 307.209: Progress states detected: 134217296
pins2lts-mc-linux64( 0/ 8), 307.209: Redundant explorations: -3.7519
pins2lts-mc-linux64( 0/ 8), 307.209:
pins2lts-mc-linux64( 0/ 8), 307.209: Queue width: 8B, total height: 10797809, memory: 82.38MB
pins2lts-mc-linux64( 0/ 8), 307.209: Tree memory: 1039.4MB, 8.1 B/state, compr.: 1.8%
pins2lts-mc-linux64( 0/ 8), 307.209: Tree fill ratio (roots/leafs): 99.0%/6.0%
pins2lts-mc-linux64( 0/ 8), 307.209: Stored 128 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 307.209: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 307.209: Est. total memory use: 1121.8MB (~1106.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10654867201644673639;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(X([]((LTLAPp0==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10654867201644673639;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(X([]((LTLAPp0==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-19 00:11:59] [INFO ] Flatten gal took : 182 ms
[2023-03-19 00:11:59] [INFO ] Time to serialize gal into /tmp/LTLCardinality11583728235177137.gal : 59 ms
[2023-03-19 00:11:59] [INFO ] Time to serialize properties into /tmp/LTLCardinality10759702090054704757.ltl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11583728235177137.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10759702090054704757.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...296
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(G("(l235<=0)")))))))
Formula 0 simplified : XXXXF!"(l235<=0)"
Reverse transition relation is NOT exact ! Due to transitions t1, t16, t19, t21, t22, t26, t27, t30, t31, t35, t36, t62, t64, t90, t97, t98, t99, t100, t10...342
Computing Next relation with stutter on 5.2931e+17 deadlock states
Detected timeout of ITS tools.
[2023-03-19 00:33:16] [INFO ] Flatten gal took : 27 ms
[2023-03-19 00:33:16] [INFO ] Input system was already deterministic with 128 transitions.
[2023-03-19 00:33:16] [INFO ] Transformed 112 places.
[2023-03-19 00:33:16] [INFO ] Transformed 128 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-19 00:33:16] [INFO ] Time to serialize gal into /tmp/LTLCardinality2561906745348354459.gal : 3 ms
[2023-03-19 00:33:16] [INFO ] Time to serialize properties into /tmp/LTLCardinality2604557005172548370.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2561906745348354459.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2604557005172548370.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(X(X(G("(l235<=0)")))))))
Formula 0 simplified : XXXXF!"(l235<=0)"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 12827584 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16170112 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SieveSingleMsgMbox-PT-d2m96"
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-d2m96, 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-167905975300491"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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