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-165286024700091.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 ShieldIIPs-PT-010B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286024700091
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 6.4K Apr 29 15:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 29 15:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 29 15:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 29 15:01 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.9K May 9 08:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:48 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 164K 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 ShieldIIPs-PT-010B-LTLCardinality-00
FORMULA_NAME ShieldIIPs-PT-010B-LTLCardinality-01
FORMULA_NAME ShieldIIPs-PT-010B-LTLCardinality-02
FORMULA_NAME ShieldIIPs-PT-010B-LTLCardinality-03
FORMULA_NAME ShieldIIPs-PT-010B-LTLCardinality-04
FORMULA_NAME ShieldIIPs-PT-010B-LTLCardinality-05
FORMULA_NAME ShieldIIPs-PT-010B-LTLCardinality-06
FORMULA_NAME ShieldIIPs-PT-010B-LTLCardinality-07
FORMULA_NAME ShieldIIPs-PT-010B-LTLCardinality-08
FORMULA_NAME ShieldIIPs-PT-010B-LTLCardinality-09
FORMULA_NAME ShieldIIPs-PT-010B-LTLCardinality-10
FORMULA_NAME ShieldIIPs-PT-010B-LTLCardinality-11
FORMULA_NAME ShieldIIPs-PT-010B-LTLCardinality-12
FORMULA_NAME ShieldIIPs-PT-010B-LTLCardinality-13
FORMULA_NAME ShieldIIPs-PT-010B-LTLCardinality-14
FORMULA_NAME ShieldIIPs-PT-010B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652923250546

