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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 5.8K Feb 26 01:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 26 01:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 26 01:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 26 01:58 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.8K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 02:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Feb 26 02:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 01:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 01:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 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 18K 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-001B-LTLCardinality-00
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-01
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-02
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-03
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-04
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-05
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-06
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-07
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-08
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-09
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-10
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-11
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-12
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-13
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-14
FORMULA_NAME ShieldPPPs-PT-001B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679192998938

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-001B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-19 02:30:01] [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 02:30:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 02:30:01] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2023-03-19 02:30:01] [INFO ] Transformed 71 places.
[2023-03-19 02:30:01] [INFO ] Transformed 66 transitions.
[2023-03-19 02:30:01] [INFO ] Found NUPN structural information;
[2023-03-19 02:30:01] [INFO ] Parsed PT model containing 71 places and 66 transitions and 180 arcs in 101 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPs-PT-001B-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-001B-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-001B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-001B-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-001B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-001B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 69 transition count 64
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 69 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 68 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 68 transition count 63
Applied a total of 6 rules in 39 ms. Remains 68 /71 variables (removed 3) and now considering 63/66 (removed 3) transitions.
// Phase 1: matrix 63 rows 68 cols
[2023-03-19 02:30:02] [INFO ] Computed 12 place invariants in 22 ms
[2023-03-19 02:30:02] [INFO ] Implicit Places using invariants in 383 ms returned []
[2023-03-19 02:30:02] [INFO ] Invariant cache hit.
[2023-03-19 02:30:02] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
[2023-03-19 02:30:02] [INFO ] Invariant cache hit.
[2023-03-19 02:30:02] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 68/71 places, 63/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 772 ms. Remains : 68/71 places, 63/66 transitions.
Support contains 26 out of 68 places after structural reductions.
[2023-03-19 02:30:02] [INFO ] Flatten gal took : 40 ms
[2023-03-19 02:30:02] [INFO ] Flatten gal took : 9 ms
[2023-03-19 02:30:03] [INFO ] Input system was already deterministic with 63 transitions.
Finished random walk after 169 steps, including 0 resets, run visited all 20 properties in 53 ms. (steps per millisecond=3 )
FORMULA ShieldPPPs-PT-001B-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 13 stabilizing places and 13 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' '!(X(F(p0)))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 63/63 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 64 transition count 59
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 64 transition count 59
Applied a total of 8 rules in 6 ms. Remains 64 /68 variables (removed 4) and now considering 59/63 (removed 4) transitions.
// Phase 1: matrix 59 rows 64 cols
[2023-03-19 02:30:03] [INFO ] Computed 12 place invariants in 4 ms
[2023-03-19 02:30:03] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-03-19 02:30:03] [INFO ] Invariant cache hit.
[2023-03-19 02:30:03] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2023-03-19 02:30:03] [INFO ] Invariant cache hit.
[2023-03-19 02:30:04] [INFO ] Dead Transitions using invariants and state equation in 277 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/68 places, 59/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 613 ms. Remains : 64/68 places, 59/63 transitions.
Stuttering acceptance computed with spot in 403 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s44 0) (NEQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 23696 steps with 425 reset in 148 ms.
FORMULA ShieldPPPs-PT-001B-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-001B-LTLCardinality-02 finished in 1265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 63/63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 67 transition count 54
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 59 transition count 54
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 16 place count 59 transition count 50
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 24 place count 55 transition count 50
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 27 place count 52 transition count 47
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 52 transition count 47
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 60 place count 37 transition count 32
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 36 transition count 31
Applied a total of 61 rules in 16 ms. Remains 36 /68 variables (removed 32) and now considering 31/63 (removed 32) transitions.
// Phase 1: matrix 31 rows 36 cols
[2023-03-19 02:30:04] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-19 02:30:04] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-19 02:30:04] [INFO ] Invariant cache hit.
[2023-03-19 02:30:04] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2023-03-19 02:30:04] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 02:30:04] [INFO ] Invariant cache hit.
[2023-03-19 02:30:05] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/68 places, 31/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 378 ms. Remains : 36/68 places, 31/63 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s23 1) (AND (NEQ s3 0) (NEQ s31 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 825 reset in 247 ms.
Stack based approach found an accepted trace after 194 steps with 2 reset with depth 62 and stack size 62 in 2 ms.
FORMULA ShieldPPPs-PT-001B-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPs-PT-001B-LTLCardinality-04 finished in 704 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X((G(p0)||G(F(p1)))))))))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 63/63 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 63 transition count 58
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 63 transition count 58
Applied a total of 10 rules in 3 ms. Remains 63 /68 variables (removed 5) and now considering 58/63 (removed 5) transitions.
// Phase 1: matrix 58 rows 63 cols
[2023-03-19 02:30:05] [INFO ] Computed 12 place invariants in 0 ms
[2023-03-19 02:30:05] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-19 02:30:05] [INFO ] Invariant cache hit.
[2023-03-19 02:30:05] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2023-03-19 02:30:05] [INFO ] Invariant cache hit.
[2023-03-19 02:30:05] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/68 places, 58/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 257 ms. Remains : 63/68 places, 58/63 transitions.
Stuttering acceptance computed with spot in 491 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(NOT p0), acceptance={} source=5 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=true, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (EQ s57 0) (EQ s61 1)), p1:(EQ s41 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2447 reset in 223 ms.
Product exploration explored 100000 steps with 2452 reset in 180 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 206 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 566 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Finished random walk after 23 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 290 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 517 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 513 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 58/58 transitions.
Applied a total of 0 rules in 14 ms. Remains 63 /63 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2023-03-19 02:30:08] [INFO ] Invariant cache hit.
[2023-03-19 02:30:08] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-03-19 02:30:08] [INFO ] Invariant cache hit.
[2023-03-19 02:30:08] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2023-03-19 02:30:09] [INFO ] Invariant cache hit.
[2023-03-19 02:30:09] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 341 ms. Remains : 63/63 places, 58/58 transitions.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 144 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 604 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Finished random walk after 28 steps, including 0 resets, run visited all 3 properties in 16 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 249 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 341 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 469 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 471 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2440 reset in 212 ms.
Product exploration explored 100000 steps with 2439 reset in 134 ms.
Applying partial POR strategy [false, false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 369 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 58/58 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 63 transition count 58
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 7 place count 63 transition count 58
Deduced a syphon composed of 10 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 63 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 62 transition count 57
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 62 transition count 57
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 29 place count 62 transition count 57
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 57 transition count 52
Deduced a syphon composed of 21 places in 3 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 57 transition count 52
Deduced a syphon composed of 21 places in 0 ms
Applied a total of 39 rules in 29 ms. Remains 57 /63 variables (removed 6) and now considering 52/58 (removed 6) transitions.
[2023-03-19 02:30:12] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 52 rows 57 cols
[2023-03-19 02:30:12] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-19 02:30:12] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/63 places, 52/58 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 130 ms. Remains : 57/63 places, 52/58 transitions.
Built C files in :
/tmp/ltsmin17759723151175191100
[2023-03-19 02:30:12] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17759723151175191100
Running compilation step : cd /tmp/ltsmin17759723151175191100;'/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 466 ms.
Running link step : cd /tmp/ltsmin17759723151175191100;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin17759723151175191100;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1951322577552279613.hoa' '--buchi-type=spotba'
LTSmin run took 3786 ms.
FORMULA ShieldPPPs-PT-001B-LTLCardinality-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-001B-LTLCardinality-05 finished in 11501 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F((G(F(p0))||(!p1&&F(p0)))) U G(!p2)) U p3))'
Support contains 5 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 63/63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 67 transition count 56
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 61 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 60 transition count 55
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 14 place count 60 transition count 49
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 26 place count 54 transition count 49
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 30 place count 50 transition count 45
Iterating global reduction 3 with 4 rules applied. Total rules applied 34 place count 50 transition count 45
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 60 place count 37 transition count 32
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 61 place count 36 transition count 31
Applied a total of 61 rules in 20 ms. Remains 36 /68 variables (removed 32) and now considering 31/63 (removed 32) transitions.
// Phase 1: matrix 31 rows 36 cols
[2023-03-19 02:30:16] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-19 02:30:17] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-19 02:30:17] [INFO ] Invariant cache hit.
[2023-03-19 02:30:17] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2023-03-19 02:30:17] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 02:30:17] [INFO ] Invariant cache hit.
[2023-03-19 02:30:17] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/68 places, 31/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 287 ms. Remains : 36/68 places, 31/63 transitions.
Stuttering acceptance computed with spot in 345 ms :[(NOT p3), (AND (NOT p0) (NOT p2)), p2, (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 p1), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(EQ s19 1), p2:(OR (EQ s19 1) (EQ s3 0) (EQ s10 1)), p1:(OR (EQ s3 0) (EQ s10 1)), p0:(OR (EQ s24 0) (EQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 14761 reset in 196 ms.
Product exploration explored 100000 steps with 14645 reset in 154 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 : [(AND (NOT p3) p2 p1 p0), (X (NOT (AND (NOT p2) p1))), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0)))))]
False Knowledge obtained : [(X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p3) p2 p1)), (X (NOT (AND (NOT p3) p2 p1))), (X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (NOT p2)), (X p2), (X (NOT p0)), (X p0), (X (AND (NOT p3) p2 (NOT p0))), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p3) p2 p1))), (X (X (NOT (AND (NOT p3) p2 p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 7 factoid took 1007 ms. Reduced automaton from 4 states, 11 edges and 4 AP (stutter insensitive) to 4 states, 11 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 387 ms :[(NOT p3), (AND (NOT p0) (NOT p2)), p2, (NOT p0)]
Incomplete random walk after 10000 steps, including 61 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 02:30:19] [INFO ] Invariant cache hit.
[2023-03-19 02:30:19] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) p2 p1 p0), (X (NOT (AND (NOT p2) p1))), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (G (NOT (AND (NOT p2) p1)))]
False Knowledge obtained : [(X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p3) p2 p1)), (X (NOT (AND (NOT p3) p2 p1))), (X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (NOT p2)), (X p2), (X (NOT p0)), (X p0), (X (AND (NOT p3) p2 (NOT p0))), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p3) p2 p1))), (X (X (NOT (AND (NOT p3) p2 p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p0) (NOT p2))), (F (NOT p2)), (F (NOT (AND p2 p1))), (F p3), (F (AND (NOT p0) p2 (NOT p3))), (F (NOT (AND p2 (NOT p3) p1))), (F (NOT p0)), (F (AND (NOT p0) p2))]
Knowledge based reduction with 8 factoid took 1428 ms. Reduced automaton from 4 states, 11 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 289 ms :[(NOT p3), (AND (NOT p0) (NOT p2)), p2, (NOT p0)]
Stuttering acceptance computed with spot in 381 ms :[(NOT p3), (AND (NOT p0) (NOT p2)), p2, (NOT p0)]
[2023-03-19 02:30:21] [INFO ] Invariant cache hit.
[2023-03-19 02:30:21] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-19 02:30:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 02:30:21] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2023-03-19 02:30:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 02:30:22] [INFO ] [Nat]Absence check using 12 positive place invariants in 16 ms returned sat
[2023-03-19 02:30:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 02:30:22] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2023-03-19 02:30:22] [INFO ] Computed and/alt/rep : 29/59/29 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-19 02:30:22] [INFO ] Added : 1 causal constraints over 1 iterations in 31 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 5 out of 36 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 36/36 places, 31/31 transitions.
Applied a total of 0 rules in 3 ms. Remains 36 /36 variables (removed 0) and now considering 31/31 (removed 0) transitions.
[2023-03-19 02:30:22] [INFO ] Invariant cache hit.
[2023-03-19 02:30:22] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-19 02:30:22] [INFO ] Invariant cache hit.
[2023-03-19 02:30:22] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2023-03-19 02:30:22] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 02:30:22] [INFO ] Invariant cache hit.
[2023-03-19 02:30:22] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 383 ms. Remains : 36/36 places, 31/31 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 : [(AND (NOT p3) p1 p0 p2), (X (NOT (AND (NOT p3) p1 p0))), (X (NOT (AND p1 p0))), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0)))))]
False Knowledge obtained : [(X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (NOT p2)), (X p2), (X (NOT p0)), (X p0), (X (AND (NOT p3) p2 (NOT p0))), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (X (AND (NOT p3) p1 p0))), (X (X (NOT (AND (NOT p3) p1 p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 7 factoid took 1073 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 263 ms :[(NOT p3), (AND (NOT p0) (NOT p2)), p2, (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 8 properties in 3 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p3) p1 p0 p2), (X (NOT (AND (NOT p3) p1 p0))), (X (NOT (AND p1 p0))), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0)))))]
False Knowledge obtained : [(X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (NOT p2)), (X p2), (X (NOT p0)), (X p0), (X (AND (NOT p3) p2 (NOT p0))), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (X (AND (NOT p3) p1 p0))), (X (X (NOT (AND (NOT p3) p1 p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p0))), (X (X p0)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) p2)), (F (NOT p2)), (F p3), (F (AND (NOT p0) p2 (NOT p3))), (F (NOT (AND p0 (NOT p3) p1))), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 1266 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 299 ms :[(NOT p3), (AND (NOT p0) (NOT p2)), p2, (NOT p0)]
Stuttering acceptance computed with spot in 318 ms :[(NOT p3), (AND (NOT p0) (NOT p2)), p2, (NOT p0)]
[2023-03-19 02:30:25] [INFO ] Invariant cache hit.
[2023-03-19 02:30:26] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-19 02:30:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 02:30:26] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-19 02:30:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 02:30:26] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-19 02:30:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 02:30:26] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-19 02:30:26] [INFO ] Computed and/alt/rep : 29/59/29 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-19 02:30:26] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 180 ms :[(NOT p3), (AND (NOT p0) (NOT p2)), p2, (NOT p0)]
Product exploration explored 100000 steps with 13501 reset in 133 ms.
Product exploration explored 100000 steps with 13535 reset in 108 ms.
Built C files in :
/tmp/ltsmin5946755066097843524
[2023-03-19 02:30:26] [INFO ] Computing symmetric may disable matrix : 31 transitions.
[2023-03-19 02:30:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 02:30:26] [INFO ] Computing symmetric may enable matrix : 31 transitions.
[2023-03-19 02:30:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 02:30:26] [INFO ] Computing Do-Not-Accords matrix : 31 transitions.
[2023-03-19 02:30:26] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 02:30:26] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5946755066097843524
Running compilation step : cd /tmp/ltsmin5946755066097843524;'/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 121 ms.
Running link step : cd /tmp/ltsmin5946755066097843524;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin5946755066097843524;'/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/stateBased16807838458221094728.hoa' '--buchi-type=spotba'
LTSmin run took 114 ms.
FORMULA ShieldPPPs-PT-001B-LTLCardinality-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-001B-LTLCardinality-07 finished in 10119 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)))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 63/63 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 63 transition count 58
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 63 transition count 58
Applied a total of 10 rules in 2 ms. Remains 63 /68 variables (removed 5) and now considering 58/63 (removed 5) transitions.
// Phase 1: matrix 58 rows 63 cols
[2023-03-19 02:30:27] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-19 02:30:27] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-19 02:30:27] [INFO ] Invariant cache hit.
[2023-03-19 02:30:27] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2023-03-19 02:30:27] [INFO ] Invariant cache hit.
[2023-03-19 02:30:27] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/68 places, 58/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 335 ms. Remains : 63/68 places, 58/63 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s30 0) (EQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 115 ms.
Product exploration explored 100000 steps with 50000 reset in 68 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-001B-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-001B-LTLCardinality-08 finished in 719 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U (p1 U p2)))))'
Support contains 5 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 63/63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 67 transition count 54
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 59 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 58 transition count 53
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 18 place count 58 transition count 48
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 28 place count 53 transition count 48
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 32 place count 49 transition count 44
Iterating global reduction 3 with 4 rules applied. Total rules applied 36 place count 49 transition count 44
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 36 place count 49 transition count 43
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 38 place count 48 transition count 43
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 62 place count 36 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 63 place count 35 transition count 30
Applied a total of 63 rules in 49 ms. Remains 35 /68 variables (removed 33) and now considering 30/63 (removed 33) transitions.
// Phase 1: matrix 30 rows 35 cols
[2023-03-19 02:30:27] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-19 02:30:27] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-19 02:30:27] [INFO ] Invariant cache hit.
[2023-03-19 02:30:28] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2023-03-19 02:30:28] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 02:30:28] [INFO ] Invariant cache hit.
[2023-03-19 02:30:28] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/68 places, 30/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 413 ms. Remains : 35/68 places, 30/63 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(OR p2 p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (EQ s8 0) (EQ s29 1)), p1:(OR (EQ s26 0) (EQ s14 1)), p0:(NEQ s9 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 673 steps with 24 reset in 2 ms.
FORMULA ShieldPPPs-PT-001B-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-001B-LTLCardinality-10 finished in 622 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(G(p1)))))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 63/63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 67 transition count 55
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 16 place count 60 transition count 53
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 58 transition count 53
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 18 place count 58 transition count 48
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 28 place count 53 transition count 48
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 32 place count 49 transition count 44
Iterating global reduction 3 with 4 rules applied. Total rules applied 36 place count 49 transition count 44
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 36 place count 49 transition count 43
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 38 place count 48 transition count 43
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 68 place count 33 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 32 transition count 27
Applied a total of 69 rules in 7 ms. Remains 32 /68 variables (removed 36) and now considering 27/63 (removed 36) transitions.
// Phase 1: matrix 27 rows 32 cols
[2023-03-19 02:30:28] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-19 02:30:28] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-19 02:30:28] [INFO ] Invariant cache hit.
[2023-03-19 02:30:28] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2023-03-19 02:30:28] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 02:30:28] [INFO ] Invariant cache hit.
[2023-03-19 02:30:28] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/68 places, 27/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 186 ms. Remains : 32/68 places, 27/63 transitions.
Stuttering acceptance computed with spot in 63 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s15 0) (EQ s6 1)), p1:(EQ s29 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 124 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-001B-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-001B-LTLCardinality-11 finished in 273 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))))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 63/63 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 63 transition count 58
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 63 transition count 58
Applied a total of 10 rules in 2 ms. Remains 63 /68 variables (removed 5) and now considering 58/63 (removed 5) transitions.
// Phase 1: matrix 58 rows 63 cols
[2023-03-19 02:30:28] [INFO ] Computed 12 place invariants in 0 ms
[2023-03-19 02:30:28] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-19 02:30:28] [INFO ] Invariant cache hit.
[2023-03-19 02:30:28] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2023-03-19 02:30:28] [INFO ] Invariant cache hit.
[2023-03-19 02:30:28] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/68 places, 58/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 235 ms. Remains : 63/68 places, 58/63 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLCardinality-12 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:(AND (EQ s16 1) (OR (EQ s21 0) (EQ s10 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 0 ms.
FORMULA ShieldPPPs-PT-001B-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-001B-LTLCardinality-12 finished in 399 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((G(F(p1))||p0)) U (p2&&F(p3)))))'
Support contains 7 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 63/63 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 64 transition count 59
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 64 transition count 59
Applied a total of 8 rules in 15 ms. Remains 64 /68 variables (removed 4) and now considering 59/63 (removed 4) transitions.
// Phase 1: matrix 59 rows 64 cols
[2023-03-19 02:30:29] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-19 02:30:29] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-19 02:30:29] [INFO ] Invariant cache hit.
[2023-03-19 02:30:29] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2023-03-19 02:30:29] [INFO ] Invariant cache hit.
[2023-03-19 02:30:29] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/68 places, 59/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 220 ms. Remains : 64/68 places, 59/63 transitions.
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p3)]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s19 0) (EQ s5 1)), p0:(OR (EQ s5 0) (EQ s45 1)), p1:(OR (EQ s20 0) (EQ s34 1)), p3:(OR (EQ s60 0) (EQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 91 ms.
Product exploration explored 100000 steps with 50000 reset in 80 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p2 p0 p1 p3), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p2), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p3)), (X (X p2)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p3))
Knowledge based reduction with 12 factoid took 501 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-001B-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-001B-LTLCardinality-14 finished in 1177 ms.
All properties solved by simple procedures.
Total runtime 28592 ms.

BK_STOP 1679193030474

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-001B.tgz
mv ShieldPPPs-PT-001B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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