Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r222-tall-165286025400587.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldPPPt-PT-004B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025400587
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 316K
-rw-r--r-- 1 mcc users 7.2K Apr 29 13:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 29 13:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 29 13:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 29 13:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 74K May 10 09:34 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-LTLCardinality-00
FORMULA_NAME ShieldPPPt-PT-004B-LTLCardinality-01
FORMULA_NAME ShieldPPPt-PT-004B-LTLCardinality-02
FORMULA_NAME ShieldPPPt-PT-004B-LTLCardinality-03
FORMULA_NAME ShieldPPPt-PT-004B-LTLCardinality-04
FORMULA_NAME ShieldPPPt-PT-004B-LTLCardinality-05
FORMULA_NAME ShieldPPPt-PT-004B-LTLCardinality-06
FORMULA_NAME ShieldPPPt-PT-004B-LTLCardinality-07
FORMULA_NAME ShieldPPPt-PT-004B-LTLCardinality-08
FORMULA_NAME ShieldPPPt-PT-004B-LTLCardinality-09
FORMULA_NAME ShieldPPPt-PT-004B-LTLCardinality-10
FORMULA_NAME ShieldPPPt-PT-004B-LTLCardinality-11
FORMULA_NAME ShieldPPPt-PT-004B-LTLCardinality-12
FORMULA_NAME ShieldPPPt-PT-004B-LTLCardinality-13
FORMULA_NAME ShieldPPPt-PT-004B-LTLCardinality-14
FORMULA_NAME ShieldPPPt-PT-004B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653017908284

