Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r265-smll-167863539900332.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is NoC3x3-PT-7B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863539900332
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 8.0K Feb 26 09:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 26 09:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 09:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 09:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 09:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 09:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 130K Feb 26 09:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 2.0M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678962313701

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=NoC3x3-PT-7B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-16 10:25:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-16 10:25:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 10:25:16] [INFO ] Load time of PNML (sax parser for PT used): 502 ms
[2023-03-16 10:25:16] [INFO ] Transformed 7014 places.
[2023-03-16 10:25:16] [INFO ] Transformed 8833 transitions.
[2023-03-16 10:25:16] [INFO ] Found NUPN structural information;
[2023-03-16 10:25:17] [INFO ] Parsed PT model containing 7014 places and 8833 transitions and 19619 arcs in 814 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA NoC3x3-PT-7B-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7B-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 7014 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7014/7014 places, 8833/8833 transitions.
Discarding 1857 places :
Symmetric choice reduction at 0 with 1857 rule applications. Total rules 1857 place count 5157 transition count 6976
Iterating global reduction 0 with 1857 rules applied. Total rules applied 3714 place count 5157 transition count 6976
Discarding 491 places :
Symmetric choice reduction at 0 with 491 rule applications. Total rules 4205 place count 4666 transition count 6485
Iterating global reduction 0 with 491 rules applied. Total rules applied 4696 place count 4666 transition count 6485
Discarding 82 places :
Symmetric choice reduction at 0 with 82 rule applications. Total rules 4778 place count 4584 transition count 6321
Iterating global reduction 0 with 82 rules applied. Total rules applied 4860 place count 4584 transition count 6321
Discarding 82 places :
Symmetric choice reduction at 0 with 82 rule applications. Total rules 4942 place count 4502 transition count 6239
Iterating global reduction 0 with 82 rules applied. Total rules applied 5024 place count 4502 transition count 6239
Discarding 82 places :
Symmetric choice reduction at 0 with 82 rule applications. Total rules 5106 place count 4420 transition count 6157
Iterating global reduction 0 with 82 rules applied. Total rules applied 5188 place count 4420 transition count 6157
Discarding 82 places :
Symmetric choice reduction at 0 with 82 rule applications. Total rules 5270 place count 4338 transition count 6030
Iterating global reduction 0 with 82 rules applied. Total rules applied 5352 place count 4338 transition count 6030
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 5432 place count 4258 transition count 5870
Iterating global reduction 0 with 80 rules applied. Total rules applied 5512 place count 4258 transition count 5870
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 5530 place count 4258 transition count 5852
Applied a total of 5530 rules in 6513 ms. Remains 4258 /7014 variables (removed 2756) and now considering 5852/8833 (removed 2981) transitions.
// Phase 1: matrix 5852 rows 4258 cols
[2023-03-16 10:25:24] [INFO ] Computed 66 place invariants in 83 ms
[2023-03-16 10:25:26] [INFO ] Implicit Places using invariants in 2103 ms returned []
[2023-03-16 10:25:26] [INFO ] Invariant cache hit.
[2023-03-16 10:25:27] [INFO ] Implicit Places using invariants and state equation in 1407 ms returned []
Implicit Place search using SMT with State Equation took 3572 ms to find 0 implicit places.
[2023-03-16 10:25:27] [INFO ] Invariant cache hit.
[2023-03-16 10:25:35] [INFO ] Dead Transitions using invariants and state equation in 7738 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4258/7014 places, 5852/8833 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17834 ms. Remains : 4258/7014 places, 5852/8833 transitions.
Support contains 32 out of 4258 places after structural reductions.
[2023-03-16 10:25:36] [INFO ] Flatten gal took : 448 ms
[2023-03-16 10:25:36] [INFO ] Flatten gal took : 239 ms
[2023-03-16 10:25:37] [INFO ] Input system was already deterministic with 5852 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 740 ms. (steps per millisecond=13 ) properties (out of 27) seen :9
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-16 10:25:38] [INFO ] Invariant cache hit.
[2023-03-16 10:25:40] [INFO ] [Real]Absence check using 66 positive place invariants in 75 ms returned sat
[2023-03-16 10:25:40] [INFO ] After 2500ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-16 10:25:42] [INFO ] [Nat]Absence check using 66 positive place invariants in 80 ms returned sat
[2023-03-16 10:25:52] [INFO ] After 8100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-03-16 10:25:52] [INFO ] Deduced a trap composed of 112 places in 285 ms of which 5 ms to minimize.
[2023-03-16 10:25:53] [INFO ] Deduced a trap composed of 146 places in 357 ms of which 15 ms to minimize.
[2023-03-16 10:25:53] [INFO ] Deduced a trap composed of 114 places in 198 ms of which 2 ms to minimize.
[2023-03-16 10:25:53] [INFO ] Deduced a trap composed of 137 places in 136 ms of which 2 ms to minimize.
[2023-03-16 10:25:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2187 ms
[2023-03-16 10:26:01] [INFO ] After 17354ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 3951 ms.
[2023-03-16 10:26:05] [INFO ] After 24582ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Fused 18 Parikh solutions to 7 different solutions.
Finished Parikh walk after 2625 steps, including 1 resets, run visited all 1 properties in 19 ms. (steps per millisecond=138 )
Parikh walk visited 18 properties in 498 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 65 stabilizing places and 65 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((G(p0)||F(p1)))))'
Support contains 3 out of 4258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4258/4258 places, 5852/5852 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 4245 transition count 5837
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 4245 transition count 5837
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 4239 transition count 5828
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 4239 transition count 5828
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 4239 transition count 5827
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 4235 transition count 5823
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 4235 transition count 5823
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 51 place count 4231 transition count 5816
Iterating global reduction 1 with 4 rules applied. Total rules applied 55 place count 4231 transition count 5816
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 59 place count 4227 transition count 5810
Iterating global reduction 1 with 4 rules applied. Total rules applied 63 place count 4227 transition count 5810
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 4225 transition count 5806
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 4225 transition count 5806
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 68 place count 4225 transition count 5805
Applied a total of 68 rules in 3809 ms. Remains 4225 /4258 variables (removed 33) and now considering 5805/5852 (removed 47) transitions.
// Phase 1: matrix 5805 rows 4225 cols
[2023-03-16 10:26:10] [INFO ] Computed 66 place invariants in 34 ms
[2023-03-16 10:26:11] [INFO ] Implicit Places using invariants in 1529 ms returned []
[2023-03-16 10:26:11] [INFO ] Invariant cache hit.
[2023-03-16 10:26:12] [INFO ] Implicit Places using invariants and state equation in 1303 ms returned []
Implicit Place search using SMT with State Equation took 2835 ms to find 0 implicit places.
[2023-03-16 10:26:12] [INFO ] Invariant cache hit.
[2023-03-16 10:26:20] [INFO ] Dead Transitions using invariants and state equation in 7456 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4225/4258 places, 5805/5852 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14106 ms. Remains : 4225/4258 places, 5805/5852 transitions.
Stuttering acceptance computed with spot in 322 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(OR (EQ s1223 1) (EQ s3757 1)), p0:(EQ s1769 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, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 3101 steps with 0 reset in 56 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-00 finished in 14606 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||X(X(G(p1)))))))'
Support contains 3 out of 4258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4258/4258 places, 5852/5852 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 4243 transition count 5835
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 4243 transition count 5835
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 4236 transition count 5825
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 4236 transition count 5825
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 4232 transition count 5821
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 4232 transition count 5821
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 4228 transition count 5814
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 4228 transition count 5814
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 64 place count 4224 transition count 5808
Iterating global reduction 0 with 4 rules applied. Total rules applied 68 place count 4224 transition count 5808
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 4223 transition count 5806
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 4223 transition count 5806
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 71 place count 4223 transition count 5805
Applied a total of 71 rules in 3673 ms. Remains 4223 /4258 variables (removed 35) and now considering 5805/5852 (removed 47) transitions.
// Phase 1: matrix 5805 rows 4223 cols
[2023-03-16 10:26:24] [INFO ] Computed 66 place invariants in 26 ms
[2023-03-16 10:26:25] [INFO ] Implicit Places using invariants in 1329 ms returned []
[2023-03-16 10:26:25] [INFO ] Invariant cache hit.
[2023-03-16 10:26:27] [INFO ] Implicit Places using invariants and state equation in 1399 ms returned []
Implicit Place search using SMT with State Equation took 2732 ms to find 0 implicit places.
[2023-03-16 10:26:27] [INFO ] Invariant cache hit.
[2023-03-16 10:26:34] [INFO ] Dead Transitions using invariants and state equation in 7630 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4223/4258 places, 5805/5852 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14038 ms. Remains : 4223/4258 places, 5805/5852 transitions.
Stuttering acceptance computed with spot in 230 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-01 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}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}]], initial=2, aps=[p0:(OR (EQ s1944 1) (EQ s1786 1)), p1:(EQ s3934 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, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1744 steps with 0 reset in 24 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-01 finished in 14345 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 4258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4258/4258 places, 5852/5852 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 4242 transition count 5834
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 4242 transition count 5834
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 4234 transition count 5822
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 4234 transition count 5822
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 4234 transition count 5821
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 53 place count 4230 transition count 5817
Iterating global reduction 1 with 4 rules applied. Total rules applied 57 place count 4230 transition count 5817
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 61 place count 4226 transition count 5810
Iterating global reduction 1 with 4 rules applied. Total rules applied 65 place count 4226 transition count 5810
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 69 place count 4222 transition count 5804
Iterating global reduction 1 with 4 rules applied. Total rules applied 73 place count 4222 transition count 5804
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 4220 transition count 5800
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 4220 transition count 5800
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 78 place count 4220 transition count 5799
Applied a total of 78 rules in 3723 ms. Remains 4220 /4258 variables (removed 38) and now considering 5799/5852 (removed 53) transitions.
// Phase 1: matrix 5799 rows 4220 cols
[2023-03-16 10:26:38] [INFO ] Computed 66 place invariants in 23 ms
[2023-03-16 10:26:40] [INFO ] Implicit Places using invariants in 1412 ms returned []
[2023-03-16 10:26:40] [INFO ] Invariant cache hit.
[2023-03-16 10:26:41] [INFO ] Implicit Places using invariants and state equation in 1406 ms returned []
Implicit Place search using SMT with State Equation took 2822 ms to find 0 implicit places.
[2023-03-16 10:26:41] [INFO ] Invariant cache hit.
[2023-03-16 10:26:49] [INFO ] Dead Transitions using invariants and state equation in 7488 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4220/4258 places, 5799/5852 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14046 ms. Remains : 4220/4258 places, 5799/5852 transitions.
Stuttering acceptance computed with spot in 286 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-02 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: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(EQ s2670 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 39 reset in 712 ms.
Product exploration explored 100000 steps with 36 reset in 771 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 109 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 343912 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :{}
Probabilistic random walk after 343912 steps, saw 332376 distinct states, run finished after 3002 ms. (steps per millisecond=114 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 10:26:54] [INFO ] Invariant cache hit.
[2023-03-16 10:26:55] [INFO ] After 596ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 10:26:55] [INFO ] [Nat]Absence check using 66 positive place invariants in 72 ms returned sat
[2023-03-16 10:26:59] [INFO ] After 3958ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 10:27:00] [INFO ] Deduced a trap composed of 112 places in 248 ms of which 1 ms to minimize.
[2023-03-16 10:27:00] [INFO ] Deduced a trap composed of 159 places in 202 ms of which 0 ms to minimize.
[2023-03-16 10:27:01] [INFO ] Deduced a trap composed of 138 places in 131 ms of which 2 ms to minimize.
[2023-03-16 10:27:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1451 ms
[2023-03-16 10:27:01] [INFO ] After 5559ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 217 ms.
[2023-03-16 10:27:01] [INFO ] After 6550ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 792 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=88 )
Parikh walk visited 1 properties in 10 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 4220 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4220/4220 places, 5799/5799 transitions.
Applied a total of 0 rules in 489 ms. Remains 4220 /4220 variables (removed 0) and now considering 5799/5799 (removed 0) transitions.
[2023-03-16 10:27:02] [INFO ] Invariant cache hit.
[2023-03-16 10:27:04] [INFO ] Implicit Places using invariants in 1401 ms returned []
[2023-03-16 10:27:04] [INFO ] Invariant cache hit.
[2023-03-16 10:27:05] [INFO ] Implicit Places using invariants and state equation in 1540 ms returned []
Implicit Place search using SMT with State Equation took 2943 ms to find 0 implicit places.
[2023-03-16 10:27:05] [INFO ] Invariant cache hit.
[2023-03-16 10:27:13] [INFO ] Dead Transitions using invariants and state equation in 7990 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11424 ms. Remains : 4220/4220 places, 5799/5799 transitions.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 361642 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :{}
Probabilistic random walk after 361642 steps, saw 349508 distinct states, run finished after 3001 ms. (steps per millisecond=120 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 10:27:17] [INFO ] Invariant cache hit.
[2023-03-16 10:27:17] [INFO ] After 663ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 10:27:18] [INFO ] [Nat]Absence check using 66 positive place invariants in 79 ms returned sat
[2023-03-16 10:27:22] [INFO ] After 4225ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 10:27:23] [INFO ] Deduced a trap composed of 112 places in 254 ms of which 1 ms to minimize.
[2023-03-16 10:27:23] [INFO ] Deduced a trap composed of 159 places in 177 ms of which 1 ms to minimize.
[2023-03-16 10:27:24] [INFO ] Deduced a trap composed of 138 places in 119 ms of which 1 ms to minimize.
[2023-03-16 10:27:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1409 ms
[2023-03-16 10:27:24] [INFO ] After 5787ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 211 ms.
[2023-03-16 10:27:24] [INFO ] After 6800ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 848 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=121 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 114 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 37 reset in 486 ms.
Entered a terminal (fully accepting) state of product in 58164 steps with 21 reset in 321 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-02 finished in 51010 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||(p1 U p2))))'
Support contains 4 out of 4258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4258/4258 places, 5852/5852 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 4244 transition count 5837
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 4244 transition count 5837
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 4237 transition count 5826
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 4237 transition count 5826
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 4237 transition count 5825
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 46 place count 4234 transition count 5822
Iterating global reduction 1 with 3 rules applied. Total rules applied 49 place count 4234 transition count 5822
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 4231 transition count 5819
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 4231 transition count 5819
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 4228 transition count 5815
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 4228 transition count 5815
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 4226 transition count 5811
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 4226 transition count 5811
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 4226 transition count 5810
Applied a total of 66 rules in 3700 ms. Remains 4226 /4258 variables (removed 32) and now considering 5810/5852 (removed 42) transitions.
// Phase 1: matrix 5810 rows 4226 cols
[2023-03-16 10:27:29] [INFO ] Computed 66 place invariants in 22 ms
[2023-03-16 10:27:31] [INFO ] Implicit Places using invariants in 1428 ms returned []
[2023-03-16 10:27:31] [INFO ] Invariant cache hit.
[2023-03-16 10:27:32] [INFO ] Implicit Places using invariants and state equation in 1427 ms returned []
Implicit Place search using SMT with State Equation took 2860 ms to find 0 implicit places.
[2023-03-16 10:27:32] [INFO ] Invariant cache hit.
[2023-03-16 10:27:38] [INFO ] Dead Transitions using invariants and state equation in 5660 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4226/4258 places, 5810/5852 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12240 ms. Remains : 4226/4258 places, 5810/5852 transitions.
Stuttering acceptance computed with spot in 245 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(EQ s271 1), p1:(AND (EQ s1838 1) (EQ s2142 1)), p0:(EQ s3322 0)], 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, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8325 steps with 2 reset in 45 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-04 finished in 12577 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)&&(p1||G(F(p0))))||G(p1))))'
Support contains 2 out of 4258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4258/4258 places, 5852/5852 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 4243 transition count 5835
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 4243 transition count 5835
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 4235 transition count 5823
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 4235 transition count 5823
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 4235 transition count 5822
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 51 place count 4231 transition count 5818
Iterating global reduction 1 with 4 rules applied. Total rules applied 55 place count 4231 transition count 5818
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 59 place count 4227 transition count 5811
Iterating global reduction 1 with 4 rules applied. Total rules applied 63 place count 4227 transition count 5811
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 67 place count 4223 transition count 5805
Iterating global reduction 1 with 4 rules applied. Total rules applied 71 place count 4223 transition count 5805
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 73 place count 4221 transition count 5801
Iterating global reduction 1 with 2 rules applied. Total rules applied 75 place count 4221 transition count 5801
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 76 place count 4221 transition count 5800
Applied a total of 76 rules in 3688 ms. Remains 4221 /4258 variables (removed 37) and now considering 5800/5852 (removed 52) transitions.
// Phase 1: matrix 5800 rows 4221 cols
[2023-03-16 10:27:42] [INFO ] Computed 66 place invariants in 19 ms
[2023-03-16 10:27:43] [INFO ] Implicit Places using invariants in 1471 ms returned []
[2023-03-16 10:27:43] [INFO ] Invariant cache hit.
[2023-03-16 10:27:45] [INFO ] Implicit Places using invariants and state equation in 1527 ms returned []
Implicit Place search using SMT with State Equation took 3006 ms to find 0 implicit places.
[2023-03-16 10:27:45] [INFO ] Invariant cache hit.
[2023-03-16 10:27:52] [INFO ] Dead Transitions using invariants and state equation in 7434 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4221/4258 places, 5800/5852 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14129 ms. Remains : 4221/4258 places, 5800/5852 transitions.
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s1445 1), p0:(NEQ s2782 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]]
Product exploration explored 100000 steps with 50000 reset in 4366 ms.
Product exploration explored 100000 steps with 50000 reset in 4528 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT (AND p1 (NOT p0)))), true, (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p1 (NOT p0))))
Knowledge based reduction with 8 factoid took 174 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-7B-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-7B-LTLFireability-05 finished in 23518 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||F((p1 U (p2||G(p1)))))))'
Support contains 4 out of 4258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4258/4258 places, 5852/5852 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 4244 transition count 5836
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 4244 transition count 5836
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 4236 transition count 5824
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 4236 transition count 5824
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 4236 transition count 5823
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 49 place count 4232 transition count 5819
Iterating global reduction 1 with 4 rules applied. Total rules applied 53 place count 4232 transition count 5819
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 57 place count 4228 transition count 5812
Iterating global reduction 1 with 4 rules applied. Total rules applied 61 place count 4228 transition count 5812
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 65 place count 4224 transition count 5806
Iterating global reduction 1 with 4 rules applied. Total rules applied 69 place count 4224 transition count 5806
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 4222 transition count 5802
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 4222 transition count 5802
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 74 place count 4222 transition count 5801
Applied a total of 74 rules in 3694 ms. Remains 4222 /4258 variables (removed 36) and now considering 5801/5852 (removed 51) transitions.
// Phase 1: matrix 5801 rows 4222 cols
[2023-03-16 10:28:05] [INFO ] Computed 66 place invariants in 18 ms
[2023-03-16 10:28:07] [INFO ] Implicit Places using invariants in 1268 ms returned []
[2023-03-16 10:28:07] [INFO ] Invariant cache hit.
[2023-03-16 10:28:08] [INFO ] Implicit Places using invariants and state equation in 1379 ms returned []
Implicit Place search using SMT with State Equation took 2649 ms to find 0 implicit places.
[2023-03-16 10:28:08] [INFO ] Invariant cache hit.
[2023-03-16 10:28:15] [INFO ] Dead Transitions using invariants and state equation in 6740 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4222/4258 places, 5801/5852 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13088 ms. Remains : 4222/4258 places, 5801/5852 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (NEQ s3312 1) (NEQ s3517 1)), p1:(NEQ s3517 1), p0:(AND (EQ s438 1) (EQ s645 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 4509 ms.
Product exploration explored 100000 steps with 50000 reset in 4535 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 4 factoid took 158 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-7B-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-7B-LTLFireability-06 finished in 22540 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))))'
Support contains 3 out of 4258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4258/4258 places, 5852/5852 transitions.
Graph (trivial) has 5150 edges and 4258 vertex of which 3163 / 4258 are part of one of the 32 SCC in 13 ms
Free SCC test removed 3131 places
Ensure Unique test removed 4221 transitions
Reduce isomorphic transitions removed 4221 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 1126 transition count 1596
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 56 rules applied. Total rules applied 91 place count 1092 transition count 1574
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 15 rules applied. Total rules applied 106 place count 1078 transition count 1573
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 107 place count 1077 transition count 1573
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 55 Pre rules applied. Total rules applied 107 place count 1077 transition count 1518
Deduced a syphon composed of 55 places in 4 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 4 with 110 rules applied. Total rules applied 217 place count 1022 transition count 1518
Discarding 270 places :
Symmetric choice reduction at 4 with 270 rule applications. Total rules 487 place count 752 transition count 1110
Iterating global reduction 4 with 270 rules applied. Total rules applied 757 place count 752 transition count 1110
Discarding 197 places :
Symmetric choice reduction at 4 with 197 rule applications. Total rules 954 place count 555 transition count 870
Iterating global reduction 4 with 197 rules applied. Total rules applied 1151 place count 555 transition count 870
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 197 transitions.
Iterating post reduction 4 with 197 rules applied. Total rules applied 1348 place count 555 transition count 673
Performed 151 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 151 places in 0 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 5 with 302 rules applied. Total rules applied 1650 place count 404 transition count 515
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1653 place count 404 transition count 512
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 1661 place count 400 transition count 508
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1663 place count 400 transition count 506
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1667 place count 398 transition count 504
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1668 place count 398 transition count 503
Performed 10 Post agglomeration using F-continuation condition with reduction of 33 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 20 rules applied. Total rules applied 1688 place count 388 transition count 547
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 8 with 39 rules applied. Total rules applied 1727 place count 388 transition count 508
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1729 place count 387 transition count 527
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 1744 place count 387 transition count 512
Applied a total of 1744 rules in 383 ms. Remains 387 /4258 variables (removed 3871) and now considering 512/5852 (removed 5340) transitions.
[2023-03-16 10:28:25] [INFO ] Flow matrix only has 481 transitions (discarded 31 similar events)
// Phase 1: matrix 481 rows 387 cols
[2023-03-16 10:28:25] [INFO ] Computed 66 place invariants in 3 ms
[2023-03-16 10:28:25] [INFO ] Implicit Places using invariants in 288 ms returned [10, 44, 87, 124, 179, 241, 287, 324, 367]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 292 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 378/4258 places, 512/5852 transitions.
Graph (trivial) has 260 edges and 378 vertex of which 46 / 378 are part of one of the 23 SCC in 0 ms
Free SCC test removed 23 places
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 354 transition count 465
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 354 transition count 463
Applied a total of 5 rules in 27 ms. Remains 354 /378 variables (removed 24) and now considering 463/512 (removed 49) transitions.
[2023-03-16 10:28:25] [INFO ] Flow matrix only has 432 transitions (discarded 31 similar events)
// Phase 1: matrix 432 rows 354 cols
[2023-03-16 10:28:25] [INFO ] Computed 57 place invariants in 1 ms
[2023-03-16 10:28:25] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-03-16 10:28:25] [INFO ] Flow matrix only has 432 transitions (discarded 31 similar events)
[2023-03-16 10:28:25] [INFO ] Invariant cache hit.
[2023-03-16 10:28:26] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-16 10:28:26] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 830 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 354/4258 places, 463/5852 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1534 ms. Remains : 354/4258 places, 463/5852 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(EQ s90 0), p0:(AND (EQ s59 1) (EQ s231 1) (EQ s90 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 420 steps with 5 reset in 6 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-07 finished in 1646 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||X(F((p0&&F(p1)))))))))'
Support contains 1 out of 4258 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 4258/4258 places, 5852/5852 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 4244 transition count 5836
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 4244 transition count 5836
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 4237 transition count 5826
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 4237 transition count 5826
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 4237 transition count 5825
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 46 place count 4234 transition count 5822
Iterating global reduction 1 with 3 rules applied. Total rules applied 49 place count 4234 transition count 5822
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 4231 transition count 5816
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 4231 transition count 5816
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 4228 transition count 5811
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 4228 transition count 5811
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 4227 transition count 5809
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 4227 transition count 5809
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 4227 transition count 5808
Applied a total of 64 rules in 3712 ms. Remains 4227 /4258 variables (removed 31) and now considering 5808/5852 (removed 44) transitions.
// Phase 1: matrix 5808 rows 4227 cols
[2023-03-16 10:28:30] [INFO ] Computed 66 place invariants in 18 ms
[2023-03-16 10:28:31] [INFO ] Implicit Places using invariants in 1398 ms returned []
[2023-03-16 10:28:31] [INFO ] Invariant cache hit.
[2023-03-16 10:28:33] [INFO ] Implicit Places using invariants and state equation in 1522 ms returned []
Implicit Place search using SMT with State Equation took 2922 ms to find 0 implicit places.
[2023-03-16 10:28:33] [INFO ] Invariant cache hit.
[2023-03-16 10:28:38] [INFO ] Dead Transitions using invariants and state equation in 5737 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4227/4258 places, 5808/5852 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12376 ms. Remains : 4227/4258 places, 5808/5852 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s1885 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 2825 steps with 0 reset in 18 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-08 finished in 12548 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)&&F(G(p1)))))'
Support contains 2 out of 4258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4258/4258 places, 5852/5852 transitions.
Graph (trivial) has 5153 edges and 4258 vertex of which 3166 / 4258 are part of one of the 32 SCC in 5 ms
Free SCC test removed 3134 places
Ensure Unique test removed 4225 transitions
Reduce isomorphic transitions removed 4225 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 1123 transition count 1599
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 41 rules applied. Total rules applied 69 place count 1096 transition count 1585
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 with 12 rules applied. Total rules applied 81 place count 1087 transition count 1582
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 84 place count 1085 transition count 1581
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 85 place count 1084 transition count 1581
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 57 Pre rules applied. Total rules applied 85 place count 1084 transition count 1524
Deduced a syphon composed of 57 places in 4 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 5 with 114 rules applied. Total rules applied 199 place count 1027 transition count 1524
Discarding 266 places :
Symmetric choice reduction at 5 with 266 rule applications. Total rules 465 place count 761 transition count 1120
Iterating global reduction 5 with 266 rules applied. Total rules applied 731 place count 761 transition count 1120
Discarding 193 places :
Symmetric choice reduction at 5 with 193 rule applications. Total rules 924 place count 568 transition count 884
Iterating global reduction 5 with 193 rules applied. Total rules applied 1117 place count 568 transition count 884
Ensure Unique test removed 193 transitions
Reduce isomorphic transitions removed 193 transitions.
Iterating post reduction 5 with 193 rules applied. Total rules applied 1310 place count 568 transition count 691
Performed 158 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 158 places in 1 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 6 with 316 rules applied. Total rules applied 1626 place count 410 transition count 527
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1628 place count 410 transition count 525
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1629 place count 409 transition count 524
Iterating global reduction 7 with 1 rules applied. Total rules applied 1630 place count 409 transition count 524
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1634 place count 407 transition count 522
Performed 16 Post agglomeration using F-continuation condition with reduction of 60 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 1666 place count 391 transition count 554
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 7 with 32 rules applied. Total rules applied 1698 place count 391 transition count 522
Drop transitions removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 8 with 25 rules applied. Total rules applied 1723 place count 391 transition count 497
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1725 place count 390 transition count 514
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1726 place count 390 transition count 513
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1727 place count 390 transition count 513
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1728 place count 389 transition count 512
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 269 edges and 380 vertex of which 48 / 380 are part of one of the 24 SCC in 0 ms
Free SCC test removed 24 places
Iterating post reduction 8 with 10 rules applied. Total rules applied 1738 place count 356 transition count 512
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 9 with 48 rules applied. Total rules applied 1786 place count 356 transition count 464
Applied a total of 1786 rules in 280 ms. Remains 356 /4258 variables (removed 3902) and now considering 464/5852 (removed 5388) transitions.
[2023-03-16 10:28:39] [INFO ] Flow matrix only has 433 transitions (discarded 31 similar events)
// Phase 1: matrix 433 rows 356 cols
[2023-03-16 10:28:39] [INFO ] Computed 57 place invariants in 1 ms
[2023-03-16 10:28:39] [INFO ] Implicit Places using invariants in 308 ms returned []
[2023-03-16 10:28:39] [INFO ] Flow matrix only has 433 transitions (discarded 31 similar events)
[2023-03-16 10:28:39] [INFO ] Invariant cache hit.
[2023-03-16 10:28:39] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-16 10:28:40] [INFO ] Implicit Places using invariants and state equation in 644 ms returned []
Implicit Place search using SMT with State Equation took 955 ms to find 0 implicit places.
[2023-03-16 10:28:40] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-16 10:28:40] [INFO ] Flow matrix only has 433 transitions (discarded 31 similar events)
[2023-03-16 10:28:40] [INFO ] Invariant cache hit.
[2023-03-16 10:28:40] [INFO ] Dead Transitions using invariants and state equation in 474 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 356/4258 places, 464/5852 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1776 ms. Remains : 356/4258 places, 464/5852 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s276 1), p1:(EQ s253 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-09 finished in 1910 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)))'
Support contains 1 out of 4258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4258/4258 places, 5852/5852 transitions.
Graph (trivial) has 5154 edges and 4258 vertex of which 3262 / 4258 are part of one of the 33 SCC in 2 ms
Free SCC test removed 3229 places
Ensure Unique test removed 4354 transitions
Reduce isomorphic transitions removed 4354 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 1028 transition count 1493
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 1024 transition count 1491
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 1023 transition count 1491
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 12 place count 1023 transition count 1454
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 86 place count 986 transition count 1454
Discarding 275 places :
Symmetric choice reduction at 3 with 275 rule applications. Total rules 361 place count 711 transition count 1041
Iterating global reduction 3 with 275 rules applied. Total rules applied 636 place count 711 transition count 1041
Discarding 201 places :
Symmetric choice reduction at 3 with 201 rule applications. Total rules 837 place count 510 transition count 797
Iterating global reduction 3 with 201 rules applied. Total rules applied 1038 place count 510 transition count 797
Ensure Unique test removed 201 transitions
Reduce isomorphic transitions removed 201 transitions.
Iterating post reduction 3 with 201 rules applied. Total rules applied 1239 place count 510 transition count 596
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 4 with 258 rules applied. Total rules applied 1497 place count 381 transition count 467
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1498 place count 380 transition count 466
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 266 edges and 371 vertex of which 48 / 371 are part of one of the 24 SCC in 0 ms
Free SCC test removed 24 places
Iterating post reduction 4 with 10 rules applied. Total rules applied 1508 place count 347 transition count 466
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 1556 place count 347 transition count 418
Applied a total of 1556 rules in 146 ms. Remains 347 /4258 variables (removed 3911) and now considering 418/5852 (removed 5434) transitions.
[2023-03-16 10:28:41] [INFO ] Flow matrix only has 386 transitions (discarded 32 similar events)
// Phase 1: matrix 386 rows 347 cols
[2023-03-16 10:28:41] [INFO ] Computed 57 place invariants in 1 ms
[2023-03-16 10:28:41] [INFO ] Implicit Places using invariants in 274 ms returned []
[2023-03-16 10:28:41] [INFO ] Flow matrix only has 386 transitions (discarded 32 similar events)
[2023-03-16 10:28:41] [INFO ] Invariant cache hit.
[2023-03-16 10:28:41] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-16 10:28:41] [INFO ] Implicit Places using invariants and state equation in 598 ms returned []
Implicit Place search using SMT with State Equation took 883 ms to find 0 implicit places.
[2023-03-16 10:28:41] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-16 10:28:41] [INFO ] Flow matrix only has 386 transitions (discarded 32 similar events)
[2023-03-16 10:28:41] [INFO ] Invariant cache hit.
[2023-03-16 10:28:42] [INFO ] Dead Transitions using invariants and state equation in 310 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 347/4258 places, 418/5852 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1357 ms. Remains : 347/4258 places, 418/5852 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s302 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 201 steps with 2 reset in 2 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-10 finished in 1412 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)&&F(G((F(p1) U p2))))))'
Support contains 3 out of 4258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4258/4258 places, 5852/5852 transitions.
Graph (trivial) has 5147 edges and 4258 vertex of which 3211 / 4258 are part of one of the 33 SCC in 2 ms
Free SCC test removed 3178 places
Ensure Unique test removed 4275 transitions
Reduce isomorphic transitions removed 4275 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 1079 transition count 1566
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 21 rules applied. Total rules applied 32 place count 1069 transition count 1555
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 39 place count 1062 transition count 1555
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 39 place count 1062 transition count 1508
Deduced a syphon composed of 47 places in 3 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 133 place count 1015 transition count 1508
Discarding 270 places :
Symmetric choice reduction at 3 with 270 rule applications. Total rules 403 place count 745 transition count 1100
Iterating global reduction 3 with 270 rules applied. Total rules applied 673 place count 745 transition count 1100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 674 place count 745 transition count 1099
Discarding 194 places :
Symmetric choice reduction at 4 with 194 rule applications. Total rules 868 place count 551 transition count 862
Iterating global reduction 4 with 194 rules applied. Total rules applied 1062 place count 551 transition count 862
Ensure Unique test removed 194 transitions
Reduce isomorphic transitions removed 194 transitions.
Iterating post reduction 4 with 194 rules applied. Total rules applied 1256 place count 551 transition count 668
Performed 148 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 148 places in 0 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 5 with 296 rules applied. Total rules applied 1552 place count 403 transition count 516
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1555 place count 403 transition count 513
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1559 place count 401 transition count 511
Performed 8 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 1575 place count 393 transition count 527
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 1596 place count 393 transition count 506
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1598 place count 392 transition count 515
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1606 place count 392 transition count 507
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 8 with 11 rules applied. Total rules applied 1617 place count 392 transition count 496
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1619 place count 390 transition count 494
Iterating global reduction 8 with 2 rules applied. Total rules applied 1621 place count 390 transition count 494
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1629 place count 390 transition count 486
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1630 place count 389 transition count 485
Iterating global reduction 8 with 1 rules applied. Total rules applied 1631 place count 389 transition count 485
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 1634 place count 389 transition count 482
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1635 place count 388 transition count 481
Iterating global reduction 8 with 1 rules applied. Total rules applied 1636 place count 388 transition count 481
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1638 place count 388 transition count 479
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1639 place count 387 transition count 478
Iterating global reduction 8 with 1 rules applied. Total rules applied 1640 place count 387 transition count 478
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1641 place count 387 transition count 477
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1642 place count 386 transition count 476
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 270 edges and 377 vertex of which 48 / 377 are part of one of the 24 SCC in 0 ms
Free SCC test removed 24 places
Iterating post reduction 8 with 10 rules applied. Total rules applied 1652 place count 353 transition count 476
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 9 with 48 rules applied. Total rules applied 1700 place count 353 transition count 428
Applied a total of 1700 rules in 263 ms. Remains 353 /4258 variables (removed 3905) and now considering 428/5852 (removed 5424) transitions.
[2023-03-16 10:28:42] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
// Phase 1: matrix 396 rows 353 cols
[2023-03-16 10:28:42] [INFO ] Computed 57 place invariants in 1 ms
[2023-03-16 10:28:42] [INFO ] Implicit Places using invariants in 264 ms returned []
[2023-03-16 10:28:42] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2023-03-16 10:28:42] [INFO ] Invariant cache hit.
[2023-03-16 10:28:43] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-16 10:28:43] [INFO ] Implicit Places using invariants and state equation in 673 ms returned []
Implicit Place search using SMT with State Equation took 940 ms to find 0 implicit places.
[2023-03-16 10:28:43] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-16 10:28:43] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2023-03-16 10:28:43] [INFO ] Invariant cache hit.
[2023-03-16 10:28:43] [INFO ] Dead Transitions using invariants and state equation in 303 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 353/4258 places, 428/5852 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1531 ms. Remains : 353/4258 places, 428/5852 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s81 1), p2:(EQ s195 1), p1:(EQ s91 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 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-12 finished in 1714 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)))'
Support contains 1 out of 4258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4258/4258 places, 5852/5852 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 4243 transition count 5835
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 4243 transition count 5835
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 4236 transition count 5825
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 4236 transition count 5825
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 4236 transition count 5824
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 4233 transition count 5821
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 4233 transition count 5821
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 4230 transition count 5815
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 4230 transition count 5815
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 4227 transition count 5810
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 4227 transition count 5810
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 4226 transition count 5808
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 4226 transition count 5808
Applied a total of 65 rules in 3677 ms. Remains 4226 /4258 variables (removed 32) and now considering 5808/5852 (removed 44) transitions.
// Phase 1: matrix 5808 rows 4226 cols
[2023-03-16 10:28:47] [INFO ] Computed 66 place invariants in 17 ms
[2023-03-16 10:28:49] [INFO ] Implicit Places using invariants in 1414 ms returned []
[2023-03-16 10:28:49] [INFO ] Invariant cache hit.
[2023-03-16 10:28:50] [INFO ] Implicit Places using invariants and state equation in 1515 ms returned []
Implicit Place search using SMT with State Equation took 2931 ms to find 0 implicit places.
[2023-03-16 10:28:50] [INFO ] Invariant cache hit.
[2023-03-16 10:28:57] [INFO ] Dead Transitions using invariants and state equation in 6512 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4226/4258 places, 5808/5852 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13121 ms. Remains : 4226/4258 places, 5808/5852 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1017 0)], 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 4229 ms.
Product exploration explored 100000 steps with 50000 reset in 4176 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-7B-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-7B-LTLFireability-13 finished in 21773 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||F(p1)))))'
Support contains 2 out of 4258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4258/4258 places, 5852/5852 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 4242 transition count 5834
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 4242 transition count 5834
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 4234 transition count 5822
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 4234 transition count 5822
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 4234 transition count 5821
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 53 place count 4230 transition count 5817
Iterating global reduction 1 with 4 rules applied. Total rules applied 57 place count 4230 transition count 5817
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 61 place count 4226 transition count 5810
Iterating global reduction 1 with 4 rules applied. Total rules applied 65 place count 4226 transition count 5810
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 69 place count 4222 transition count 5804
Iterating global reduction 1 with 4 rules applied. Total rules applied 73 place count 4222 transition count 5804
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 4220 transition count 5800
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 4220 transition count 5800
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 78 place count 4220 transition count 5799
Applied a total of 78 rules in 3712 ms. Remains 4220 /4258 variables (removed 38) and now considering 5799/5852 (removed 53) transitions.
// Phase 1: matrix 5799 rows 4220 cols
[2023-03-16 10:29:09] [INFO ] Computed 66 place invariants in 17 ms
[2023-03-16 10:29:10] [INFO ] Implicit Places using invariants in 1443 ms returned []
[2023-03-16 10:29:10] [INFO ] Invariant cache hit.
[2023-03-16 10:29:12] [INFO ] Implicit Places using invariants and state equation in 1451 ms returned []
Implicit Place search using SMT with State Equation took 2896 ms to find 0 implicit places.
[2023-03-16 10:29:12] [INFO ] Invariant cache hit.
[2023-03-16 10:29:19] [INFO ] Dead Transitions using invariants and state equation in 6773 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4220/4258 places, 5799/5852 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13386 ms. Remains : 4220/4258 places, 5799/5852 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s1420 1), p1:(EQ s3964 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 4059 steps with 1 reset in 25 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-15 finished in 13633 ms.
All properties solved by simple procedures.
Total runtime 243167 ms.
ITS solved all properties within timeout

BK_STOP 1678962560446

--------------------
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="NoC3x3-PT-7B"
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 NoC3x3-PT-7B, 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 r265-smll-167863539900332"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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