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.r041-tajo-167813695000636.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is CANConstruction-PT-030, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813695000636
=====================================================================

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

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-030
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 20:07:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 20:07:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 20:07:00] [INFO ] Load time of PNML (sax parser for PT used): 232 ms
[2023-03-12 20:07:00] [INFO ] Transformed 2162 places.
[2023-03-12 20:07:00] [INFO ] Transformed 3840 transitions.
[2023-03-12 20:07:00] [INFO ] Parsed PT model containing 2162 places and 3840 transitions and 11400 arcs in 373 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 332 ms. Remains 1339 /2162 variables (removed 823) and now considering 2194/3840 (removed 1646) transitions.
// Phase 1: matrix 2194 rows 1339 cols
[2023-03-12 20:07:01] [INFO ] Computed 61 place invariants in 78 ms
[2023-03-12 20:07:03] [INFO ] Implicit Places using invariants in 1724 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 1781 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 298 ms. Remains 1279 /1309 variables (removed 30) and now considering 2164/2194 (removed 30) transitions.
// Phase 1: matrix 2164 rows 1279 cols
[2023-03-12 20:07:03] [INFO ] Computed 31 place invariants in 21 ms
[2023-03-12 20:07:04] [INFO ] Implicit Places using invariants in 967 ms returned []
[2023-03-12 20:07:04] [INFO ] Invariant cache hit.
[2023-03-12 20:07:05] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 20:07:12] [INFO ] Implicit Places using invariants and state equation in 7597 ms returned []
Implicit Place search using SMT with State Equation took 8568 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 10993 ms. Remains : 1279/2162 places, 2164/3840 transitions.
Support contains 48 out of 1279 places after structural reductions.
[2023-03-12 20:07:12] [INFO ] Flatten gal took : 294 ms
[2023-03-12 20:07:12] [INFO ] Flatten gal took : 201 ms
[2023-03-12 20:07:13] [INFO ] Input system was already deterministic with 2164 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 580 ms. (steps per millisecond=17 ) properties (out of 33) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) 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 7) seen :0
Running SMT prover for 7 properties.
[2023-03-12 20:07:14] [INFO ] Invariant cache hit.
[2023-03-12 20:07:14] [INFO ] [Real]Absence check using 31 positive place invariants in 27 ms returned sat
[2023-03-12 20:07:15] [INFO ] After 979ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:5
[2023-03-12 20:07:15] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 20:07:16] [INFO ] After 428ms SMT Verify possible using 1770 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 20:07:16] [INFO ] After 1990ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 20:07:16] [INFO ] [Nat]Absence check using 31 positive place invariants in 26 ms returned sat
[2023-03-12 20:07:17] [INFO ] After 1193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-12 20:07:18] [INFO ] After 731ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-12 20:07:19] [INFO ] After 1856ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 766 ms.
[2023-03-12 20:07:20] [INFO ] After 4315ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 75 ms.
Support contains 14 out of 1279 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1279/1279 places, 2164/2164 transitions.
Drop transitions removed 194 transitions
Trivial Post-agglo rules discarded 194 transitions
Performed 194 trivial Post agglomeration. Transition count delta: 194
Iterating post reduction 0 with 194 rules applied. Total rules applied 194 place count 1279 transition count 1970
Reduce places removed 194 places and 0 transitions.
Iterating post reduction 1 with 194 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 2 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 2 with 60 rules applied. Total rules applied 448 place count 1055 transition count 1940
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 459 place count 1044 transition count 1918
Iterating global reduction 2 with 11 rules applied. Total rules applied 470 place count 1044 transition count 1918
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 8 rules applied. Total rules applied 478 place count 1044 transition count 1910
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 486 place count 1036 transition count 1910
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 2 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 550 place count 1004 transition count 1878
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 552 place count 1004 transition count 1876
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 554 place count 1002 transition count 1876
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 560 place count 1002 transition count 1876
Applied a total of 560 rules in 662 ms. Remains 1002 /1279 variables (removed 277) and now considering 1876/2164 (removed 288) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 662 ms. Remains : 1002/1279 places, 1876/2164 transitions.
Incomplete random walk after 10000 steps, including 48 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1876 rows 1002 cols
[2023-03-12 20:07:21] [INFO ] Computed 31 place invariants in 44 ms
[2023-03-12 20:07:21] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned sat
[2023-03-12 20:07:22] [INFO ] After 668ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 20:07:22] [INFO ] [Nat]Absence check using 31 positive place invariants in 19 ms returned sat
[2023-03-12 20:07:22] [INFO ] After 469ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 20:07:22] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 20:07:23] [INFO ] After 289ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 20:07:23] [INFO ] After 389ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-12 20:07:23] [INFO ] After 1155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 1002 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1002/1002 places, 1876/1876 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1002 transition count 1874
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1000 transition count 1874
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 8 place count 996 transition count 1866
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 996 transition count 1866
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 994 transition count 1864
Applied a total of 16 rules in 262 ms. Remains 994 /1002 variables (removed 8) and now considering 1864/1876 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 263 ms. Remains : 994/1002 places, 1864/1876 transitions.
Incomplete random walk after 10000 steps, including 48 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 245300 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 245300 steps, saw 54121 distinct states, run finished after 3004 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1864 rows 994 cols
[2023-03-12 20:07:26] [INFO ] Computed 31 place invariants in 22 ms
[2023-03-12 20:07:26] [INFO ] [Real]Absence check using 31 positive place invariants in 19 ms returned sat
[2023-03-12 20:07:27] [INFO ] After 533ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 20:07:27] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 20:07:27] [INFO ] After 226ms SMT Verify possible using 1770 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 20:07:27] [INFO ] After 994ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 20:07:27] [INFO ] [Nat]Absence check using 31 positive place invariants in 39 ms returned sat
[2023-03-12 20:07:28] [INFO ] After 540ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 20:07:28] [INFO ] After 203ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 20:07:28] [INFO ] After 286ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-12 20:07:28] [INFO ] After 1097ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 994 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 994/994 places, 1864/1864 transitions.
Applied a total of 0 rules in 47 ms. Remains 994 /994 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 994/994 places, 1864/1864 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 994/994 places, 1864/1864 transitions.
Applied a total of 0 rules in 47 ms. Remains 994 /994 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
[2023-03-12 20:07:28] [INFO ] Invariant cache hit.
[2023-03-12 20:07:29] [INFO ] Implicit Places using invariants in 560 ms returned []
[2023-03-12 20:07:29] [INFO ] Invariant cache hit.
[2023-03-12 20:07:29] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 20:07:35] [INFO ] Implicit Places using invariants and state equation in 6100 ms returned []
Implicit Place search using SMT with State Equation took 6662 ms to find 0 implicit places.
[2023-03-12 20:07:35] [INFO ] Redundant transitions in 136 ms returned []
[2023-03-12 20:07:35] [INFO ] Invariant cache hit.
[2023-03-12 20:07:36] [INFO ] Dead Transitions using invariants and state equation in 923 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7779 ms. Remains : 994/994 places, 1864/1864 transitions.
Graph (trivial) has 1798 edges and 994 vertex of which 928 / 994 are part of one of the 30 SCC in 5 ms
Free SCC test removed 898 places
Drop transitions removed 1766 transitions
Reduce isomorphic transitions removed 1766 transitions.
Graph (complete) has 191 edges and 96 vertex of which 8 are kept as prefixes of interest. Removing 88 places using SCC suffix rule.0 ms
Discarding 88 places :
Also discarding 84 output transitions
Drop transitions removed 84 transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 8 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 6 place count 8 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 6 transition count 8
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 6 transition count 8
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 4 transition count 6
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 4 transition count 6
Applied a total of 16 rules in 12 ms. Remains 4 /994 variables (removed 990) and now considering 6/1864 (removed 1858) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 6 rows 4 cols
[2023-03-12 20:07:36] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-12 20:07:36] [INFO ] After 2ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 20:07:36] [INFO ] After 6ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-12 20:07:36] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
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 117 ms. Remains 1262 /1279 variables (removed 17) and now considering 2130/2164 (removed 34) transitions.
// Phase 1: matrix 2130 rows 1262 cols
[2023-03-12 20:07:37] [INFO ] Computed 31 place invariants in 26 ms
[2023-03-12 20:07:38] [INFO ] Implicit Places using invariants in 806 ms returned []
[2023-03-12 20:07:38] [INFO ] Invariant cache hit.
[2023-03-12 20:07:39] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 20:07:46] [INFO ] Implicit Places using invariants and state equation in 8306 ms returned []
Implicit Place search using SMT with State Equation took 9129 ms to find 0 implicit places.
[2023-03-12 20:07:46] [INFO ] Invariant cache hit.
[2023-03-12 20:07:47] [INFO ] Dead Transitions using invariants and state equation in 1299 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 10564 ms. Remains : 1262/1279 places, 2130/2164 transitions.
Stuttering acceptance computed with spot in 465 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 4 ms.
FORMULA CANConstruction-PT-030-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-00 finished in 11144 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 1 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 314 ms. Remains 995 /1279 variables (removed 284) and now considering 1865/2164 (removed 299) transitions.
// Phase 1: matrix 1865 rows 995 cols
[2023-03-12 20:07:48] [INFO ] Computed 31 place invariants in 12 ms
[2023-03-12 20:07:49] [INFO ] Implicit Places using invariants in 966 ms returned []
[2023-03-12 20:07:49] [INFO ] Invariant cache hit.
[2023-03-12 20:07:50] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 20:07:56] [INFO ] Implicit Places using invariants and state equation in 7150 ms returned []
Implicit Place search using SMT with State Equation took 8121 ms to find 0 implicit places.
[2023-03-12 20:07:56] [INFO ] Redundant transitions in 111 ms returned []
[2023-03-12 20:07:56] [INFO ] Invariant cache hit.
[2023-03-12 20:07:57] [INFO ] Dead Transitions using invariants and state equation in 907 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 9467 ms. Remains : 995/1279 places, 1865/2164 transitions.
Stuttering acceptance computed with spot in 162 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 190 steps with 0 reset in 9 ms.
FORMULA CANConstruction-PT-030-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-01 finished in 9681 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 99 ms. Remains 1264 /1279 variables (removed 15) and now considering 2134/2164 (removed 30) transitions.
// Phase 1: matrix 2134 rows 1264 cols
[2023-03-12 20:07:58] [INFO ] Computed 31 place invariants in 24 ms
[2023-03-12 20:07:58] [INFO ] Implicit Places using invariants in 724 ms returned []
[2023-03-12 20:07:58] [INFO ] Invariant cache hit.
[2023-03-12 20:07:59] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 20:08:06] [INFO ] Implicit Places using invariants and state equation in 7225 ms returned []
Implicit Place search using SMT with State Equation took 7954 ms to find 0 implicit places.
[2023-03-12 20:08:06] [INFO ] Invariant cache hit.
[2023-03-12 20:08:06] [INFO ] Dead Transitions using invariants and state equation in 948 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 9011 ms. Remains : 1264/1279 places, 2134/2164 transitions.
Stuttering acceptance computed with spot in 146 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 1388 ms.
Product exploration explored 100000 steps with 50000 reset in 1226 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 203 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 12034 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 118 ms. Remains 1264 /1279 variables (removed 15) and now considering 2134/2164 (removed 30) transitions.
// Phase 1: matrix 2134 rows 1264 cols
[2023-03-12 20:08:10] [INFO ] Computed 31 place invariants in 26 ms
[2023-03-12 20:08:10] [INFO ] Implicit Places using invariants in 706 ms returned []
[2023-03-12 20:08:10] [INFO ] Invariant cache hit.
[2023-03-12 20:08:11] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 20:08:20] [INFO ] Implicit Places using invariants and state equation in 9582 ms returned []
Implicit Place search using SMT with State Equation took 10306 ms to find 0 implicit places.
[2023-03-12 20:08:20] [INFO ] Invariant cache hit.
[2023-03-12 20:08:21] [INFO ] Dead Transitions using invariants and state equation in 1058 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 11498 ms. Remains : 1264/1279 places, 2134/2164 transitions.
Stuttering acceptance computed with spot in 320 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 2 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 11838 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 157 ms. Remains 1263 /1279 variables (removed 16) and now considering 2132/2164 (removed 32) transitions.
// Phase 1: matrix 2132 rows 1263 cols
[2023-03-12 20:08:22] [INFO ] Computed 31 place invariants in 28 ms
[2023-03-12 20:08:22] [INFO ] Implicit Places using invariants in 685 ms returned []
[2023-03-12 20:08:22] [INFO ] Invariant cache hit.
[2023-03-12 20:08:23] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 20:08:30] [INFO ] Implicit Places using invariants and state equation in 8144 ms returned []
Implicit Place search using SMT with State Equation took 8870 ms to find 0 implicit places.
[2023-03-12 20:08:30] [INFO ] Invariant cache hit.
[2023-03-12 20:08:32] [INFO ] Dead Transitions using invariants and state equation in 1235 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 10263 ms. Remains : 1263/1279 places, 2132/2164 transitions.
Stuttering acceptance computed with spot in 133 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 490 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 10438 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 102 ms. Remains 1263 /1279 variables (removed 16) and now considering 2132/2164 (removed 32) transitions.
// Phase 1: matrix 2132 rows 1263 cols
[2023-03-12 20:08:32] [INFO ] Computed 31 place invariants in 21 ms
[2023-03-12 20:08:33] [INFO ] Implicit Places using invariants in 685 ms returned []
[2023-03-12 20:08:33] [INFO ] Invariant cache hit.
[2023-03-12 20:08:33] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 20:08:40] [INFO ] Implicit Places using invariants and state equation in 7293 ms returned []
Implicit Place search using SMT with State Equation took 7988 ms to find 0 implicit places.
[2023-03-12 20:08:40] [INFO ] Invariant cache hit.
[2023-03-12 20:08:41] [INFO ] Dead Transitions using invariants and state equation in 906 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 9005 ms. Remains : 1263/1279 places, 2132/2164 transitions.
Stuttering acceptance computed with spot in 224 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 562 steps with 0 reset in 4 ms.
FORMULA CANConstruction-PT-030-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-05 finished in 9260 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 124 ms. Remains 1262 /1279 variables (removed 17) and now considering 2130/2164 (removed 34) transitions.
// Phase 1: matrix 2130 rows 1262 cols
[2023-03-12 20:08:41] [INFO ] Computed 31 place invariants in 12 ms
[2023-03-12 20:08:42] [INFO ] Implicit Places using invariants in 672 ms returned []
[2023-03-12 20:08:42] [INFO ] Invariant cache hit.
[2023-03-12 20:08:43] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 20:08:50] [INFO ] Implicit Places using invariants and state equation in 8071 ms returned []
Implicit Place search using SMT with State Equation took 8760 ms to find 0 implicit places.
[2023-03-12 20:08:50] [INFO ] Invariant cache hit.
[2023-03-12 20:08:52] [INFO ] Dead Transitions using invariants and state equation in 1614 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 10504 ms. Remains : 1262/1279 places, 2130/2164 transitions.
Stuttering acceptance computed with spot in 115 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 1 ms.
FORMULA CANConstruction-PT-030-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-06 finished in 10642 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 107 ms. Remains 1265 /1279 variables (removed 14) and now considering 2136/2164 (removed 28) transitions.
// Phase 1: matrix 2136 rows 1265 cols
[2023-03-12 20:08:52] [INFO ] Computed 31 place invariants in 16 ms
[2023-03-12 20:08:53] [INFO ] Implicit Places using invariants in 738 ms returned []
[2023-03-12 20:08:53] [INFO ] Invariant cache hit.
[2023-03-12 20:08:53] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 20:08:59] [INFO ] Implicit Places using invariants and state equation in 6869 ms returned []
Implicit Place search using SMT with State Equation took 7621 ms to find 0 implicit places.
[2023-03-12 20:08:59] [INFO ] Invariant cache hit.
[2023-03-12 20:09:00] [INFO ] Dead Transitions using invariants and state equation in 1018 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 8749 ms. Remains : 1265/1279 places, 2136/2164 transitions.
Stuttering acceptance computed with spot in 169 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 2649 steps with 5 reset in 21 ms.
FORMULA CANConstruction-PT-030-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-07 finished in 8978 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 182 ms. Remains 995 /1279 variables (removed 284) and now considering 1864/2164 (removed 300) transitions.
// Phase 1: matrix 1864 rows 995 cols
[2023-03-12 20:09:01] [INFO ] Computed 31 place invariants in 30 ms
[2023-03-12 20:09:02] [INFO ] Implicit Places using invariants in 684 ms returned []
[2023-03-12 20:09:02] [INFO ] Invariant cache hit.
[2023-03-12 20:09:02] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 20:09:08] [INFO ] Implicit Places using invariants and state equation in 6316 ms returned []
Implicit Place search using SMT with State Equation took 7026 ms to find 0 implicit places.
[2023-03-12 20:09:08] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-12 20:09:08] [INFO ] Invariant cache hit.
[2023-03-12 20:09:09] [INFO ] Dead Transitions using invariants and state equation in 1240 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 8501 ms. Remains : 995/1279 places, 1864/2164 transitions.
Stuttering acceptance computed with spot in 85 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 671 steps with 4 reset in 10 ms.
FORMULA CANConstruction-PT-030-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-08 finished in 8618 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 150 ms. Remains 1264 /1279 variables (removed 15) and now considering 2134/2164 (removed 30) transitions.
// Phase 1: matrix 2134 rows 1264 cols
[2023-03-12 20:09:09] [INFO ] Computed 31 place invariants in 23 ms
[2023-03-12 20:09:10] [INFO ] Implicit Places using invariants in 725 ms returned []
[2023-03-12 20:09:10] [INFO ] Invariant cache hit.
[2023-03-12 20:09:11] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 20:09:17] [INFO ] Implicit Places using invariants and state equation in 6928 ms returned []
Implicit Place search using SMT with State Equation took 7660 ms to find 0 implicit places.
[2023-03-12 20:09:17] [INFO ] Invariant cache hit.
[2023-03-12 20:09:18] [INFO ] Dead Transitions using invariants and state equation in 928 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 8741 ms. Remains : 1264/1279 places, 2134/2164 transitions.
Stuttering acceptance computed with spot in 197 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 193 reset in 478 ms.
Product exploration explored 100000 steps with 194 reset in 597 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 (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 313 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) 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
Running SMT prover for 2 properties.
[2023-03-12 20:09:20] [INFO ] Invariant cache hit.
[2023-03-12 20:09:20] [INFO ] [Real]Absence check using 31 positive place invariants in 26 ms returned sat
[2023-03-12 20:09:21] [INFO ] After 788ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-12 20:09:21] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 20:09:22] [INFO ] After 316ms SMT Verify possible using 1770 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 20:09:22] [INFO ] After 1473ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 20:09:22] [INFO ] [Nat]Absence check using 31 positive place invariants in 22 ms returned sat
[2023-03-12 20:09:23] [INFO ] After 749ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 20:09:23] [INFO ] After 291ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 20:09:23] [INFO ] After 608ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 194 ms.
[2023-03-12 20:09:23] [INFO ] After 1835ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 46 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=11 )
Parikh walk visited 2 properties in 7 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 7 factoid took 507 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Support contains 4 out of 1264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1264/1264 places, 2134/2134 transitions.
Applied a total of 0 rules in 77 ms. Remains 1264 /1264 variables (removed 0) and now considering 2134/2134 (removed 0) transitions.
[2023-03-12 20:09:25] [INFO ] Invariant cache hit.
[2023-03-12 20:09:25] [INFO ] Implicit Places using invariants in 705 ms returned []
[2023-03-12 20:09:25] [INFO ] Invariant cache hit.
[2023-03-12 20:09:26] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 20:09:33] [INFO ] Implicit Places using invariants and state equation in 7342 ms returned []
Implicit Place search using SMT with State Equation took 8052 ms to find 0 implicit places.
[2023-03-12 20:09:33] [INFO ] Invariant cache hit.
[2023-03-12 20:09:34] [INFO ] Dead Transitions using invariants and state equation in 1025 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9157 ms. Remains : 1264/1264 places, 2134/2134 transitions.
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 (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 390 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 348 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Finished random walk after 8234 steps, including 15 resets, run visited all 3 properties in 249 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 7 factoid took 620 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 293 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 342 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 362 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 193 reset in 522 ms.
Product exploration explored 100000 steps with 193 reset in 485 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Support contains 4 out of 1264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1264/1264 places, 2134/2134 transitions.
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 1264 transition count 2134
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 31 Pre rules applied. Total rules applied 119 place count 1264 transition count 2134
Deduced a syphon composed of 150 places in 1 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 150 place count 1264 transition count 2134
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 210 place count 1204 transition count 2074
Deduced a syphon composed of 90 places in 24 ms
Iterating global reduction 1 with 60 rules applied. Total rules applied 270 place count 1204 transition count 2074
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 208 places in 1 ms
Iterating global reduction 1 with 118 rules applied. Total rules applied 388 place count 1204 transition count 2074
Discarding 147 places :
Symmetric choice reduction at 1 with 147 rule applications. Total rules 535 place count 1057 transition count 1927
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 1 with 147 rules applied. Total rules applied 682 place count 1057 transition count 1927
Deduced a syphon composed of 61 places in 1 ms
Applied a total of 682 rules in 653 ms. Remains 1057 /1264 variables (removed 207) and now considering 1927/2134 (removed 207) transitions.
[2023-03-12 20:09:39] [INFO ] Redundant transitions in 35 ms returned []
// Phase 1: matrix 1927 rows 1057 cols
[2023-03-12 20:09:39] [INFO ] Computed 31 place invariants in 14 ms
[2023-03-12 20:09:40] [INFO ] Dead Transitions using invariants and state equation in 1472 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1057/1264 places, 1927/2134 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2205 ms. Remains : 1057/1264 places, 1927/2134 transitions.
Support contains 4 out of 1264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1264/1264 places, 2134/2134 transitions.
Applied a total of 0 rules in 85 ms. Remains 1264 /1264 variables (removed 0) and now considering 2134/2134 (removed 0) transitions.
// Phase 1: matrix 2134 rows 1264 cols
[2023-03-12 20:09:40] [INFO ] Computed 31 place invariants in 31 ms
[2023-03-12 20:09:41] [INFO ] Implicit Places using invariants in 1005 ms returned []
[2023-03-12 20:09:41] [INFO ] Invariant cache hit.
[2023-03-12 20:09:42] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 20:09:49] [INFO ] Implicit Places using invariants and state equation in 7490 ms returned []
Implicit Place search using SMT with State Equation took 8526 ms to find 0 implicit places.
[2023-03-12 20:09:49] [INFO ] Invariant cache hit.
[2023-03-12 20:09:50] [INFO ] Dead Transitions using invariants and state equation in 1626 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10241 ms. Remains : 1264/1264 places, 2134/2134 transitions.
Treatment of property CANConstruction-PT-030-LTLFireability-10 finished in 41359 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 171 ms. Remains 1263 /1279 variables (removed 16) and now considering 2132/2164 (removed 32) transitions.
// Phase 1: matrix 2132 rows 1263 cols
[2023-03-12 20:09:51] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-12 20:09:52] [INFO ] Implicit Places using invariants in 938 ms returned []
[2023-03-12 20:09:52] [INFO ] Invariant cache hit.
[2023-03-12 20:09:53] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 20:10:00] [INFO ] Implicit Places using invariants and state equation in 8561 ms returned []
Implicit Place search using SMT with State Equation took 9502 ms to find 0 implicit places.
[2023-03-12 20:10:00] [INFO ] Invariant cache hit.
[2023-03-12 20:10:01] [INFO ] Dead Transitions using invariants and state equation in 1140 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 10815 ms. Remains : 1263/1279 places, 2132/2164 transitions.
Stuttering acceptance computed with spot in 272 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 463 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-030-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-12 finished in 11156 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 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 253 ms. Remains 995 /1279 variables (removed 284) and now considering 1864/2164 (removed 300) transitions.
// Phase 1: matrix 1864 rows 995 cols
[2023-03-12 20:10:02] [INFO ] Computed 31 place invariants in 14 ms
[2023-03-12 20:10:03] [INFO ] Implicit Places using invariants in 819 ms returned []
[2023-03-12 20:10:03] [INFO ] Invariant cache hit.
[2023-03-12 20:10:03] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 20:10:09] [INFO ] Implicit Places using invariants and state equation in 6623 ms returned []
Implicit Place search using SMT with State Equation took 7450 ms to find 0 implicit places.
[2023-03-12 20:10:10] [INFO ] Redundant transitions in 51 ms returned []
[2023-03-12 20:10:10] [INFO ] Invariant cache hit.
[2023-03-12 20:10:10] [INFO ] Dead Transitions using invariants and state equation in 891 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 8662 ms. Remains : 995/1279 places, 1864/2164 transitions.
Stuttering acceptance computed with spot in 123 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 241 steps with 0 reset in 4 ms.
FORMULA CANConstruction-PT-030-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-13 finished in 8814 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 209 ms. Remains 993 /1279 variables (removed 286) and now considering 1861/2164 (removed 303) transitions.
// Phase 1: matrix 1861 rows 993 cols
[2023-03-12 20:10:11] [INFO ] Computed 31 place invariants in 8 ms
[2023-03-12 20:10:11] [INFO ] Implicit Places using invariants in 618 ms returned []
[2023-03-12 20:10:11] [INFO ] Invariant cache hit.
[2023-03-12 20:10:12] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 20:10:18] [INFO ] Implicit Places using invariants and state equation in 6495 ms returned []
Implicit Place search using SMT with State Equation took 7116 ms to find 0 implicit places.
[2023-03-12 20:10:18] [INFO ] Redundant transitions in 60 ms returned []
[2023-03-12 20:10:18] [INFO ] Invariant cache hit.
[2023-03-12 20:10:19] [INFO ] Dead Transitions using invariants and state equation in 880 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 8296 ms. Remains : 993/1279 places, 1861/2164 transitions.
Stuttering acceptance computed with spot in 46 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 386 steps with 2 reset in 3 ms.
FORMULA CANConstruction-PT-030-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-14 finished in 8366 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 0 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 0 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 175 ms. Remains 995 /1279 variables (removed 284) and now considering 1864/2164 (removed 300) transitions.
// Phase 1: matrix 1864 rows 995 cols
[2023-03-12 20:10:19] [INFO ] Computed 31 place invariants in 14 ms
[2023-03-12 20:10:20] [INFO ] Implicit Places using invariants in 697 ms returned []
[2023-03-12 20:10:20] [INFO ] Invariant cache hit.
[2023-03-12 20:10:20] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 20:10:30] [INFO ] Implicit Places using invariants and state equation in 10015 ms returned []
Implicit Place search using SMT with State Equation took 10734 ms to find 0 implicit places.
[2023-03-12 20:10:30] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-12 20:10:30] [INFO ] Invariant cache hit.
[2023-03-12 20:10:31] [INFO ] Dead Transitions using invariants and state equation in 1237 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 12206 ms. Remains : 995/1279 places, 1864/2164 transitions.
Stuttering acceptance computed with spot in 90 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 480 reset in 654 ms.
Stack based approach found an accepted trace after 5554 steps with 25 reset with depth 263 and stack size 263 in 37 ms.
FORMULA CANConstruction-PT-030-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-15 finished in 13011 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))))))'
Found a Lengthening insensitive property : CANConstruction-PT-030-LTLFireability-10
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Support contains 4 out of 1279 places. Attempting structural reductions.
Starting structural reductions in LI_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 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 465 place count 1039 transition count 1909
Iterating global reduction 2 with 15 rules applied. Total rules applied 480 place count 1039 transition count 1909
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 492 place count 1039 transition count 1897
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 504 place count 1027 transition count 1897
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 566 place count 996 transition count 1866
Applied a total of 566 rules in 241 ms. Remains 996 /1279 variables (removed 283) and now considering 1866/2164 (removed 298) transitions.
// Phase 1: matrix 1866 rows 996 cols
[2023-03-12 20:10:33] [INFO ] Computed 31 place invariants in 24 ms
[2023-03-12 20:10:33] [INFO ] Implicit Places using invariants in 856 ms returned []
[2023-03-12 20:10:33] [INFO ] Invariant cache hit.
[2023-03-12 20:10:34] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 20:10:40] [INFO ] Implicit Places using invariants and state equation in 6611 ms returned []
Implicit Place search using SMT with State Equation took 7482 ms to find 0 implicit places.
[2023-03-12 20:10:40] [INFO ] Invariant cache hit.
[2023-03-12 20:10:41] [INFO ] Dead Transitions using invariants and state equation in 1064 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 996/1279 places, 1866/2164 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 8802 ms. Remains : 996/1279 places, 1866/2164 transitions.
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 s484 1), p1:(AND (GEQ s10 1) (GEQ s51 1)), p2:(LT s607 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 493 reset in 557 ms.
Product exploration explored 100000 steps with 493 reset in 552 ms.
Computed a total of 31 stabilizing places and 60 stable transitions
Computed a total of 31 stabilizing places and 60 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 452 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Finished random walk after 4663 steps, including 22 resets, run visited all 3 properties in 83 ms. (steps per millisecond=56 )
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 7 factoid took 455 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Support contains 4 out of 996 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 996/996 places, 1866/1866 transitions.
Applied a total of 0 rules in 41 ms. Remains 996 /996 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
[2023-03-12 20:10:44] [INFO ] Invariant cache hit.
[2023-03-12 20:10:45] [INFO ] Implicit Places using invariants in 659 ms returned []
[2023-03-12 20:10:45] [INFO ] Invariant cache hit.
[2023-03-12 20:10:45] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-12 20:10:51] [INFO ] Implicit Places using invariants and state equation in 6357 ms returned []
Implicit Place search using SMT with State Equation took 7025 ms to find 0 implicit places.
[2023-03-12 20:10:51] [INFO ] Invariant cache hit.
[2023-03-12 20:10:52] [INFO ] Dead Transitions using invariants and state equation in 943 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8011 ms. Remains : 996/996 places, 1866/1866 transitions.
Computed a total of 31 stabilizing places and 60 stable transitions
Computed a total of 31 stabilizing places and 60 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 383 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Finished random walk after 2659 steps, including 12 resets, run visited all 3 properties in 79 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 7 factoid took 317 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 487 reset in 586 ms.
Stack based approach found an accepted trace after 10096 steps with 50 reset with depth 251 and stack size 251 in 57 ms.
Treatment of property CANConstruction-PT-030-LTLFireability-10 finished in 22279 ms.
FORMULA CANConstruction-PT-030-LTLFireability-10 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-12 20:10:54] [INFO ] Flatten gal took : 56 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 234341 ms.
ITS solved all properties within timeout

BK_STOP 1678651855036

--------------------
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="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is 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 r041-tajo-167813695000636"
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 ;