Running Version 202205111006
[2022-05-19 01:20:51] [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 01:20:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 01:20:51] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2022-05-19 01:20:51] [INFO ] Transformed 603 places.
[2022-05-19 01:20:51] [INFO ] Transformed 593 transitions.
[2022-05-19 01:20:51] [INFO ] Found NUPN structural information;
[2022-05-19 01:20:51] [INFO ] Parsed PT model containing 603 places and 593 transitions in 230 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldIIPs-PT-010B-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010B-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010B-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 603/603 places, 593/593 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 542 transition count 532
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 542 transition count 532
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 123 place count 541 transition count 531
Iterating global reduction 0 with 1 rules applied. Total rules applied 124 place count 541 transition count 531
Applied a total of 124 rules in 104 ms. Remains 541 /603 variables (removed 62) and now considering 531/593 (removed 62) transitions.
// Phase 1: matrix 531 rows 541 cols
[2022-05-19 01:20:52] [INFO ] Computed 91 place invariants in 23 ms
[2022-05-19 01:20:52] [INFO ] Implicit Places using invariants in 359 ms returned []
// Phase 1: matrix 531 rows 541 cols
[2022-05-19 01:20:52] [INFO ] Computed 91 place invariants in 5 ms
[2022-05-19 01:20:52] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 822 ms to find 0 implicit places.
// Phase 1: matrix 531 rows 541 cols
[2022-05-19 01:20:52] [INFO ] Computed 91 place invariants in 4 ms
[2022-05-19 01:20:53] [INFO ] Dead Transitions using invariants and state equation in 317 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 541/603 places, 531/593 transitions.
Finished structural reductions, in 1 iterations. Remains : 541/603 places, 531/593 transitions.
Support contains 29 out of 541 places after structural reductions.
[2022-05-19 01:20:53] [INFO ] Flatten gal took : 94 ms
[2022-05-19 01:20:53] [INFO ] Flatten gal took : 46 ms
[2022-05-19 01:20:53] [INFO ] Input system was already deterministic with 531 transitions.
Finished random walk after 7404 steps, including 5 resets, run visited all 19 properties in 315 ms. (steps per millisecond=23 )
Computed a total of 121 stabilizing places and 121 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(G(p2)&&p1))))'
Support contains 6 out of 541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 531/531 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 534 transition count 524
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 534 transition count 524
Applied a total of 14 rules in 32 ms. Remains 534 /541 variables (removed 7) and now considering 524/531 (removed 7) transitions.
// Phase 1: matrix 524 rows 534 cols
[2022-05-19 01:20:54] [INFO ] Computed 91 place invariants in 4 ms
[2022-05-19 01:20:54] [INFO ] Implicit Places using invariants in 158 ms returned []
// Phase 1: matrix 524 rows 534 cols
[2022-05-19 01:20:54] [INFO ] Computed 91 place invariants in 14 ms
[2022-05-19 01:20:55] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
// Phase 1: matrix 524 rows 534 cols
[2022-05-19 01:20:55] [INFO ] Computed 91 place invariants in 3 ms
[2022-05-19 01:20:55] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 534/541 places, 524/531 transitions.
Finished structural reductions, in 1 iterations. Remains : 534/541 places, 524/531 transitions.
Stuttering acceptance computed with spot in 232 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 2}]], initial=1, aps=[p2:(AND (OR (EQ s52 0) (EQ s93 1)) (OR (EQ s56 0) (EQ s234 1))), p0:(AND (EQ s234 0) (EQ s56 1)), p1:(AND (OR (EQ s500 0) (EQ s202 1)) (OR (EQ s56 0) (EQ ...], 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 909 steps with 0 reset in 14 ms.
FORMULA ShieldIIPs-PT-010B-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010B-LTLCardinality-02 finished in 1278 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U (p1 U !(G(F(p0))||p2)))))'
Support contains 5 out of 541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 541/541 places, 531/531 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 540 transition count 481
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 491 transition count 481
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 98 place count 491 transition count 431
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 198 place count 441 transition count 431
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 205 place count 434 transition count 424
Iterating global reduction 2 with 7 rules applied. Total rules applied 212 place count 434 transition count 424
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 212 place count 434 transition count 423
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 214 place count 433 transition count 423
Performed 174 Post agglomeration using F-continuation condition.Transition count delta: 174
Deduced a syphon composed of 174 places in 1 ms
Reduce places removed 174 places and 0 transitions.
Iterating global reduction 2 with 348 rules applied. Total rules applied 562 place count 259 transition count 249
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 564 place count 257 transition count 247
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 565 place count 256 transition count 247
Applied a total of 565 rules in 159 ms. Remains 256 /541 variables (removed 285) and now considering 247/531 (removed 284) transitions.
// Phase 1: matrix 247 rows 256 cols
[2022-05-19 01:20:55] [INFO ] Computed 90 place invariants in 1 ms
[2022-05-19 01:20:56] [INFO ] Implicit Places using invariants in 167 ms returned []
// Phase 1: matrix 247 rows 256 cols
[2022-05-19 01:20:56] [INFO ] Computed 90 place invariants in 14 ms
[2022-05-19 01:20:56] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
[2022-05-19 01:20:56] [INFO ] Redundant transitions in 74 ms returned [246]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 246 rows 256 cols
[2022-05-19 01:20:56] [INFO ] Computed 90 place invariants in 9 ms
[2022-05-19 01:20:56] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 256/541 places, 246/531 transitions.
Applied a total of 0 rules in 21 ms. Remains 256 /256 variables (removed 0) and now considering 246/246 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 256/541 places, 246/531 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR p2 p0), (NOT p0), (OR p0 p2), p0]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (EQ s48 0) (EQ s77 1)), p0:(OR (EQ s127 0) (EQ s3 1)), p1:(NEQ s233 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 598 steps with 0 reset in 8 ms.
FORMULA ShieldIIPs-PT-010B-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010B-LTLCardinality-03 finished in 996 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 531/531 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 532 transition count 522
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 532 transition count 522
Applied a total of 18 rules in 82 ms. Remains 532 /541 variables (removed 9) and now considering 522/531 (removed 9) transitions.
// Phase 1: matrix 522 rows 532 cols
[2022-05-19 01:20:56] [INFO ] Computed 91 place invariants in 1 ms
[2022-05-19 01:20:57] [INFO ] Implicit Places using invariants in 231 ms returned []
// Phase 1: matrix 522 rows 532 cols
[2022-05-19 01:20:57] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-19 01:20:57] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
// Phase 1: matrix 522 rows 532 cols
[2022-05-19 01:20:57] [INFO ] Computed 91 place invariants in 7 ms
[2022-05-19 01:20:57] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 532/541 places, 522/531 transitions.
Finished structural reductions, in 1 iterations. Remains : 532/541 places, 522/531 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s99 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 2 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-010B-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010B-LTLCardinality-05 finished in 1157 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(X(F(G(p0)))))))'
Support contains 2 out of 541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 541/541 places, 531/531 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 540 transition count 479
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 489 transition count 479
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 102 place count 489 transition count 428
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 204 place count 438 transition count 428
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 212 place count 430 transition count 420
Iterating global reduction 2 with 8 rules applied. Total rules applied 220 place count 430 transition count 420
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 220 place count 430 transition count 418
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 224 place count 428 transition count 418
Performed 174 Post agglomeration using F-continuation condition.Transition count delta: 174
Deduced a syphon composed of 174 places in 1 ms
Reduce places removed 174 places and 0 transitions.
Iterating global reduction 2 with 348 rules applied. Total rules applied 572 place count 254 transition count 244
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 574 place count 252 transition count 242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 575 place count 251 transition count 242
Applied a total of 575 rules in 91 ms. Remains 251 /541 variables (removed 290) and now considering 242/531 (removed 289) transitions.
// Phase 1: matrix 242 rows 251 cols
[2022-05-19 01:20:58] [INFO ] Computed 90 place invariants in 1 ms
[2022-05-19 01:20:58] [INFO ] Implicit Places using invariants in 422 ms returned []
// Phase 1: matrix 242 rows 251 cols
[2022-05-19 01:20:58] [INFO ] Computed 90 place invariants in 5 ms
[2022-05-19 01:20:58] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
[2022-05-19 01:20:58] [INFO ] Redundant transitions in 53 ms returned [241]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 241 rows 251 cols
[2022-05-19 01:20:58] [INFO ] Computed 90 place invariants in 0 ms
[2022-05-19 01:20:58] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 251/541 places, 241/531 transitions.
Applied a total of 0 rules in 8 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 251/541 places, 241/531 transitions.
Stuttering acceptance computed with spot in 554 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s222 0) (EQ s37 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 560 steps with 0 reset in 11 ms.
FORMULA ShieldIIPs-PT-010B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010B-LTLCardinality-08 finished in 1637 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p1 U G(!p2))&&p0)))'
Support contains 4 out of 541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 531/531 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 532 transition count 522
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 532 transition count 522
Applied a total of 18 rules in 29 ms. Remains 532 /541 variables (removed 9) and now considering 522/531 (removed 9) transitions.
// Phase 1: matrix 522 rows 532 cols
[2022-05-19 01:20:59] [INFO ] Computed 91 place invariants in 4 ms
[2022-05-19 01:20:59] [INFO ] Implicit Places using invariants in 247 ms returned []
// Phase 1: matrix 522 rows 532 cols
[2022-05-19 01:20:59] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-19 01:21:00] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
// Phase 1: matrix 522 rows 532 cols
[2022-05-19 01:21:00] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-19 01:21:00] [INFO ] Dead Transitions using invariants and state equation in 252 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 532/541 places, 522/531 transitions.
Finished structural reductions, in 1 iterations. Remains : 532/541 places, 522/531 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), true, p2, p2]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND p2 (NOT p1))), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND p2 p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s220 0) (EQ s191 1)), p2:(OR (EQ s191 0) (EQ s220 1)), p1:(OR (EQ s348 0) (EQ s483 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-010B-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010B-LTLCardinality-10 finished in 1133 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&p0&&(!(X(F(p0)) U p1)||p2))))'
Support contains 4 out of 541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 531/531 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 533 transition count 523
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 533 transition count 523
Applied a total of 16 rules in 20 ms. Remains 533 /541 variables (removed 8) and now considering 523/531 (removed 8) transitions.
// Phase 1: matrix 523 rows 533 cols
[2022-05-19 01:21:00] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-19 01:21:00] [INFO ] Implicit Places using invariants in 158 ms returned []
// Phase 1: matrix 523 rows 533 cols
[2022-05-19 01:21:00] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-19 01:21:01] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
// Phase 1: matrix 523 rows 533 cols
[2022-05-19 01:21:01] [INFO ] Computed 91 place invariants in 3 ms
[2022-05-19 01:21:01] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 533/541 places, 523/531 transitions.
Finished structural reductions, in 1 iterations. Remains : 533/541 places, 523/531 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), true, (NOT p0), (AND p0 p1), p0]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 2}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s53 0) (EQ s287 1)), p2:(EQ s319 1), p1:(NEQ s394 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-010B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010B-LTLCardinality-13 finished in 1073 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 541/541 places, 531/531 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 540 transition count 480
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 490 transition count 480
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 100 place count 490 transition count 429
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 202 place count 439 transition count 429
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 210 place count 431 transition count 421
Iterating global reduction 2 with 8 rules applied. Total rules applied 218 place count 431 transition count 421
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 218 place count 431 transition count 419
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 222 place count 429 transition count 419
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 0 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 2 with 350 rules applied. Total rules applied 572 place count 254 transition count 244
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 574 place count 252 transition count 242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 575 place count 251 transition count 242
Applied a total of 575 rules in 56 ms. Remains 251 /541 variables (removed 290) and now considering 242/531 (removed 289) transitions.
// Phase 1: matrix 242 rows 251 cols
[2022-05-19 01:21:01] [INFO ] Computed 90 place invariants in 7 ms
[2022-05-19 01:21:01] [INFO ] Implicit Places using invariants in 118 ms returned []
// Phase 1: matrix 242 rows 251 cols
[2022-05-19 01:21:01] [INFO ] Computed 90 place invariants in 1 ms
[2022-05-19 01:21:02] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2022-05-19 01:21:02] [INFO ] Redundant transitions in 66 ms returned [241]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 241 rows 251 cols
[2022-05-19 01:21:02] [INFO ] Computed 90 place invariants in 1 ms
[2022-05-19 01:21:02] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 251/541 places, 241/531 transitions.
Applied a total of 0 rules in 7 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 251/541 places, 241/531 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLCardinality-14 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 s67 0) (EQ s17 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 191 reset in 560 ms.
Product exploration explored 100000 steps with 190 reset in 574 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 373 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 59 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1615 steps, including 2 resets, run visited all 1 properties in 21 ms. (steps per millisecond=76 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 113 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 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 241/241 transitions.
Applied a total of 0 rules in 9 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
// Phase 1: matrix 241 rows 251 cols
[2022-05-19 01:21:04] [INFO ] Computed 90 place invariants in 1 ms
[2022-05-19 01:21:04] [INFO ] Implicit Places using invariants in 142 ms returned []
// Phase 1: matrix 241 rows 251 cols
[2022-05-19 01:21:04] [INFO ] Computed 90 place invariants in 1 ms
[2022-05-19 01:21:04] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2022-05-19 01:21:04] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 241 rows 251 cols
[2022-05-19 01:21:04] [INFO ] Computed 90 place invariants in 2 ms
[2022-05-19 01:21:04] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 251/251 places, 241/241 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 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)]
Finished random walk after 1998 steps, including 3 resets, run visited all 1 properties in 13 ms. (steps per millisecond=153 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 118 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 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 189 reset in 367 ms.
Product exploration explored 100000 steps with 191 reset in 421 ms.
Built C files in :
/tmp/ltsmin9860321290776205169
[2022-05-19 01:21:06] [INFO ] Computing symmetric may disable matrix : 241 transitions.
[2022-05-19 01:21:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:21:06] [INFO ] Computing symmetric may enable matrix : 241 transitions.
[2022-05-19 01:21:06] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:21:06] [INFO ] Computing Do-Not-Accords matrix : 241 transitions.
[2022-05-19 01:21:06] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:21:06] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9860321290776205169
Running compilation step : cd /tmp/ltsmin9860321290776205169;'/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 565 ms.
Running link step : cd /tmp/ltsmin9860321290776205169;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin9860321290776205169;'/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/stateBased8945275371548817707.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 241/241 transitions.
Applied a total of 0 rules in 20 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
// Phase 1: matrix 241 rows 251 cols
[2022-05-19 01:21:21] [INFO ] Computed 90 place invariants in 2 ms
[2022-05-19 01:21:21] [INFO ] Implicit Places using invariants in 152 ms returned []
// Phase 1: matrix 241 rows 251 cols
[2022-05-19 01:21:21] [INFO ] Computed 90 place invariants in 5 ms
[2022-05-19 01:21:21] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2022-05-19 01:21:21] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 241 rows 251 cols
[2022-05-19 01:21:21] [INFO ] Computed 90 place invariants in 0 ms
[2022-05-19 01:21:21] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 251/251 places, 241/241 transitions.
Built C files in :
/tmp/ltsmin9910505799131607387
[2022-05-19 01:21:21] [INFO ] Computing symmetric may disable matrix : 241 transitions.
[2022-05-19 01:21:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:21:21] [INFO ] Computing symmetric may enable matrix : 241 transitions.
[2022-05-19 01:21:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:21:21] [INFO ] Computing Do-Not-Accords matrix : 241 transitions.
[2022-05-19 01:21:21] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:21:21] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9910505799131607387
Running compilation step : cd /tmp/ltsmin9910505799131607387;'/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 488 ms.
Running link step : cd /tmp/ltsmin9910505799131607387;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin9910505799131607387;'/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/stateBased5996669766964908496.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 01:21:37] [INFO ] Flatten gal took : 20 ms
[2022-05-19 01:21:37] [INFO ] Flatten gal took : 18 ms
[2022-05-19 01:21:37] [INFO ] Time to serialize gal into /tmp/LTL17895404562347919825.gal : 4 ms
[2022-05-19 01:21:37] [INFO ] Time to serialize properties into /tmp/LTL15756148093688972725.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17895404562347919825.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15756148093688972725.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1789540...268
Read 1 LTL properties
Checking formula 0 : !((G(F("((p160==0)||(p44==1))"))))
Formula 0 simplified : !GF"((p160==0)||(p44==1))"
Detected timeout of ITS tools.
[2022-05-19 01:21:52] [INFO ] Flatten gal took : 16 ms
[2022-05-19 01:21:52] [INFO ] Applying decomposition
[2022-05-19 01:21:52] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18045234496663690647.txt' '-o' '/tmp/graph18045234496663690647.bin' '-w' '/tmp/graph18045234496663690647.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18045234496663690647.bin' '-l' '-1' '-v' '-w' '/tmp/graph18045234496663690647.weights' '-q' '0' '-e' '0.001'
[2022-05-19 01:21:52] [INFO ] Decomposing Gal with order
[2022-05-19 01:21:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 01:21:52] [INFO ] Removed a total of 157 redundant transitions.
[2022-05-19 01:21:52] [INFO ] Flatten gal took : 345 ms
[2022-05-19 01:21:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 138 labels/synchronizations in 14 ms.
[2022-05-19 01:21:52] [INFO ] Time to serialize gal into /tmp/LTL15870648167600703275.gal : 5 ms
[2022-05-19 01:21:52] [INFO ] Time to serialize properties into /tmp/LTL14264841931166013771.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15870648167600703275.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14264841931166013771.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1587064...247
Read 1 LTL properties
Checking formula 0 : !((G(F("((i2.i0.u25.p160==0)||(i0.i1.u7.p44==1))"))))
Formula 0 simplified : !GF"((i2.i0.u25.p160==0)||(i0.i1.u7.p44==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14899791485395388769
[2022-05-19 01:22:07] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14899791485395388769
Running compilation step : cd /tmp/ltsmin14899791485395388769;'/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 363 ms.
Running link step : cd /tmp/ltsmin14899791485395388769;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin14899791485395388769;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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 ShieldIIPs-PT-010B-LTLCardinality-14 finished in 81307 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(!(p0 U p1)))||F(p2)||p3)))'
Support contains 5 out of 541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 531/531 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 534 transition count 524
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 534 transition count 524
Applied a total of 14 rules in 16 ms. Remains 534 /541 variables (removed 7) and now considering 524/531 (removed 7) transitions.
// Phase 1: matrix 524 rows 534 cols
[2022-05-19 01:22:23] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-19 01:22:23] [INFO ] Implicit Places using invariants in 306 ms returned []
// Phase 1: matrix 524 rows 534 cols
[2022-05-19 01:22:23] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-19 01:22:23] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 711 ms to find 0 implicit places.
// Phase 1: matrix 524 rows 534 cols
[2022-05-19 01:22:23] [INFO ] Computed 91 place invariants in 1 ms
[2022-05-19 01:22:24] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 534/541 places, 524/531 transitions.
Finished structural reductions, in 1 iterations. Remains : 534/541 places, 524/531 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p2), (AND (NOT p2) (NOT p3) p1), (AND (NOT p2) (NOT p3) p1), (AND (NOT p2) p1)]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(AND (EQ s406 1) (OR (EQ s345 0) (EQ s444 1))), p3:(EQ s406 0), p1:(OR (EQ s459 0) (EQ s67 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 460 ms.
Product exploration explored 100000 steps with 50000 reset in 448 ms.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Knowledge obtained : [(AND (NOT p2) p3 p1), (X (NOT (AND (NOT p3) (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p3) (NOT p2))))
Knowledge based reduction with 4 factoid took 107 ms. Reduced automaton from 4 states, 5 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPs-PT-010B-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-010B-LTLCardinality-15 finished in 2146 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2022-05-19 01:22:25] [INFO ] Flatten gal took : 57 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin18263834440501703528
[2022-05-19 01:22:25] [INFO ] Computing symmetric may disable matrix : 531 transitions.
[2022-05-19 01:22:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:22:25] [INFO ] Computing symmetric may enable matrix : 531 transitions.
[2022-05-19 01:22:25] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:22:25] [INFO ] Applying decomposition
[2022-05-19 01:22:25] [INFO ] Flatten gal took : 39 ms
[2022-05-19 01:22:25] [INFO ] Computing Do-Not-Accords matrix : 531 transitions.
[2022-05-19 01:22:25] [INFO ] Computation of Completed DNA matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:22:25] [INFO ] Built C files in 99ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18263834440501703528
Running compilation step : cd /tmp/ltsmin18263834440501703528;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9041203859539770892.txt' '-o' '/tmp/graph9041203859539770892.bin' '-w' '/tmp/graph9041203859539770892.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9041203859539770892.bin' '-l' '-1' '-v' '-w' '/tmp/graph9041203859539770892.weights' '-q' '0' '-e' '0.001'
[2022-05-19 01:22:25] [INFO ] Decomposing Gal with order
[2022-05-19 01:22:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 01:22:25] [INFO ] Removed a total of 230 redundant transitions.
[2022-05-19 01:22:25] [INFO ] Flatten gal took : 41 ms
[2022-05-19 01:22:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-19 01:22:25] [INFO ] Time to serialize gal into /tmp/LTLCardinality165629039659405463.gal : 30 ms
[2022-05-19 01:22:25] [INFO ] Time to serialize properties into /tmp/LTLCardinality3098557406635084857.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality165629039659405463.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3098557406635084857.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...266
Read 1 LTL properties
Checking formula 0 : !((G(F("((i2.i3.u56.p160==0)||(i0.i4.u18.p44==1))"))))
Formula 0 simplified : !GF"((i2.i3.u56.p160==0)||(i0.i4.u18.p44==1))"
Compilation finished in 1374 ms.
Running link step : cd /tmp/ltsmin18263834440501703528;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin18263834440501703528;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-19 01:42:58] [INFO ] Applying decomposition
[2022-05-19 01:42:58] [INFO ] Flatten gal took : 210 ms
[2022-05-19 01:42:58] [INFO ] Decomposing Gal with order
[2022-05-19 01:42:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 01:42:59] [INFO ] Removed a total of 160 redundant transitions.
[2022-05-19 01:42:59] [INFO ] Flatten gal took : 304 ms
[2022-05-19 01:42:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 200 labels/synchronizations in 160 ms.
[2022-05-19 01:42:59] [INFO ] Time to serialize gal into /tmp/LTLCardinality16364542684355287036.gal : 51 ms
[2022-05-19 01:42:59] [INFO ] Time to serialize properties into /tmp/LTLCardinality13812575213404791719.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16364542684355287036.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13812575213404791719.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...269
Read 1 LTL properties
Checking formula 0 : !((G(F("((i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u58.p160==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u24.p44==1))"))))
Formula 0 simplified : !GF"((i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u58.p160==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u24.p44==1))"
Detected timeout of ITS tools.
[2022-05-19 02:03:32] [INFO ] Flatten gal took : 156 ms
[2022-05-19 02:03:33] [INFO ] Input system was already deterministic with 531 transitions.
[2022-05-19 02:03:33] [INFO ] Transformed 541 places.
[2022-05-19 02:03:33] [INFO ] Transformed 531 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/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//..//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
[2022-05-19 02:03:33] [INFO ] Time to serialize gal into /tmp/LTLCardinality12002328974061273085.gal : 25 ms
[2022-05-19 02:03:33] [INFO ] Time to serialize properties into /tmp/LTLCardinality16131270447797482843.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality12002328974061273085.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16131270447797482843.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...335
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("((p160==0)||(p44==1))"))))
Formula 0 simplified : !GF"((p160==0)||(p44==1))"
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.092: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.205: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.227: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.352: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.699: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 2.732: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 2.773: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 2.893: LTL layer: formula: [](<>((LTLAPp0==true)))
pins2lts-mc-linux64( 6/ 8), 2.894: "[](<>((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 2.894: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 3.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 3.015: Initializing POR dependencies: labels 532, guards 531
pins2lts-mc-linux64( 0/ 8), 4.652: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 4.658: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 4.678: There are 534 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 4.678: State length is 542, there are 534 groups
pins2lts-mc-linux64( 0/ 8), 4.678: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 4.678: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 4.679: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 4.679: Visible groups: 0 / 534, labels: 1 / 534
pins2lts-mc-linux64( 0/ 8), 4.679: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 4.679: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 1/ 8), 4.777: [Blue] ~120 levels ~960 states ~960 transitions
pins2lts-mc-linux64( 5/ 8), 4.856: [Blue] ~240 levels ~1920 states ~2056 transitions
pins2lts-mc-linux64( 5/ 8), 5.389: [Blue] ~480 levels ~3840 states ~6360 transitions
pins2lts-mc-linux64( 4/ 8), 6.312: [Blue] ~944 levels ~7680 states ~15856 transitions
pins2lts-mc-linux64( 4/ 8), 7.556: [Blue] ~1357 levels ~15360 states ~27296 transitions
pins2lts-mc-linux64( 4/ 8), 9.950: [Blue] ~1464 levels ~30720 states ~45912 transitions
pins2lts-mc-linux64( 0/ 8), 14.104: [Blue] ~1416 levels ~61440 states ~85760 transitions
pins2lts-mc-linux64( 3/ 8), 21.721: [Blue] ~1414 levels ~122880 states ~162864 transitions
pins2lts-mc-linux64( 0/ 8), 30.484: [Blue] ~1424 levels ~245760 states ~312488 transitions
pins2lts-mc-linux64( 0/ 8), 48.214: [Blue] ~1424 levels ~491520 states ~630256 transitions
pins2lts-mc-linux64( 0/ 8), 58.823: [Blue] ~1424 levels ~983040 states ~1250888 transitions
pins2lts-mc-linux64( 3/ 8), 75.121: [Blue] ~1464 levels ~1966080 states ~2473760 transitions
pins2lts-mc-linux64( 3/ 8), 109.659: [Blue] ~1464 levels ~3932160 states ~4982704 transitions
pins2lts-mc-linux64( 3/ 8), 175.479: [Blue] ~1464 levels ~7864320 states ~10046240 transitions
pins2lts-mc-linux64( 3/ 8), 306.728: [Blue] ~1464 levels ~15728640 states ~20362712 transitions
pins2lts-mc-linux64( 3/ 8), 568.738: [Blue] ~1511 levels ~31457280 states ~40332936 transitions
pins2lts-mc-linux64( 3/ 8), 1084.672: [Blue] ~1511 levels ~62914560 states ~81437072 transitions
pins2lts-mc-linux64( 3/ 8), 2125.512: [Blue] ~1511 levels ~125829120 states ~164426736 transitions
pins2lts-mc-linux64( 7/ 8), 2541.533: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 2541.607:
pins2lts-mc-linux64( 0/ 8), 2541.607: Explored 134202489 states 193482495 transitions, fanout: 1.442
pins2lts-mc-linux64( 0/ 8), 2541.609: Total exploration time 2536.900 sec (2536.820 sec minimum, 2536.856 sec on average)
pins2lts-mc-linux64( 0/ 8), 2541.609: States per second: 52900, Transitions per second: 76267
pins2lts-mc-linux64( 0/ 8), 2541.609:
pins2lts-mc-linux64( 0/ 8), 2541.609: State space has 134217360 states, 33270803 are accepting
pins2lts-mc-linux64( 0/ 8), 2541.609: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 2541.609: blue states: 134202489 (99.99%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 2541.609: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 2541.609: all-red states: 33270803 (24.79%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 2541.609:
pins2lts-mc-linux64( 0/ 8), 2541.609: Total memory used for local state coloring: 0.2MB
pins2lts-mc-linux64( 0/ 8), 2541.609:
pins2lts-mc-linux64( 0/ 8), 2541.609: Queue width: 8B, total height: 12996, memory: 0.10MB
pins2lts-mc-linux64( 0/ 8), 2541.609: Tree memory: 1109.9MB, 8.7 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 2541.609: Tree fill ratio (roots/leafs): 99.0%/33.0%
pins2lts-mc-linux64( 0/ 8), 2541.613: Stored 540 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 2541.832: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 2541.849: Est. total memory use: 1110.0MB (~1024.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin18263834440501703528;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin18263834440501703528;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)

BK_TIME_CONFINEMENT_REACHED

--------------------
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="ShieldIIPs-PT-010B"
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 ShieldIIPs-PT-010B, 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-165286024700091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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