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-165286025100372.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldPPPs-PT-002A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025100372
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 7.4K Apr 30 03:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 30 03:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 30 03:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 30 03:31 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.4K May 9 08:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:51 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 18K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652972661674

Running Version 202205111006
[2022-05-19 15:04:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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 15:04:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 15:04:22] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2022-05-19 15:04:22] [INFO ] Transformed 65 places.
[2022-05-19 15:04:22] [INFO ] Transformed 55 transitions.
[2022-05-19 15:04:22] [INFO ] Found NUPN structural information;
[2022-05-19 15:04:22] [INFO ] Parsed PT model containing 65 places and 55 transitions in 165 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldPPPs-PT-002A-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-002A-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-002A-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 55/55 transitions.
Applied a total of 0 rules in 10 ms. Remains 65 /65 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:04:23] [INFO ] Computed 23 place invariants in 8 ms
[2022-05-19 15:04:23] [INFO ] Implicit Places using invariants in 161 ms returned []
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:04:23] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-19 15:04:23] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:04:23] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-19 15:04:23] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 55/55 transitions.
Support contains 32 out of 65 places after structural reductions.
[2022-05-19 15:04:23] [INFO ] Flatten gal took : 27 ms
[2022-05-19 15:04:23] [INFO ] Flatten gal took : 9 ms
[2022-05-19 15:04:23] [INFO ] Input system was already deterministic with 55 transitions.
Finished random walk after 251 steps, including 1 resets, run visited all 24 properties in 28 ms. (steps per millisecond=8 )
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!F(X(!p0)) U F(G((!p0 U !p1)))))'
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 55/55 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 62 transition count 52
Applied a total of 4 rules in 17 ms. Remains 62 /65 variables (removed 3) and now considering 52/55 (removed 3) transitions.
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:04:24] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:04:24] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:04:24] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:04:24] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2022-05-19 15:04:24] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:04:24] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-19 15:04:24] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/65 places, 52/55 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/65 places, 52/55 transitions.
Stuttering acceptance computed with spot in 215 ms :[p1, p1]
Running random walk in product with property : ShieldPPPs-PT-002A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s7 1) (EQ s27 1)), p0:(AND (EQ s15 1) (EQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1095 reset in 276 ms.
Product exploration explored 100000 steps with 1078 reset in 217 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 : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 846 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[p1, p1]
Finished random walk after 34 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND p0 p1))]
Knowledge based reduction with 7 factoid took 294 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 87 ms :[p1, p1]
Stuttering acceptance computed with spot in 78 ms :[p1, p1]
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 52/52 transitions.
Applied a total of 0 rules in 11 ms. Remains 62 /62 variables (removed 0) and now considering 52/52 (removed 0) transitions.
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:04:26] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:04:26] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:04:26] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:04:26] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2022-05-19 15:04:26] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:04:26] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:04:26] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 52/52 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 : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 275 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[p1, p1]
Finished random walk after 1005 steps, including 5 resets, run visited all 3 properties in 44 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND p0 p1))]
Knowledge based reduction with 7 factoid took 327 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 84 ms :[p1, p1]
Stuttering acceptance computed with spot in 62 ms :[p1, p1]
Stuttering acceptance computed with spot in 76 ms :[p1, p1]
Product exploration explored 100000 steps with 1111 reset in 192 ms.
Product exploration explored 100000 steps with 1086 reset in 313 ms.
Built C files in :
/tmp/ltsmin10176999662983941926
[2022-05-19 15:04:28] [INFO ] Computing symmetric may disable matrix : 52 transitions.
[2022-05-19 15:04:28] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:04:28] [INFO ] Computing symmetric may enable matrix : 52 transitions.
[2022-05-19 15:04:28] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:04:28] [INFO ] Computing Do-Not-Accords matrix : 52 transitions.
[2022-05-19 15:04:28] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:04:28] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10176999662983941926
Running compilation step : cd /tmp/ltsmin10176999662983941926;'/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 218 ms.
Running link step : cd /tmp/ltsmin10176999662983941926;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin10176999662983941926;'/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/stateBased5573706293837798213.hoa' '--buchi-type=spotba'
LTSmin run took 747 ms.
FORMULA ShieldPPPs-PT-002A-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-002A-LTLFireability-00 finished in 5105 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p0)||p1))&&X(F((F(p0)||X(p2))))))'
Support contains 6 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 55/55 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:04:29] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:04:29] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:04:29] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-19 15:04:29] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:04:29] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-19 15:04:29] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 55/55 transitions.
Stuttering acceptance computed with spot in 214 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-002A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(OR (AND p1 p0) (AND p1 p2)), acceptance={0} source=3 dest: 4}, { cond=(NOT p1), acceptance={0} source=3 dest: 5}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=(AND p1 p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}]], initial=1, aps=[p1:(AND (EQ s49 1) (EQ s60 1)), p0:(AND (EQ s44 1) (EQ s63 1)), p2:(AND (EQ s38 1) (EQ s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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 1 ms.
FORMULA ShieldPPPs-PT-002A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-002A-LTLFireability-01 finished in 406 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(X(p1))||p0))))'
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 55/55 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:04:29] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:04:29] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:04:29] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:04:29] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:04:29] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-19 15:04:29] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 55/55 transitions.
Stuttering acceptance computed with spot in 844 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-002A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s0 0), p0:(OR (EQ s46 0) (AND (EQ s1 1) (EQ s26 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]]
Product exploration explored 100000 steps with 550 reset in 172 ms.
Product exploration explored 100000 steps with 548 reset in 189 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/65 stabilizing places and 1/55 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p0)), (X (X p1)), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 214 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p0)), (X (X p1)), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 191 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:04:31] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-19 15:04:31] [INFO ] [Real]Absence check using 23 positive place invariants in 3 ms returned sat
[2022-05-19 15:04:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 15:04:31] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-19 15:04:31] [INFO ] Computed and/alt/rep : 54/147/54 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 15:04:31] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 65 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 55/55 transitions.
Applied a total of 0 rules in 9 ms. Remains 65 /65 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:04:31] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:04:31] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:04:31] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:04:31] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:04:31] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:04:31] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 55/55 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/65 stabilizing places and 1/55 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:04:32] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-19 15:04:32] [INFO ] [Real]Absence check using 23 positive place invariants in 2 ms returned sat
[2022-05-19 15:04:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 15:04:32] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-19 15:04:32] [INFO ] Computed and/alt/rep : 54/147/54 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 15:04:32] [INFO ] Added : 0 causal constraints over 0 iterations in 17 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 559 reset in 147 ms.
Product exploration explored 100000 steps with 547 reset in 160 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 55/55 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 65 transition count 55
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 5 ms. Remains 65 /65 variables (removed 0) and now considering 55/55 (removed 0) transitions.
[2022-05-19 15:04:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:04:33] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:04:33] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/65 places, 55/55 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 55/55 transitions.
Product exploration explored 100000 steps with 602 reset in 235 ms.
Product exploration explored 100000 steps with 614 reset in 283 ms.
Built C files in :
/tmp/ltsmin2092595627252245228
[2022-05-19 15:04:33] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2092595627252245228
Running compilation step : cd /tmp/ltsmin2092595627252245228;'/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 131 ms.
Running link step : cd /tmp/ltsmin2092595627252245228;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin2092595627252245228;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4256609439284679813.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 55/55 transitions.
Applied a total of 0 rules in 4 ms. Remains 65 /65 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:04:49] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:04:49] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:04:49] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:04:49] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:04:49] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:04:49] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 55/55 transitions.
Built C files in :
/tmp/ltsmin18084140700363358366
[2022-05-19 15:04:49] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18084140700363358366
Running compilation step : cd /tmp/ltsmin18084140700363358366;'/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 127 ms.
Running link step : cd /tmp/ltsmin18084140700363358366;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin18084140700363358366;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2330734289809601918.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 15:05:04] [INFO ] Flatten gal took : 7 ms
[2022-05-19 15:05:04] [INFO ] Flatten gal took : 5 ms
[2022-05-19 15:05:04] [INFO ] Time to serialize gal into /tmp/LTL11319501368096785083.gal : 1 ms
[2022-05-19 15:05:04] [INFO ] Time to serialize properties into /tmp/LTL18026525485219108848.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/LTL11319501368096785083.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18026525485219108848.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/LTL1131950...268
Read 1 LTL properties
Checking formula 0 : !((X(G(((G(X("(p0==0)")))||("(p46==0)"))||("((p1==1)&&(p26==1))")))))
Formula 0 simplified : !XG("((p1==1)&&(p26==1))" | "(p46==0)" | GX"(p0==0)")
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t20, t26, t28...300
Computing Next relation with stutter on 162 deadlock states
Detected timeout of ITS tools.
[2022-05-19 15:05:19] [INFO ] Flatten gal took : 5 ms
[2022-05-19 15:05:19] [INFO ] Applying decomposition
[2022-05-19 15:05:19] [INFO ] Flatten gal took : 8 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/graph3304711341012840383.txt' '-o' '/tmp/graph3304711341012840383.bin' '-w' '/tmp/graph3304711341012840383.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3304711341012840383.bin' '-l' '-1' '-v' '-w' '/tmp/graph3304711341012840383.weights' '-q' '0' '-e' '0.001'
[2022-05-19 15:05:19] [INFO ] Decomposing Gal with order
[2022-05-19 15:05:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 15:05:19] [INFO ] Removed a total of 12 redundant transitions.
[2022-05-19 15:05:19] [INFO ] Flatten gal took : 34 ms
[2022-05-19 15:05:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 5 ms.
[2022-05-19 15:05:19] [INFO ] Time to serialize gal into /tmp/LTL6600144499626586753.gal : 2 ms
[2022-05-19 15:05:19] [INFO ] Time to serialize properties into /tmp/LTL8914524865478530510.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/LTL6600144499626586753.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8914524865478530510.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/LTL6600144...245
Read 1 LTL properties
Checking formula 0 : !((X(G(((G(X("(i1.u0.p0==0)")))||("(i5.i0.u17.p46==0)"))||("((i1.u0.p1==1)&&(i1.u10.p26==1))")))))
Formula 0 simplified : !XG("((i1.u0.p1==1)&&(i1.u10.p26==1))" | "(i5.i0.u17.p46==0)" | GX"(i1.u0.p0==0)")
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t9, t10, t39, i0.t45, i0.t44, i0.u8.t3, i0.u8.t4, i1.t41, i1.t40, i1.u10.t5, i1.u...443
Computing Next relation with stutter on 162 deadlock states
56 unique states visited
0 strongly connected components in search stack
56 transitions explored
56 items max in DFS search stack
673 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.74846,197948,1,0,342035,177,800,603829,122,596,436319
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldPPPs-PT-002A-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldPPPs-PT-002A-LTLFireability-02 finished in 57794 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)))'
Support contains 5 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 55/55 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 63 transition count 53
Applied a total of 4 rules in 4 ms. Remains 63 /65 variables (removed 2) and now considering 53/55 (removed 2) transitions.
// Phase 1: matrix 53 rows 63 cols
[2022-05-19 15:05:27] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:05:27] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 53 rows 63 cols
[2022-05-19 15:05:27] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:05:27] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2022-05-19 15:05:27] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 53 rows 63 cols
[2022-05-19 15:05:27] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:05:27] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/65 places, 53/55 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/65 places, 53/55 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-002A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(EQ s61 1), p0:(AND (OR (EQ s1 0) (EQ s26 0)) (EQ s16 1) (EQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 10634 reset in 158 ms.
Product exploration explored 100000 steps with 10661 reset in 153 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 8 factoid took 392 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p1), (OR (NOT p1) (NOT p0))]
Finished random walk after 7 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (F p0), (F (AND (NOT p0) p1)), (F p1)]
Knowledge based reduction with 8 factoid took 591 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p1), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p1), (OR (NOT p1) (NOT p0))]
// Phase 1: matrix 53 rows 63 cols
[2022-05-19 15:05:29] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:05:29] [INFO ] [Real]Absence check using 23 positive place invariants in 3 ms returned sat
[2022-05-19 15:05:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 15:05:29] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-19 15:05:29] [INFO ] Computed and/alt/rep : 52/151/52 causal constraints (skipped 0 transitions) in 33 ms.
[2022-05-19 15:05:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 15:05:29] [INFO ] [Nat]Absence check using 23 positive place invariants in 3 ms returned sat
[2022-05-19 15:05:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 15:05:29] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-19 15:05:29] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 3 ms to minimize.
[2022-05-19 15:05:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2022-05-19 15:05:29] [INFO ] Computed and/alt/rep : 52/151/52 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 15:05:29] [INFO ] Added : 47 causal constraints over 12 iterations in 103 ms. Result :sat
Could not prove EG (NOT p1)
// Phase 1: matrix 53 rows 63 cols
[2022-05-19 15:05:29] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-19 15:05:29] [INFO ] [Real]Absence check using 23 positive place invariants in 4 ms returned sat
[2022-05-19 15:05:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 15:05:29] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-05-19 15:05:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 15:05:29] [INFO ] [Nat]Absence check using 23 positive place invariants in 4 ms returned sat
[2022-05-19 15:05:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 15:05:29] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-19 15:05:29] [INFO ] Computed and/alt/rep : 52/151/52 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-19 15:05:29] [INFO ] Added : 36 causal constraints over 8 iterations in 67 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 53/53 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 53/53 (removed 0) transitions.
// Phase 1: matrix 53 rows 63 cols
[2022-05-19 15:05:29] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:05:29] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 53 rows 63 cols
[2022-05-19 15:05:29] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:05:29] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2022-05-19 15:05:29] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 53 rows 63 cols
[2022-05-19 15:05:29] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:05:29] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 53/53 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 8 factoid took 776 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p1), (OR (NOT p1) (NOT p0))]
Finished random walk after 12 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (F p0), (F (AND (NOT p0) p1)), (F p1)]
Knowledge based reduction with 8 factoid took 447 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p1), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p1), (OR (NOT p1) (NOT p0))]
// Phase 1: matrix 53 rows 63 cols
[2022-05-19 15:05:31] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:05:31] [INFO ] [Real]Absence check using 23 positive place invariants in 4 ms returned sat
[2022-05-19 15:05:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 15:05:31] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-19 15:05:31] [INFO ] Computed and/alt/rep : 52/151/52 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-19 15:05:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 15:05:31] [INFO ] [Nat]Absence check using 23 positive place invariants in 3 ms returned sat
[2022-05-19 15:05:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 15:05:31] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-19 15:05:31] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2022-05-19 15:05:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2022-05-19 15:05:31] [INFO ] Computed and/alt/rep : 52/151/52 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-19 15:05:31] [INFO ] Added : 47 causal constraints over 12 iterations in 95 ms. Result :sat
Could not prove EG (NOT p1)
// Phase 1: matrix 53 rows 63 cols
[2022-05-19 15:05:31] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:05:31] [INFO ] [Real]Absence check using 23 positive place invariants in 4 ms returned sat
[2022-05-19 15:05:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 15:05:31] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-19 15:05:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 15:05:31] [INFO ] [Nat]Absence check using 23 positive place invariants in 3 ms returned sat
[2022-05-19 15:05:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 15:05:31] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-19 15:05:31] [INFO ] Computed and/alt/rep : 52/151/52 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 15:05:32] [INFO ] Added : 36 causal constraints over 8 iterations in 57 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p1), (OR (NOT p1) (NOT p0))]
Stuttering criterion allowed to conclude after 62568 steps with 6658 reset in 91 ms.
FORMULA ShieldPPPs-PT-002A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-002A-LTLFireability-03 finished in 4941 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(G(!(p1 U p2)))&&p0))))'
Support contains 5 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 55/55 transitions.
Applied a total of 0 rules in 5 ms. Remains 65 /65 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:05:32] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:05:32] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:05:32] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-19 15:05:32] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:05:32] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:05:32] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 55/55 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), true, p2]
Running random walk in product with property : ShieldPPPs-PT-002A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=p2, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s62 0) (OR (EQ s17 0) (EQ s19 0))), p2:(AND (EQ s39 1) (EQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 160 steps with 1 reset in 1 ms.
FORMULA ShieldPPPs-PT-002A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-002A-LTLFireability-04 finished in 281 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 55/55 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 62 transition count 52
Applied a total of 4 rules in 10 ms. Remains 62 /65 variables (removed 3) and now considering 52/55 (removed 3) transitions.
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:05:32] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:05:32] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:05:32] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:05:32] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2022-05-19 15:05:32] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:05:32] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:05:32] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/65 places, 52/55 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/65 places, 52/55 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-002A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s31 1), p1:(NEQ s50 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1472 reset in 182 ms.
Product exploration explored 100000 steps with 1468 reset in 198 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 : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 172 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 267 steps, including 1 resets, run visited all 2 properties in 5 ms. (steps per millisecond=53 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 275 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 52/52 transitions.
Applied a total of 0 rules in 6 ms. Remains 62 /62 variables (removed 0) and now considering 52/52 (removed 0) transitions.
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:05:33] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:05:33] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:05:33] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:05:33] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2022-05-19 15:05:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:05:33] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:05:33] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 52/52 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 : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 182 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 162 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=81 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 203 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1475 reset in 165 ms.
Product exploration explored 100000 steps with 1461 reset in 184 ms.
Built C files in :
/tmp/ltsmin12411761743644570475
[2022-05-19 15:05:35] [INFO ] Computing symmetric may disable matrix : 52 transitions.
[2022-05-19 15:05:35] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:05:35] [INFO ] Computing symmetric may enable matrix : 52 transitions.
[2022-05-19 15:05:35] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:05:35] [INFO ] Computing Do-Not-Accords matrix : 52 transitions.
[2022-05-19 15:05:35] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:05:35] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12411761743644570475
Running compilation step : cd /tmp/ltsmin12411761743644570475;'/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 317 ms.
Running link step : cd /tmp/ltsmin12411761743644570475;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin12411761743644570475;'/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/stateBased262644226240930097.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 52/52 transitions.
Applied a total of 0 rules in 6 ms. Remains 62 /62 variables (removed 0) and now considering 52/52 (removed 0) transitions.
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:05:50] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:05:50] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:05:50] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:05:50] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2022-05-19 15:05:50] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:05:50] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:05:50] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 52/52 transitions.
Built C files in :
/tmp/ltsmin10547868625644300503
[2022-05-19 15:05:50] [INFO ] Computing symmetric may disable matrix : 52 transitions.
[2022-05-19 15:05:50] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:05:50] [INFO ] Computing symmetric may enable matrix : 52 transitions.
[2022-05-19 15:05:50] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:05:50] [INFO ] Computing Do-Not-Accords matrix : 52 transitions.
[2022-05-19 15:05:50] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:05:50] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10547868625644300503
Running compilation step : cd /tmp/ltsmin10547868625644300503;'/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 128 ms.
Running link step : cd /tmp/ltsmin10547868625644300503;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin10547868625644300503;'/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/stateBased18062717082369461161.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 15:06:05] [INFO ] Flatten gal took : 5 ms
[2022-05-19 15:06:05] [INFO ] Flatten gal took : 4 ms
[2022-05-19 15:06:05] [INFO ] Time to serialize gal into /tmp/LTL7833338065565855932.gal : 2 ms
[2022-05-19 15:06:05] [INFO ] Time to serialize properties into /tmp/LTL609422336421890708.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/LTL7833338065565855932.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL609422336421890708.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/LTL7833338...265
Read 1 LTL properties
Checking formula 0 : !((F((G("(p32==1)"))||(G(F("(p53==0)"))))))
Formula 0 simplified : !F(G"(p32==1)" | GF"(p53==0)")
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t14, t15, t16, t17, t26, t28, t36, t38, t41, t43...311
Computing Next relation with stutter on 162 deadlock states
Detected timeout of ITS tools.
[2022-05-19 15:06:20] [INFO ] Flatten gal took : 4 ms
[2022-05-19 15:06:20] [INFO ] Applying decomposition
[2022-05-19 15:06:20] [INFO ] Flatten gal took : 4 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/graph13893829043190130075.txt' '-o' '/tmp/graph13893829043190130075.bin' '-w' '/tmp/graph13893829043190130075.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13893829043190130075.bin' '-l' '-1' '-v' '-w' '/tmp/graph13893829043190130075.weights' '-q' '0' '-e' '0.001'
[2022-05-19 15:06:20] [INFO ] Decomposing Gal with order
[2022-05-19 15:06:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 15:06:20] [INFO ] Removed a total of 12 redundant transitions.
[2022-05-19 15:06:20] [INFO ] Flatten gal took : 6 ms
[2022-05-19 15:06:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 1 ms.
[2022-05-19 15:06:20] [INFO ] Time to serialize gal into /tmp/LTL7056802319848610016.gal : 1 ms
[2022-05-19 15:06:20] [INFO ] Time to serialize properties into /tmp/LTL7164162843373924027.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/LTL7056802319848610016.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7164162843373924027.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/LTL7056802...245
Read 1 LTL properties
Checking formula 0 : !((F((G("(i3.u11.p32==1)"))||(G(F("(i5.u19.p53==0)"))))))
Formula 0 simplified : !F(G"(i3.u11.p32==1)" | GF"(i5.u19.p53==0)")
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t9, t10, t11_t19, i0.t45, i0.t44, i0.u8.t3, i0.u8.t4, i2.t41, i2.t40, i2.u10.t5, ...422
Computing Next relation with stutter on 162 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin577768582343170112
[2022-05-19 15:06:35] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin577768582343170112
Running compilation step : cd /tmp/ltsmin577768582343170112;'/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 126 ms.
Running link step : cd /tmp/ltsmin577768582343170112;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin577768582343170112;'/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))||[](<>((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-002A-LTLFireability-05 finished in 78078 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 55/55 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 62 transition count 52
Applied a total of 4 rules in 9 ms. Remains 62 /65 variables (removed 3) and now considering 52/55 (removed 3) transitions.
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:06:50] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:06:50] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:06:50] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:06:50] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2022-05-19 15:06:50] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:06:50] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:06:50] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/65 places, 52/55 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/65 places, 52/55 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-002A-LTLFireability-07 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:(NEQ s49 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 2539 reset in 147 ms.
Product exploration explored 100000 steps with 2492 reset in 156 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 89 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 68 ms :[(NOT p0), (NOT p0)]
Finished random walk after 28 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=14 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 108 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 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 52/52 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 52/52 (removed 0) transitions.
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:06:51] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:06:51] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:06:51] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:06:51] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2022-05-19 15:06:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:06:51] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:06:51] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 52/52 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 101 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 71 ms :[(NOT p0), (NOT p0)]
Finished random walk after 21 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 142 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 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2520 reset in 152 ms.
Product exploration explored 100000 steps with 2500 reset in 157 ms.
Built C files in :
/tmp/ltsmin624154914662657115
[2022-05-19 15:06:52] [INFO ] Computing symmetric may disable matrix : 52 transitions.
[2022-05-19 15:06:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:06:52] [INFO ] Computing symmetric may enable matrix : 52 transitions.
[2022-05-19 15:06:52] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:06:52] [INFO ] Computing Do-Not-Accords matrix : 52 transitions.
[2022-05-19 15:06:52] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:06:52] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin624154914662657115
Running compilation step : cd /tmp/ltsmin624154914662657115;'/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 135 ms.
Running link step : cd /tmp/ltsmin624154914662657115;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin624154914662657115;'/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/stateBased10868804910978011712.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 52/52 transitions.
Applied a total of 0 rules in 5 ms. Remains 62 /62 variables (removed 0) and now considering 52/52 (removed 0) transitions.
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:07:07] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-19 15:07:07] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:07:07] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:07:07] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2022-05-19 15:07:07] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:07:07] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:07:07] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 52/52 transitions.
Built C files in :
/tmp/ltsmin5072765983734412879
[2022-05-19 15:07:08] [INFO ] Computing symmetric may disable matrix : 52 transitions.
[2022-05-19 15:07:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:07:08] [INFO ] Computing symmetric may enable matrix : 52 transitions.
[2022-05-19 15:07:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:07:08] [INFO ] Computing Do-Not-Accords matrix : 52 transitions.
[2022-05-19 15:07:08] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:07:08] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5072765983734412879
Running compilation step : cd /tmp/ltsmin5072765983734412879;'/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 135 ms.
Running link step : cd /tmp/ltsmin5072765983734412879;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin5072765983734412879;'/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/stateBased14513202577686170391.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 15:07:23] [INFO ] Flatten gal took : 4 ms
[2022-05-19 15:07:23] [INFO ] Flatten gal took : 4 ms
[2022-05-19 15:07:23] [INFO ] Time to serialize gal into /tmp/LTL562509477364006978.gal : 1 ms
[2022-05-19 15:07:23] [INFO ] Time to serialize properties into /tmp/LTL13402065424836203735.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/LTL562509477364006978.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13402065424836203735.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/LTL5625094...266
Read 1 LTL properties
Checking formula 0 : !((G(F("(p52==0)"))))
Formula 0 simplified : !GF"(p52==0)"
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t14, t15, t16, t17, t26, t28, t36, t38, t41, t43...311
Computing Next relation with stutter on 162 deadlock states
Detected timeout of ITS tools.
[2022-05-19 15:07:38] [INFO ] Flatten gal took : 11 ms
[2022-05-19 15:07:38] [INFO ] Applying decomposition
[2022-05-19 15:07:38] [INFO ] Flatten gal took : 3 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/graph8441272401427007916.txt' '-o' '/tmp/graph8441272401427007916.bin' '-w' '/tmp/graph8441272401427007916.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8441272401427007916.bin' '-l' '-1' '-v' '-w' '/tmp/graph8441272401427007916.weights' '-q' '0' '-e' '0.001'
[2022-05-19 15:07:39] [INFO ] Decomposing Gal with order
[2022-05-19 15:07:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 15:07:39] [INFO ] Removed a total of 12 redundant transitions.
[2022-05-19 15:07:39] [INFO ] Flatten gal took : 8 ms
[2022-05-19 15:07:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 1 ms.
[2022-05-19 15:07:39] [INFO ] Time to serialize gal into /tmp/LTL12757838518583682103.gal : 1 ms
[2022-05-19 15:07:39] [INFO ] Time to serialize properties into /tmp/LTL802329823203483047.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/LTL12757838518583682103.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL802329823203483047.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/LTL1275783...245
Read 1 LTL properties
Checking formula 0 : !((G(F("(i5.u19.p52==0)"))))
Formula 0 simplified : !GF"(i5.u19.p52==0)"
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t9, t10, t11_t19, i0.t45, i0.t44, i0.u8.t3, i0.u8.t4, i2.t41, i2.t40, i2.u10.t5, ...422
Computing Next relation with stutter on 162 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2030296660206213786
[2022-05-19 15:07:54] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2030296660206213786
Running compilation step : cd /tmp/ltsmin2030296660206213786;'/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 123 ms.
Running link step : cd /tmp/ltsmin2030296660206213786;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin2030296660206213786;'/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 ShieldPPPs-PT-002A-LTLFireability-07 finished in 78563 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(p1))))'
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 55/55 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:08:09] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:08:09] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:08:09] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-19 15:08:09] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:08:09] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:08:09] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 55/55 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldPPPs-PT-002A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s37 1) (EQ s53 1)), p0:(EQ s46 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-002A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-002A-LTLFireability-08 finished in 272 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 55/55 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:08:09] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:08:09] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:08:09] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-19 15:08:09] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:08:09] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:08:09] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 55/55 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-002A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s8 1) (EQ s29 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-002A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-002A-LTLFireability-10 finished in 274 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((F(p0)&&p1))))'
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 55/55 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:08:09] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:08:09] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:08:09] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:08:09] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:08:09] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:08:09] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 55/55 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-002A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s42 0) (EQ s54 0)), p1:(EQ s31 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 10005 steps with 197 reset in 20 ms.
FORMULA ShieldPPPs-PT-002A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-002A-LTLFireability-12 finished in 407 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(p0))))'
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 55/55 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:08:10] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:08:10] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:08:10] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-19 15:08:10] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:08:10] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:08:10] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 55/55 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-002A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s62 0) (EQ s17 0) (EQ s19 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 115 ms.
Product exploration explored 100000 steps with 33333 reset in 115 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 43 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPs-PT-002A-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-002A-LTLFireability-13 finished in 550 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 55/55 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 62 transition count 52
Applied a total of 4 rules in 9 ms. Remains 62 /65 variables (removed 3) and now considering 52/55 (removed 3) transitions.
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:08:10] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:08:10] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:08:10] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:08:10] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2022-05-19 15:08:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:08:10] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:08:10] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/65 places, 52/55 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/65 places, 52/55 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-002A-LTLFireability-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:(NEQ s50 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 1523 reset in 146 ms.
Product exploration explored 100000 steps with 1541 reset in 154 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 115 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 50 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=25 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 108 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 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 52/52 transitions.
Applied a total of 0 rules in 6 ms. Remains 62 /62 variables (removed 0) and now considering 52/52 (removed 0) transitions.
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:08:11] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:08:11] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:08:11] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:08:11] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2022-05-19 15:08:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:08:11] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:08:11] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 52/52 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 91 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 62 ms :[(NOT p0), (NOT p0)]
Finished random walk after 44 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=44 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1522 reset in 146 ms.
Product exploration explored 100000 steps with 1529 reset in 156 ms.
Built C files in :
/tmp/ltsmin8729198558139980213
[2022-05-19 15:08:12] [INFO ] Computing symmetric may disable matrix : 52 transitions.
[2022-05-19 15:08:12] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:08:12] [INFO ] Computing symmetric may enable matrix : 52 transitions.
[2022-05-19 15:08:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:08:12] [INFO ] Computing Do-Not-Accords matrix : 52 transitions.
[2022-05-19 15:08:12] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:08:12] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8729198558139980213
Running compilation step : cd /tmp/ltsmin8729198558139980213;'/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 492 ms.
Running link step : cd /tmp/ltsmin8729198558139980213;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin8729198558139980213;'/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/stateBased1732441380633078831.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 52/52 transitions.
Applied a total of 0 rules in 7 ms. Remains 62 /62 variables (removed 0) and now considering 52/52 (removed 0) transitions.
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:08:27] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:08:27] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:08:27] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:08:27] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2022-05-19 15:08:27] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 52 rows 62 cols
[2022-05-19 15:08:27] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:08:27] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 52/52 transitions.
Built C files in :
/tmp/ltsmin11420265777020115465
[2022-05-19 15:08:27] [INFO ] Computing symmetric may disable matrix : 52 transitions.
[2022-05-19 15:08:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:08:27] [INFO ] Computing symmetric may enable matrix : 52 transitions.
[2022-05-19 15:08:27] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:08:27] [INFO ] Computing Do-Not-Accords matrix : 52 transitions.
[2022-05-19 15:08:27] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:08:27] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11420265777020115465
Running compilation step : cd /tmp/ltsmin11420265777020115465;'/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 140 ms.
Running link step : cd /tmp/ltsmin11420265777020115465;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin11420265777020115465;'/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/stateBased7094002979834559808.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 15:08:43] [INFO ] Flatten gal took : 4 ms
[2022-05-19 15:08:43] [INFO ] Flatten gal took : 4 ms
[2022-05-19 15:08:43] [INFO ] Time to serialize gal into /tmp/LTL12770473404233051027.gal : 1 ms
[2022-05-19 15:08:43] [INFO ] Time to serialize properties into /tmp/LTL4375548416020057643.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/LTL12770473404233051027.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4375548416020057643.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/LTL1277047...267
Read 1 LTL properties
Checking formula 0 : !((G(F("(p53==0)"))))
Formula 0 simplified : !GF"(p53==0)"
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t14, t15, t16, t17, t26, t28, t36, t38, t41, t43...311
Computing Next relation with stutter on 162 deadlock states
Detected timeout of ITS tools.
[2022-05-19 15:08:58] [INFO ] Flatten gal took : 7 ms
[2022-05-19 15:08:58] [INFO ] Applying decomposition
[2022-05-19 15:08:58] [INFO ] Flatten gal took : 4 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/graph1103399064649119026.txt' '-o' '/tmp/graph1103399064649119026.bin' '-w' '/tmp/graph1103399064649119026.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1103399064649119026.bin' '-l' '-1' '-v' '-w' '/tmp/graph1103399064649119026.weights' '-q' '0' '-e' '0.001'
[2022-05-19 15:08:58] [INFO ] Decomposing Gal with order
[2022-05-19 15:08:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 15:08:58] [INFO ] Removed a total of 12 redundant transitions.
[2022-05-19 15:08:58] [INFO ] Flatten gal took : 6 ms
[2022-05-19 15:08:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 1 ms.
[2022-05-19 15:08:58] [INFO ] Time to serialize gal into /tmp/LTL17341554523418413699.gal : 1 ms
[2022-05-19 15:08:58] [INFO ] Time to serialize properties into /tmp/LTL16441016356158796528.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/LTL17341554523418413699.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16441016356158796528.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/LTL1734155...247
Read 1 LTL properties
Checking formula 0 : !((G(F("(i4.u19.p53==0)"))))
Formula 0 simplified : !GF"(i4.u19.p53==0)"
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t9, t10, t11_t19, i1.t45, i1.t44, i1.u8.t3, i1.u8.t4, i2.t41, i2.t40, i2.u10.t5, ...422
Computing Next relation with stutter on 162 deadlock states
48 unique states visited
0 strongly connected components in search stack
94 transitions explored
48 items max in DFS search stack
1177 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,11.7813,244640,1,0,397181,150,615,974986,125,307,337129
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldPPPs-PT-002A-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldPPPs-PT-002A-LTLFireability-14 finished in 60990 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G((G(p1)&&p0)))&&F(p2))))'
Support contains 6 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 55/55 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 64 transition count 54
Applied a total of 2 rules in 6 ms. Remains 64 /65 variables (removed 1) and now considering 54/55 (removed 1) transitions.
// Phase 1: matrix 54 rows 64 cols
[2022-05-19 15:09:11] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:09:11] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 54 rows 64 cols
[2022-05-19 15:09:11] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:09:11] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2022-05-19 15:09:11] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 54 rows 64 cols
[2022-05-19 15:09:11] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:09:11] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/65 places, 54/55 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/65 places, 54/55 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-002A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (EQ s11 0) (EQ s21 0)), p1:(OR (EQ s43 0) (EQ s45 0)), p0:(AND (OR (EQ s47 0) (EQ s63 0)) (OR (EQ s43 0) (EQ s45 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 571 reset in 176 ms.
Stack based approach found an accepted trace after 8778 steps with 50 reset with depth 151 and stack size 151 in 16 ms.
FORMULA ShieldPPPs-PT-002A-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPs-PT-002A-LTLFireability-15 finished in 478 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2022-05-19 15:09:12] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17076183162226832806
[2022-05-19 15:09:12] [INFO ] Computing symmetric may disable matrix : 55 transitions.
[2022-05-19 15:09:12] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:09:12] [INFO ] Applying decomposition
[2022-05-19 15:09:12] [INFO ] Computing symmetric may enable matrix : 55 transitions.
[2022-05-19 15:09:12] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:09:12] [INFO ] Computing Do-Not-Accords matrix : 55 transitions.
[2022-05-19 15:09:12] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:09:12] [INFO ] Flatten gal took : 4 ms
[2022-05-19 15:09:12] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17076183162226832806
Running compilation step : cd /tmp/ltsmin17076183162226832806;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' '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/graph16901206056418695303.txt' '-o' '/tmp/graph16901206056418695303.bin' '-w' '/tmp/graph16901206056418695303.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16901206056418695303.bin' '-l' '-1' '-v' '-w' '/tmp/graph16901206056418695303.weights' '-q' '0' '-e' '0.001'
[2022-05-19 15:09:12] [INFO ] Decomposing Gal with order
[2022-05-19 15:09:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 15:09:12] [INFO ] Removed a total of 12 redundant transitions.
[2022-05-19 15:09:12] [INFO ] Flatten gal took : 6 ms
[2022-05-19 15:09:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 2 ms.
[2022-05-19 15:09:12] [INFO ] Time to serialize gal into /tmp/LTLFireability11350734057137417025.gal : 1 ms
[2022-05-19 15:09:12] [INFO ] Time to serialize properties into /tmp/LTLFireability16280412575127756448.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/LTLFireability11350734057137417025.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16280412575127756448.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/LTLFireabi...269
Read 2 LTL properties
Checking formula 0 : !((F((G("(i3.u11.p32==1)"))||(G(F("(i5.u19.p53!=1)"))))))
Formula 0 simplified : !F(G"(i3.u11.p32==1)" | GF"(i5.u19.p53!=1)")
Compilation finished in 143 ms.
Running link step : cd /tmp/ltsmin17076183162226832806;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin17076183162226832806;'/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))||[](<>((LTLAPp1==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t9, t10, t39, i0.t41, i0.t40, i0.u10.t5, i0.u10.t6, i1.t45, i1.t44, i1.u8.t3, i1....443
Computing Next relation with stutter on 162 deadlock states
57 unique states visited
0 strongly connected components in search stack
112 transitions explored
57 items max in DFS search stack
2147 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,21.4872,426892,1,0,796380,218,826,953040,120,693,639706
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldPPPs-PT-002A-LTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F("(i5.u19.p52!=1)"))))
Formula 1 simplified : !GF"(i5.u19.p52!=1)"
Computing Next relation with stutter on 162 deadlock states
100 unique states visited
0 strongly connected components in search stack
112 transitions explored
57 items max in DFS search stack
1096 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,32.4417,587648,1,0,1.07622e+06,218,848,1.25443e+06,122,697,861817
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA ShieldPPPs-PT-002A-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 364997 ms.

BK_STOP 1652973027887

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldPPPs-PT-002A, examination is LTLFireability"
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-165286025100372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-002A.tgz
mv ShieldPPPs-PT-002A execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;