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.r393-oct2-167903717200588.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldPPPt-PT-004B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717200588
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.2K Feb 25 20:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 20:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 20:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 25 20:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Feb 25 20:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 20:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 20:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 20:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 74K 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 ShieldPPPt-PT-004B-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679460440743

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=ShieldPPPt-PT-004B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 04:47:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 04:47:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 04:47:24] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2023-03-22 04:47:24] [INFO ] Transformed 315 places.
[2023-03-22 04:47:24] [INFO ] Transformed 287 transitions.
[2023-03-22 04:47:24] [INFO ] Found NUPN structural information;
[2023-03-22 04:47:24] [INFO ] Parsed PT model containing 315 places and 287 transitions and 718 arcs in 249 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldPPPt-PT-004B-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-004B-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-004B-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 287/287 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 282 transition count 254
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 282 transition count 254
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 281 transition count 253
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 281 transition count 253
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 280 transition count 252
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 280 transition count 252
Applied a total of 70 rules in 129 ms. Remains 280 /315 variables (removed 35) and now considering 252/287 (removed 35) transitions.
// Phase 1: matrix 252 rows 280 cols
[2023-03-22 04:47:24] [INFO ] Computed 45 place invariants in 6 ms
[2023-03-22 04:47:25] [INFO ] Implicit Places using invariants in 600 ms returned []
[2023-03-22 04:47:25] [INFO ] Invariant cache hit.
[2023-03-22 04:47:26] [INFO ] Implicit Places using invariants and state equation in 890 ms returned []
Implicit Place search using SMT with State Equation took 1544 ms to find 0 implicit places.
[2023-03-22 04:47:26] [INFO ] Invariant cache hit.
[2023-03-22 04:47:26] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 280/315 places, 252/287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1920 ms. Remains : 280/315 places, 252/287 transitions.
Support contains 36 out of 280 places after structural reductions.
[2023-03-22 04:47:26] [INFO ] Flatten gal took : 59 ms
[2023-03-22 04:47:26] [INFO ] Flatten gal took : 17 ms
[2023-03-22 04:47:26] [INFO ] Input system was already deterministic with 252 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 33) seen :32
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
Running SMT prover for 1 properties.
[2023-03-22 04:47:27] [INFO ] Invariant cache hit.
[2023-03-22 04:47:27] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2023-03-22 04:47:27] [INFO ] After 152ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 04:47:27] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 23 ms to minimize.
[2023-03-22 04:47:27] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2023-03-22 04:47:27] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 12 ms to minimize.
[2023-03-22 04:47:27] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2023-03-22 04:47:27] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 0 ms to minimize.
[2023-03-22 04:47:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 720 ms
[2023-03-22 04:47:28] [INFO ] After 888ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 04:47:28] [INFO ] After 991ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 04:47:28] [INFO ] [Nat]Absence check using 45 positive place invariants in 59 ms returned sat
[2023-03-22 04:47:28] [INFO ] After 198ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 04:47:28] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 1 ms to minimize.
[2023-03-22 04:47:28] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2023-03-22 04:47:28] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2023-03-22 04:47:28] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 0 ms to minimize.
[2023-03-22 04:47:29] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 0 ms to minimize.
[2023-03-22 04:47:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 567 ms
[2023-03-22 04:47:29] [INFO ] After 787ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-22 04:47:29] [INFO ] After 1024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 226 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=75 )
Parikh walk visited 1 properties in 4 ms.
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' '!(F(((X((F(p0)&&X(p1)))&&G((p1||F(!p0))))||G((F(p0)&&X(p1))))))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 269 transition count 241
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 269 transition count 241
Applied a total of 22 rules in 55 ms. Remains 269 /280 variables (removed 11) and now considering 241/252 (removed 11) transitions.
// Phase 1: matrix 241 rows 269 cols
[2023-03-22 04:47:29] [INFO ] Computed 45 place invariants in 2 ms
[2023-03-22 04:47:30] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-22 04:47:30] [INFO ] Invariant cache hit.
[2023-03-22 04:47:30] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
[2023-03-22 04:47:30] [INFO ] Invariant cache hit.
[2023-03-22 04:47:30] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 269/280 places, 241/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 744 ms. Remains : 269/280 places, 241/252 transitions.
Stuttering acceptance computed with spot in 604 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=true, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(NEQ s16 1), p0:(EQ s211 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 441 ms.
Product exploration explored 100000 steps with 1 reset in 425 ms.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Detected a total of 62/269 stabilizing places and 62/241 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT (AND p1 p0))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND p1 p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 761 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :2
Finished Best-First random walk after 8059 steps, including 2 resets, run visited all 1 properties in 21 ms. (steps per millisecond=383 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT (AND p1 p0))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND p1 p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F p0), (F (AND p1 p0))]
Knowledge based reduction with 11 factoid took 891 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p0)]
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p0)]
[2023-03-22 04:47:34] [INFO ] Invariant cache hit.
[2023-03-22 04:47:34] [INFO ] [Real]Absence check using 45 positive place invariants in 13 ms returned sat
[2023-03-22 04:47:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:47:35] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2023-03-22 04:47:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:47:35] [INFO ] [Nat]Absence check using 45 positive place invariants in 48 ms returned sat
[2023-03-22 04:47:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:47:35] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2023-03-22 04:47:35] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 2 ms to minimize.
[2023-03-22 04:47:35] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 0 ms to minimize.
[2023-03-22 04:47:36] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2023-03-22 04:47:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 326 ms
[2023-03-22 04:47:36] [INFO ] Computed and/alt/rep : 240/357/240 causal constraints (skipped 0 transitions) in 26 ms.
[2023-03-22 04:47:37] [INFO ] Added : 205 causal constraints over 41 iterations in 1450 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 241/241 transitions.
Applied a total of 0 rules in 5 ms. Remains 269 /269 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2023-03-22 04:47:37] [INFO ] Invariant cache hit.
[2023-03-22 04:47:37] [INFO ] Implicit Places using invariants in 400 ms returned []
[2023-03-22 04:47:37] [INFO ] Invariant cache hit.
[2023-03-22 04:47:38] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 742 ms to find 0 implicit places.
[2023-03-22 04:47:38] [INFO ] Invariant cache hit.
[2023-03-22 04:47:38] [INFO ] Dead Transitions using invariants and state equation in 319 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1067 ms. Remains : 269/269 places, 241/241 transitions.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Detected a total of 62/269 stabilizing places and 62/241 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 541 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 04:47:39] [INFO ] Invariant cache hit.
[2023-03-22 04:47:39] [INFO ] [Real]Absence check using 45 positive place invariants in 9 ms returned sat
[2023-03-22 04:47:39] [INFO ] After 231ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 04:47:39] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 0 ms to minimize.
[2023-03-22 04:47:39] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2023-03-22 04:47:40] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2023-03-22 04:47:40] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2023-03-22 04:47:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 340 ms
[2023-03-22 04:47:40] [INFO ] After 625ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 04:47:40] [INFO ] After 715ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 04:47:40] [INFO ] [Nat]Absence check using 45 positive place invariants in 13 ms returned sat
[2023-03-22 04:47:40] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 04:47:40] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2023-03-22 04:47:40] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2023-03-22 04:47:40] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2023-03-22 04:47:40] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 2 ms to minimize.
[2023-03-22 04:47:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 260 ms
[2023-03-22 04:47:40] [INFO ] After 465ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-22 04:47:40] [INFO ] After 623ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 159 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=79 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F p0), (F (AND p1 p0))]
Knowledge based reduction with 8 factoid took 618 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p0)]
Stuttering acceptance computed with spot in 316 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p0)]
[2023-03-22 04:47:42] [INFO ] Invariant cache hit.
[2023-03-22 04:47:42] [INFO ] [Real]Absence check using 45 positive place invariants in 17 ms returned sat
[2023-03-22 04:47:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:47:42] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2023-03-22 04:47:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:47:42] [INFO ] [Nat]Absence check using 45 positive place invariants in 71 ms returned sat
[2023-03-22 04:47:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:47:43] [INFO ] [Nat]Absence check using state equation in 419 ms returned sat
[2023-03-22 04:47:43] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2023-03-22 04:47:43] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2023-03-22 04:47:43] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2023-03-22 04:47:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 268 ms
[2023-03-22 04:47:43] [INFO ] Computed and/alt/rep : 240/357/240 causal constraints (skipped 0 transitions) in 40 ms.
[2023-03-22 04:47:44] [INFO ] Added : 205 causal constraints over 41 iterations in 1266 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 286 ms.
Product exploration explored 100000 steps with 0 reset in 362 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p0)]
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 269/269 places, 241/241 transitions.
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 269 transition count 241
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 20 Pre rules applied. Total rules applied 56 place count 269 transition count 257
Deduced a syphon composed of 76 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 76 place count 269 transition count 257
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 149 places in 1 ms
Iterating global reduction 1 with 73 rules applied. Total rules applied 149 place count 269 transition count 257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 150 place count 269 transition count 256
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 180 place count 239 transition count 226
Deduced a syphon composed of 119 places in 0 ms
Iterating global reduction 2 with 30 rules applied. Total rules applied 210 place count 239 transition count 226
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 120 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 211 place count 239 transition count 226
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 213 place count 237 transition count 224
Deduced a syphon composed of 118 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 215 place count 237 transition count 224
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -63
Deduced a syphon composed of 133 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 230 place count 237 transition count 287
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 245 place count 222 transition count 257
Deduced a syphon composed of 118 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 260 place count 222 transition count 257
Deduced a syphon composed of 118 places in 0 ms
Applied a total of 260 rules in 135 ms. Remains 222 /269 variables (removed 47) and now considering 257/241 (removed -16) transitions.
[2023-03-22 04:47:46] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 257 rows 222 cols
[2023-03-22 04:47:46] [INFO ] Computed 45 place invariants in 3 ms
[2023-03-22 04:47:46] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 222/269 places, 257/241 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 378 ms. Remains : 222/269 places, 257/241 transitions.
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 241/241 transitions.
Applied a total of 0 rules in 5 ms. Remains 269 /269 variables (removed 0) and now considering 241/241 (removed 0) transitions.
// Phase 1: matrix 241 rows 269 cols
[2023-03-22 04:47:46] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-22 04:47:46] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-22 04:47:46] [INFO ] Invariant cache hit.
[2023-03-22 04:47:46] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
[2023-03-22 04:47:46] [INFO ] Invariant cache hit.
[2023-03-22 04:47:47] [INFO ] Dead Transitions using invariants and state equation in 321 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 740 ms. Remains : 269/269 places, 241/241 transitions.
Treatment of property ShieldPPPt-PT-004B-LTLFireability-00 finished in 17532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(F(p1)))))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 279 transition count 193
Reduce places removed 58 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 59 rules applied. Total rules applied 117 place count 221 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 118 place count 220 transition count 192
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 118 place count 220 transition count 166
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 170 place count 194 transition count 166
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 178 place count 186 transition count 158
Iterating global reduction 3 with 8 rules applied. Total rules applied 186 place count 186 transition count 158
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 186 place count 186 transition count 152
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 198 place count 180 transition count 152
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 322 place count 118 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 323 place count 118 transition count 89
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 325 place count 117 transition count 88
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 347 place count 106 transition count 88
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 349 place count 104 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 350 place count 103 transition count 86
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 350 place count 103 transition count 84
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 354 place count 101 transition count 84
Applied a total of 354 rules in 54 ms. Remains 101 /280 variables (removed 179) and now considering 84/252 (removed 168) transitions.
// Phase 1: matrix 84 rows 101 cols
[2023-03-22 04:47:47] [INFO ] Computed 44 place invariants in 0 ms
[2023-03-22 04:47:47] [INFO ] Implicit Places using invariants in 67 ms returned [84, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 70 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/280 places, 84/252 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 97 transition count 82
Applied a total of 4 rules in 4 ms. Remains 97 /99 variables (removed 2) and now considering 82/84 (removed 2) transitions.
// Phase 1: matrix 82 rows 97 cols
[2023-03-22 04:47:47] [INFO ] Computed 42 place invariants in 1 ms
[2023-03-22 04:47:47] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-22 04:47:47] [INFO ] Invariant cache hit.
[2023-03-22 04:47:47] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 04:47:47] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 97/280 places, 82/252 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 371 ms. Remains : 97/280 places, 82/252 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s3 1), p1:(EQ s76 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 20919 reset in 255 ms.
Stack based approach found an accepted trace after 288 steps with 58 reset with depth 15 and stack size 15 in 1 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-01 finished in 766 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)))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 279 transition count 192
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 118 place count 220 transition count 192
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 118 place count 220 transition count 167
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 168 place count 195 transition count 167
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 176 place count 187 transition count 159
Iterating global reduction 2 with 8 rules applied. Total rules applied 184 place count 187 transition count 159
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 184 place count 187 transition count 153
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 196 place count 181 transition count 153
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 326 place count 116 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 327 place count 116 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 329 place count 115 transition count 86
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 351 place count 104 transition count 86
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 353 place count 102 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 354 place count 101 transition count 84
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 354 place count 101 transition count 82
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 358 place count 99 transition count 82
Applied a total of 358 rules in 23 ms. Remains 99 /280 variables (removed 181) and now considering 82/252 (removed 170) transitions.
// Phase 1: matrix 82 rows 99 cols
[2023-03-22 04:47:48] [INFO ] Computed 44 place invariants in 0 ms
[2023-03-22 04:47:48] [INFO ] Implicit Places using invariants in 119 ms returned [82, 86]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 121 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/280 places, 82/252 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 95 transition count 80
Applied a total of 4 rules in 2 ms. Remains 95 /97 variables (removed 2) and now considering 80/82 (removed 2) transitions.
// Phase 1: matrix 80 rows 95 cols
[2023-03-22 04:47:48] [INFO ] Computed 42 place invariants in 1 ms
[2023-03-22 04:47:48] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-22 04:47:48] [INFO ] Invariant cache hit.
[2023-03-22 04:47:48] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 95/280 places, 80/252 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 454 ms. Remains : 95/280 places, 80/252 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s66 1) (NEQ s78 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4173 reset in 239 ms.
Stack based approach found an accepted trace after 2612 steps with 111 reset with depth 18 and stack size 14 in 6 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-02 finished in 891 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((X(X((p0||G(p1))))&&(p2||X(p3)))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 270 transition count 242
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 270 transition count 242
Applied a total of 20 rules in 8 ms. Remains 270 /280 variables (removed 10) and now considering 242/252 (removed 10) transitions.
// Phase 1: matrix 242 rows 270 cols
[2023-03-22 04:47:48] [INFO ] Computed 45 place invariants in 2 ms
[2023-03-22 04:47:49] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-22 04:47:49] [INFO ] Invariant cache hit.
[2023-03-22 04:47:49] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2023-03-22 04:47:49] [INFO ] Invariant cache hit.
[2023-03-22 04:47:49] [INFO ] Dead Transitions using invariants and state equation in 417 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 270/280 places, 242/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 790 ms. Remains : 270/280 places, 242/252 transitions.
Stuttering acceptance computed with spot in 582 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), false, (AND (NOT p2) (NOT p3) p0 (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 3}, { cond=(NOT p2), acceptance={0} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) p1), acceptance={} source=4 dest: 6}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=5 dest: 4}], [{ cond=(AND (NOT p3) p0 (NOT p1)), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p3) p0 p1), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) (NOT p3) p0 p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(EQ s246 0), p3:(EQ s194 0), p0:(AND (EQ s169 1) (EQ s195 1)), p1:(EQ s246 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 883 reset in 214 ms.
Stack based approach found an accepted trace after 118 steps with 0 reset with depth 119 and stack size 78 in 24 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-03 finished in 1657 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U ((G(p0) U X(p1))&&F(p2))))'
Support contains 3 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 272 transition count 244
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 272 transition count 244
Applied a total of 16 rules in 5 ms. Remains 272 /280 variables (removed 8) and now considering 244/252 (removed 8) transitions.
// Phase 1: matrix 244 rows 272 cols
[2023-03-22 04:47:50] [INFO ] Computed 45 place invariants in 15 ms
[2023-03-22 04:47:50] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-03-22 04:47:50] [INFO ] Invariant cache hit.
[2023-03-22 04:47:51] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
[2023-03-22 04:47:51] [INFO ] Invariant cache hit.
[2023-03-22 04:47:51] [INFO ] Dead Transitions using invariants and state equation in 300 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 272/280 places, 244/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 793 ms. Remains : 272/280 places, 244/252 transitions.
Stuttering acceptance computed with spot in 382 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), true, (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s125 1), p2:(EQ s135 1), p1:(EQ s116 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1927 steps with 7 reset in 8 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-04 finished in 1248 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||X(p1)))))))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 270 transition count 242
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 270 transition count 242
Applied a total of 20 rules in 13 ms. Remains 270 /280 variables (removed 10) and now considering 242/252 (removed 10) transitions.
// Phase 1: matrix 242 rows 270 cols
[2023-03-22 04:47:51] [INFO ] Computed 45 place invariants in 2 ms
[2023-03-22 04:47:51] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-22 04:47:51] [INFO ] Invariant cache hit.
[2023-03-22 04:47:52] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2023-03-22 04:47:52] [INFO ] Invariant cache hit.
[2023-03-22 04:47:52] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 270/280 places, 242/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 586 ms. Remains : 270/280 places, 242/252 transitions.
Stuttering acceptance computed with spot in 354 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p1:(NEQ s224 1), p0:(NEQ s259 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 1966 steps with 0 reset in 5 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-05 finished in 970 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||(X(p2)&&p1)))&&F((G(p0)||G(p3))))))'
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 269 transition count 241
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 269 transition count 241
Applied a total of 22 rules in 8 ms. Remains 269 /280 variables (removed 11) and now considering 241/252 (removed 11) transitions.
// Phase 1: matrix 241 rows 269 cols
[2023-03-22 04:47:52] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-22 04:47:52] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-22 04:47:52] [INFO ] Invariant cache hit.
[2023-03-22 04:47:53] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
[2023-03-22 04:47:53] [INFO ] Invariant cache hit.
[2023-03-22 04:47:53] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 269/280 places, 241/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 679 ms. Remains : 269/280 places, 241/252 transitions.
Stuttering acceptance computed with spot in 251 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p0) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND p0 p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p3), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s231 1), p1:(AND (EQ s83 1) (EQ s120 1)), p3:(AND (EQ s216 1) (EQ s246 1)), p2:(AND (EQ s83 1) (EQ s120 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 49432 steps with 1 reset in 130 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-06 finished in 1111 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)||F(G(p1))))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 279 transition count 194
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 114 place count 222 transition count 194
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 114 place count 222 transition count 169
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 164 place count 197 transition count 169
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 172 place count 189 transition count 161
Iterating global reduction 2 with 8 rules applied. Total rules applied 180 place count 189 transition count 161
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 180 place count 189 transition count 155
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 192 place count 183 transition count 155
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 326 place count 116 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 327 place count 116 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 329 place count 115 transition count 86
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 349 place count 105 transition count 86
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 351 place count 103 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 352 place count 102 transition count 84
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 352 place count 102 transition count 82
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 356 place count 100 transition count 82
Applied a total of 356 rules in 21 ms. Remains 100 /280 variables (removed 180) and now considering 82/252 (removed 170) transitions.
// Phase 1: matrix 82 rows 100 cols
[2023-03-22 04:47:53] [INFO ] Computed 44 place invariants in 1 ms
[2023-03-22 04:47:53] [INFO ] Implicit Places using invariants in 100 ms returned [83, 87]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 114 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 98/280 places, 82/252 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 97 transition count 81
Applied a total of 2 rules in 3 ms. Remains 97 /98 variables (removed 1) and now considering 81/82 (removed 1) transitions.
// Phase 1: matrix 81 rows 97 cols
[2023-03-22 04:47:54] [INFO ] Computed 42 place invariants in 0 ms
[2023-03-22 04:47:54] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-22 04:47:54] [INFO ] Invariant cache hit.
[2023-03-22 04:47:54] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 97/280 places, 81/252 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 363 ms. Remains : 97/280 places, 81/252 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s28 1), p1:(EQ s82 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 212 ms.
Stack based approach found an accepted trace after 175 steps with 0 reset with depth 176 and stack size 171 in 0 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-07 finished in 699 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((X(F(!(p0 U p1)))&&(F(p0)||p2))))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 270 transition count 242
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 270 transition count 242
Applied a total of 20 rules in 7 ms. Remains 270 /280 variables (removed 10) and now considering 242/252 (removed 10) transitions.
// Phase 1: matrix 242 rows 270 cols
[2023-03-22 04:47:54] [INFO ] Computed 45 place invariants in 2 ms
[2023-03-22 04:47:54] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-22 04:47:54] [INFO ] Invariant cache hit.
[2023-03-22 04:47:54] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2023-03-22 04:47:54] [INFO ] Invariant cache hit.
[2023-03-22 04:47:55] [INFO ] Dead Transitions using invariants and state equation in 381 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 270/280 places, 242/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 782 ms. Remains : 270/280 places, 242/252 transitions.
Stuttering acceptance computed with spot in 322 ms :[(OR p1 (AND (NOT p0) (NOT p2))), p1, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1)]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s42 1) (EQ s176 1)), p0:(EQ s176 1), p1:(EQ s42 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 339 reset in 242 ms.
Stack based approach found an accepted trace after 1615 steps with 7 reset with depth 110 and stack size 110 in 3 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-08 finished in 1403 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((G(p0)||X(p1))) U p2)||G(!p1)))'
Support contains 3 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 270 transition count 242
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 270 transition count 242
Applied a total of 20 rules in 22 ms. Remains 270 /280 variables (removed 10) and now considering 242/252 (removed 10) transitions.
// Phase 1: matrix 242 rows 270 cols
[2023-03-22 04:47:55] [INFO ] Computed 45 place invariants in 3 ms
[2023-03-22 04:47:56] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-22 04:47:56] [INFO ] Invariant cache hit.
[2023-03-22 04:47:56] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
[2023-03-22 04:47:56] [INFO ] Invariant cache hit.
[2023-03-22 04:47:56] [INFO ] Dead Transitions using invariants and state equation in 346 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 270/280 places, 242/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 805 ms. Remains : 270/280 places, 242/252 transitions.
Stuttering acceptance computed with spot in 696 ms :[(AND p1 (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p2), false, false, false, (AND (NOT p1) (NOT p0)), true, p1, (AND p1 (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 6}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=0 dest: 7}], [{ cond=(NOT p1), acceptance={} source=1 dest: 8}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(NOT p2), acceptance={0} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 7}], [{ cond=(NOT p1), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND p0 p1), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 9}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 10}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=p1, acceptance={} source=9 dest: 8}, { cond=(NOT p1), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p0) p1), acceptance={} source=10 dest: 8}, { cond=(AND p0 p1), acceptance={} source=10 dest: 10}]], initial=0, aps=[p2:(EQ s7 1), p1:(NEQ s253 1), p0:(EQ s112 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, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 20 steps with 4 reset in 0 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-11 finished in 1535 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) U p1)))'
Support contains 3 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 271 transition count 243
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 271 transition count 243
Applied a total of 18 rules in 12 ms. Remains 271 /280 variables (removed 9) and now considering 243/252 (removed 9) transitions.
// Phase 1: matrix 243 rows 271 cols
[2023-03-22 04:47:57] [INFO ] Computed 45 place invariants in 15 ms
[2023-03-22 04:47:57] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-22 04:47:57] [INFO ] Invariant cache hit.
[2023-03-22 04:47:57] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2023-03-22 04:47:57] [INFO ] Invariant cache hit.
[2023-03-22 04:47:58] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 271/280 places, 243/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 604 ms. Remains : 271/280 places, 243/252 transitions.
Stuttering acceptance computed with spot in 282 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s180 1), p0:(AND (NEQ s113 1) (EQ s138 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-12 finished in 914 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((X(X((G(X(p0))&&p0))) U p1)))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 270 transition count 242
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 270 transition count 242
Applied a total of 20 rules in 25 ms. Remains 270 /280 variables (removed 10) and now considering 242/252 (removed 10) transitions.
// Phase 1: matrix 242 rows 270 cols
[2023-03-22 04:47:58] [INFO ] Computed 45 place invariants in 2 ms
[2023-03-22 04:47:58] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-22 04:47:58] [INFO ] Invariant cache hit.
[2023-03-22 04:47:59] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
[2023-03-22 04:47:59] [INFO ] Invariant cache hit.
[2023-03-22 04:47:59] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 270/280 places, 242/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 976 ms. Remains : 270/280 places, 242/252 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s57 1) (EQ s209 1)), p0:(EQ s209 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-13 finished in 1191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(p1)||F(p2))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 270 transition count 242
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 270 transition count 242
Applied a total of 20 rules in 10 ms. Remains 270 /280 variables (removed 10) and now considering 242/252 (removed 10) transitions.
// Phase 1: matrix 242 rows 270 cols
[2023-03-22 04:47:59] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-22 04:47:59] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-03-22 04:47:59] [INFO ] Invariant cache hit.
[2023-03-22 04:48:00] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2023-03-22 04:48:00] [INFO ] Invariant cache hit.
[2023-03-22 04:48:00] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 270/280 places, 242/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 723 ms. Remains : 270/280 places, 242/252 transitions.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}]], initial=0, aps=[p2:(EQ s251 1), p0:(EQ s177 1), p1:(AND (EQ s30 1) (EQ s72 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]]
Product exploration explored 100000 steps with 2396 reset in 189 ms.
Product exploration explored 100000 steps with 2444 reset in 202 ms.
Computed a total of 63 stabilizing places and 63 stable transitions
Computed a total of 63 stabilizing places and 63 stable transitions
Detected a total of 63/270 stabilizing places and 63/242 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 227 ms. Reduced automaton from 4 states, 4 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p2), (NOT p2)]
Finished random walk after 21 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 4 factoid took 249 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p2)]
[2023-03-22 04:48:01] [INFO ] Invariant cache hit.
[2023-03-22 04:48:01] [INFO ] [Real]Absence check using 45 positive place invariants in 11 ms returned sat
[2023-03-22 04:48:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:48:02] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2023-03-22 04:48:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:48:02] [INFO ] [Nat]Absence check using 45 positive place invariants in 14 ms returned sat
[2023-03-22 04:48:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:48:02] [INFO ] [Nat]Absence check using state equation in 296 ms returned sat
[2023-03-22 04:48:02] [INFO ] Computed and/alt/rep : 241/358/241 causal constraints (skipped 0 transitions) in 17 ms.
[2023-03-22 04:48:04] [INFO ] Added : 237 causal constraints over 49 iterations in 1699 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 1 out of 270 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 270/270 places, 242/242 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 269 transition count 187
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 215 transition count 187
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 108 place count 215 transition count 157
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 168 place count 185 transition count 157
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 300 place count 119 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 301 place count 119 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 303 place count 118 transition count 89
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 323 place count 108 transition count 89
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 325 place count 106 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 326 place count 105 transition count 87
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 326 place count 105 transition count 85
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 330 place count 103 transition count 85
Applied a total of 330 rules in 17 ms. Remains 103 /270 variables (removed 167) and now considering 85/242 (removed 157) transitions.
// Phase 1: matrix 85 rows 103 cols
[2023-03-22 04:48:04] [INFO ] Computed 44 place invariants in 0 ms
[2023-03-22 04:48:04] [INFO ] Implicit Places using invariants in 86 ms returned [84, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 88 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/270 places, 85/242 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 99 transition count 83
Applied a total of 4 rules in 7 ms. Remains 99 /101 variables (removed 2) and now considering 83/85 (removed 2) transitions.
// Phase 1: matrix 83 rows 99 cols
[2023-03-22 04:48:04] [INFO ] Computed 42 place invariants in 1 ms
[2023-03-22 04:48:04] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-22 04:48:04] [INFO ] Invariant cache hit.
[2023-03-22 04:48:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 04:48:04] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/270 places, 83/242 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 361 ms. Remains : 99/270 places, 83/242 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/99 stabilizing places and 2/83 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 154 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p2)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 2 factoid took 219 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p2)]
[2023-03-22 04:48:05] [INFO ] Invariant cache hit.
[2023-03-22 04:48:05] [INFO ] [Real]Absence check using 42 positive place invariants in 12 ms returned sat
[2023-03-22 04:48:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:48:05] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2023-03-22 04:48:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:48:05] [INFO ] [Nat]Absence check using 42 positive place invariants in 8 ms returned sat
[2023-03-22 04:48:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:48:05] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2023-03-22 04:48:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 04:48:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 12 ms returned sat
[2023-03-22 04:48:05] [INFO ] Computed and/alt/rep : 77/124/77 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-22 04:48:05] [INFO ] Added : 65 causal constraints over 13 iterations in 257 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 80 ms :[(NOT p2)]
Product exploration explored 100000 steps with 18348 reset in 185 ms.
Stack based approach found an accepted trace after 9 steps with 2 reset with depth 4 and stack size 4 in 0 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-14 finished in 6705 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(((X((F(p0)&&X(p1)))&&G((p1||F(!p0))))||G((F(p0)&&X(p1))))))'
Found a Shortening insensitive property : ShieldPPPt-PT-004B-LTLFireability-00
Stuttering acceptance computed with spot in 445 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p0), (NOT p1)]
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 279 transition count 192
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 118 place count 220 transition count 192
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 118 place count 220 transition count 166
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 170 place count 194 transition count 166
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 178 place count 186 transition count 158
Iterating global reduction 2 with 8 rules applied. Total rules applied 186 place count 186 transition count 158
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 186 place count 186 transition count 152
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 198 place count 180 transition count 152
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 324 place count 117 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 325 place count 117 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 327 place count 116 transition count 87
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 349 place count 105 transition count 87
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 351 place count 103 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 352 place count 102 transition count 85
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 352 place count 102 transition count 83
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 356 place count 100 transition count 83
Applied a total of 356 rules in 57 ms. Remains 100 /280 variables (removed 180) and now considering 83/252 (removed 169) transitions.
// Phase 1: matrix 83 rows 100 cols
[2023-03-22 04:48:06] [INFO ] Computed 44 place invariants in 0 ms
[2023-03-22 04:48:07] [INFO ] Implicit Places using invariants in 140 ms returned [83, 87]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 141 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 98/280 places, 83/252 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 96 transition count 81
Applied a total of 4 rules in 2 ms. Remains 96 /98 variables (removed 2) and now considering 81/83 (removed 2) transitions.
// Phase 1: matrix 81 rows 96 cols
[2023-03-22 04:48:07] [INFO ] Computed 42 place invariants in 0 ms
[2023-03-22 04:48:07] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-03-22 04:48:07] [INFO ] Invariant cache hit.
[2023-03-22 04:48:07] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 96/280 places, 81/252 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 544 ms. Remains : 96/280 places, 81/252 transitions.
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=true, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(NEQ s3 1), p0:(EQ s79 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 185 ms.
Product exploration explored 100000 steps with 0 reset in 286 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/96 stabilizing places and 2/81 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X (AND p1 p0)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
Knowledge based reduction with 9 factoid took 831 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 04:48:09] [INFO ] Invariant cache hit.
[2023-03-22 04:48:09] [INFO ] [Real]Absence check using 42 positive place invariants in 76 ms returned sat
[2023-03-22 04:48:09] [INFO ] After 200ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 04:48:09] [INFO ] [Nat]Absence check using 42 positive place invariants in 5 ms returned sat
[2023-03-22 04:48:09] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 04:48:09] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-22 04:48:09] [INFO ] After 158ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 38 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=38 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X (AND p1 p0)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (F (AND (NOT p1) p0)), (F (AND p1 p0))]
Knowledge based reduction with 9 factoid took 705 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-22 04:48:10] [INFO ] Invariant cache hit.
[2023-03-22 04:48:10] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-22 04:48:10] [INFO ] Invariant cache hit.
[2023-03-22 04:48:10] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2023-03-22 04:48:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 04:48:10] [INFO ] Invariant cache hit.
[2023-03-22 04:48:10] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 399 ms. Remains : 96/96 places, 81/81 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/96 stabilizing places and 2/81 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
Knowledge based reduction with 5 factoid took 383 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :1
Finished Best-First random walk after 297 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=297 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (F (AND (NOT p1) p0)), (F (AND p1 p0))]
Knowledge based reduction with 5 factoid took 443 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 0 reset in 223 ms.
Product exploration explored 100000 steps with 0 reset in 254 ms.
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-22 04:48:12] [INFO ] Invariant cache hit.
[2023-03-22 04:48:13] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-22 04:48:13] [INFO ] Invariant cache hit.
[2023-03-22 04:48:13] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2023-03-22 04:48:13] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 04:48:13] [INFO ] Invariant cache hit.
[2023-03-22 04:48:13] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 445 ms. Remains : 96/96 places, 81/81 transitions.
Treatment of property ShieldPPPt-PT-004B-LTLFireability-00 finished in 7084 ms.
[2023-03-22 04:48:13] [INFO ] Flatten gal took : 11 ms
[2023-03-22 04:48:13] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-22 04:48:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 280 places, 252 transitions and 648 arcs took 2 ms.
Total runtime 49334 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1723/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldPPPt-PT-004B-LTLFireability-00

BK_STOP 1679460494053

--------------------
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
mcc2023
ltl formula name ShieldPPPt-PT-004B-LTLFireability-00
ltl formula formula --ltl=/tmp/1723/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 280 places, 252 transitions and 648 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1723/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1723/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.130 real 0.030 user 0.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1723/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1723/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 10 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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="ShieldPPPt-PT-004B"
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 ShieldPPPt-PT-004B, 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 r393-oct2-167903717200588"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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