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.r039-tajo-167813692800636.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 lolaxred
Input is CANConstruction-PT-030, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692800636
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 13K Feb 25 21:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 25 21:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 21:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 21:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 21:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 25 21:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 25 21:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 25 21:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.4M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CANConstruction-PT-030-LTLFireability-00
FORMULA_NAME CANConstruction-PT-030-LTLFireability-01
FORMULA_NAME CANConstruction-PT-030-LTLFireability-02
FORMULA_NAME CANConstruction-PT-030-LTLFireability-03
FORMULA_NAME CANConstruction-PT-030-LTLFireability-04
FORMULA_NAME CANConstruction-PT-030-LTLFireability-05
FORMULA_NAME CANConstruction-PT-030-LTLFireability-06
FORMULA_NAME CANConstruction-PT-030-LTLFireability-07
FORMULA_NAME CANConstruction-PT-030-LTLFireability-08
FORMULA_NAME CANConstruction-PT-030-LTLFireability-09
FORMULA_NAME CANConstruction-PT-030-LTLFireability-10
FORMULA_NAME CANConstruction-PT-030-LTLFireability-11
FORMULA_NAME CANConstruction-PT-030-LTLFireability-12
FORMULA_NAME CANConstruction-PT-030-LTLFireability-13
FORMULA_NAME CANConstruction-PT-030-LTLFireability-14
FORMULA_NAME CANConstruction-PT-030-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678504057502

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-030
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 03:07:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 03:07:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:07:39] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2023-03-11 03:07:39] [INFO ] Transformed 2162 places.
[2023-03-11 03:07:39] [INFO ] Transformed 3840 transitions.
[2023-03-11 03:07:39] [INFO ] Parsed PT model containing 2162 places and 3840 transitions and 11400 arcs in 270 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CANConstruction-PT-030-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-030-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 2162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2162/2162 places, 3840/3840 transitions.
Discarding 823 places :
Symmetric choice reduction at 0 with 823 rule applications. Total rules 823 place count 1339 transition count 2194
Iterating global reduction 0 with 823 rules applied. Total rules applied 1646 place count 1339 transition count 2194
Applied a total of 1646 rules in 267 ms. Remains 1339 /2162 variables (removed 823) and now considering 2194/3840 (removed 1646) transitions.
// Phase 1: matrix 2194 rows 1339 cols
[2023-03-11 03:07:40] [INFO ] Computed 61 place invariants in 53 ms
[2023-03-11 03:07:41] [INFO ] Implicit Places using invariants in 1038 ms returned [12, 26, 40, 54, 68, 82, 96, 110, 124, 138, 152, 166, 180, 194, 208, 222, 236, 250, 264, 278, 292, 306, 320, 334, 348, 362, 376, 390, 404, 418]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 1075 ms to find 30 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1309/2162 places, 2194/3840 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 1279 transition count 2164
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 1279 transition count 2164
Applied a total of 60 rules in 199 ms. Remains 1279 /1309 variables (removed 30) and now considering 2164/2194 (removed 30) transitions.
// Phase 1: matrix 2164 rows 1279 cols
[2023-03-11 03:07:41] [INFO ] Computed 31 place invariants in 29 ms
[2023-03-11 03:07:41] [INFO ] Implicit Places using invariants in 545 ms returned []
[2023-03-11 03:07:41] [INFO ] Invariant cache hit.
[2023-03-11 03:07:42] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:07:48] [INFO ] Implicit Places using invariants and state equation in 6649 ms returned []
Implicit Place search using SMT with State Equation took 7202 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1279/2162 places, 2164/3840 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8746 ms. Remains : 1279/2162 places, 2164/3840 transitions.
Support contains 48 out of 1279 places after structural reductions.
[2023-03-11 03:07:48] [INFO ] Flatten gal took : 165 ms
[2023-03-11 03:07:48] [INFO ] Flatten gal took : 72 ms
[2023-03-11 03:07:49] [INFO ] Input system was already deterministic with 2164 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 586 ms. (steps per millisecond=17 ) properties (out of 33) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-11 03:07:49] [INFO ] Invariant cache hit.
[2023-03-11 03:07:50] [INFO ] [Real]Absence check using 31 positive place invariants in 33 ms returned sat
[2023-03-11 03:07:51] [INFO ] After 1392ms SMT Verify possible using state equation in real domain returned unsat :0 sat :8 real:3
[2023-03-11 03:07:52] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:07:53] [INFO ] After 1129ms SMT Verify possible using 1770 Read/Feed constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-11 03:07:53] [INFO ] After 3144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-11 03:07:53] [INFO ] [Nat]Absence check using 31 positive place invariants in 23 ms returned sat
[2023-03-11 03:07:54] [INFO ] After 972ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-11 03:07:55] [INFO ] After 1121ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-11 03:07:57] [INFO ] After 2755ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1279 ms.
[2023-03-11 03:07:58] [INFO ] After 5609ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 4 properties in 236 ms.
Support contains 11 out of 1279 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1279/1279 places, 2164/2164 transitions.
Drop transitions removed 195 transitions
Trivial Post-agglo rules discarded 195 transitions
Performed 195 trivial Post agglomeration. Transition count delta: 195
Iterating post reduction 0 with 195 rules applied. Total rules applied 195 place count 1279 transition count 1969
Reduce places removed 195 places and 0 transitions.
Iterating post reduction 1 with 195 rules applied. Total rules applied 390 place count 1084 transition count 1969
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 390 place count 1084 transition count 1939
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 450 place count 1054 transition count 1939
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 462 place count 1042 transition count 1915
Iterating global reduction 2 with 12 rules applied. Total rules applied 474 place count 1042 transition count 1915
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 9 rules applied. Total rules applied 483 place count 1042 transition count 1906
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 492 place count 1033 transition count 1906
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 556 place count 1001 transition count 1874
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 557 place count 1001 transition count 1873
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 558 place count 1000 transition count 1873
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 563 place count 1000 transition count 1873
Applied a total of 563 rules in 643 ms. Remains 1000 /1279 variables (removed 279) and now considering 1873/2164 (removed 291) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 644 ms. Remains : 1000/1279 places, 1873/2164 transitions.
Incomplete random walk after 10000 steps, including 48 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1873 rows 1000 cols
[2023-03-11 03:07:59] [INFO ] Computed 31 place invariants in 12 ms
[2023-03-11 03:08:00] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2023-03-11 03:08:00] [INFO ] After 503ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-11 03:08:00] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:08:00] [INFO ] After 241ms SMT Verify possible using 1770 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:08:00] [INFO ] After 974ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:08:01] [INFO ] [Nat]Absence check using 31 positive place invariants in 19 ms returned sat
[2023-03-11 03:08:01] [INFO ] After 511ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:08:01] [INFO ] After 341ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:08:02] [INFO ] After 625ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 151 ms.
[2023-03-11 03:08:02] [INFO ] After 1500ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 5 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 1873/1873 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1000 transition count 1872
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 999 transition count 1872
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 998 transition count 1870
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 998 transition count 1870
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 6 place count 997 transition count 1869
Applied a total of 6 rules in 245 ms. Remains 997 /1000 variables (removed 3) and now considering 1869/1873 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 245 ms. Remains : 997/1000 places, 1869/1873 transitions.
Incomplete random walk after 10000 steps, including 47 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 241736 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :{}
Probabilistic random walk after 241736 steps, saw 52418 distinct states, run finished after 3002 ms. (steps per millisecond=80 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1869 rows 997 cols
[2023-03-11 03:08:05] [INFO ] Computed 31 place invariants in 31 ms
[2023-03-11 03:08:06] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned sat
[2023-03-11 03:08:06] [INFO ] After 522ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-11 03:08:06] [INFO ] State equation strengthened by 1771 read => feed constraints.
[2023-03-11 03:08:06] [INFO ] After 190ms SMT Verify possible using 1771 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:08:06] [INFO ] After 943ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:08:07] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2023-03-11 03:08:07] [INFO ] After 510ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:08:07] [INFO ] After 257ms SMT Verify possible using 1771 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:08:08] [INFO ] After 478ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 148 ms.
[2023-03-11 03:08:08] [INFO ] After 1335ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 997 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 997/997 places, 1869/1869 transitions.
Applied a total of 0 rules in 80 ms. Remains 997 /997 variables (removed 0) and now considering 1869/1869 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 997/997 places, 1869/1869 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 997/997 places, 1869/1869 transitions.
Applied a total of 0 rules in 71 ms. Remains 997 /997 variables (removed 0) and now considering 1869/1869 (removed 0) transitions.
[2023-03-11 03:08:08] [INFO ] Invariant cache hit.
[2023-03-11 03:08:08] [INFO ] Implicit Places using invariants in 608 ms returned []
[2023-03-11 03:08:08] [INFO ] Invariant cache hit.
[2023-03-11 03:08:09] [INFO ] State equation strengthened by 1771 read => feed constraints.
[2023-03-11 03:08:14] [INFO ] Implicit Places using invariants and state equation in 5436 ms returned []
Implicit Place search using SMT with State Equation took 6057 ms to find 0 implicit places.
[2023-03-11 03:08:14] [INFO ] Redundant transitions in 89 ms returned []
[2023-03-11 03:08:14] [INFO ] Invariant cache hit.
[2023-03-11 03:08:15] [INFO ] Dead Transitions using invariants and state equation in 672 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6896 ms. Remains : 997/997 places, 1869/1869 transitions.
Graph (trivial) has 1768 edges and 997 vertex of which 896 / 997 are part of one of the 29 SCC in 9 ms
Free SCC test removed 867 places
Drop transitions removed 1705 transitions
Reduce isomorphic transitions removed 1705 transitions.
Graph (complete) has 259 edges and 130 vertex of which 50 are kept as prefixes of interest. Removing 80 places using SCC suffix rule.1 ms
Discarding 80 places :
Also discarding 50 output transitions
Drop transitions removed 50 transitions
Drop transitions removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 50 transition count 52
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 121 place count 21 transition count 24
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 121 place count 21 transition count 20
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 129 place count 17 transition count 20
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 130 place count 16 transition count 19
Iterating global reduction 2 with 1 rules applied. Total rules applied 131 place count 16 transition count 19
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 132 place count 16 transition count 18
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 133 place count 16 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 134 place count 15 transition count 17
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 15 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 136 place count 14 transition count 16
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 139 place count 14 transition count 16
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 142 place count 11 transition count 13
Iterating global reduction 5 with 3 rules applied. Total rules applied 145 place count 11 transition count 13
Applied a total of 145 rules in 23 ms. Remains 11 /997 variables (removed 986) and now considering 13/1869 (removed 1856) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 13 rows 11 cols
[2023-03-11 03:08:15] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 03:08:15] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-11 03:08:15] [INFO ] After 4ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-11 03:08:15] [INFO ] After 8ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-11 03:08:15] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Computed a total of 91 stabilizing places and 120 stable transitions
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(X(G(p0)))))))'
Support contains 2 out of 1279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1279/1279 places, 2164/2164 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1262 transition count 2130
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1262 transition count 2130
Applied a total of 34 rules in 98 ms. Remains 1262 /1279 variables (removed 17) and now considering 2130/2164 (removed 34) transitions.
// Phase 1: matrix 2130 rows 1262 cols
[2023-03-11 03:08:15] [INFO ] Computed 31 place invariants in 20 ms
[2023-03-11 03:08:16] [INFO ] Implicit Places using invariants in 729 ms returned []
[2023-03-11 03:08:16] [INFO ] Invariant cache hit.
[2023-03-11 03:08:17] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:08:23] [INFO ] Implicit Places using invariants and state equation in 7036 ms returned []
Implicit Place search using SMT with State Equation took 7769 ms to find 0 implicit places.
[2023-03-11 03:08:23] [INFO ] Invariant cache hit.
[2023-03-11 03:08:24] [INFO ] Dead Transitions using invariants and state equation in 880 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1262/1279 places, 2130/2164 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8760 ms. Remains : 1262/1279 places, 2130/2164 transitions.
Stuttering acceptance computed with spot in 440 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-00 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: 6}], [{ cond=true, acceptance={} source=6 dest: 4}]], initial=5, aps=[p0:(OR (LT s0 1) (LT s194 1))], 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, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-030-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-00 finished in 9315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (G(p1) U p2)))'
Support contains 4 out of 1279 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1279/1279 places, 2164/2164 transitions.
Drop transitions removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 0 with 196 rules applied. Total rules applied 196 place count 1279 transition count 1968
Reduce places removed 196 places and 0 transitions.
Iterating post reduction 1 with 196 rules applied. Total rules applied 392 place count 1083 transition count 1968
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 392 place count 1083 transition count 1938
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 452 place count 1053 transition count 1938
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 467 place count 1038 transition count 1908
Iterating global reduction 2 with 15 rules applied. Total rules applied 482 place count 1038 transition count 1908
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 2 with 12 rules applied. Total rules applied 494 place count 1038 transition count 1896
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 506 place count 1026 transition count 1896
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 2 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 568 place count 995 transition count 1865
Applied a total of 568 rules in 235 ms. Remains 995 /1279 variables (removed 284) and now considering 1865/2164 (removed 299) transitions.
// Phase 1: matrix 1865 rows 995 cols
[2023-03-11 03:08:25] [INFO ] Computed 31 place invariants in 19 ms
[2023-03-11 03:08:25] [INFO ] Implicit Places using invariants in 675 ms returned []
[2023-03-11 03:08:25] [INFO ] Invariant cache hit.
[2023-03-11 03:08:26] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:08:31] [INFO ] Implicit Places using invariants and state equation in 5950 ms returned []
Implicit Place search using SMT with State Equation took 6639 ms to find 0 implicit places.
[2023-03-11 03:08:31] [INFO ] Redundant transitions in 98 ms returned []
[2023-03-11 03:08:31] [INFO ] Invariant cache hit.
[2023-03-11 03:08:33] [INFO ] Dead Transitions using invariants and state equation in 1303 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 995/1279 places, 1865/2164 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8305 ms. Remains : 995/1279 places, 1865/2164 transitions.
Stuttering acceptance computed with spot in 271 ms :[(NOT p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s353 1), p1:(GEQ s865 1), p0:(AND (GEQ s28 1) (GEQ s275 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 205 steps with 0 reset in 8 ms.
FORMULA CANConstruction-PT-030-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-01 finished in 8613 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' '!(((p0&&(F(p1)||X(F(p2)))) U (G((p0&&(F(p1)||X(F(p2)))))||(p0&&(F(p1)||X(F(p2)))&&X(!p2)))))'
Support contains 4 out of 1279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1279/1279 places, 2164/2164 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1264 transition count 2134
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1264 transition count 2134
Applied a total of 30 rules in 76 ms. Remains 1264 /1279 variables (removed 15) and now considering 2134/2164 (removed 30) transitions.
// Phase 1: matrix 2134 rows 1264 cols
[2023-03-11 03:08:33] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-11 03:08:34] [INFO ] Implicit Places using invariants in 1054 ms returned []
[2023-03-11 03:08:34] [INFO ] Invariant cache hit.
[2023-03-11 03:08:35] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:08:44] [INFO ] Implicit Places using invariants and state equation in 9584 ms returned []
Implicit Place search using SMT with State Equation took 10657 ms to find 0 implicit places.
[2023-03-11 03:08:44] [INFO ] Invariant cache hit.
[2023-03-11 03:08:45] [INFO ] Dead Transitions using invariants and state equation in 1090 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1264/1279 places, 2134/2164 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11827 ms. Remains : 1264/1279 places, 2134/2164 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (AND (NOT p0) p2)]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LT s620 1), p1:(LT s820 1), p2:(AND (GEQ s258 1) (GEQ s557 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1233 ms.
Product exploration explored 100000 steps with 50000 reset in 1230 ms.
Computed a total of 91 stabilizing places and 120 stable transitions
Computed a total of 91 stabilizing places and 120 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p2)))
Knowledge based reduction with 10 factoid took 210 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-030-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-030-LTLFireability-02 finished in 14689 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X((p1&&G(p2)))))))'
Support contains 4 out of 1279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1279/1279 places, 2164/2164 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1264 transition count 2134
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1264 transition count 2134
Applied a total of 30 rules in 74 ms. Remains 1264 /1279 variables (removed 15) and now considering 2134/2164 (removed 30) transitions.
// Phase 1: matrix 2134 rows 1264 cols
[2023-03-11 03:08:48] [INFO ] Computed 31 place invariants in 21 ms
[2023-03-11 03:08:48] [INFO ] Implicit Places using invariants in 668 ms returned []
[2023-03-11 03:08:48] [INFO ] Invariant cache hit.
[2023-03-11 03:08:49] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:08:55] [INFO ] Implicit Places using invariants and state equation in 6401 ms returned []
Implicit Place search using SMT with State Equation took 7091 ms to find 0 implicit places.
[2023-03-11 03:08:55] [INFO ] Invariant cache hit.
[2023-03-11 03:08:56] [INFO ] Dead Transitions using invariants and state equation in 992 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1264/1279 places, 2134/2164 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8159 ms. Remains : 1264/1279 places, 2134/2164 transitions.
Stuttering acceptance computed with spot in 240 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s532 1) (GEQ s902 1)), p1:(GEQ s532 1), p2:(OR (LT s0 1) (LT s206 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-030-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-03 finished in 8424 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(F((X(F(p1))||p0))))'
Support contains 3 out of 1279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1279/1279 places, 2164/2164 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1263 transition count 2132
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1263 transition count 2132
Applied a total of 32 rules in 100 ms. Remains 1263 /1279 variables (removed 16) and now considering 2132/2164 (removed 32) transitions.
// Phase 1: matrix 2132 rows 1263 cols
[2023-03-11 03:08:56] [INFO ] Computed 31 place invariants in 33 ms
[2023-03-11 03:08:57] [INFO ] Implicit Places using invariants in 589 ms returned []
[2023-03-11 03:08:57] [INFO ] Invariant cache hit.
[2023-03-11 03:08:57] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:09:03] [INFO ] Implicit Places using invariants and state equation in 6376 ms returned []
Implicit Place search using SMT with State Equation took 6969 ms to find 0 implicit places.
[2023-03-11 03:09:03] [INFO ] Invariant cache hit.
[2023-03-11 03:09:04] [INFO ] Dead Transitions using invariants and state equation in 892 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1263/1279 places, 2132/2164 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7962 ms. Remains : 1263/1279 places, 2132/2164 transitions.
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s1131 1) (AND (GEQ s186 1) (GEQ s551 1))), p1:(AND (GEQ s186 1) (GEQ s551 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 499 steps with 0 reset in 3 ms.
FORMULA CANConstruction-PT-030-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-04 finished in 8170 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(F((G((p1&&F(p2)))&&p0))))'
Support contains 5 out of 1279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1279/1279 places, 2164/2164 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1263 transition count 2132
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1263 transition count 2132
Applied a total of 32 rules in 82 ms. Remains 1263 /1279 variables (removed 16) and now considering 2132/2164 (removed 32) transitions.
// Phase 1: matrix 2132 rows 1263 cols
[2023-03-11 03:09:04] [INFO ] Computed 31 place invariants in 21 ms
[2023-03-11 03:09:05] [INFO ] Implicit Places using invariants in 636 ms returned []
[2023-03-11 03:09:05] [INFO ] Invariant cache hit.
[2023-03-11 03:09:06] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:09:12] [INFO ] Implicit Places using invariants and state equation in 7019 ms returned []
Implicit Place search using SMT with State Equation took 7663 ms to find 0 implicit places.
[2023-03-11 03:09:12] [INFO ] Invariant cache hit.
[2023-03-11 03:09:13] [INFO ] Dead Transitions using invariants and state equation in 931 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1263/1279 places, 2132/2164 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8678 ms. Remains : 1263/1279 places, 2132/2164 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s126 1) (GEQ s837 1)), p1:(GEQ s963 1), p2:(AND (GEQ s6 1) (GEQ s155 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 427 steps with 0 reset in 3 ms.
FORMULA CANConstruction-PT-030-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-05 finished in 8903 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 1279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1279/1279 places, 2164/2164 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1262 transition count 2130
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1262 transition count 2130
Applied a total of 34 rules in 83 ms. Remains 1262 /1279 variables (removed 17) and now considering 2130/2164 (removed 34) transitions.
// Phase 1: matrix 2130 rows 1262 cols
[2023-03-11 03:09:13] [INFO ] Computed 31 place invariants in 22 ms
[2023-03-11 03:09:14] [INFO ] Implicit Places using invariants in 742 ms returned []
[2023-03-11 03:09:14] [INFO ] Invariant cache hit.
[2023-03-11 03:09:15] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:09:21] [INFO ] Implicit Places using invariants and state equation in 6525 ms returned []
Implicit Place search using SMT with State Equation took 7281 ms to find 0 implicit places.
[2023-03-11 03:09:21] [INFO ] Invariant cache hit.
[2023-03-11 03:09:22] [INFO ] Dead Transitions using invariants and state equation in 978 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1262/1279 places, 2130/2164 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8344 ms. Remains : 1262/1279 places, 2130/2164 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s78 1) (GEQ s659 1) (GEQ s330 1) (GEQ s359 1))], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-030-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-06 finished in 8479 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G((p0||(p1 U p2))))))'
Support contains 3 out of 1279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1279/1279 places, 2164/2164 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1265 transition count 2136
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1265 transition count 2136
Applied a total of 28 rules in 105 ms. Remains 1265 /1279 variables (removed 14) and now considering 2136/2164 (removed 28) transitions.
// Phase 1: matrix 2136 rows 1265 cols
[2023-03-11 03:09:22] [INFO ] Computed 31 place invariants in 19 ms
[2023-03-11 03:09:22] [INFO ] Implicit Places using invariants in 709 ms returned []
[2023-03-11 03:09:22] [INFO ] Invariant cache hit.
[2023-03-11 03:09:23] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:09:30] [INFO ] Implicit Places using invariants and state equation in 7026 ms returned []
Implicit Place search using SMT with State Equation took 7774 ms to find 0 implicit places.
[2023-03-11 03:09:30] [INFO ] Invariant cache hit.
[2023-03-11 03:09:31] [INFO ] Dead Transitions using invariants and state equation in 1028 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1265/1279 places, 2136/2164 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8910 ms. Remains : 1265/1279 places, 2136/2164 transitions.
Stuttering acceptance computed with spot in 291 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR p0 p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LT s782 1), p2:(GEQ s518 1), p1:(GEQ s923 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11562 steps with 22 reset in 107 ms.
FORMULA CANConstruction-PT-030-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-07 finished in 9342 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||G(p1)))||F(p0)))'
Support contains 3 out of 1279 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1279/1279 places, 2164/2164 transitions.
Drop transitions removed 195 transitions
Trivial Post-agglo rules discarded 195 transitions
Performed 195 trivial Post agglomeration. Transition count delta: 195
Iterating post reduction 0 with 195 rules applied. Total rules applied 195 place count 1279 transition count 1969
Reduce places removed 195 places and 0 transitions.
Iterating post reduction 1 with 195 rules applied. Total rules applied 390 place count 1084 transition count 1969
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 390 place count 1084 transition count 1939
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 450 place count 1054 transition count 1939
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 466 place count 1038 transition count 1907
Iterating global reduction 2 with 16 rules applied. Total rules applied 482 place count 1038 transition count 1907
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 2 with 13 rules applied. Total rules applied 495 place count 1038 transition count 1894
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 508 place count 1025 transition count 1894
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 568 place count 995 transition count 1864
Applied a total of 568 rules in 247 ms. Remains 995 /1279 variables (removed 284) and now considering 1864/2164 (removed 300) transitions.
// Phase 1: matrix 1864 rows 995 cols
[2023-03-11 03:09:31] [INFO ] Computed 31 place invariants in 24 ms
[2023-03-11 03:09:32] [INFO ] Implicit Places using invariants in 765 ms returned []
[2023-03-11 03:09:32] [INFO ] Invariant cache hit.
[2023-03-11 03:09:33] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:09:38] [INFO ] Implicit Places using invariants and state equation in 5762 ms returned []
Implicit Place search using SMT with State Equation took 6551 ms to find 0 implicit places.
[2023-03-11 03:09:38] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-11 03:09:38] [INFO ] Invariant cache hit.
[2023-03-11 03:09:39] [INFO ] Dead Transitions using invariants and state equation in 1300 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 995/1279 places, 1864/2164 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8173 ms. Remains : 995/1279 places, 1864/2164 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s56 1) (GEQ s74 1)), p1:(GEQ s270 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 411 steps with 1 reset in 4 ms.
FORMULA CANConstruction-PT-030-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-08 finished in 8350 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((F(G(p0))&&G((p1||F(p2))))))'
Support contains 4 out of 1279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1279/1279 places, 2164/2164 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1264 transition count 2134
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1264 transition count 2134
Applied a total of 30 rules in 114 ms. Remains 1264 /1279 variables (removed 15) and now considering 2134/2164 (removed 30) transitions.
// Phase 1: matrix 2134 rows 1264 cols
[2023-03-11 03:09:39] [INFO ] Computed 31 place invariants in 19 ms
[2023-03-11 03:09:41] [INFO ] Implicit Places using invariants in 1083 ms returned []
[2023-03-11 03:09:41] [INFO ] Invariant cache hit.
[2023-03-11 03:09:41] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:09:48] [INFO ] Implicit Places using invariants and state equation in 7401 ms returned []
Implicit Place search using SMT with State Equation took 8499 ms to find 0 implicit places.
[2023-03-11 03:09:48] [INFO ] Invariant cache hit.
[2023-03-11 03:09:49] [INFO ] Dead Transitions using invariants and state equation in 975 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1264/1279 places, 2134/2164 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9595 ms. Remains : 1264/1279 places, 2134/2164 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LT s752 1), p1:(AND (GEQ s30 1) (GEQ s191 1)), p2:(LT s875 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 196 reset in 437 ms.
Stack based approach found an accepted trace after 13172 steps with 25 reset with depth 696 and stack size 654 in 57 ms.
FORMULA CANConstruction-PT-030-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-10 finished in 10290 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(((F(p0) U G(p1))||(p2 U p3))))'
Support contains 7 out of 1279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1279/1279 places, 2164/2164 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1263 transition count 2132
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1263 transition count 2132
Applied a total of 32 rules in 108 ms. Remains 1263 /1279 variables (removed 16) and now considering 2132/2164 (removed 32) transitions.
// Phase 1: matrix 2132 rows 1263 cols
[2023-03-11 03:09:50] [INFO ] Computed 31 place invariants in 19 ms
[2023-03-11 03:09:51] [INFO ] Implicit Places using invariants in 1123 ms returned []
[2023-03-11 03:09:51] [INFO ] Invariant cache hit.
[2023-03-11 03:09:52] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:09:58] [INFO ] Implicit Places using invariants and state equation in 6742 ms returned []
Implicit Place search using SMT with State Equation took 7880 ms to find 0 implicit places.
[2023-03-11 03:09:58] [INFO ] Invariant cache hit.
[2023-03-11 03:09:59] [INFO ] Dead Transitions using invariants and state equation in 1303 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1263/1279 places, 2132/2164 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9295 ms. Remains : 1263/1279 places, 2132/2164 transitions.
Stuttering acceptance computed with spot in 301 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p3) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s354 1) (GEQ s1175 1)), p3:(AND (GEQ s246 1) (GEQ s760 1)), p2:(AND (GEQ s470 1) (GEQ s54 1) (GEQ s203 1)), p0:(AND (GEQ s54 1) (GEQ s203 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2253 steps with 4 reset in 15 ms.
FORMULA CANConstruction-PT-030-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-12 finished in 9675 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 3 out of 1279 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1279/1279 places, 2164/2164 transitions.
Drop transitions removed 195 transitions
Trivial Post-agglo rules discarded 195 transitions
Performed 195 trivial Post agglomeration. Transition count delta: 195
Iterating post reduction 0 with 195 rules applied. Total rules applied 195 place count 1279 transition count 1969
Reduce places removed 195 places and 0 transitions.
Iterating post reduction 1 with 195 rules applied. Total rules applied 390 place count 1084 transition count 1969
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 390 place count 1084 transition count 1939
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 450 place count 1054 transition count 1939
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 466 place count 1038 transition count 1907
Iterating global reduction 2 with 16 rules applied. Total rules applied 482 place count 1038 transition count 1907
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 2 with 13 rules applied. Total rules applied 495 place count 1038 transition count 1894
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 508 place count 1025 transition count 1894
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 568 place count 995 transition count 1864
Applied a total of 568 rules in 217 ms. Remains 995 /1279 variables (removed 284) and now considering 1864/2164 (removed 300) transitions.
// Phase 1: matrix 1864 rows 995 cols
[2023-03-11 03:10:00] [INFO ] Computed 31 place invariants in 12 ms
[2023-03-11 03:10:00] [INFO ] Implicit Places using invariants in 759 ms returned []
[2023-03-11 03:10:00] [INFO ] Invariant cache hit.
[2023-03-11 03:10:01] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:10:06] [INFO ] Implicit Places using invariants and state equation in 5354 ms returned []
Implicit Place search using SMT with State Equation took 6120 ms to find 0 implicit places.
[2023-03-11 03:10:06] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-11 03:10:06] [INFO ] Invariant cache hit.
[2023-03-11 03:10:07] [INFO ] Dead Transitions using invariants and state equation in 826 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 995/1279 places, 1864/2164 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7226 ms. Remains : 995/1279 places, 1864/2164 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GEQ s709 1), p1:(OR (LT s26 1) (LT s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 173 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-030-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-13 finished in 7359 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1279 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1279/1279 places, 2164/2164 transitions.
Drop transitions removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 0 with 196 rules applied. Total rules applied 196 place count 1279 transition count 1968
Reduce places removed 196 places and 0 transitions.
Iterating post reduction 1 with 196 rules applied. Total rules applied 392 place count 1083 transition count 1968
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 392 place count 1083 transition count 1938
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 452 place count 1053 transition count 1938
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 469 place count 1036 transition count 1904
Iterating global reduction 2 with 17 rules applied. Total rules applied 486 place count 1036 transition count 1904
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 2 with 14 rules applied. Total rules applied 500 place count 1036 transition count 1890
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 514 place count 1022 transition count 1890
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 572 place count 993 transition count 1861
Applied a total of 572 rules in 146 ms. Remains 993 /1279 variables (removed 286) and now considering 1861/2164 (removed 303) transitions.
// Phase 1: matrix 1861 rows 993 cols
[2023-03-11 03:10:07] [INFO ] Computed 31 place invariants in 21 ms
[2023-03-11 03:10:07] [INFO ] Implicit Places using invariants in 651 ms returned []
[2023-03-11 03:10:07] [INFO ] Invariant cache hit.
[2023-03-11 03:10:08] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:10:14] [INFO ] Implicit Places using invariants and state equation in 6106 ms returned []
Implicit Place search using SMT with State Equation took 6761 ms to find 0 implicit places.
[2023-03-11 03:10:14] [INFO ] Redundant transitions in 51 ms returned []
[2023-03-11 03:10:14] [INFO ] Invariant cache hit.
[2023-03-11 03:10:15] [INFO ] Dead Transitions using invariants and state equation in 1023 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 993/1279 places, 1861/2164 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7992 ms. Remains : 993/1279 places, 1861/2164 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s73 1) (GEQ s435 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 181 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-030-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-14 finished in 8059 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(p1)))'
Support contains 2 out of 1279 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1279/1279 places, 2164/2164 transitions.
Drop transitions removed 193 transitions
Trivial Post-agglo rules discarded 193 transitions
Performed 193 trivial Post agglomeration. Transition count delta: 193
Iterating post reduction 0 with 193 rules applied. Total rules applied 193 place count 1279 transition count 1971
Reduce places removed 193 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 194 rules applied. Total rules applied 387 place count 1086 transition count 1970
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 388 place count 1085 transition count 1970
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 388 place count 1085 transition count 1940
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 448 place count 1055 transition count 1940
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 464 place count 1039 transition count 1908
Iterating global reduction 3 with 16 rules applied. Total rules applied 480 place count 1039 transition count 1908
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 3 with 13 rules applied. Total rules applied 493 place count 1039 transition count 1895
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 506 place count 1026 transition count 1895
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 568 place count 995 transition count 1864
Applied a total of 568 rules in 258 ms. Remains 995 /1279 variables (removed 284) and now considering 1864/2164 (removed 300) transitions.
// Phase 1: matrix 1864 rows 995 cols
[2023-03-11 03:10:15] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-11 03:10:16] [INFO ] Implicit Places using invariants in 552 ms returned []
[2023-03-11 03:10:16] [INFO ] Invariant cache hit.
[2023-03-11 03:10:16] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-11 03:10:25] [INFO ] Implicit Places using invariants and state equation in 9474 ms returned []
Implicit Place search using SMT with State Equation took 10030 ms to find 0 implicit places.
[2023-03-11 03:10:25] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-11 03:10:25] [INFO ] Invariant cache hit.
[2023-03-11 03:10:26] [INFO ] Dead Transitions using invariants and state equation in 813 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 995/1279 places, 1864/2164 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11158 ms. Remains : 995/1279 places, 1864/2164 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LT s649 1), p0:(LT s89 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 473 reset in 570 ms.
Stack based approach found an accepted trace after 22780 steps with 106 reset with depth 189 and stack size 187 in 218 ms.
FORMULA CANConstruction-PT-030-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-15 finished in 12092 ms.
All properties solved by simple procedures.
Total runtime 168056 ms.
ITS solved all properties within timeout

BK_STOP 1678504227556

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANConstruction-PT-030"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is CANConstruction-PT-030, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r039-tajo-167813692800636"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-030.tgz
mv CANConstruction-PT-030 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;