Running Version 202205111006
[2022-05-20 03:38:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 03:38:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 03:38:29] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2022-05-20 03:38:29] [INFO ] Transformed 315 places.
[2022-05-20 03:38:29] [INFO ] Transformed 287 transitions.
[2022-05-20 03:38:29] [INFO ] Found NUPN structural information;
[2022-05-20 03:38:29] [INFO ] Parsed PT model containing 315 places and 287 transitions in 200 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPt-PT-004B-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-004B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-004B-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-004B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-004B-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 287/287 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 279 transition count 251
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 279 transition count 251
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 278 transition count 250
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 278 transition count 250
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 277 transition count 249
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 277 transition count 249
Applied a total of 76 rules in 77 ms. Remains 277 /315 variables (removed 38) and now considering 249/287 (removed 38) transitions.
// Phase 1: matrix 249 rows 277 cols
[2022-05-20 03:38:29] [INFO ] Computed 45 place invariants in 17 ms
[2022-05-20 03:38:30] [INFO ] Implicit Places using invariants in 221 ms returned []
// Phase 1: matrix 249 rows 277 cols
[2022-05-20 03:38:30] [INFO ] Computed 45 place invariants in 9 ms
[2022-05-20 03:38:30] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
// Phase 1: matrix 249 rows 277 cols
[2022-05-20 03:38:30] [INFO ] Computed 45 place invariants in 3 ms
[2022-05-20 03:38:30] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 277/315 places, 249/287 transitions.
Finished structural reductions, in 1 iterations. Remains : 277/315 places, 249/287 transitions.
Support contains 32 out of 277 places after structural reductions.
[2022-05-20 03:38:30] [INFO ] Flatten gal took : 43 ms
[2022-05-20 03:38:30] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA ShieldPPPt-PT-004B-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 03:38:30] [INFO ] Flatten gal took : 18 ms
[2022-05-20 03:38:30] [INFO ] Input system was already deterministic with 249 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 21) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 249 rows 277 cols
[2022-05-20 03:38:30] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-20 03:38:30] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 03:38:31] [INFO ] [Nat]Absence check using 45 positive place invariants in 12 ms returned sat
[2022-05-20 03:38:31] [INFO ] After 111ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA ShieldPPPt-PT-004B-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 9 simplifications.
Computed a total of 63 stabilizing places and 63 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 249/249 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 270 transition count 242
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 270 transition count 242
Applied a total of 14 rules in 45 ms. Remains 270 /277 variables (removed 7) and now considering 242/249 (removed 7) transitions.
// Phase 1: matrix 242 rows 270 cols
[2022-05-20 03:38:31] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-20 03:38:31] [INFO ] Implicit Places using invariants in 100 ms returned []
// Phase 1: matrix 242 rows 270 cols
[2022-05-20 03:38:31] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-20 03:38:31] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 270 cols
[2022-05-20 03:38:31] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-20 03:38:31] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 270/277 places, 242/249 transitions.
Finished structural reductions, in 1 iterations. Remains : 270/277 places, 242/249 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s189 0) (EQ s66 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 258 ms.
Product exploration explored 100000 steps with 50000 reset in 176 ms.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPt-PT-004B-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-004B-LTLCardinality-00 finished in 1176 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(X(X(X(X(F(X(X(F(p1)))))))))))'
Support contains 3 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 249/249 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 269 transition count 241
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 269 transition count 241
Applied a total of 16 rules in 6 ms. Remains 269 /277 variables (removed 8) and now considering 241/249 (removed 8) transitions.
// Phase 1: matrix 241 rows 269 cols
[2022-05-20 03:38:32] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-20 03:38:32] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 241 rows 269 cols
[2022-05-20 03:38:32] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-20 03:38:32] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
// Phase 1: matrix 241 rows 269 cols
[2022-05-20 03:38:32] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-20 03:38:32] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 269/277 places, 241/249 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/277 places, 241/249 transitions.
Stuttering acceptance computed with spot in 307 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=(NOT p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (EQ s75 0) (EQ s54 1)), p1:(EQ s61 0)], nbAcceptance=0, 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][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2469 reset in 231 ms.
Product exploration explored 100000 steps with 2454 reset in 192 ms.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 153 ms. Reduced automaton from 8 states, 9 edges and 2 AP to 8 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 832 steps, including 0 resets, run visited all 2 properties in 9 ms. (steps per millisecond=92 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 206 ms. Reduced automaton from 8 states, 9 edges and 2 AP to 8 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 241 rows 269 cols
[2022-05-20 03:38:34] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-20 03:38:34] [INFO ] [Real]Absence check using 45 positive place invariants in 11 ms returned sat
[2022-05-20 03:38:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 03:38:35] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2022-05-20 03:38:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 03:38:35] [INFO ] [Nat]Absence check using 45 positive place invariants in 11 ms returned sat
[2022-05-20 03:38:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 03:38:35] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2022-05-20 03:38:35] [INFO ] Computed and/alt/rep : 240/357/240 causal constraints (skipped 0 transitions) in 15 ms.
[2022-05-20 03:38:36] [INFO ] Added : 238 causal constraints over 48 iterations in 1273 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 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
[2022-05-20 03:38:36] [INFO ] Computed 45 place invariants in 2 ms
[2022-05-20 03:38:36] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 241 rows 269 cols
[2022-05-20 03:38:36] [INFO ] Computed 45 place invariants in 2 ms
[2022-05-20 03:38:36] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
// Phase 1: matrix 241 rows 269 cols
[2022-05-20 03:38:36] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-20 03:38:37] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 170 ms. Reduced automaton from 8 states, 9 edges and 2 AP to 8 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 322 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 273 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=136 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 197 ms. Reduced automaton from 8 states, 9 edges and 2 AP to 8 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 241 rows 269 cols
[2022-05-20 03:38:38] [INFO ] Computed 45 place invariants in 3 ms
[2022-05-20 03:38:38] [INFO ] [Real]Absence check using 45 positive place invariants in 14 ms returned sat
[2022-05-20 03:38:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 03:38:38] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2022-05-20 03:38:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 03:38:38] [INFO ] [Nat]Absence check using 45 positive place invariants in 11 ms returned sat
[2022-05-20 03:38:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 03:38:38] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2022-05-20 03:38:38] [INFO ] Computed and/alt/rep : 240/357/240 causal constraints (skipped 0 transitions) in 14 ms.
[2022-05-20 03:38:39] [INFO ] Added : 238 causal constraints over 48 iterations in 1035 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2463 reset in 169 ms.
Product exploration explored 100000 steps with 2334 reset in 166 ms.
Applying partial POR strategy [false, true, false, false, false, false, false, true]
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 3 out of 269 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 269/269 places, 241/241 transitions.
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 269 transition count 241
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 21 Pre rules applied. Total rules applied 54 place count 269 transition count 257
Deduced a syphon composed of 75 places in 1 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 75 place count 269 transition count 257
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 149 places in 0 ms
Iterating global reduction 1 with 74 rules applied. Total rules applied 149 place count 269 transition count 258
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 257
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 179 place count 240 transition count 227
Deduced a syphon composed of 120 places in 0 ms
Iterating global reduction 2 with 29 rules applied. Total rules applied 208 place count 240 transition count 227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 121 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 209 place count 240 transition count 227
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 211 place count 238 transition count 225
Deduced a syphon composed of 119 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 213 place count 238 transition count 225
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 132 places in 0 ms
Iterating global reduction 2 with 13 rules applied. Total rules applied 226 place count 238 transition count 281
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 239 place count 225 transition count 255
Deduced a syphon composed of 119 places in 0 ms
Iterating global reduction 2 with 13 rules applied. Total rules applied 252 place count 225 transition count 255
Deduced a syphon composed of 119 places in 0 ms
Applied a total of 252 rules in 94 ms. Remains 225 /269 variables (removed 44) and now considering 255/241 (removed -14) transitions.
[2022-05-20 03:38:40] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 255 rows 225 cols
[2022-05-20 03:38:41] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-20 03:38:41] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 225/269 places, 255/241 transitions.
Finished structural reductions, in 1 iterations. Remains : 225/269 places, 255/241 transitions.
Product exploration explored 100000 steps with 11766 reset in 386 ms.
Stack based approach found an accepted trace after 208 steps with 27 reset with depth 5 and stack size 4 in 3 ms.
FORMULA ShieldPPPt-PT-004B-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-004B-LTLCardinality-03 finished in 9028 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(F((G(p1)||p0))))||p2)))'
Support contains 3 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 249/249 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 271 transition count 243
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 271 transition count 243
Applied a total of 12 rules in 16 ms. Remains 271 /277 variables (removed 6) and now considering 243/249 (removed 6) transitions.
// Phase 1: matrix 243 rows 271 cols
[2022-05-20 03:38:41] [INFO ] Computed 45 place invariants in 2 ms
[2022-05-20 03:38:41] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 243 rows 271 cols
[2022-05-20 03:38:41] [INFO ] Computed 45 place invariants in 9 ms
[2022-05-20 03:38:41] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
// Phase 1: matrix 243 rows 271 cols
[2022-05-20 03:38:41] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-20 03:38:41] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 271/277 places, 243/249 transitions.
Finished structural reductions, in 1 iterations. Remains : 271/277 places, 243/249 transitions.
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p2:(EQ s117 0), p1:(EQ s117 1), p0:(OR (EQ s267 0) (EQ s108 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 50000 reset in 141 ms.
Product exploration explored 100000 steps with 50000 reset in 143 ms.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p2), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 6 factoid took 132 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPt-PT-004B-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-004B-LTLCardinality-04 finished in 1019 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(G(X(F(p0)))))))'
Support contains 2 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 249/249 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 276 transition count 192
Reduce places removed 56 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 57 rules applied. Total rules applied 113 place count 220 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 114 place count 219 transition count 191
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 114 place count 219 transition count 164
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 168 place count 192 transition count 164
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 174 place count 186 transition count 158
Iterating global reduction 3 with 6 rules applied. Total rules applied 180 place count 186 transition count 158
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 180 place count 186 transition count 153
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 190 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 3 with 130 rules applied. Total rules applied 320 place count 116 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 321 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 323 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 4 with 22 rules applied. Total rules applied 345 place count 104 transition count 86
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 347 place count 102 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 348 place count 101 transition count 84
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 348 place count 101 transition count 83
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 350 place count 100 transition count 83
Applied a total of 350 rules in 40 ms. Remains 100 /277 variables (removed 177) and now considering 83/249 (removed 166) transitions.
// Phase 1: matrix 83 rows 100 cols
[2022-05-20 03:38:42] [INFO ] Computed 44 place invariants in 2 ms
[2022-05-20 03:38:42] [INFO ] Implicit Places using invariants in 61 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/277 places, 83/249 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 98 transition count 82
Applied a total of 2 rules in 9 ms. Remains 98 /99 variables (removed 1) and now considering 82/83 (removed 1) transitions.
// Phase 1: matrix 82 rows 98 cols
[2022-05-20 03:38:42] [INFO ] Computed 43 place invariants in 0 ms
[2022-05-20 03:38:42] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 82 rows 98 cols
[2022-05-20 03:38:42] [INFO ] Computed 43 place invariants in 1 ms
[2022-05-20 03:38:42] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 98/277 places, 82/249 transitions.
Finished structural reductions, in 2 iterations. Remains : 98/277 places, 82/249 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLCardinality-05 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 (EQ s83 0) (EQ s53 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 1551 reset in 201 ms.
Stack based approach found an accepted trace after 347 steps with 2 reset with depth 202 and stack size 196 in 1 ms.
FORMULA ShieldPPPt-PT-004B-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-004B-LTLCardinality-05 finished in 541 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(X(p0)))&&G(X(p1)))))'
Support contains 4 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 249/249 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 270 transition count 242
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 270 transition count 242
Applied a total of 14 rules in 15 ms. Remains 270 /277 variables (removed 7) and now considering 242/249 (removed 7) transitions.
// Phase 1: matrix 242 rows 270 cols
[2022-05-20 03:38:43] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-20 03:38:43] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 242 rows 270 cols
[2022-05-20 03:38:43] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-20 03:38:43] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 270 cols
[2022-05-20 03:38:43] [INFO ] Computed 45 place invariants in 8 ms
[2022-05-20 03:38:43] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 270/277 places, 242/249 transitions.
Finished structural reductions, in 1 iterations. Remains : 270/277 places, 242/249 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p1:(OR (EQ s157 0) (EQ s121 1)), p0:(OR (EQ s2 0) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-004B-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-004B-LTLCardinality-06 finished in 544 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(G((F(p0) U p1))))&&X(!(!G(p2) U p1))))'
Support contains 6 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 249/249 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 270 transition count 242
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 270 transition count 242
Applied a total of 14 rules in 13 ms. Remains 270 /277 variables (removed 7) and now considering 242/249 (removed 7) transitions.
// Phase 1: matrix 242 rows 270 cols
[2022-05-20 03:38:43] [INFO ] Computed 45 place invariants in 2 ms
[2022-05-20 03:38:43] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 242 rows 270 cols
[2022-05-20 03:38:43] [INFO ] Computed 45 place invariants in 5 ms
[2022-05-20 03:38:43] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 270 cols
[2022-05-20 03:38:43] [INFO ] Computed 45 place invariants in 3 ms
[2022-05-20 03:38:44] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 270/277 places, 242/249 transitions.
Finished structural reductions, in 1 iterations. Remains : 270/277 places, 242/249 transitions.
Stuttering acceptance computed with spot in 338 ms :[true, true, true, p1, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (AND p1 (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(NOT p1), acceptance={} source=1 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 7}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(NOT p1), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 7}, { cond=(AND p2 p1), acceptance={} source=7 dest: 8}], [{ cond=(NOT p2), acceptance={} source=8 dest: 2}, { cond=p2, acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(OR (EQ s265 0) (EQ s11 1)), p2:(OR (EQ s68 0) (EQ s166 1)), p0:(OR (EQ s245 0) (EQ s64 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-004B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-004B-LTLCardinality-07 finished in 740 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0))||(p1 U (G(p2) U p3)))))'
Support contains 7 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 249/249 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 273 transition count 245
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 273 transition count 245
Applied a total of 8 rules in 12 ms. Remains 273 /277 variables (removed 4) and now considering 245/249 (removed 4) transitions.
// Phase 1: matrix 245 rows 273 cols
[2022-05-20 03:38:44] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-20 03:38:44] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 245 rows 273 cols
[2022-05-20 03:38:44] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-20 03:38:44] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
// Phase 1: matrix 245 rows 273 cols
[2022-05-20 03:38:44] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-20 03:38:44] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 273/277 places, 245/249 transitions.
Finished structural reductions, in 1 iterations. Remains : 273/277 places, 245/249 transitions.
Stuttering acceptance computed with spot in 453 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p2) (NOT p0)), (NOT p2), true, (AND (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p3 p2 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=1 dest: 9}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={} source=6 dest: 0}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p3) p1), acceptance={} source=7 dest: 10}], [{ cond=(NOT p2), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={} source=8 dest: 1}, { cond=(AND p3 p2), acceptance={} source=8 dest: 2}], [{ cond=(AND p3 p2), acceptance={0} source=9 dest: 3}, { cond=(NOT p2), acceptance={0} source=9 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={0} source=9 dest: 9}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=10 dest: 0}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=10 dest: 1}, { cond=(AND (NOT p3) p1), acceptance={} source=10 dest: 12}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=11 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={0} source=11 dest: 9}, { cond=(AND (NOT p3) p1), acceptance={0} source=11 dest: 11}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=12 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=12 dest: 9}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=12 dest: 11}]], initial=5, aps=[p0:(EQ s31 1), p3:(OR (EQ s209 0) (EQ s69 1)), p2:(OR (EQ s115 0) (EQ s59 1)), p1:(OR (EQ s201 0) (EQ s118 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 19814 reset in 138 ms.
Product exploration explored 100000 steps with 19691 reset in 197 ms.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Knowledge obtained : [(AND (NOT p0) p3 p2 p1), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (AND (NOT p3) p1)), true, (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X p2))]
False Knowledge obtained : [(X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND p3 p2))), (X (X (NOT (AND p3 p2)))), (X (X (AND (NOT p3) p1))), (X (X (NOT (AND (NOT p3) p1))))]
Knowledge based reduction with 8 factoid took 431 ms. Reduced automaton from 13 states, 29 edges and 4 AP to 8 states, 15 edges and 4 AP.
Stuttering acceptance computed with spot in 486 ms :[(NOT p2), (AND (NOT p0) (NOT p3)), (OR (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 10) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 245 rows 273 cols
[2022-05-20 03:38:46] [INFO ] Computed 45 place invariants in 5 ms
[2022-05-20 03:38:46] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 03:38:47] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2022-05-20 03:38:47] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-20 03:38:47] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 3 ms to minimize.
[2022-05-20 03:38:47] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2022-05-20 03:38:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 190 ms
[2022-05-20 03:38:47] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2022-05-20 03:38:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2022-05-20 03:38:47] [INFO ] After 461ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 62 ms.
[2022-05-20 03:38:47] [INFO ] After 613ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 30 ms.
Support contains 7 out of 273 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 273/273 places, 245/245 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 273 transition count 193
Reduce places removed 52 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 54 rules applied. Total rules applied 106 place count 221 transition count 191
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 108 place count 219 transition count 191
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 108 place count 219 transition count 162
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 166 place count 190 transition count 162
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 306 place count 120 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 307 place count 120 transition count 91
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 309 place count 119 transition count 90
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 331 place count 108 transition count 90
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 341 place count 108 transition count 90
Applied a total of 341 rules in 27 ms. Remains 108 /273 variables (removed 165) and now considering 90/245 (removed 155) transitions.
Finished structural reductions, in 1 iterations. Remains : 108/273 places, 90/245 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 236726 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{}
Probabilistic random walk after 236726 steps, saw 165811 distinct states, run finished after 3002 ms. (steps per millisecond=78 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 90 rows 108 cols
[2022-05-20 03:38:50] [INFO ] Computed 45 place invariants in 0 ms
[2022-05-20 03:38:50] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 03:38:51] [INFO ] [Nat]Absence check using 45 positive place invariants in 6 ms returned sat
[2022-05-20 03:38:51] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-20 03:38:51] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-05-20 03:38:51] [INFO ] After 72ms SMT Verify possible using 27 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-20 03:38:51] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 2 ms to minimize.
[2022-05-20 03:38:51] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2022-05-20 03:38:51] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2022-05-20 03:38:51] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2022-05-20 03:38:51] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2022-05-20 03:38:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 199 ms
[2022-05-20 03:38:51] [INFO ] After 338ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-05-20 03:38:51] [INFO ] After 474ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 7 out of 108 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 108/108 places, 90/90 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 377875 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :{}
Probabilistic random walk after 377875 steps, saw 260466 distinct states, run finished after 3001 ms. (steps per millisecond=125 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 90 rows 108 cols
[2022-05-20 03:38:54] [INFO ] Computed 45 place invariants in 0 ms
[2022-05-20 03:38:54] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 03:38:54] [INFO ] [Nat]Absence check using 45 positive place invariants in 5 ms returned sat
[2022-05-20 03:38:54] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 03:38:54] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-05-20 03:38:54] [INFO ] After 31ms SMT Verify possible using 27 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 03:38:54] [INFO ] After 74ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 28 ms.
[2022-05-20 03:38:54] [INFO ] After 179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 7 out of 108 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 108/108 places, 90/90 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 9 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 108 cols
[2022-05-20 03:38:54] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-20 03:38:54] [INFO ] Implicit Places using invariants in 64 ms returned [101]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 107/108 places, 90/90 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 107 transition count 88
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 105 transition count 88
Applied a total of 4 rules in 4 ms. Remains 105 /107 variables (removed 2) and now considering 88/90 (removed 2) transitions.
// Phase 1: matrix 88 rows 105 cols
[2022-05-20 03:38:54] [INFO ] Computed 44 place invariants in 0 ms
[2022-05-20 03:38:54] [INFO ] Implicit Places using invariants in 57 ms returned [88, 92]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 65 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 103/108 places, 88/90 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 101 transition count 86
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 101 transition count 86
Applied a total of 4 rules in 4 ms. Remains 101 /103 variables (removed 2) and now considering 86/88 (removed 2) transitions.
// Phase 1: matrix 86 rows 101 cols
[2022-05-20 03:38:54] [INFO ] Computed 42 place invariants in 1 ms
[2022-05-20 03:38:55] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 86 rows 101 cols
[2022-05-20 03:38:55] [INFO ] Computed 42 place invariants in 1 ms
[2022-05-20 03:38:55] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-20 03:38:55] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 101/108 places, 86/90 transitions.
Finished structural reductions, in 3 iterations. Remains : 101/108 places, 86/90 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 450518 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :{}
Probabilistic random walk after 450518 steps, saw 318990 distinct states, run finished after 3001 ms. (steps per millisecond=150 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 86 rows 101 cols
[2022-05-20 03:38:58] [INFO ] Computed 42 place invariants in 2 ms
[2022-05-20 03:38:58] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 03:38:58] [INFO ] [Nat]Absence check using 42 positive place invariants in 4 ms returned sat
[2022-05-20 03:38:58] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 03:38:58] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-20 03:38:58] [INFO ] After 31ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 03:38:58] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2022-05-20 03:38:58] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2022-05-20 03:38:58] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2022-05-20 03:38:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 126 ms
[2022-05-20 03:38:58] [INFO ] After 191ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-05-20 03:38:58] [INFO ] After 287ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 16 ms.
Support contains 7 out of 101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 5 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 101/101 places, 86/86 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 2 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
// Phase 1: matrix 86 rows 101 cols
[2022-05-20 03:38:58] [INFO ] Computed 42 place invariants in 2 ms
[2022-05-20 03:38:58] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 86 rows 101 cols
[2022-05-20 03:38:58] [INFO ] Computed 42 place invariants in 1 ms
[2022-05-20 03:38:58] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-20 03:38:58] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2022-05-20 03:38:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 86 rows 101 cols
[2022-05-20 03:38:58] [INFO ] Computed 42 place invariants in 1 ms
[2022-05-20 03:38:58] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 101/101 places, 86/86 transitions.
Partial Free-agglomeration rule applied 24 times.
Drop transitions removed 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 101 transition count 86
Applied a total of 24 rules in 4 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 86 rows 101 cols
[2022-05-20 03:38:58] [INFO ] Computed 42 place invariants in 0 ms
[2022-05-20 03:38:58] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 03:38:58] [INFO ] [Nat]Absence check using 42 positive place invariants in 5 ms returned sat
[2022-05-20 03:38:58] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 03:38:58] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-05-20 03:38:59] [INFO ] After 18ms SMT Verify possible using 23 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 03:38:59] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2022-05-20 03:38:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2022-05-20 03:38:59] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 19 ms.
[2022-05-20 03:38:59] [INFO ] After 176ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-20 03:38:59] [INFO ] Flatten gal took : 8 ms
[2022-05-20 03:38:59] [INFO ] Flatten gal took : 6 ms
[2022-05-20 03:38:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13139872696278702824.gal : 3 ms
[2022-05-20 03:38:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11981798378993935890.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms3994240586635056816;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13139872696278702824.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11981798378993935890.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality11981798378993935890.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 19
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :19 after 30
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :30 after 68
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :68 after 112
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :112 after 384
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :384 after 925
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :925 after 2648
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2648 after 91094
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :91094 after 1.13226e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.13226e+06 after 8.4411e+08
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :8.4411e+08 after 2.0286e+10
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2.0286e+10 after 4.32218e+12
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :4.32218e+12 after 2.9207e+13
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6.07806e+13,3.33474,100640,2,5030,19,326544,8,0,502,677696,0
Total reachable state count : 60780586836950

Verifying 2 reachability properties.
Reachability property apf1 does not hold.
No reachable states exhibit your property : apf1

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,0,3.33675,100640,1,0,19,326544,8,0,508,677696,0
Reachability property apf6 does not hold.
No reachable states exhibit your property : apf6

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf6,0,3.33749,100640,1,0,19,326544,8,0,508,677696,0
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p3 p2 p1), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (AND (NOT p3) p1)), true, (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X p2)), (G (NOT (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p3) p2))), (G (NOT (AND (NOT p1) (NOT p3) p2 (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p3) (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND p3 p2))), (X (X (NOT (AND p3 p2)))), (X (X (AND (NOT p3) p1))), (X (X (NOT (AND (NOT p3) p1)))), (F (NOT (AND p3 p2))), (F (AND (NOT p3) p2)), (F (NOT p2)), (F (AND p1 (NOT p3) (NOT p0))), (F (AND p1 (NOT p3))), (F (NOT p3))]
Knowledge based reduction with 12 factoid took 920 ms. Reduced automaton from 8 states, 15 edges and 4 AP to 5 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p3) p1 (NOT p0)), (AND (NOT p3) p1), (AND (NOT p3) p1 (NOT p0)), (AND (NOT p3) p1 (NOT p0)), (AND (NOT p3) p1 (NOT p0))]
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p3) p1 (NOT p0)), (AND (NOT p3) p1), (AND (NOT p3) p1 (NOT p0)), (AND (NOT p3) p1 (NOT p0)), (AND (NOT p3) p1 (NOT p0))]
Support contains 5 out of 273 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 245/245 transitions.
Applied a total of 0 rules in 6 ms. Remains 273 /273 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 273 cols
[2022-05-20 03:39:03] [INFO ] Computed 45 place invariants in 3 ms
[2022-05-20 03:39:03] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 245 rows 273 cols
[2022-05-20 03:39:03] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-20 03:39:04] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
// Phase 1: matrix 245 rows 273 cols
[2022-05-20 03:39:04] [INFO ] Computed 45 place invariants in 0 ms
[2022-05-20 03:39:04] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 273/273 places, 245/245 transitions.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Knowledge obtained : [(AND p3 p1 (NOT p0))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3))]
Knowledge based reduction with 1 factoid took 69 ms. Reduced automaton from 5 states, 5 edges and 3 AP to 5 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p3) p1 (NOT p0)), (AND (NOT p3) p1), (AND (NOT p3) p1 (NOT p0)), (AND (NOT p3) p1 (NOT p0)), (AND (NOT p3) p1 (NOT p0))]
Finished random walk after 1 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p3 p1 (NOT p0))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (F (NOT p3)), (F (AND (NOT p0) p1 (NOT p3))), (F (AND p1 (NOT p3)))]
Knowledge based reduction with 1 factoid took 111 ms. Reduced automaton from 5 states, 5 edges and 3 AP to 5 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p3) p1 (NOT p0)), (AND (NOT p3) p1), (AND (NOT p3) p1 (NOT p0)), (AND (NOT p3) p1 (NOT p0)), (AND (NOT p3) p1 (NOT p0))]
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p3) p1 (NOT p0)), (AND (NOT p3) p1), (AND (NOT p3) p1 (NOT p0)), (AND (NOT p3) p1 (NOT p0)), (AND (NOT p3) p1 (NOT p0))]
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p3) p1 (NOT p0)), (AND (NOT p3) p1), (AND (NOT p3) p1 (NOT p0)), (AND (NOT p3) p1 (NOT p0)), (AND (NOT p3) p1 (NOT p0))]
Product exploration explored 100000 steps with 19564 reset in 123 ms.
Product exploration explored 100000 steps with 19771 reset in 120 ms.
Applying partial POR strategy [false, true, true, false, false]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p3) p1 (NOT p0)), (AND (NOT p3) p1), (AND (NOT p3) p1 (NOT p0)), (AND (NOT p3) p1 (NOT p0)), (AND (NOT p3) p1 (NOT p0))]
Support contains 5 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 245/245 transitions.
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 273 transition count 245
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 18 Pre rules applied. Total rules applied 55 place count 273 transition count 260
Deduced a syphon composed of 73 places in 1 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 73 place count 273 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 272 transition count 259
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 272 transition count 259
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 75 place count 272 transition count 260
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 272 transition count 260
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 152 places in 0 ms
Iterating global reduction 1 with 78 rules applied. Total rules applied 154 place count 272 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 155 place count 272 transition count 260
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 186 place count 241 transition count 228
Deduced a syphon composed of 121 places in 0 ms
Iterating global reduction 2 with 31 rules applied. Total rules applied 217 place count 241 transition count 228
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 122 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 218 place count 241 transition count 228
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 220 place count 239 transition count 226
Deduced a syphon composed of 120 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 222 place count 239 transition count 226
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 134 places in 1 ms
Iterating global reduction 2 with 14 rules applied. Total rules applied 236 place count 239 transition count 284
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 251 place count 224 transition count 254
Deduced a syphon composed of 119 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 266 place count 224 transition count 254
Deduced a syphon composed of 119 places in 0 ms
Applied a total of 266 rules in 43 ms. Remains 224 /273 variables (removed 49) and now considering 254/245 (removed -9) transitions.
[2022-05-20 03:39:05] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 254 rows 224 cols
[2022-05-20 03:39:05] [INFO ] Computed 45 place invariants in 3 ms
[2022-05-20 03:39:05] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 224/273 places, 254/245 transitions.
Finished structural reductions, in 1 iterations. Remains : 224/273 places, 254/245 transitions.
Product exploration explored 100000 steps with 23524 reset in 264 ms.
Product exploration explored 100000 steps with 23477 reset in 281 ms.
Built C files in :
/tmp/ltsmin13360288663266605646
[2022-05-20 03:39:06] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13360288663266605646
Running compilation step : cd /tmp/ltsmin13360288663266605646;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 428 ms.
Running link step : cd /tmp/ltsmin13360288663266605646;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin13360288663266605646;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5220011237109452691.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 245/245 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 244
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 244
Applied a total of 2 rules in 6 ms. Remains 272 /273 variables (removed 1) and now considering 244/245 (removed 1) transitions.
// Phase 1: matrix 244 rows 272 cols
[2022-05-20 03:39:21] [INFO ] Computed 45 place invariants in 2 ms
[2022-05-20 03:39:21] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 244 rows 272 cols
[2022-05-20 03:39:21] [INFO ] Computed 45 place invariants in 0 ms
[2022-05-20 03:39:21] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
// Phase 1: matrix 244 rows 272 cols
[2022-05-20 03:39:21] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-20 03:39:21] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 272/273 places, 244/245 transitions.
Finished structural reductions, in 1 iterations. Remains : 272/273 places, 244/245 transitions.
Built C files in :
/tmp/ltsmin16295859290828449399
[2022-05-20 03:39:21] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16295859290828449399
Running compilation step : cd /tmp/ltsmin16295859290828449399;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 343 ms.
Running link step : cd /tmp/ltsmin16295859290828449399;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin16295859290828449399;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8961674225069346743.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 03:39:36] [INFO ] Flatten gal took : 12 ms
[2022-05-20 03:39:36] [INFO ] Flatten gal took : 11 ms
[2022-05-20 03:39:36] [INFO ] Time to serialize gal into /tmp/LTL9228703340787102831.gal : 3 ms
[2022-05-20 03:39:36] [INFO ] Time to serialize properties into /tmp/LTL8103237138014342166.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9228703340787102831.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8103237138014342166.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9228703...266
Read 1 LTL properties
Checking formula 0 : !((X((X(X("(p31==1)")))||(("((p228==0)||(p130==1))")U((G("((p127==0)||(p64==1))"))U("((p238==0)||(p76==1))"))))))
Formula 0 simplified : !X(XX"(p31==1)" | ("((p228==0)||(p130==1))" U (G"((p127==0)||(p64==1))" U "((p238==0)||(p76==1))")))
Detected timeout of ITS tools.
[2022-05-20 03:39:51] [INFO ] Flatten gal took : 17 ms
[2022-05-20 03:39:51] [INFO ] Applying decomposition
[2022-05-20 03:39:51] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10741603677680323788.txt' '-o' '/tmp/graph10741603677680323788.bin' '-w' '/tmp/graph10741603677680323788.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10741603677680323788.bin' '-l' '-1' '-v' '-w' '/tmp/graph10741603677680323788.weights' '-q' '0' '-e' '0.001'
[2022-05-20 03:39:52] [INFO ] Decomposing Gal with order
[2022-05-20 03:39:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 03:39:52] [INFO ] Removed a total of 39 redundant transitions.
[2022-05-20 03:39:52] [INFO ] Flatten gal took : 55 ms
[2022-05-20 03:39:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-20 03:39:52] [INFO ] Time to serialize gal into /tmp/LTL15238379009695586510.gal : 6 ms
[2022-05-20 03:39:52] [INFO ] Time to serialize properties into /tmp/LTL9575775963790023738.ltl : 17 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15238379009695586510.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9575775963790023738.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1523837...246
Read 1 LTL properties
Checking formula 0 : !((X((X(X("(i2.i0.u9.p31==1)")))||(("((i10.i3.u74.p228==0)||(i7.u43.p130==1))")U((G("((i6.i0.u42.p127==0)||(i0.i1.u23.p64==1))"))U("((...202
Formula 0 simplified : !X(XX"(i2.i0.u9.p31==1)" | ("((i10.i3.u74.p228==0)||(i7.u43.p130==1))" U (G"((i6.i0.u42.p127==0)||(i0.i1.u23.p64==1))" U "((i13.i0.u...191
Reverse transition relation is NOT exact ! Due to transitions t46, t49, t96, t99, t143, t192, t195, t223, t232, t241, i0.i0.u2.t202, i0.i1.t167, i0.i1.t173...1059
Computing Next relation with stutter on 369558 deadlock states
63 unique states visited
0 strongly connected components in search stack
62 transitions explored
63 items max in DFS search stack
763 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.69964,139248,1,0,232088,413,3308,555288,265,1278,287479
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldPPPt-PT-004B-LTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldPPPt-PT-004B-LTLCardinality-10 finished in 76075 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 249/249 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 276 transition count 192
Reduce places removed 56 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 57 rules applied. Total rules applied 113 place count 220 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 114 place count 219 transition count 191
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 114 place count 219 transition count 164
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 168 place count 192 transition count 164
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 174 place count 186 transition count 158
Iterating global reduction 3 with 6 rules applied. Total rules applied 180 place count 186 transition count 158
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 180 place count 186 transition count 153
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 190 place count 181 transition count 153
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 3 with 134 rules applied. Total rules applied 324 place count 114 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 325 place count 114 transition count 85
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 327 place count 113 transition count 84
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 349 place count 102 transition count 84
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 351 place count 100 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 352 place count 99 transition count 82
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 352 place count 99 transition count 80
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 356 place count 97 transition count 80
Applied a total of 356 rules in 30 ms. Remains 97 /277 variables (removed 180) and now considering 80/249 (removed 169) transitions.
// Phase 1: matrix 80 rows 97 cols
[2022-05-20 03:40:00] [INFO ] Computed 44 place invariants in 1 ms
[2022-05-20 03:40:00] [INFO ] Implicit Places using invariants in 77 ms returned [80, 84]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 78 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/277 places, 80/249 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 93 transition count 78
Applied a total of 4 rules in 2 ms. Remains 93 /95 variables (removed 2) and now considering 78/80 (removed 2) transitions.
// Phase 1: matrix 78 rows 93 cols
[2022-05-20 03:40:00] [INFO ] Computed 42 place invariants in 0 ms
[2022-05-20 03:40:00] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 78 rows 93 cols
[2022-05-20 03:40:00] [INFO ] Computed 42 place invariants in 0 ms
[2022-05-20 03:40:00] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 93/277 places, 78/249 transitions.
Finished structural reductions, in 2 iterations. Remains : 93/277 places, 78/249 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s36 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 26644 steps with 0 reset in 54 ms.
FORMULA ShieldPPPt-PT-004B-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-004B-LTLCardinality-11 finished in 356 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 249/249 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 276 transition count 194
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 222 transition count 194
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 108 place count 222 transition count 166
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 164 place count 194 transition count 166
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 171 place count 187 transition count 159
Iterating global reduction 2 with 7 rules applied. Total rules applied 178 place count 187 transition count 159
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 178 place count 187 transition count 154
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 188 place count 182 transition count 154
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 320 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 321 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 323 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 345 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 347 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 348 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 348 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 352 place count 99 transition count 82
Applied a total of 352 rules in 22 ms. Remains 99 /277 variables (removed 178) and now considering 82/249 (removed 167) transitions.
// Phase 1: matrix 82 rows 99 cols
[2022-05-20 03:40:00] [INFO ] Computed 44 place invariants in 1 ms
[2022-05-20 03:40:00] [INFO ] Implicit Places using invariants in 124 ms returned [82, 86]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 124 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/277 places, 82/249 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 3 ms. Remains 95 /97 variables (removed 2) and now considering 80/82 (removed 2) transitions.
// Phase 1: matrix 80 rows 95 cols
[2022-05-20 03:40:00] [INFO ] Computed 42 place invariants in 0 ms
[2022-05-20 03:40:01] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 80 rows 95 cols
[2022-05-20 03:40:01] [INFO ] Computed 42 place invariants in 0 ms
[2022-05-20 03:40:01] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 95/277 places, 80/249 transitions.
Finished structural reductions, in 2 iterations. Remains : 95/277 places, 80/249 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s47 0) (EQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1 reset in 221 ms.
Stack based approach found an accepted trace after 83 steps with 0 reset with depth 84 and stack size 83 in 1 ms.
FORMULA ShieldPPPt-PT-004B-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-004B-LTLCardinality-12 finished in 575 ms.
All properties solved by simple procedures.
Total runtime 91997 ms.

BK_STOP 1653018001481

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-PT-004B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286025400587"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;