Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r389-oct2-167903713700539.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ShieldPPPt-PT-001B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713700539
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 7.8K Feb 25 21:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 21:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 20:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 25 20:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 25 21:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 21:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 21:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 19K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679213060607

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-001B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-19 08:04:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 08:04:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 08:04:23] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2023-03-19 08:04:23] [INFO ] Transformed 81 places.
[2023-03-19 08:04:23] [INFO ] Transformed 74 transitions.
[2023-03-19 08:04:23] [INFO ] Found NUPN structural information;
[2023-03-19 08:04:23] [INFO ] Parsed PT model containing 81 places and 74 transitions and 184 arcs in 144 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldPPPt-PT-001B-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001B-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001B-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001B-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001B-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 74/74 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 71 transition count 64
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 71 transition count 64
Applied a total of 20 rules in 22 ms. Remains 71 /81 variables (removed 10) and now considering 64/74 (removed 10) transitions.
// Phase 1: matrix 64 rows 71 cols
[2023-03-19 08:04:23] [INFO ] Computed 12 place invariants in 23 ms
[2023-03-19 08:04:24] [INFO ] Implicit Places using invariants in 416 ms returned []
[2023-03-19 08:04:24] [INFO ] Invariant cache hit.
[2023-03-19 08:04:24] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
[2023-03-19 08:04:24] [INFO ] Invariant cache hit.
[2023-03-19 08:04:24] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 71/81 places, 64/74 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 675 ms. Remains : 71/81 places, 64/74 transitions.
Support contains 16 out of 71 places after structural reductions.
[2023-03-19 08:04:24] [INFO ] Flatten gal took : 37 ms
[2023-03-19 08:04:24] [INFO ] Flatten gal took : 8 ms
[2023-03-19 08:04:24] [INFO ] Input system was already deterministic with 64 transitions.
Finished random walk after 133 steps, including 0 resets, run visited all 11 properties in 36 ms. (steps per millisecond=3 )
Computed a total of 16 stabilizing places and 16 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 64/64 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 70 transition count 49
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 30 place count 56 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 55 transition count 47
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 31 place count 55 transition count 40
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 45 place count 48 transition count 40
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 47 place count 46 transition count 38
Iterating global reduction 3 with 2 rules applied. Total rules applied 49 place count 46 transition count 38
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 49 place count 46 transition count 36
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 53 place count 44 transition count 36
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 81 place count 30 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 83 place count 29 transition count 22
Applied a total of 83 rules in 24 ms. Remains 29 /71 variables (removed 42) and now considering 22/64 (removed 42) transitions.
// Phase 1: matrix 22 rows 29 cols
[2023-03-19 08:04:25] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-19 08:04:25] [INFO ] Implicit Places using invariants in 297 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 299 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/71 places, 22/64 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 28 transition count 20
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 26 transition count 20
Applied a total of 4 rules in 2 ms. Remains 26 /28 variables (removed 2) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 26 cols
[2023-03-19 08:04:25] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-19 08:04:25] [INFO ] Implicit Places using invariants in 63 ms returned [7, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 65 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 24/71 places, 20/64 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 22 transition count 18
Applied a total of 4 rules in 4 ms. Remains 22 /24 variables (removed 2) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-19 08:04:25] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 08:04:25] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-19 08:04:25] [INFO ] Invariant cache hit.
[2023-03-19 08:04:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 08:04:25] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 22/71 places, 18/64 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 545 ms. Remains : 22/71 places, 18/64 transitions.
Stuttering acceptance computed with spot in 274 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLCardinality-00 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 s1 1) (EQ s3 0) (EQ s21 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 76 reset in 357 ms.
Product exploration explored 100000 steps with 52 reset in 252 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 199 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 210 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 29 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-19 08:04:27] [INFO ] Invariant cache hit.
[2023-03-19 08:04:27] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-19 08:04:27] [INFO ] Invariant cache hit.
[2023-03-19 08:04:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 08:04:27] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2023-03-19 08:04:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 08:04:27] [INFO ] Invariant cache hit.
[2023-03-19 08:04:27] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 306 ms. Remains : 22/22 places, 18/18 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 275 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 73 reset in 229 ms.
Product exploration explored 100000 steps with 55 reset in 175 ms.
Built C files in :
/tmp/ltsmin7231351817930475822
[2023-03-19 08:04:28] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2023-03-19 08:04:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 08:04:28] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2023-03-19 08:04:28] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 08:04:28] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2023-03-19 08:04:28] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 08:04:28] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7231351817930475822
Running compilation step : cd /tmp/ltsmin7231351817930475822;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 333 ms.
Running link step : cd /tmp/ltsmin7231351817930475822;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 81 ms.
Running LTSmin : cd /tmp/ltsmin7231351817930475822;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15300690959064141352.hoa' '--buchi-type=spotba'
LTSmin run took 193 ms.
FORMULA ShieldPPPt-PT-001B-LTLCardinality-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPt-PT-001B-LTLCardinality-00 finished in 4570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(p1)))))'
Support contains 3 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 64/64 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 69 transition count 62
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 69 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 68 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 68 transition count 61
Applied a total of 6 rules in 5 ms. Remains 68 /71 variables (removed 3) and now considering 61/64 (removed 3) transitions.
// Phase 1: matrix 61 rows 68 cols
[2023-03-19 08:04:29] [INFO ] Computed 12 place invariants in 0 ms
[2023-03-19 08:04:29] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-19 08:04:29] [INFO ] Invariant cache hit.
[2023-03-19 08:04:29] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2023-03-19 08:04:29] [INFO ] Invariant cache hit.
[2023-03-19 08:04:29] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 68/71 places, 61/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 250 ms. Remains : 68/71 places, 61/64 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s65 0) (EQ s30 1)), p1:(EQ s6 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5 reset in 139 ms.
Product exploration explored 100000 steps with 7 reset in 248 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Detected a total of 14/68 stabilizing places and 14/61 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p1)), (X (X (AND p0 p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 371 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 3 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p1)), (X (X (AND p0 p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (OR (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 7 factoid took 553 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-19 08:04:32] [INFO ] Invariant cache hit.
[2023-03-19 08:04:32] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-19 08:04:32] [INFO ] Invariant cache hit.
[2023-03-19 08:04:32] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2023-03-19 08:04:32] [INFO ] Invariant cache hit.
[2023-03-19 08:04:32] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 277 ms. Remains : 68/68 places, 61/61 transitions.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Detected a total of 14/68 stabilizing places and 14/61 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p1)), (X (X (AND p0 p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 437 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 3 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p1)), (X (X (AND p0 p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (OR (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 7 factoid took 555 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 10 reset in 190 ms.
Product exploration explored 100000 steps with 9 reset in 132 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 61/61 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 68 transition count 61
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 11 place count 68 transition count 65
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 18 place count 68 transition count 65
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 34 place count 68 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 68 transition count 64
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 41 place count 62 transition count 58
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 47 place count 62 transition count 58
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 62 transition count 58
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 60 transition count 56
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 60 transition count 56
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 29 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 60 transition count 63
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 58 transition count 59
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 58 transition count 59
Deduced a syphon composed of 27 places in 0 ms
Applied a total of 58 rules in 42 ms. Remains 58 /68 variables (removed 10) and now considering 59/61 (removed 2) transitions.
[2023-03-19 08:04:35] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 59 rows 58 cols
[2023-03-19 08:04:35] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-19 08:04:35] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/68 places, 59/61 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 145 ms. Remains : 58/68 places, 59/61 transitions.
Built C files in :
/tmp/ltsmin9083788621444065162
[2023-03-19 08:04:35] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9083788621444065162
Running compilation step : cd /tmp/ltsmin9083788621444065162;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 174 ms.
Running link step : cd /tmp/ltsmin9083788621444065162;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin9083788621444065162;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4021558244462140768.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 61/61 transitions.
Applied a total of 0 rules in 22 ms. Remains 68 /68 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 68 cols
[2023-03-19 08:04:50] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-19 08:04:50] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-19 08:04:50] [INFO ] Invariant cache hit.
[2023-03-19 08:04:50] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2023-03-19 08:04:50] [INFO ] Invariant cache hit.
[2023-03-19 08:04:50] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 350 ms. Remains : 68/68 places, 61/61 transitions.
Built C files in :
/tmp/ltsmin11212921070279021370
[2023-03-19 08:04:50] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11212921070279021370
Running compilation step : cd /tmp/ltsmin11212921070279021370;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 163 ms.
Running link step : cd /tmp/ltsmin11212921070279021370;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin11212921070279021370;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9379496758507137321.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 08:05:05] [INFO ] Flatten gal took : 4 ms
[2023-03-19 08:05:05] [INFO ] Flatten gal took : 5 ms
[2023-03-19 08:05:05] [INFO ] Time to serialize gal into /tmp/LTL2613845142165064756.gal : 1 ms
[2023-03-19 08:05:05] [INFO ] Time to serialize properties into /tmp/LTL4731394003476823919.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2613845142165064756.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14482626343490044518.hoa' '-atoms' '/tmp/LTL4731394003476823919.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4731394003476823919.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14482626343490044518.hoa
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t15, t20, t25, t29, t35, t37, t40, t42, t43, t45, t46, t48, t49, t50, Intersection ...239
Computing Next relation with stutter on 3 deadlock states
91 unique states visited
0 strongly connected components in search stack
94 transitions explored
43 items max in DFS search stack
426 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,4.28523,167168,1,0,935,621783,156,1093,1846,1.17909e+06,2635
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldPPPt-PT-001B-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldPPPt-PT-001B-LTLCardinality-01 finished in 42194 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 64/64 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 70 transition count 48
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 32 place count 55 transition count 46
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 54 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 35 place count 53 transition count 45
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 35 place count 53 transition count 39
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 47 place count 47 transition count 39
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 48 place count 46 transition count 38
Iterating global reduction 4 with 1 rules applied. Total rules applied 49 place count 46 transition count 38
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 49 place count 46 transition count 37
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 51 place count 45 transition count 37
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 79 place count 31 transition count 23
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
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 83 place count 29 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 84 place count 28 transition count 22
Applied a total of 84 rules in 22 ms. Remains 28 /71 variables (removed 43) and now considering 22/64 (removed 42) transitions.
// Phase 1: matrix 22 rows 28 cols
[2023-03-19 08:05:11] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-19 08:05:11] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-19 08:05:11] [INFO ] Invariant cache hit.
[2023-03-19 08:05:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 08:05:12] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2023-03-19 08:05:12] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 08:05:12] [INFO ] Invariant cache hit.
[2023-03-19 08:05:12] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/71 places, 22/64 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 322 ms. Remains : 28/71 places, 22/64 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLCardinality-02 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 (NEQ s20 0) (NEQ s6 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 1668 steps with 0 reset in 2 ms.
FORMULA ShieldPPPt-PT-001B-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-001B-LTLCardinality-02 finished in 406 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X((p0&&X(p1))))))'
Support contains 4 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 64/64 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 69 transition count 62
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 69 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 68 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 68 transition count 61
Applied a total of 6 rules in 3 ms. Remains 68 /71 variables (removed 3) and now considering 61/64 (removed 3) transitions.
// Phase 1: matrix 61 rows 68 cols
[2023-03-19 08:05:12] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-19 08:05:12] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-19 08:05:12] [INFO ] Invariant cache hit.
[2023-03-19 08:05:12] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2023-03-19 08:05:12] [INFO ] Invariant cache hit.
[2023-03-19 08:05:12] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 68/71 places, 61/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 290 ms. Remains : 68/71 places, 61/64 transitions.
Stuttering acceptance computed with spot in 458 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={} source=8 dest: 4}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(OR (EQ s40 0) (EQ s17 1)), p1:(OR (EQ s31 0) (EQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 139 ms.
Product exploration explored 100000 steps with 25000 reset in 76 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 226 ms. Reduced automaton from 9 states, 16 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 327 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
Finished random walk after 3444 steps, including 1 resets, run visited all 3 properties in 34 ms. (steps per millisecond=101 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT p0)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 3 factoid took 215 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 299 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 61/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-19 08:05:14] [INFO ] Invariant cache hit.
[2023-03-19 08:05:14] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-19 08:05:14] [INFO ] Invariant cache hit.
[2023-03-19 08:05:14] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2023-03-19 08:05:14] [INFO ] Invariant cache hit.
[2023-03-19 08:05:15] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 431 ms. Remains : 68/68 places, 61/61 transitions.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 418 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
Finished random walk after 3524 steps, including 1 resets, run visited all 3 properties in 13 ms. (steps per millisecond=271 )
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p0)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 2 factoid took 218 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 288 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 338 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 253 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 116 ms.
Product exploration explored 100000 steps with 25000 reset in 73 ms.
Applying partial POR strategy [false, false, true, false, true, true]
Stuttering acceptance computed with spot in 244 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 61/61 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 68 transition count 61
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 12 place count 68 transition count 65
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 68 transition count 65
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 32 place count 68 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 68 transition count 64
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 39 place count 62 transition count 58
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 45 place count 62 transition count 58
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 62 transition count 70
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 51 place count 59 transition count 64
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 54 place count 59 transition count 64
Deduced a syphon composed of 26 places in 0 ms
Applied a total of 54 rules in 10 ms. Remains 59 /68 variables (removed 9) and now considering 64/61 (removed -3) transitions.
[2023-03-19 08:05:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 64 rows 59 cols
[2023-03-19 08:05:17] [INFO ] Computed 12 place invariants in 9 ms
[2023-03-19 08:05:17] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/68 places, 64/61 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 235 ms. Remains : 59/68 places, 64/61 transitions.
Built C files in :
/tmp/ltsmin16956903343761029385
[2023-03-19 08:05:17] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16956903343761029385
Running compilation step : cd /tmp/ltsmin16956903343761029385;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 138 ms.
Running link step : cd /tmp/ltsmin16956903343761029385;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin16956903343761029385;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13316682986134903141.hoa' '--buchi-type=spotba'
LTSmin run took 588 ms.
FORMULA ShieldPPPt-PT-001B-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPt-PT-001B-LTLCardinality-03 finished in 6092 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p1&&X(p2))||p0))))'
Support contains 4 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 64/64 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 70 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 70 transition count 63
Applied a total of 2 rules in 1 ms. Remains 70 /71 variables (removed 1) and now considering 63/64 (removed 1) transitions.
// Phase 1: matrix 63 rows 70 cols
[2023-03-19 08:05:18] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-19 08:05:18] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-19 08:05:18] [INFO ] Invariant cache hit.
[2023-03-19 08:05:18] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2023-03-19 08:05:18] [INFO ] Invariant cache hit.
[2023-03-19 08:05:18] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70/71 places, 63/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 269 ms. Remains : 70/71 places, 63/64 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s20 0) (EQ s39 1)), p0:(OR (EQ s20 0) (EQ s39 1)), p2:(OR (EQ s59 0) (EQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 12556 steps with 93 reset in 13 ms.
FORMULA ShieldPPPt-PT-001B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-001B-LTLCardinality-04 finished in 463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 64/64 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 70 transition count 48
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 32 place count 55 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 54 transition count 46
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 33 place count 54 transition count 39
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 47 place count 47 transition count 39
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 46 transition count 38
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 46 transition count 38
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 49 place count 46 transition count 37
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 51 place count 45 transition count 37
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 81 place count 30 transition count 22
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 85 place count 28 transition count 22
Applied a total of 85 rules in 5 ms. Remains 28 /71 variables (removed 43) and now considering 22/64 (removed 42) transitions.
// Phase 1: matrix 22 rows 28 cols
[2023-03-19 08:05:18] [INFO ] Computed 12 place invariants in 0 ms
[2023-03-19 08:05:18] [INFO ] Implicit Places using invariants in 56 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 57 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/71 places, 22/64 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 27 transition count 20
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 25 transition count 20
Applied a total of 4 rules in 1 ms. Remains 25 /27 variables (removed 2) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 25 cols
[2023-03-19 08:05:18] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-19 08:05:18] [INFO ] Implicit Places using invariants in 43 ms returned [7, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 57 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/71 places, 20/64 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 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /23 variables (removed 2) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-19 08:05:18] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-19 08:05:18] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-19 08:05:18] [INFO ] Invariant cache hit.
[2023-03-19 08:05:18] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-19 08:05:19] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 21/71 places, 18/64 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 256 ms. Remains : 21/71 places, 18/64 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s3 0) (EQ s16 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 38 reset in 122 ms.
Product exploration explored 100000 steps with 31 reset in 99 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 242 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-19 08:05:19] [INFO ] Invariant cache hit.
[2023-03-19 08:05:19] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-19 08:05:19] [INFO ] Invariant cache hit.
[2023-03-19 08:05:19] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-19 08:05:19] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-03-19 08:05:19] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 08:05:19] [INFO ] Invariant cache hit.
[2023-03-19 08:05:20] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 176 ms. Remains : 21/21 places, 18/18 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 222 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 181 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Product exploration explored 100000 steps with 36 reset in 126 ms.
Product exploration explored 100000 steps with 26 reset in 149 ms.
Built C files in :
/tmp/ltsmin8895148993066798532
[2023-03-19 08:05:20] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2023-03-19 08:05:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 08:05:20] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2023-03-19 08:05:20] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 08:05:20] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2023-03-19 08:05:20] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 08:05:20] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8895148993066798532
Running compilation step : cd /tmp/ltsmin8895148993066798532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 147 ms.
Running link step : cd /tmp/ltsmin8895148993066798532;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin8895148993066798532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2127990995842819002.hoa' '--buchi-type=spotba'
LTSmin run took 134 ms.
FORMULA ShieldPPPt-PT-001B-LTLCardinality-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPt-PT-001B-LTLCardinality-06 finished in 2567 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 64/64 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 69 transition count 62
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 69 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 68 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 68 transition count 61
Applied a total of 6 rules in 9 ms. Remains 68 /71 variables (removed 3) and now considering 61/64 (removed 3) transitions.
// Phase 1: matrix 61 rows 68 cols
[2023-03-19 08:05:21] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-19 08:05:21] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-19 08:05:21] [INFO ] Invariant cache hit.
[2023-03-19 08:05:21] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2023-03-19 08:05:21] [INFO ] Invariant cache hit.
[2023-03-19 08:05:21] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 68/71 places, 61/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 280 ms. Remains : 68/71 places, 61/64 transitions.
Stuttering acceptance computed with spot in 3506 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s47 0) (EQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 96 ms.
Product exploration explored 100000 steps with 25000 reset in 141 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 197 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 45 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=45 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 161 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 440 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-19 08:05:26] [INFO ] Invariant cache hit.
[2023-03-19 08:05:26] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-19 08:05:26] [INFO ] Invariant cache hit.
[2023-03-19 08:05:26] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2023-03-19 08:05:26] [INFO ] Invariant cache hit.
[2023-03-19 08:05:26] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 291 ms. Remains : 68/68 places, 61/61 transitions.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 159 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 34 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=34 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 138 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 232 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 76 ms.
Product exploration explored 100000 steps with 25000 reset in 88 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 61/61 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 68 transition count 61
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 13 place count 68 transition count 64
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 18 place count 68 transition count 64
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 68 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 68 transition count 63
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 44 place count 60 transition count 55
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 52 place count 60 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 60 transition count 55
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 58 transition count 53
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 58 transition count 53
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 58 transition count 63
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 56 transition count 59
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 56 transition count 59
Deduced a syphon composed of 26 places in 0 ms
Applied a total of 63 rules in 19 ms. Remains 56 /68 variables (removed 12) and now considering 59/61 (removed 2) transitions.
[2023-03-19 08:05:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 59 rows 56 cols
[2023-03-19 08:05:28] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-19 08:05:28] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/68 places, 59/61 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 177 ms. Remains : 56/68 places, 59/61 transitions.
Built C files in :
/tmp/ltsmin17255849042795689537
[2023-03-19 08:05:28] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17255849042795689537
Running compilation step : cd /tmp/ltsmin17255849042795689537;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 145 ms.
Running link step : cd /tmp/ltsmin17255849042795689537;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin17255849042795689537;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13072717638826761280.hoa' '--buchi-type=spotba'
LTSmin run took 552 ms.
FORMULA ShieldPPPt-PT-001B-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPt-PT-001B-LTLCardinality-10 finished in 8138 ms.
All properties solved by simple procedures.
Total runtime 66064 ms.

BK_STOP 1679213131382

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-001B"
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-5348"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-PT-001B, 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 r389-oct2-167903713700539"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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