fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r222-tall-165286025200427
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for ShieldPPPs-PT-005B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1615.955 30960.00 75395.00 1279.40 FFTFTTFFTFFFFFFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 324K
-rw-r--r-- 1 mcc users 7.4K Apr 30 03:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 30 03:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 30 03:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 30 03:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 08:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 86K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652983700762

Running Version 202205111006
[2022-05-19 18:08:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 18:08:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 18:08:22] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2022-05-19 18:08:22] [INFO ] Transformed 343 places.
[2022-05-19 18:08:22] [INFO ] Transformed 318 transitions.
[2022-05-19 18:08:22] [INFO ] Found NUPN structural information;
[2022-05-19 18:08:22] [INFO ] Parsed PT model containing 343 places and 318 transitions in 205 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPs-PT-005B-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005B-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005B-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 318/318 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 310 transition count 285
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 310 transition count 285
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 309 transition count 284
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 309 transition count 284
Applied a total of 68 rules in 72 ms. Remains 309 /343 variables (removed 34) and now considering 284/318 (removed 34) transitions.
// Phase 1: matrix 284 rows 309 cols
[2022-05-19 18:08:22] [INFO ] Computed 56 place invariants in 22 ms
[2022-05-19 18:08:22] [INFO ] Implicit Places using invariants in 260 ms returned []
// Phase 1: matrix 284 rows 309 cols
[2022-05-19 18:08:22] [INFO ] Computed 56 place invariants in 3 ms
[2022-05-19 18:08:22] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
// Phase 1: matrix 284 rows 309 cols
[2022-05-19 18:08:22] [INFO ] Computed 56 place invariants in 10 ms
[2022-05-19 18:08:22] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 309/343 places, 284/318 transitions.
Finished structural reductions, in 1 iterations. Remains : 309/343 places, 284/318 transitions.
Support contains 35 out of 309 places after structural reductions.
[2022-05-19 18:08:23] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-19 18:08:23] [INFO ] Flatten gal took : 56 ms
[2022-05-19 18:08:23] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA ShieldPPPs-PT-005B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005B-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 18:08:23] [INFO ] Flatten gal took : 20 ms
[2022-05-19 18:08:23] [INFO ] Input system was already deterministic with 284 transitions.
Support contains 34 out of 309 places (down from 35) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 19) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 284 rows 309 cols
[2022-05-19 18:08:23] [INFO ] Computed 56 place invariants in 2 ms
[2022-05-19 18:08:23] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 18:08:23] [INFO ] [Nat]Absence check using 56 positive place invariants in 11 ms returned sat
[2022-05-19 18:08:23] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
FORMULA ShieldPPPs-PT-005B-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005B-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 61 stabilizing places and 61 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(F(X(F(p0)))))))'
Support contains 2 out of 309 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 309/309 places, 284/284 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 308 transition count 247
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 272 transition count 247
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 72 place count 272 transition count 223
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 120 place count 248 transition count 223
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 122 place count 246 transition count 221
Iterating global reduction 2 with 2 rules applied. Total rules applied 124 place count 246 transition count 221
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 124 place count 246 transition count 220
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 126 place count 245 transition count 220
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 298 place count 159 transition count 134
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 300 place count 157 transition count 132
Applied a total of 300 rules in 57 ms. Remains 157 /309 variables (removed 152) and now considering 132/284 (removed 152) transitions.
// Phase 1: matrix 132 rows 157 cols
[2022-05-19 18:08:24] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-19 18:08:24] [INFO ] Implicit Places using invariants in 94 ms returned []
// Phase 1: matrix 132 rows 157 cols
[2022-05-19 18:08:24] [INFO ] Computed 56 place invariants in 0 ms
[2022-05-19 18:08:24] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2022-05-19 18:08:24] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 132 rows 157 cols
[2022-05-19 18:08:24] [INFO ] Computed 56 place invariants in 8 ms
[2022-05-19 18:08:24] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 157/309 places, 132/284 transitions.
Finished structural reductions, in 1 iterations. Remains : 157/309 places, 132/284 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-005B-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:(AND (EQ s104 0) (EQ s61 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 1361 reset in 465 ms.
Product exploration explored 100000 steps with 1321 reset in 286 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Finished random walk after 133 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=66 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 132 rows 157 cols
[2022-05-19 18:08:25] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-19 18:08:25] [INFO ] [Real]Absence check using 56 positive place invariants in 9 ms returned sat
[2022-05-19 18:08:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 18:08:25] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2022-05-19 18:08:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 18:08:25] [INFO ] [Nat]Absence check using 56 positive place invariants in 9 ms returned sat
[2022-05-19 18:08:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 18:08:26] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2022-05-19 18:08:26] [INFO ] Computed and/alt/rep : 130/245/130 causal constraints (skipped 0 transitions) in 11 ms.
[2022-05-19 18:08:26] [INFO ] Added : 111 causal constraints over 23 iterations in 408 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 132/132 transitions.
Applied a total of 0 rules in 11 ms. Remains 157 /157 variables (removed 0) and now considering 132/132 (removed 0) transitions.
// Phase 1: matrix 132 rows 157 cols
[2022-05-19 18:08:26] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-19 18:08:26] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 132 rows 157 cols
[2022-05-19 18:08:26] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-19 18:08:26] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2022-05-19 18:08:26] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 132 rows 157 cols
[2022-05-19 18:08:26] [INFO ] Computed 56 place invariants in 2 ms
[2022-05-19 18:08:26] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 157/157 places, 132/132 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Finished random walk after 62 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=62 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 132 rows 157 cols
[2022-05-19 18:08:27] [INFO ] Computed 56 place invariants in 0 ms
[2022-05-19 18:08:27] [INFO ] [Real]Absence check using 56 positive place invariants in 9 ms returned sat
[2022-05-19 18:08:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 18:08:27] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2022-05-19 18:08:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 18:08:27] [INFO ] [Nat]Absence check using 56 positive place invariants in 9 ms returned sat
[2022-05-19 18:08:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 18:08:27] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2022-05-19 18:08:27] [INFO ] Computed and/alt/rep : 130/245/130 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-19 18:08:27] [INFO ] Added : 111 causal constraints over 23 iterations in 370 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1324 reset in 225 ms.
Product exploration explored 100000 steps with 1320 reset in 233 ms.
Built C files in :
/tmp/ltsmin7857879301858642408
[2022-05-19 18:08:28] [INFO ] Computing symmetric may disable matrix : 132 transitions.
[2022-05-19 18:08:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 18:08:28] [INFO ] Computing symmetric may enable matrix : 132 transitions.
[2022-05-19 18:08:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 18:08:28] [INFO ] Computing Do-Not-Accords matrix : 132 transitions.
[2022-05-19 18:08:28] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 18:08:28] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7857879301858642408
Running compilation step : cd /tmp/ltsmin7857879301858642408;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 606 ms.
Running link step : cd /tmp/ltsmin7857879301858642408;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin7857879301858642408;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17884071675084336375.hoa' '--buchi-type=spotba'
LTSmin run took 10356 ms.
FORMULA ShieldPPPs-PT-005B-LTLCardinality-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-005B-LTLCardinality-00 finished in 15508 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(p1)&&p0))))'
Support contains 4 out of 309 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 284/284 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 307 transition count 282
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 307 transition count 282
Applied a total of 4 rules in 11 ms. Remains 307 /309 variables (removed 2) and now considering 282/284 (removed 2) transitions.
// Phase 1: matrix 282 rows 307 cols
[2022-05-19 18:08:39] [INFO ] Computed 56 place invariants in 2 ms
[2022-05-19 18:08:39] [INFO ] Implicit Places using invariants in 100 ms returned []
// Phase 1: matrix 282 rows 307 cols
[2022-05-19 18:08:39] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-19 18:08:39] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
// Phase 1: matrix 282 rows 307 cols
[2022-05-19 18:08:39] [INFO ] Computed 56 place invariants in 6 ms
[2022-05-19 18:08:39] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 307/309 places, 282/284 transitions.
Finished structural reductions, in 1 iterations. Remains : 307/309 places, 282/284 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s58 0) (EQ s304 1)), p1:(AND (NEQ s154 0) (NEQ s158 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-005B-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-005B-LTLCardinality-03 finished in 615 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 2 out of 309 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 284/284 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 308 transition count 283
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 308 transition count 283
Applied a total of 2 rules in 12 ms. Remains 308 /309 variables (removed 1) and now considering 283/284 (removed 1) transitions.
// Phase 1: matrix 283 rows 308 cols
[2022-05-19 18:08:40] [INFO ] Computed 56 place invariants in 2 ms
[2022-05-19 18:08:40] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 283 rows 308 cols
[2022-05-19 18:08:40] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-19 18:08:40] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
// Phase 1: matrix 283 rows 308 cols
[2022-05-19 18:08:40] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-19 18:08:40] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 308/309 places, 283/284 transitions.
Finished structural reductions, in 1 iterations. Remains : 308/309 places, 283/284 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s231 0) (EQ s109 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][false, false]]
Stuttering criterion allowed to conclude after 13420 steps with 37 reset in 40 ms.
FORMULA ShieldPPPs-PT-005B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-005B-LTLCardinality-07 finished in 541 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(X(p0))&&p0)))'
Support contains 2 out of 309 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 309/309 places, 284/284 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 308 transition count 247
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 37 rules applied. Total rules applied 73 place count 272 transition count 246
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 271 transition count 246
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 74 place count 271 transition count 222
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 122 place count 247 transition count 222
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 124 place count 245 transition count 220
Iterating global reduction 3 with 2 rules applied. Total rules applied 126 place count 245 transition count 220
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 126 place count 245 transition count 219
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 128 place count 244 transition count 219
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 298 place count 159 transition count 134
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 300 place count 157 transition count 132
Applied a total of 300 rules in 35 ms. Remains 157 /309 variables (removed 152) and now considering 132/284 (removed 152) transitions.
// Phase 1: matrix 132 rows 157 cols
[2022-05-19 18:08:40] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-19 18:08:40] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 132 rows 157 cols
[2022-05-19 18:08:40] [INFO ] Computed 56 place invariants in 6 ms
[2022-05-19 18:08:40] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2022-05-19 18:08:40] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 132 rows 157 cols
[2022-05-19 18:08:40] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-19 18:08:40] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 157/309 places, 132/284 transitions.
Finished structural reductions, in 1 iterations. Remains : 157/309 places, 132/284 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s16 0) (EQ s153 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 333 steps with 0 reset in 3 ms.
FORMULA ShieldPPPs-PT-005B-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-005B-LTLCardinality-10 finished in 366 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(F(G(((G(p1)||p0) U p2))))))'
Support contains 4 out of 309 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 309/309 places, 284/284 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 309 transition count 248
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 37 rules applied. Total rules applied 73 place count 273 transition count 247
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 272 transition count 247
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 74 place count 272 transition count 222
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 124 place count 247 transition count 222
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 126 place count 245 transition count 220
Iterating global reduction 3 with 2 rules applied. Total rules applied 128 place count 245 transition count 220
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 128 place count 245 transition count 219
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 130 place count 244 transition count 219
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 306 place count 156 transition count 131
Applied a total of 306 rules in 27 ms. Remains 156 /309 variables (removed 153) and now considering 131/284 (removed 153) transitions.
// Phase 1: matrix 131 rows 156 cols
[2022-05-19 18:08:41] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-19 18:08:41] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 131 rows 156 cols
[2022-05-19 18:08:41] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-19 18:08:41] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2022-05-19 18:08:41] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 131 rows 156 cols
[2022-05-19 18:08:41] [INFO ] Computed 56 place invariants in 0 ms
[2022-05-19 18:08:41] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/309 places, 131/284 transitions.
Finished structural reductions, in 1 iterations. Remains : 156/309 places, 131/284 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(OR p2 p0 p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={1} source=0 dest: 1}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={0, 1} source=0 dest: 2}], [{ cond=(OR (AND p2 (NOT p1)) (AND p0 (NOT p1))), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (AND p2 p1) (AND p0 p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=1 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={1} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={1} source=2 dest: 1}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p2:(OR (EQ s66 0) (EQ s74 1)), p0:(OR (EQ s66 0) (EQ s74 1)), p1:(OR (EQ s0 0) (EQ s154 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 302 reset in 418 ms.
Product exploration explored 100000 steps with 300 reset in 400 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (OR (AND p2 p1) (AND p0 p1))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (OR (AND p2 (NOT p1)) (AND p0 (NOT p1))))), (X (OR p2 p0 p1)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (X (OR (AND p2 p1) (AND p0 p1)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (OR (AND p2 (NOT p1)) (AND p0 (NOT p1)))))), (X (X (OR p2 p0 p1))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 714 ms. Reduced automaton from 4 states, 17 edges and 3 AP to 4 states, 17 edges and 3 AP.
Stuttering acceptance computed with spot in 409 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 28 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 131 rows 156 cols
[2022-05-19 18:08:43] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-19 18:08:43] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2022-05-19 18:08:43] [INFO ] [Nat]Absence check using 56 positive place invariants in 7 ms returned sat
[2022-05-19 18:08:43] [INFO ] After 43ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (OR (AND p2 p1) (AND p0 p1))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (OR (AND p2 (NOT p1)) (AND p0 (NOT p1))))), (X (OR p2 p0 p1)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (X (OR (AND p2 p1) (AND p0 p1)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (OR (AND p2 (NOT p1)) (AND p0 (NOT p1)))))), (X (X (OR p2 p0 p1))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (OR p0 p1 p2)), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND p0 p1 (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (F (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))), (F (OR (AND p0 p1) (AND p1 p2))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 21 factoid took 1725 ms. Reduced automaton from 4 states, 17 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p2)), false, (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p2)), false, (AND (NOT p0) (NOT p2))]
Support contains 4 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 131/131 transitions.
Applied a total of 0 rules in 6 ms. Remains 156 /156 variables (removed 0) and now considering 131/131 (removed 0) transitions.
// Phase 1: matrix 131 rows 156 cols
[2022-05-19 18:08:45] [INFO ] Computed 56 place invariants in 2 ms
[2022-05-19 18:08:45] [INFO ] Implicit Places using invariants in 88 ms returned []
// Phase 1: matrix 131 rows 156 cols
[2022-05-19 18:08:45] [INFO ] Computed 56 place invariants in 0 ms
[2022-05-19 18:08:46] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2022-05-19 18:08:46] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 131 rows 156 cols
[2022-05-19 18:08:46] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-19 18:08:46] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 156/156 places, 131/131 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (OR (NOT p0) p2)), (X (AND p1 p2)), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR (NOT p0) p2))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 315 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p2)), false, (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 27 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 131 rows 156 cols
[2022-05-19 18:08:46] [INFO ] Computed 56 place invariants in 4 ms
[2022-05-19 18:08:46] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (OR (NOT p0) p2)), (X (AND p1 p2)), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR (NOT p0) p2))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p1) p2)))), (G (OR (NOT p0) p2))]
False Knowledge obtained : [(F (AND p1 p2)), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 10 factoid took 466 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 105 ms :[(NOT p2), false, (NOT p2)]
Stuttering acceptance computed with spot in 115 ms :[(NOT p2), false, (NOT p2)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p2), false, (NOT p2)]
Product exploration explored 100000 steps with 299 reset in 271 ms.
Product exploration explored 100000 steps with 293 reset in 295 ms.
Built C files in :
/tmp/ltsmin7896101316596072357
[2022-05-19 18:08:48] [INFO ] Computing symmetric may disable matrix : 131 transitions.
[2022-05-19 18:08:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 18:08:48] [INFO ] Computing symmetric may enable matrix : 131 transitions.
[2022-05-19 18:08:48] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 18:08:48] [INFO ] Computing Do-Not-Accords matrix : 131 transitions.
[2022-05-19 18:08:48] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 18:08:48] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7896101316596072357
Running compilation step : cd /tmp/ltsmin7896101316596072357;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 268 ms.
Running link step : cd /tmp/ltsmin7896101316596072357;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin7896101316596072357;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1404329495346934976.hoa' '--buchi-type=spotba'
LTSmin run took 414 ms.
FORMULA ShieldPPPs-PT-005B-LTLCardinality-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-005B-LTLCardinality-11 finished in 7875 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)&&X(G(p1))))))'
Support contains 3 out of 309 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 309/309 places, 284/284 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 308 transition count 248
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 273 transition count 247
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 272 transition count 247
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 72 place count 272 transition count 221
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 124 place count 246 transition count 221
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 126 place count 244 transition count 219
Iterating global reduction 3 with 2 rules applied. Total rules applied 128 place count 244 transition count 219
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 128 place count 244 transition count 218
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 130 place count 243 transition count 218
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 1 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 296 place count 160 transition count 135
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 298 place count 158 transition count 133
Applied a total of 298 rules in 45 ms. Remains 158 /309 variables (removed 151) and now considering 133/284 (removed 151) transitions.
// Phase 1: matrix 133 rows 158 cols
[2022-05-19 18:08:48] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-19 18:08:48] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 133 rows 158 cols
[2022-05-19 18:08:48] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-19 18:08:49] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2022-05-19 18:08:49] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 133 rows 158 cols
[2022-05-19 18:08:49] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-19 18:08:49] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/309 places, 133/284 transitions.
Finished structural reductions, in 1 iterations. Remains : 158/309 places, 133/284 transitions.
Stuttering acceptance computed with spot in 1021 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NEQ s5 0) (NEQ s97 1)), p0:(EQ s43 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5835 steps with 28 reset in 21 ms.
FORMULA ShieldPPPs-PT-005B-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-005B-LTLCardinality-12 finished in 1363 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X((F(G(p1))&&p2))))'
Support contains 8 out of 309 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 284/284 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 308 transition count 283
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 308 transition count 283
Applied a total of 2 rules in 9 ms. Remains 308 /309 variables (removed 1) and now considering 283/284 (removed 1) transitions.
// Phase 1: matrix 283 rows 308 cols
[2022-05-19 18:08:50] [INFO ] Computed 56 place invariants in 0 ms
[2022-05-19 18:08:50] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 283 rows 308 cols
[2022-05-19 18:08:50] [INFO ] Computed 56 place invariants in 2 ms
[2022-05-19 18:08:50] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
// Phase 1: matrix 283 rows 308 cols
[2022-05-19 18:08:50] [INFO ] Computed 56 place invariants in 3 ms
[2022-05-19 18:08:50] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 308/309 places, 283/284 transitions.
Finished structural reductions, in 1 iterations. Remains : 308/309 places, 283/284 transitions.
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s196 0) (EQ s125 1)), p2:(OR (EQ s178 0) (EQ s280 1) (NOT (OR (EQ s251 0) (EQ s52 1)))), p1:(OR (EQ s147 0) (EQ s246 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 113 reset in 262 ms.
Stuttering criterion allowed to conclude after 854 steps with 0 reset in 2 ms.
FORMULA ShieldPPPs-PT-005B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-005B-LTLCardinality-13 finished in 967 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(G(p0) U p1))'
Support contains 3 out of 309 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 309/309 places, 284/284 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 308 transition count 247
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 37 rules applied. Total rules applied 73 place count 272 transition count 246
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 271 transition count 246
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 74 place count 271 transition count 221
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 124 place count 246 transition count 221
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 126 place count 244 transition count 219
Iterating global reduction 3 with 2 rules applied. Total rules applied 128 place count 244 transition count 219
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 128 place count 244 transition count 218
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 130 place count 243 transition count 218
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 300 place count 158 transition count 133
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 302 place count 156 transition count 131
Applied a total of 302 rules in 39 ms. Remains 156 /309 variables (removed 153) and now considering 131/284 (removed 153) transitions.
// Phase 1: matrix 131 rows 156 cols
[2022-05-19 18:08:51] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-19 18:08:51] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 131 rows 156 cols
[2022-05-19 18:08:51] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-19 18:08:51] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2022-05-19 18:08:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 131 rows 156 cols
[2022-05-19 18:08:51] [INFO ] Computed 56 place invariants in 1 ms
[2022-05-19 18:08:51] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/309 places, 131/284 transitions.
Finished structural reductions, in 1 iterations. Remains : 156/309 places, 131/284 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, p0, p1, (AND p0 p1)]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(OR (EQ s63 0) (EQ s13 1)), p1:(AND (OR (EQ s63 0) (EQ s13 1)) (EQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 1383 steps with 4 reset in 8 ms.
FORMULA ShieldPPPs-PT-005B-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-005B-LTLCardinality-15 finished in 466 ms.
All properties solved by simple procedures.
Total runtime 29756 ms.

BK_STOP 1652983731722

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-005B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldPPPs-PT-005B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286025200427"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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