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-167903713500427.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 ShieldPPPs-PT-005B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713500427
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 5.7K Feb 26 01:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 01:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 01:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 01:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 01:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 26 01:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 01:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 01:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:58 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 86K 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 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 1679198291565

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=ShieldPPPs-PT-005B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-19 03:58:14] [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 03:58:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 03:58:15] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2023-03-19 03:58:15] [INFO ] Transformed 343 places.
[2023-03-19 03:58:15] [INFO ] Transformed 318 transitions.
[2023-03-19 03:58:15] [INFO ] Found NUPN structural information;
[2023-03-19 03:58:15] [INFO ] Parsed PT model containing 343 places and 318 transitions and 876 arcs in 152 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPs-PT-005B-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005B-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005B-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005B-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 318/318 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 318 transition count 293
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 318 transition count 293
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 317 transition count 292
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 317 transition count 292
Applied a total of 52 rules in 76 ms. Remains 317 /343 variables (removed 26) and now considering 292/318 (removed 26) transitions.
// Phase 1: matrix 292 rows 317 cols
[2023-03-19 03:58:15] [INFO ] Computed 56 place invariants in 12 ms
[2023-03-19 03:58:15] [INFO ] Implicit Places using invariants in 557 ms returned []
[2023-03-19 03:58:15] [INFO ] Invariant cache hit.
[2023-03-19 03:58:16] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 1135 ms to find 0 implicit places.
[2023-03-19 03:58:16] [INFO ] Invariant cache hit.
[2023-03-19 03:58:16] [INFO ] Dead Transitions using invariants and state equation in 329 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 317/343 places, 292/318 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1555 ms. Remains : 317/343 places, 292/318 transitions.
Support contains 32 out of 317 places after structural reductions.
[2023-03-19 03:58:17] [INFO ] Flatten gal took : 61 ms
[2023-03-19 03:58:17] [INFO ] Flatten gal took : 38 ms
[2023-03-19 03:58:17] [INFO ] Input system was already deterministic with 292 transitions.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 18) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 03:58:17] [INFO ] Invariant cache hit.
[2023-03-19 03:58:17] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 03:58:17] [INFO ] [Nat]Absence check using 56 positive place invariants in 10 ms returned sat
[2023-03-19 03:58:17] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 03:58:18] [INFO ] Deduced a trap composed of 23 places in 298 ms of which 19 ms to minimize.
[2023-03-19 03:58:18] [INFO ] Deduced a trap composed of 20 places in 277 ms of which 1 ms to minimize.
[2023-03-19 03:58:18] [INFO ] Deduced a trap composed of 19 places in 191 ms of which 1 ms to minimize.
[2023-03-19 03:58:18] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 0 ms to minimize.
[2023-03-19 03:58:18] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 9 ms to minimize.
[2023-03-19 03:58:19] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 1 ms to minimize.
[2023-03-19 03:58:19] [INFO ] Deduced a trap composed of 31 places in 180 ms of which 0 ms to minimize.
[2023-03-19 03:58:19] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1435 ms
[2023-03-19 03:58:19] [INFO ] After 1632ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-19 03:58:19] [INFO ] After 1730ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 292/292 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 317 transition count 256
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 281 transition count 255
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 280 transition count 255
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 280 transition count 230
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 255 transition count 230
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 133 place count 246 transition count 221
Iterating global reduction 3 with 9 rules applied. Total rules applied 142 place count 246 transition count 221
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 142 place count 246 transition count 218
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 148 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 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 314 place count 160 transition count 135
Partial Free-agglomeration rule applied 42 times.
Drop transitions removed 42 transitions
Iterating global reduction 3 with 42 rules applied. Total rules applied 356 place count 160 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 357 place count 159 transition count 134
Applied a total of 357 rules in 65 ms. Remains 159 /317 variables (removed 158) and now considering 134/292 (removed 158) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 159/317 places, 134/292 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1030163 steps, run timeout after 3001 ms. (steps per millisecond=343 ) properties seen :{}
Probabilistic random walk after 1030163 steps, saw 371050 distinct states, run finished after 3002 ms. (steps per millisecond=343 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 134 rows 159 cols
[2023-03-19 03:58:22] [INFO ] Computed 56 place invariants in 4 ms
[2023-03-19 03:58:22] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 03:58:22] [INFO ] [Nat]Absence check using 54 positive place invariants in 36 ms returned sat
[2023-03-19 03:58:22] [INFO ] [Nat]Absence check using 54 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-19 03:58:22] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 03:58:23] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 1 ms to minimize.
[2023-03-19 03:58:23] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 0 ms to minimize.
[2023-03-19 03:58:23] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 1 ms to minimize.
[2023-03-19 03:58:23] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2023-03-19 03:58:23] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2023-03-19 03:58:23] [INFO ] Deduced a trap composed of 6 places in 185 ms of which 6 ms to minimize.
[2023-03-19 03:58:23] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 1 ms to minimize.
[2023-03-19 03:58:23] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
[2023-03-19 03:58:24] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 0 ms to minimize.
[2023-03-19 03:58:24] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 1 ms to minimize.
[2023-03-19 03:58:24] [INFO ] Deduced a trap composed of 7 places in 200 ms of which 0 ms to minimize.
[2023-03-19 03:58:24] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2023-03-19 03:58:24] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1454 ms
[2023-03-19 03:58:24] [INFO ] After 1634ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-19 03:58:24] [INFO ] After 1819ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 134/134 transitions.
Applied a total of 0 rules in 13 ms. Remains 159 /159 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 159/159 places, 134/134 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 134/134 transitions.
Applied a total of 0 rules in 10 ms. Remains 159 /159 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2023-03-19 03:58:24] [INFO ] Invariant cache hit.
[2023-03-19 03:58:24] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-19 03:58:24] [INFO ] Invariant cache hit.
[2023-03-19 03:58:24] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
[2023-03-19 03:58:24] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 03:58:24] [INFO ] Invariant cache hit.
[2023-03-19 03:58:25] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 521 ms. Remains : 159/159 places, 134/134 transitions.
Applied a total of 0 rules in 5 ms. Remains 159 /159 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-19 03:58:25] [INFO ] Invariant cache hit.
[2023-03-19 03:58:25] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 03:58:25] [INFO ] [Nat]Absence check using 54 positive place invariants in 48 ms returned sat
[2023-03-19 03:58:25] [INFO ] [Nat]Absence check using 54 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 03:58:25] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 03:58:25] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 0 ms to minimize.
[2023-03-19 03:58:25] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2023-03-19 03:58:25] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 1 ms to minimize.
[2023-03-19 03:58:25] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2023-03-19 03:58:25] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
[2023-03-19 03:58:25] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 0 ms to minimize.
[2023-03-19 03:58:26] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2023-03-19 03:58:26] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 1 ms to minimize.
[2023-03-19 03:58:26] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2023-03-19 03:58:26] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2023-03-19 03:58:26] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 872 ms
[2023-03-19 03:58:26] [INFO ] After 1091ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-19 03:58:26] [INFO ] After 1270ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA ShieldPPPs-PT-005B-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 63 stabilizing places and 63 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)) U G(p1)))'
Support contains 4 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 316 transition count 254
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 74 place count 279 transition count 254
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 74 place count 279 transition count 230
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 122 place count 255 transition count 230
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 129 place count 248 transition count 223
Iterating global reduction 2 with 7 rules applied. Total rules applied 136 place count 248 transition count 223
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 136 place count 248 transition count 221
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 140 place count 246 transition count 221
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 1 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 312 place count 160 transition count 135
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 314 place count 158 transition count 133
Applied a total of 314 rules in 52 ms. Remains 158 /317 variables (removed 159) and now considering 133/292 (removed 159) transitions.
// Phase 1: matrix 133 rows 158 cols
[2023-03-19 03:58:26] [INFO ] Computed 56 place invariants in 2 ms
[2023-03-19 03:58:26] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-19 03:58:26] [INFO ] Invariant cache hit.
[2023-03-19 03:58:27] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
[2023-03-19 03:58:27] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 03:58:27] [INFO ] Invariant cache hit.
[2023-03-19 03:58:27] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/317 places, 133/292 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 645 ms. Remains : 158/317 places, 133/292 transitions.
Stuttering acceptance computed with spot in 363 ms :[(NOT p1), p0, (AND p0 p1)]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s31 0) (EQ s147 1)), p0:(OR (EQ s85 0) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 978 steps with 2 reset in 12 ms.
FORMULA ShieldPPPs-PT-005B-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-005B-LTLCardinality-02 finished in 1086 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 4 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 308 transition count 283
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 308 transition count 283
Applied a total of 18 rules in 9 ms. Remains 308 /317 variables (removed 9) and now considering 283/292 (removed 9) transitions.
// Phase 1: matrix 283 rows 308 cols
[2023-03-19 03:58:27] [INFO ] Computed 56 place invariants in 2 ms
[2023-03-19 03:58:28] [INFO ] Implicit Places using invariants in 224 ms returned []
[2023-03-19 03:58:28] [INFO ] Invariant cache hit.
[2023-03-19 03:58:28] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
[2023-03-19 03:58:28] [INFO ] Invariant cache hit.
[2023-03-19 03:58:28] [INFO ] Dead Transitions using invariants and state equation in 292 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 308/317 places, 283/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 807 ms. Remains : 308/317 places, 283/292 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s7 0) (NEQ s201 1) (NEQ s68 0) (NEQ s234 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-005B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-005B-LTLCardinality-04 finished in 1022 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 4 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 308 transition count 283
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 308 transition count 283
Applied a total of 18 rules in 9 ms. Remains 308 /317 variables (removed 9) and now considering 283/292 (removed 9) transitions.
// Phase 1: matrix 283 rows 308 cols
[2023-03-19 03:58:28] [INFO ] Computed 56 place invariants in 2 ms
[2023-03-19 03:58:29] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-03-19 03:58:29] [INFO ] Invariant cache hit.
[2023-03-19 03:58:29] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
[2023-03-19 03:58:29] [INFO ] Invariant cache hit.
[2023-03-19 03:58:29] [INFO ] Dead Transitions using invariants and state equation in 310 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 308/317 places, 283/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 865 ms. Remains : 308/317 places, 283/292 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s43 0) (EQ s166 1)), p1:(OR (EQ s196 0) (EQ s266 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 397 ms.
Product exploration explored 100000 steps with 50000 reset in 359 ms.
Computed a total of 59 stabilizing places and 59 stable transitions
Computed a total of 59 stabilizing places and 59 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 6 factoid took 309 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-005B-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-005B-LTLCardinality-05 finished in 2165 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((G(!p1)||(!p1&&F(G(!p2))))&&p0)))))'
Support contains 6 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 309 transition count 284
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 309 transition count 284
Applied a total of 16 rules in 8 ms. Remains 309 /317 variables (removed 8) and now considering 284/292 (removed 8) transitions.
// Phase 1: matrix 284 rows 309 cols
[2023-03-19 03:58:31] [INFO ] Computed 56 place invariants in 12 ms
[2023-03-19 03:58:31] [INFO ] Implicit Places using invariants in 236 ms returned []
[2023-03-19 03:58:31] [INFO ] Invariant cache hit.
[2023-03-19 03:58:31] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
[2023-03-19 03:58:31] [INFO ] Invariant cache hit.
[2023-03-19 03:58:31] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 309/317 places, 284/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 982 ms. Remains : 309/317 places, 284/292 transitions.
Stuttering acceptance computed with spot in 175 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=(OR (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(AND (OR (EQ s108 0) (EQ s26 1)) (OR (EQ s47 0) (EQ s224 1))), p1:(OR (EQ s186 0) (EQ s68 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-005B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-005B-LTLCardinality-07 finished in 1190 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)||(X(!p1) U ((!p2&&X(!p1))||X(G(!p1)))))))'
Support contains 4 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 309 transition count 284
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 309 transition count 284
Applied a total of 16 rules in 7 ms. Remains 309 /317 variables (removed 8) and now considering 284/292 (removed 8) transitions.
// Phase 1: matrix 284 rows 309 cols
[2023-03-19 03:58:32] [INFO ] Computed 56 place invariants in 1 ms
[2023-03-19 03:58:32] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-19 03:58:32] [INFO ] Invariant cache hit.
[2023-03-19 03:58:32] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
[2023-03-19 03:58:32] [INFO ] Invariant cache hit.
[2023-03-19 03:58:33] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 309/317 places, 284/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 835 ms. Remains : 309/317 places, 284/292 transitions.
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s94 0) (EQ s124 1)), p1:(OR (EQ s137 0) (EQ s45 1)), p2:(OR (EQ s124 0) (EQ s94 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2453 steps with 3 reset in 12 ms.
FORMULA ShieldPPPs-PT-005B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-005B-LTLCardinality-08 finished in 1106 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 316 transition count 254
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 74 place count 279 transition count 254
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 74 place count 279 transition count 229
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 124 place count 254 transition count 229
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 133 place count 245 transition count 220
Iterating global reduction 2 with 9 rules applied. Total rules applied 142 place count 245 transition count 220
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 142 place count 245 transition count 217
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 148 place count 242 transition count 217
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 312 place count 160 transition count 135
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 314 place count 158 transition count 133
Applied a total of 314 rules in 48 ms. Remains 158 /317 variables (removed 159) and now considering 133/292 (removed 159) transitions.
// Phase 1: matrix 133 rows 158 cols
[2023-03-19 03:58:33] [INFO ] Computed 56 place invariants in 1 ms
[2023-03-19 03:58:33] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-19 03:58:33] [INFO ] Invariant cache hit.
[2023-03-19 03:58:33] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2023-03-19 03:58:33] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 03:58:33] [INFO ] Invariant cache hit.
[2023-03-19 03:58:33] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/317 places, 133/292 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 525 ms. Remains : 158/317 places, 133/292 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s83 0) (AND (EQ s32 1) (NEQ s146 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 1134 reset in 328 ms.
Product exploration explored 100000 steps with 1218 reset in 307 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]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 278 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 131 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 141 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 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Applied a total of 0 rules in 32 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2023-03-19 03:58:35] [INFO ] Invariant cache hit.
[2023-03-19 03:58:35] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-19 03:58:35] [INFO ] Invariant cache hit.
[2023-03-19 03:58:35] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2023-03-19 03:58:35] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 03:58:35] [INFO ] Invariant cache hit.
[2023-03-19 03:58:35] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 509 ms. Remains : 158/158 places, 133/133 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]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 159 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 145 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 207 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 99 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1160 reset in 286 ms.
Product exploration explored 100000 steps with 1117 reset in 282 ms.
Built C files in :
/tmp/ltsmin8839124829298770344
[2023-03-19 03:58:37] [INFO ] Computing symmetric may disable matrix : 133 transitions.
[2023-03-19 03:58:37] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:58:37] [INFO ] Computing symmetric may enable matrix : 133 transitions.
[2023-03-19 03:58:37] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:58:37] [INFO ] Computing Do-Not-Accords matrix : 133 transitions.
[2023-03-19 03:58:37] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:58:37] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8839124829298770344
Running compilation step : cd /tmp/ltsmin8839124829298770344;'/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 609 ms.
Running link step : cd /tmp/ltsmin8839124829298770344;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 102 ms.
Running LTSmin : cd /tmp/ltsmin8839124829298770344;'/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/stateBased17527315195658091953.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Applied a total of 0 rules in 14 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2023-03-19 03:58:52] [INFO ] Invariant cache hit.
[2023-03-19 03:58:52] [INFO ] Implicit Places using invariants in 324 ms returned []
[2023-03-19 03:58:52] [INFO ] Invariant cache hit.
[2023-03-19 03:58:53] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
[2023-03-19 03:58:53] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 03:58:53] [INFO ] Invariant cache hit.
[2023-03-19 03:58:53] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 825 ms. Remains : 158/158 places, 133/133 transitions.
Built C files in :
/tmp/ltsmin6022833196655431472
[2023-03-19 03:58:53] [INFO ] Computing symmetric may disable matrix : 133 transitions.
[2023-03-19 03:58:53] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:58:53] [INFO ] Computing symmetric may enable matrix : 133 transitions.
[2023-03-19 03:58:53] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:58:53] [INFO ] Computing Do-Not-Accords matrix : 133 transitions.
[2023-03-19 03:58:53] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:58:53] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6022833196655431472
Running compilation step : cd /tmp/ltsmin6022833196655431472;'/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 290 ms.
Running link step : cd /tmp/ltsmin6022833196655431472;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 92 ms.
Running LTSmin : cd /tmp/ltsmin6022833196655431472;'/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/stateBased9619533263201297268.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 03:59:08] [INFO ] Flatten gal took : 15 ms
[2023-03-19 03:59:08] [INFO ] Flatten gal took : 12 ms
[2023-03-19 03:59:08] [INFO ] Time to serialize gal into /tmp/LTL9108464296198718835.gal : 4 ms
[2023-03-19 03:59:08] [INFO ] Time to serialize properties into /tmp/LTL10335611615594002224.prop : 0 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/LTL9108464296198718835.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2595765883598915654.hoa' '-atoms' '/tmp/LTL10335611615594002224.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/LTL10335611615594002224.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2595765883598915654.hoa
Detected timeout of ITS tools.
[2023-03-19 03:59:23] [INFO ] Flatten gal took : 9 ms
[2023-03-19 03:59:23] [INFO ] Flatten gal took : 7 ms
[2023-03-19 03:59:23] [INFO ] Time to serialize gal into /tmp/LTL7828868605385586742.gal : 2 ms
[2023-03-19 03:59:23] [INFO ] Time to serialize properties into /tmp/LTL9410862305601700758.ltl : 34 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/LTL7828868605385586742.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9410862305601700758.ltl' '-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...275
Read 1 LTL properties
Checking formula 0 : !((G(F("((p174==0)||((p70==1)&&(p312!=1)))"))))
Formula 0 simplified : FG!"((p174==0)||((p70==1)&&(p312!=1)))"
Detected timeout of ITS tools.
[2023-03-19 03:59:38] [INFO ] Flatten gal took : 22 ms
[2023-03-19 03:59:38] [INFO ] Applying decomposition
[2023-03-19 03:59:38] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4919523931825648670.txt' '-o' '/tmp/graph4919523931825648670.bin' '-w' '/tmp/graph4919523931825648670.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4919523931825648670.bin' '-l' '-1' '-v' '-w' '/tmp/graph4919523931825648670.weights' '-q' '0' '-e' '0.001'
[2023-03-19 03:59:38] [INFO ] Decomposing Gal with order
[2023-03-19 03:59:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 03:59:38] [INFO ] Removed a total of 31 redundant transitions.
[2023-03-19 03:59:38] [INFO ] Flatten gal took : 53 ms
[2023-03-19 03:59:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 4 ms.
[2023-03-19 03:59:38] [INFO ] Time to serialize gal into /tmp/LTL13370465337996589969.gal : 3 ms
[2023-03-19 03:59:38] [INFO ] Time to serialize properties into /tmp/LTL15619105436073980408.ltl : 0 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/LTL13370465337996589969.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15619105436073980408.ltl' '-c' '-stutter-deadlock'

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...256
Read 1 LTL properties
Checking formula 0 : !((G(F("((i7.u30.p174==0)||((i2.i1.u11.p70==1)&&(i14.u53.p312!=1)))"))))
Formula 0 simplified : FG!"((i7.u30.p174==0)||((i2.i1.u11.p70==1)&&(i14.u53.p312!=1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4463884851748799052
[2023-03-19 03:59:54] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4463884851748799052
Running compilation step : cd /tmp/ltsmin4463884851748799052;'/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 236 ms.
Running link step : cd /tmp/ltsmin4463884851748799052;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin4463884851748799052;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-005B-LTLCardinality-10 finished in 95858 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||F((G(p1)||G(p2)))))))'
Support contains 4 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 308 transition count 283
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 308 transition count 283
Applied a total of 18 rules in 20 ms. Remains 308 /317 variables (removed 9) and now considering 283/292 (removed 9) transitions.
// Phase 1: matrix 283 rows 308 cols
[2023-03-19 04:00:09] [INFO ] Computed 56 place invariants in 2 ms
[2023-03-19 04:00:09] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-19 04:00:09] [INFO ] Invariant cache hit.
[2023-03-19 04:00:09] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
[2023-03-19 04:00:09] [INFO ] Invariant cache hit.
[2023-03-19 04:00:09] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 308/317 places, 283/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 729 ms. Remains : 308/317 places, 283/292 transitions.
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s307 1), p1:(AND (EQ s94 0) (EQ s9 1)), p2:(EQ s31 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 751 steps with 0 reset in 4 ms.
FORMULA ShieldPPPs-PT-005B-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-005B-LTLCardinality-12 finished in 1006 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&&X(X(X(G(p1))))))))'
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 308 transition count 283
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 308 transition count 283
Applied a total of 18 rules in 12 ms. Remains 308 /317 variables (removed 9) and now considering 283/292 (removed 9) transitions.
// Phase 1: matrix 283 rows 308 cols
[2023-03-19 04:00:10] [INFO ] Computed 56 place invariants in 15 ms
[2023-03-19 04:00:10] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-03-19 04:00:10] [INFO ] Invariant cache hit.
[2023-03-19 04:00:10] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2023-03-19 04:00:10] [INFO ] Invariant cache hit.
[2023-03-19 04:00:10] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 308/317 places, 283/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 650 ms. Remains : 308/317 places, 283/292 transitions.
Stuttering acceptance computed with spot in 591 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 3}, { cond=p0, acceptance={0} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 5}, { cond=p0, acceptance={0} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 7}, { cond=p0, acceptance={0} source=4 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 7}, { cond=(AND p0 p1), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 5}, { cond=(AND p0 p1), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=8 dest: 7}, { cond=(AND p0 p1), acceptance={} source=8 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p0:(EQ s200 1), p1:(AND (EQ s116 0) (EQ s187 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 999 steps with 0 reset in 8 ms.
FORMULA ShieldPPPs-PT-005B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-005B-LTLCardinality-13 finished in 1279 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-19 04:00:11] [INFO ] Flatten gal took : 27 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3309660215264358010
[2023-03-19 04:00:11] [INFO ] Computing symmetric may disable matrix : 292 transitions.
[2023-03-19 04:00:11] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 04:00:11] [INFO ] Applying decomposition
[2023-03-19 04:00:11] [INFO ] Computing symmetric may enable matrix : 292 transitions.
[2023-03-19 04:00:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 04:00:11] [INFO ] Flatten gal took : 16 ms
[2023-03-19 04:00:11] [INFO ] Computing Do-Not-Accords matrix : 292 transitions.
[2023-03-19 04:00:11] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph91728459348219610.txt' '-o' '/tmp/graph91728459348219610.bin' '-w' '/tmp/graph91728459348219610.weights'
[2023-03-19 04:00:11] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3309660215264358010
Running compilation step : cd /tmp/ltsmin3309660215264358010;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' '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'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph91728459348219610.bin' '-l' '-1' '-v' '-w' '/tmp/graph91728459348219610.weights' '-q' '0' '-e' '0.001'
[2023-03-19 04:00:11] [INFO ] Decomposing Gal with order
[2023-03-19 04:00:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 04:00:11] [INFO ] Removed a total of 45 redundant transitions.
[2023-03-19 04:00:11] [INFO ] Flatten gal took : 49 ms
[2023-03-19 04:00:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2023-03-19 04:00:11] [INFO ] Time to serialize gal into /tmp/LTLCardinality16768068497953643310.gal : 14 ms
[2023-03-19 04:00:11] [INFO ] Time to serialize properties into /tmp/LTLCardinality8518281630016037673.ltl : 0 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/LTLCardinality16768068497953643310.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8518281630016037673.ltl' '-c' '-stutter-deadlock'

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...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((i7.i1.i1.u64.p174==0)||((i1.u24.p70==1)&&(i15.u112.p312!=1)))"))))
Formula 0 simplified : FG!"((i7.i1.i1.u64.p174==0)||((i1.u24.p70==1)&&(i15.u112.p312!=1)))"
Compilation finished in 562 ms.
Running link step : cd /tmp/ltsmin3309660215264358010;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 82 ms.
Running LTSmin : cd /tmp/ltsmin3309660215264358010;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.027: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.027: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.029: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.029: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.029: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.032: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.033: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.034: Initializing POR dependencies: labels 293, guards 292
pins2lts-mc-linux64( 7/ 8), 0.047: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.048: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.055: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.043: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.059: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.059: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.063: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.780: LTL layer: formula: [](<>((LTLAPp0==true)))
pins2lts-mc-linux64( 3/ 8), 0.780: "[](<>((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.780: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.858: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.865: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.883: There are 295 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.883: State length is 318, there are 295 groups
pins2lts-mc-linux64( 0/ 8), 0.883: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.883: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.883: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.883: Visible groups: 0 / 295, labels: 1 / 295
pins2lts-mc-linux64( 0/ 8), 0.883: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.883: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.912: [Blue] ~120 levels ~960 states ~1176 transitions
pins2lts-mc-linux64( 4/ 8), 0.950: [Blue] ~230 levels ~1920 states ~3560 transitions
pins2lts-mc-linux64( 5/ 8), 1.012: [Blue] ~413 levels ~3840 states ~7600 transitions
pins2lts-mc-linux64( 5/ 8), 1.099: [Blue] ~643 levels ~7680 states ~13376 transitions
pins2lts-mc-linux64( 0/ 8), 1.233: [Blue] ~584 levels ~15360 states ~24056 transitions
pins2lts-mc-linux64( 0/ 8), 1.449: [Blue] ~584 levels ~30720 states ~45704 transitions
pins2lts-mc-linux64( 0/ 8), 1.873: [Blue] ~584 levels ~61440 states ~91288 transitions
pins2lts-mc-linux64( 6/ 8), 2.701: [Blue] ~559 levels ~122880 states ~167592 transitions
pins2lts-mc-linux64( 0/ 8), 4.162: [Blue] ~584 levels ~245760 states ~345408 transitions
pins2lts-mc-linux64( 2/ 8), 6.712: [Blue] ~775 levels ~491520 states ~677984 transitions
pins2lts-mc-linux64( 2/ 8), 10.884: [Blue] ~775 levels ~983040 states ~1318952 transitions
pins2lts-mc-linux64( 2/ 8), 19.223: [Blue] ~775 levels ~1966080 states ~2715192 transitions
pins2lts-mc-linux64( 2/ 8), 35.123: [Blue] ~775 levels ~3932160 states ~5349136 transitions
pins2lts-mc-linux64( 2/ 8), 68.064: [Blue] ~775 levels ~7864320 states ~10929464 transitions
pins2lts-mc-linux64( 2/ 8), 133.313: [Blue] ~775 levels ~15728640 states ~21932416 transitions
pins2lts-mc-linux64( 2/ 8), 264.069: [Blue] ~775 levels ~31457280 states ~43993136 transitions
pins2lts-mc-linux64( 0/ 8), 520.470: [Blue] ~599 levels ~62914560 states ~86824568 transitions
pins2lts-mc-linux64( 0/ 8), 1061.306: [Blue] ~599 levels ~125829120 states ~179602296 transitions
pins2lts-mc-linux64( 2/ 8), 1184.298: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1184.406:
pins2lts-mc-linux64( 0/ 8), 1184.406: Explored 134212713 states 191697973 transitions, fanout: 1.428
pins2lts-mc-linux64( 0/ 8), 1184.406: Total exploration time 1183.510 sec (1183.390 sec minimum, 1183.438 sec on average)
pins2lts-mc-linux64( 0/ 8), 1184.406: States per second: 113402, Transitions per second: 161974
pins2lts-mc-linux64( 0/ 8), 1184.406:
pins2lts-mc-linux64( 0/ 8), 1184.406: State space has 134217292 states, 134207959 are accepting
pins2lts-mc-linux64( 0/ 8), 1184.406: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1184.406: blue states: 134212713 (100.00%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1184.406: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1184.406: all-red states: 134207959 (99.99%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1184.406:
pins2lts-mc-linux64( 0/ 8), 1184.406: Total memory used for local state coloring: 0.1MB
pins2lts-mc-linux64( 0/ 8), 1184.406:
pins2lts-mc-linux64( 0/ 8), 1184.406: Queue width: 8B, total height: 5361, memory: 0.04MB
pins2lts-mc-linux64( 0/ 8), 1184.406: Tree memory: 1198.7MB, 9.4 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 1184.406: Tree fill ratio (roots/leafs): 99.0%/68.0%
pins2lts-mc-linux64( 0/ 8), 1184.406: Stored 294 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1184.406: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1184.406: Est. total memory use: 1198.8MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3309660215264358010;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3309660215264358010;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-19 04:20:50] [INFO ] Applying decomposition
[2023-03-19 04:20:50] [INFO ] Flatten gal took : 10 ms
[2023-03-19 04:20:50] [INFO ] Decomposing Gal with order
[2023-03-19 04:20:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 04:20:50] [INFO ] Removed a total of 30 redundant transitions.
[2023-03-19 04:20:50] [INFO ] Flatten gal took : 16 ms
[2023-03-19 04:20:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 4 ms.
[2023-03-19 04:20:50] [INFO ] Time to serialize gal into /tmp/LTLCardinality10059388216483464066.gal : 3 ms
[2023-03-19 04:20:50] [INFO ] Time to serialize properties into /tmp/LTLCardinality5570713553689808016.ltl : 0 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/LTLCardinality10059388216483464066.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5570713553689808016.ltl' '-c' '-stutter-deadlock'

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...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((i0.i0.i1.i0.i0.i0.u65.p174==0)||((i0.i0.i0.i0.i1.u26.p70==1)&&(i1.i0.i0.i0.u107.p312!=1)))"))))
Formula 0 simplified : FG!"((i0.i0.i1.i0.i0.i0.u65.p174==0)||((i0.i0.i0.i0.i1.u26.p70==1)&&(i1.i0.i0.i0.u107.p312!=1)))"
Detected timeout of ITS tools.
[2023-03-19 04:41:34] [INFO ] Flatten gal took : 468 ms
[2023-03-19 04:41:35] [INFO ] Input system was already deterministic with 292 transitions.
[2023-03-19 04:41:35] [INFO ] Transformed 317 places.
[2023-03-19 04:41:36] [INFO ] Transformed 292 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-19 04:41:36] [INFO ] Time to serialize gal into /tmp/LTLCardinality1483670194086446319.gal : 62 ms
[2023-03-19 04:41:36] [INFO ] Time to serialize properties into /tmp/LTLCardinality14713172214897817553.ltl : 8 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/LTLCardinality1483670194086446319.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14713172214897817553.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("((p174==0)||((p70==1)&&(p312!=1)))"))))
Formula 0 simplified : FG!"((p174==0)||((p70==1)&&(p312!=1)))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 170960 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16222328 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ 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="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-5348"
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 r389-oct2-167903713500427"
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 ;