About the Execution of ITS-Tools for ShieldPPPs-PT-005A
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16207.972 | 3600000.00 | 6003816.00 | 17856.70 | FFTFFF?FFFFFTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r389-oct2-167903713500420.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ShieldPPPs-PT-005A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713500420
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 7.4K Feb 26 01:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 01:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 01:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 01:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 01:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K Feb 26 01:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Feb 26 01:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 44K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPs-PT-005A-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-005A-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-005A-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-005A-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-005A-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-005A-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-005A-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-005A-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-005A-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-005A-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-005A-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-005A-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-005A-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-005A-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-005A-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-005A-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679197806067
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-005A
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-19 03:50:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 03:50:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 03:50:10] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2023-03-19 03:50:10] [INFO ] Transformed 158 places.
[2023-03-19 03:50:10] [INFO ] Transformed 133 transitions.
[2023-03-19 03:50:10] [INFO ] Found NUPN structural information;
[2023-03-19 03:50:10] [INFO ] Parsed PT model containing 158 places and 133 transitions and 506 arcs in 262 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPs-PT-005A-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Applied a total of 0 rules in 20 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
// Phase 1: matrix 133 rows 158 cols
[2023-03-19 03:50:10] [INFO ] Computed 56 place invariants in 11 ms
[2023-03-19 03:50:10] [INFO ] Implicit Places using invariants in 539 ms returned []
[2023-03-19 03:50:10] [INFO ] Invariant cache hit.
[2023-03-19 03:50:11] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 920 ms to find 0 implicit places.
[2023-03-19 03:50:11] [INFO ] Invariant cache hit.
[2023-03-19 03:50:11] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1155 ms. Remains : 158/158 places, 133/133 transitions.
Support contains 51 out of 158 places after structural reductions.
[2023-03-19 03:50:11] [INFO ] Flatten gal took : 60 ms
[2023-03-19 03:50:11] [INFO ] Flatten gal took : 12 ms
[2023-03-19 03:50:11] [INFO ] Input system was already deterministic with 133 transitions.
Finished random walk after 4706 steps, including 12 resets, run visited all 36 properties in 167 ms. (steps per millisecond=28 )
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U p1))'
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Applied a total of 0 rules in 22 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2023-03-19 03:50:13] [INFO ] Invariant cache hit.
[2023-03-19 03:50:13] [INFO ] Implicit Places using invariants in 230 ms returned []
[2023-03-19 03:50:13] [INFO ] Invariant cache hit.
[2023-03-19 03:50:13] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
[2023-03-19 03:50:13] [INFO ] Invariant cache hit.
[2023-03-19 03:50:13] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 906 ms. Remains : 158/158 places, 133/133 transitions.
Stuttering acceptance computed with spot in 324 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-005A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s42 1) (EQ s54 1)), p0:(AND (EQ s135 1) (EQ s147 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ShieldPPPs-PT-005A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-005A-LTLFireability-00 finished in 1442 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 156 transition count 131
Applied a total of 4 rules in 40 ms. Remains 156 /158 variables (removed 2) and now considering 131/133 (removed 2) transitions.
// Phase 1: matrix 131 rows 156 cols
[2023-03-19 03:50:14] [INFO ] Computed 56 place invariants in 3 ms
[2023-03-19 03:50:14] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-19 03:50:14] [INFO ] Invariant cache hit.
[2023-03-19 03:50:14] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
[2023-03-19 03:50:14] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 03:50:14] [INFO ] Invariant cache hit.
[2023-03-19 03:50:14] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/158 places, 131/133 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 661 ms. Remains : 156/158 places, 131/133 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-005A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s30 1) (EQ s11 1) (EQ s21 1) (EQ s128 1) (EQ s147 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][true]]
Stuttering criterion allowed to conclude after 407 steps with 0 reset in 5 ms.
FORMULA ShieldPPPs-PT-005A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-005A-LTLFireability-01 finished in 722 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (F(p1)||(X(p3)&&p2))))'
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Applied a total of 0 rules in 7 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
// Phase 1: matrix 133 rows 158 cols
[2023-03-19 03:50:14] [INFO ] Computed 56 place invariants in 6 ms
[2023-03-19 03:50:15] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-03-19 03:50:15] [INFO ] Invariant cache hit.
[2023-03-19 03:50:15] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2023-03-19 03:50:15] [INFO ] Invariant cache hit.
[2023-03-19 03:50:15] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 550 ms. Remains : 158/158 places, 133/133 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : ShieldPPPs-PT-005A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2) p0 (NOT p3)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p2 p0 (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s80 1) (EQ s91 1)), p2:(AND (EQ s98 1) (EQ s117 1)), p0:(AND (EQ s80 1) (EQ s91 1) (EQ s140 1) (EQ s155 1)), p3:(AND (EQ s140 1) (EQ s155 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4032 reset in 373 ms.
Product exploration explored 100000 steps with 4010 reset in 297 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 p2) (NOT p0) (NOT p3)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT p1)), (X (NOT (AND (NOT p1) p2 p0 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))), (X (AND (NOT p1) (NOT p3))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2 p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (X (AND (NOT p1) (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 1120 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (NOT p1)]
Finished random walk after 39 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT p1)), (X (NOT (AND (NOT p1) p2 p0 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))), (X (AND (NOT p1) (NOT p3))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2 p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (X (AND (NOT p1) (NOT p3))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 21 factoid took 1278 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
[2023-03-19 03:50:19] [INFO ] Invariant cache hit.
[2023-03-19 03:50:19] [INFO ] [Real]Absence check using 56 positive place invariants in 24 ms returned sat
[2023-03-19 03:50:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 03:50:19] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2023-03-19 03:50:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 03:50:19] [INFO ] [Nat]Absence check using 56 positive place invariants in 11 ms returned sat
[2023-03-19 03:50:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 03:50:19] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2023-03-19 03:50:19] [INFO ] Computed and/alt/rep : 132/363/132 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-19 03:50:20] [INFO ] Added : 105 causal constraints over 23 iterations in 731 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 158 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 133/133 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 157 transition count 132
Applied a total of 2 rules in 9 ms. Remains 157 /158 variables (removed 1) and now considering 132/133 (removed 1) transitions.
// Phase 1: matrix 132 rows 157 cols
[2023-03-19 03:50:20] [INFO ] Computed 56 place invariants in 12 ms
[2023-03-19 03:50:20] [INFO ] Implicit Places using invariants in 181 ms returned []
[2023-03-19 03:50:20] [INFO ] Invariant cache hit.
[2023-03-19 03:50:21] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 694 ms to find 0 implicit places.
[2023-03-19 03:50:21] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 03:50:21] [INFO ] Invariant cache hit.
[2023-03-19 03:50:21] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 157/158 places, 132/133 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 869 ms. Remains : 157/158 places, 132/133 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 : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p1)]
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 225 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p1)]
[2023-03-19 03:50:22] [INFO ] Invariant cache hit.
[2023-03-19 03:50:22] [INFO ] [Real]Absence check using 56 positive place invariants in 31 ms returned sat
[2023-03-19 03:50:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 03:50:22] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2023-03-19 03:50:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 03:50:22] [INFO ] [Nat]Absence check using 56 positive place invariants in 9 ms returned sat
[2023-03-19 03:50:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 03:50:22] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-19 03:50:22] [INFO ] Computed and/alt/rep : 131/365/131 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-19 03:50:23] [INFO ] Added : 116 causal constraints over 24 iterations in 408 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Product exploration explored 100000 steps with 4049 reset in 229 ms.
Product exploration explored 100000 steps with 4121 reset in 320 ms.
Built C files in :
/tmp/ltsmin13733580856761730659
[2023-03-19 03:50:23] [INFO ] Computing symmetric may disable matrix : 132 transitions.
[2023-03-19 03:50:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:50:23] [INFO ] Computing symmetric may enable matrix : 132 transitions.
[2023-03-19 03:50:23] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:50:23] [INFO ] Computing Do-Not-Accords matrix : 132 transitions.
[2023-03-19 03:50:23] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:50:23] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13733580856761730659
Running compilation step : cd /tmp/ltsmin13733580856761730659;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 393 ms.
Running link step : cd /tmp/ltsmin13733580856761730659;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 78 ms.
Running LTSmin : cd /tmp/ltsmin13733580856761730659;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13648713387756025782.hoa' '--buchi-type=spotba'
LTSmin run took 2344 ms.
FORMULA ShieldPPPs-PT-005A-LTLFireability-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-005A-LTLFireability-02 finished in 11859 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(G(p1)))))'
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Applied a total of 0 rules in 2 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
// Phase 1: matrix 133 rows 158 cols
[2023-03-19 03:50:26] [INFO ] Computed 56 place invariants in 1 ms
[2023-03-19 03:50:27] [INFO ] Implicit Places using invariants in 241 ms returned []
[2023-03-19 03:50:27] [INFO ] Invariant cache hit.
[2023-03-19 03:50:27] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
[2023-03-19 03:50:27] [INFO ] Invariant cache hit.
[2023-03-19 03:50:27] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 729 ms. Remains : 158/158 places, 133/133 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-005A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s68 1) (EQ s85 1)), p1:(AND (OR (EQ s75 0) (EQ s94 0) (AND (EQ s68 1) (EQ s85 1))) (OR (EQ s75 0) (EQ s94 0)) (OR (EQ s68 0) (EQ s85 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 450 reset in 342 ms.
Product exploration explored 100000 steps with 473 reset in 300 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 p0) p1), (X (NOT p0)), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 240 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 72 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 274 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-19 03:50:29] [INFO ] Invariant cache hit.
[2023-03-19 03:50:29] [INFO ] [Real]Absence check using 56 positive place invariants in 56 ms returned sat
[2023-03-19 03:50:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 03:50:29] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2023-03-19 03:50:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 03:50:29] [INFO ] [Nat]Absence check using 56 positive place invariants in 23 ms returned sat
[2023-03-19 03:50:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 03:50:30] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2023-03-19 03:50:30] [INFO ] Computed and/alt/rep : 132/363/132 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-19 03:50:30] [INFO ] Added : 115 causal constraints over 26 iterations in 728 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Applied a total of 0 rules in 4 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2023-03-19 03:50:30] [INFO ] Invariant cache hit.
[2023-03-19 03:50:30] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-03-19 03:50:30] [INFO ] Invariant cache hit.
[2023-03-19 03:50:31] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2023-03-19 03:50:31] [INFO ] Invariant cache hit.
[2023-03-19 03:50:31] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 581 ms. Remains : 158/158 places, 133/133 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) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 228 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 33 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 379 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-19 03:50:32] [INFO ] Invariant cache hit.
[2023-03-19 03:50:32] [INFO ] [Real]Absence check using 56 positive place invariants in 25 ms returned sat
[2023-03-19 03:50:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 03:50:32] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2023-03-19 03:50:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 03:50:32] [INFO ] [Nat]Absence check using 56 positive place invariants in 25 ms returned sat
[2023-03-19 03:50:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 03:50:32] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2023-03-19 03:50:33] [INFO ] Computed and/alt/rep : 132/363/132 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-19 03:50:33] [INFO ] Added : 115 causal constraints over 26 iterations in 832 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 450 reset in 284 ms.
Product exploration explored 100000 steps with 452 reset in 277 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 133/133 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 158 transition count 133
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 18 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2023-03-19 03:50:34] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 133 rows 158 cols
[2023-03-19 03:50:34] [INFO ] Computed 56 place invariants in 1 ms
[2023-03-19 03:50:35] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/158 places, 133/133 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 173 ms. Remains : 158/158 places, 133/133 transitions.
Built C files in :
/tmp/ltsmin13670709689923163248
[2023-03-19 03:50:35] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13670709689923163248
Running compilation step : cd /tmp/ltsmin13670709689923163248;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 224 ms.
Running link step : cd /tmp/ltsmin13670709689923163248;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin13670709689923163248;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2256822088494848862.hoa' '--buchi-type=spotba'
LTSmin run took 1025 ms.
FORMULA ShieldPPPs-PT-005A-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-005A-LTLFireability-03 finished in 9604 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 13 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 156 transition count 131
Applied a total of 4 rules in 27 ms. Remains 156 /158 variables (removed 2) and now considering 131/133 (removed 2) transitions.
// Phase 1: matrix 131 rows 156 cols
[2023-03-19 03:50:36] [INFO ] Computed 56 place invariants in 1 ms
[2023-03-19 03:50:36] [INFO ] Implicit Places using invariants in 196 ms returned []
[2023-03-19 03:50:36] [INFO ] Invariant cache hit.
[2023-03-19 03:50:36] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
[2023-03-19 03:50:36] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 03:50:36] [INFO ] Invariant cache hit.
[2023-03-19 03:50:36] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/158 places, 131/133 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 555 ms. Remains : 156/158 places, 131/133 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-005A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s75 0) (EQ s95 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 273 reset in 267 ms.
Product exploration explored 100000 steps with 272 reset in 276 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 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Finished random walk after 132 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=66 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 233 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 131/131 transitions.
Applied a total of 0 rules in 6 ms. Remains 156 /156 variables (removed 0) and now considering 131/131 (removed 0) transitions.
[2023-03-19 03:50:38] [INFO ] Invariant cache hit.
[2023-03-19 03:50:38] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-19 03:50:38] [INFO ] Invariant cache hit.
[2023-03-19 03:50:38] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
[2023-03-19 03:50:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 03:50:38] [INFO ] Invariant cache hit.
[2023-03-19 03:50:38] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 670 ms. Remains : 156/156 places, 131/131 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Finished random walk after 113 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=113 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 211 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 275 reset in 255 ms.
Product exploration explored 100000 steps with 277 reset in 262 ms.
Built C files in :
/tmp/ltsmin10719571987803779479
[2023-03-19 03:50:39] [INFO ] Computing symmetric may disable matrix : 131 transitions.
[2023-03-19 03:50:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:50:39] [INFO ] Computing symmetric may enable matrix : 131 transitions.
[2023-03-19 03:50:39] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:50:39] [INFO ] Computing Do-Not-Accords matrix : 131 transitions.
[2023-03-19 03:50:39] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:50:39] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10719571987803779479
Running compilation step : cd /tmp/ltsmin10719571987803779479;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 290 ms.
Running link step : cd /tmp/ltsmin10719571987803779479;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin10719571987803779479;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13223913330181694962.hoa' '--buchi-type=spotba'
LTSmin run took 852 ms.
FORMULA ShieldPPPs-PT-005A-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-005A-LTLFireability-04 finished in 4564 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p1 U X(G((p1||F(p2)))))||p0)))'
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Applied a total of 0 rules in 14 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
// Phase 1: matrix 133 rows 158 cols
[2023-03-19 03:50:41] [INFO ] Computed 56 place invariants in 0 ms
[2023-03-19 03:50:41] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-19 03:50:41] [INFO ] Invariant cache hit.
[2023-03-19 03:50:41] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2023-03-19 03:50:41] [INFO ] Invariant cache hit.
[2023-03-19 03:50:41] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 438 ms. Remains : 158/158 places, 133/133 transitions.
Stuttering acceptance computed with spot in 273 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-005A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s8 0) (EQ s29 0)), p1:(AND (EQ s8 1) (EQ s29 1)), p2:(EQ s155 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2754 steps with 11 reset in 7 ms.
FORMULA ShieldPPPs-PT-005A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-005A-LTLFireability-05 finished in 741 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
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 156 transition count 131
Applied a total of 4 rules in 8 ms. Remains 156 /158 variables (removed 2) and now considering 131/133 (removed 2) transitions.
// Phase 1: matrix 131 rows 156 cols
[2023-03-19 03:50:41] [INFO ] Computed 56 place invariants in 1 ms
[2023-03-19 03:50:41] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-19 03:50:41] [INFO ] Invariant cache hit.
[2023-03-19 03:50:42] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2023-03-19 03:50:42] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 03:50:42] [INFO ] Invariant cache hit.
[2023-03-19 03:50:42] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/158 places, 131/133 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 463 ms. Remains : 156/158 places, 131/133 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-005A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(NEQ s94 1), p0:(OR (EQ s49 0) (EQ s60 0) (EQ s94 0))], 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 534 reset in 273 ms.
Product exploration explored 100000 steps with 528 reset in 275 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 p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 260 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 27 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 03:50:43] [INFO ] Invariant cache hit.
[2023-03-19 03:50:43] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 295 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 131/131 transitions.
Applied a total of 0 rules in 3 ms. Remains 156 /156 variables (removed 0) and now considering 131/131 (removed 0) transitions.
[2023-03-19 03:50:43] [INFO ] Invariant cache hit.
[2023-03-19 03:50:43] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-19 03:50:44] [INFO ] Invariant cache hit.
[2023-03-19 03:50:44] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2023-03-19 03:50:44] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 03:50:44] [INFO ] Invariant cache hit.
[2023-03-19 03:50:44] [INFO ] Dead Transitions using invariants and state equation in 283 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 653 ms. Remains : 156/156 places, 131/131 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Finished random walk after 489 steps, including 1 resets, run visited all 1 properties in 5 ms. (steps per millisecond=97 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 240 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 513 reset in 295 ms.
Product exploration explored 100000 steps with 518 reset in 280 ms.
Built C files in :
/tmp/ltsmin13335380851266161022
[2023-03-19 03:50:45] [INFO ] Computing symmetric may disable matrix : 131 transitions.
[2023-03-19 03:50:45] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:50:45] [INFO ] Computing symmetric may enable matrix : 131 transitions.
[2023-03-19 03:50:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:50:45] [INFO ] Computing Do-Not-Accords matrix : 131 transitions.
[2023-03-19 03:50:45] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:50:45] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13335380851266161022
Running compilation step : cd /tmp/ltsmin13335380851266161022;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 254 ms.
Running link step : cd /tmp/ltsmin13335380851266161022;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin13335380851266161022;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10833090564605598265.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 131/131 transitions.
Applied a total of 0 rules in 9 ms. Remains 156 /156 variables (removed 0) and now considering 131/131 (removed 0) transitions.
[2023-03-19 03:51:01] [INFO ] Invariant cache hit.
[2023-03-19 03:51:01] [INFO ] Implicit Places using invariants in 168 ms returned []
[2023-03-19 03:51:01] [INFO ] Invariant cache hit.
[2023-03-19 03:51:01] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2023-03-19 03:51:01] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 03:51:01] [INFO ] Invariant cache hit.
[2023-03-19 03:51:01] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 492 ms. Remains : 156/156 places, 131/131 transitions.
Built C files in :
/tmp/ltsmin610820226317221836
[2023-03-19 03:51:01] [INFO ] Computing symmetric may disable matrix : 131 transitions.
[2023-03-19 03:51:01] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:51:01] [INFO ] Computing symmetric may enable matrix : 131 transitions.
[2023-03-19 03:51:01] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:51:01] [INFO ] Computing Do-Not-Accords matrix : 131 transitions.
[2023-03-19 03:51:01] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:51:01] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin610820226317221836
Running compilation step : cd /tmp/ltsmin610820226317221836;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 332 ms.
Running link step : cd /tmp/ltsmin610820226317221836;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 73 ms.
Running LTSmin : cd /tmp/ltsmin610820226317221836;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1859859482062187361.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 03:51:16] [INFO ] Flatten gal took : 13 ms
[2023-03-19 03:51:16] [INFO ] Flatten gal took : 9 ms
[2023-03-19 03:51:16] [INFO ] Time to serialize gal into /tmp/LTL15752846673954329907.gal : 3 ms
[2023-03-19 03:51:16] [INFO ] Time to serialize properties into /tmp/LTL307485600488659658.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15752846673954329907.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8460910845085204255.hoa' '-atoms' '/tmp/LTL307485600488659658.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL307485600488659658.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8460910845085204255.hoa
Detected timeout of ITS tools.
[2023-03-19 03:51:31] [INFO ] Flatten gal took : 16 ms
[2023-03-19 03:51:31] [INFO ] Flatten gal took : 12 ms
[2023-03-19 03:51:31] [INFO ] Time to serialize gal into /tmp/LTL16054720070143689210.gal : 3 ms
[2023-03-19 03:51:31] [INFO ] Time to serialize properties into /tmp/LTL15497737495871942974.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16054720070143689210.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15497737495871942974.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("((p49==0)||(p60==0))")||(("(p94==0)")||(G("(p94==0)")))))))
Formula 0 simplified : FG(!"((p49==0)||(p60==0))" & !"(p94==0)")
Detected timeout of ITS tools.
[2023-03-19 03:51:47] [INFO ] Flatten gal took : 8 ms
[2023-03-19 03:51:47] [INFO ] Applying decomposition
[2023-03-19 03:51:47] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph131572092913227718.txt' '-o' '/tmp/graph131572092913227718.bin' '-w' '/tmp/graph131572092913227718.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph131572092913227718.bin' '-l' '-1' '-v' '-w' '/tmp/graph131572092913227718.weights' '-q' '0' '-e' '0.001'
[2023-03-19 03:51:47] [INFO ] Decomposing Gal with order
[2023-03-19 03:51:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 03:51:47] [INFO ] Removed a total of 30 redundant transitions.
[2023-03-19 03:51:47] [INFO ] Flatten gal took : 42 ms
[2023-03-19 03:51:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 7 ms.
[2023-03-19 03:51:47] [INFO ] Time to serialize gal into /tmp/LTL5295171924731699826.gal : 23 ms
[2023-03-19 03:51:47] [INFO ] Time to serialize properties into /tmp/LTL139587638071917328.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5295171924731699826.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL139587638071917328.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i5.u18.p49==0)||(i5.u21.p60==0))")||(("(i7.i0.u33.p94==0)")||(G("(i7.i0.u33.p94==0)")))))))
Formula 0 simplified : FG(!"((i5.u18.p49==0)||(i5.u21.p60==0))" & !"(i7.i0.u33.p94==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin362207253948295762
[2023-03-19 03:52:02] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin362207253948295762
Running compilation step : cd /tmp/ltsmin362207253948295762;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 207 ms.
Running link step : cd /tmp/ltsmin362207253948295762;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin362207253948295762;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-005A-LTLFireability-06 finished in 95830 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U (F(p1)||G(p2))))'
Support contains 8 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 156 transition count 131
Applied a total of 4 rules in 18 ms. Remains 156 /158 variables (removed 2) and now considering 131/133 (removed 2) transitions.
[2023-03-19 03:52:17] [INFO ] Invariant cache hit.
[2023-03-19 03:52:17] [INFO ] Implicit Places using invariants in 318 ms returned []
[2023-03-19 03:52:17] [INFO ] Invariant cache hit.
[2023-03-19 03:52:18] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 715 ms to find 0 implicit places.
[2023-03-19 03:52:18] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 03:52:18] [INFO ] Invariant cache hit.
[2023-03-19 03:52:18] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/158 places, 131/133 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 984 ms. Remains : 156/158 places, 131/133 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-005A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s37 1) (EQ s54 1)), p2:(AND (EQ s73 1) (EQ s85 1)), p0:(OR (AND (EQ s13 1) (EQ s32 1)) (AND (EQ s37 1) (EQ s54 1) (EQ s42 1) (EQ s52 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 1043 reset in 238 ms.
Product exploration explored 100000 steps with 1031 reset in 259 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 p2) (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 402 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0))]
Finished random walk after 85 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND p2 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 7 factoid took 502 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0))]
[2023-03-19 03:52:20] [INFO ] Invariant cache hit.
[2023-03-19 03:52:20] [INFO ] [Real]Absence check using 56 positive place invariants in 36 ms returned sat
[2023-03-19 03:52:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 03:52:21] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2023-03-19 03:52:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 03:52:21] [INFO ] [Nat]Absence check using 56 positive place invariants in 10 ms returned sat
[2023-03-19 03:52:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 03:52:21] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2023-03-19 03:52:21] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 16 ms to minimize.
[2023-03-19 03:52:21] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2023-03-19 03:52:21] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 1 ms to minimize.
[2023-03-19 03:52:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 402 ms
[2023-03-19 03:52:21] [INFO ] Computed and/alt/rep : 130/367/130 causal constraints (skipped 0 transitions) in 18 ms.
[2023-03-19 03:52:22] [INFO ] Added : 130 causal constraints over 27 iterations in 696 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 8 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 131/131 transitions.
Applied a total of 0 rules in 3 ms. Remains 156 /156 variables (removed 0) and now considering 131/131 (removed 0) transitions.
[2023-03-19 03:52:22] [INFO ] Invariant cache hit.
[2023-03-19 03:52:22] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-19 03:52:22] [INFO ] Invariant cache hit.
[2023-03-19 03:52:23] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
[2023-03-19 03:52:23] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 03:52:23] [INFO ] Invariant cache hit.
[2023-03-19 03:52:23] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 702 ms. Remains : 156/156 places, 131/131 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 412 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0))]
Finished random walk after 188 steps, including 0 resets, run visited all 3 properties in 7 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p1) p2)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 7 factoid took 427 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0))]
[2023-03-19 03:52:24] [INFO ] Invariant cache hit.
[2023-03-19 03:52:24] [INFO ] [Real]Absence check using 56 positive place invariants in 11 ms returned sat
[2023-03-19 03:52:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 03:52:24] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2023-03-19 03:52:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 03:52:24] [INFO ] [Nat]Absence check using 56 positive place invariants in 21 ms returned sat
[2023-03-19 03:52:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 03:52:24] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2023-03-19 03:52:25] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
[2023-03-19 03:52:25] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2023-03-19 03:52:25] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2023-03-19 03:52:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 220 ms
[2023-03-19 03:52:25] [INFO ] Computed and/alt/rep : 130/367/130 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-19 03:52:25] [INFO ] Added : 130 causal constraints over 27 iterations in 783 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1035 reset in 253 ms.
Product exploration explored 100000 steps with 1022 reset in 244 ms.
Built C files in :
/tmp/ltsmin8726572515759775624
[2023-03-19 03:52:26] [INFO ] Computing symmetric may disable matrix : 131 transitions.
[2023-03-19 03:52:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:52:26] [INFO ] Computing symmetric may enable matrix : 131 transitions.
[2023-03-19 03:52:26] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:52:26] [INFO ] Computing Do-Not-Accords matrix : 131 transitions.
[2023-03-19 03:52:26] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:52:26] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8726572515759775624
Running compilation step : cd /tmp/ltsmin8726572515759775624;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 266 ms.
Running link step : cd /tmp/ltsmin8726572515759775624;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin8726572515759775624;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3749210269581936223.hoa' '--buchi-type=spotba'
LTSmin run took 610 ms.
FORMULA ShieldPPPs-PT-005A-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-005A-LTLFireability-07 finished in 10040 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||G(p1)))&&X(F(p0))))'
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Applied a total of 0 rules in 1 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
// Phase 1: matrix 133 rows 158 cols
[2023-03-19 03:52:27] [INFO ] Computed 56 place invariants in 1 ms
[2023-03-19 03:52:27] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-19 03:52:27] [INFO ] Invariant cache hit.
[2023-03-19 03:52:27] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2023-03-19 03:52:27] [INFO ] Invariant cache hit.
[2023-03-19 03:52:28] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 460 ms. Remains : 158/158 places, 133/133 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-005A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(OR p0 p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s63 0), p1:(OR (EQ s3 0) (EQ s30 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 142 steps with 2 reset in 0 ms.
FORMULA ShieldPPPs-PT-005A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-005A-LTLFireability-08 finished in 685 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)&&(X(X(p1)) U ((!p2&&X(X(p1)))||X(X(G(p1))))))))'
Support contains 5 out of 158 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Applied a total of 0 rules in 1 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2023-03-19 03:52:28] [INFO ] Invariant cache hit.
[2023-03-19 03:52:28] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-19 03:52:28] [INFO ] Invariant cache hit.
[2023-03-19 03:52:28] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
[2023-03-19 03:52:28] [INFO ] Invariant cache hit.
[2023-03-19 03:52:28] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 676 ms. Remains : 158/158 places, 133/133 transitions.
Stuttering acceptance computed with spot in 205 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-005A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s70 0) (EQ s90 0)), p1:(OR (NEQ s21 1) (NOT (AND (EQ s49 1) (EQ s58 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 58 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-005A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-005A-LTLFireability-09 finished in 900 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((X((G(p1) U G(p2)))&&p0))) U G(!p3)))'
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Applied a total of 0 rules in 2 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2023-03-19 03:52:29] [INFO ] Invariant cache hit.
[2023-03-19 03:52:29] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-19 03:52:29] [INFO ] Invariant cache hit.
[2023-03-19 03:52:29] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2023-03-19 03:52:29] [INFO ] Invariant cache hit.
[2023-03-19 03:52:29] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 382 ms. Remains : 158/158 places, 133/133 transitions.
Stuttering acceptance computed with spot in 559 ms :[p3, (OR (NOT p0) (NOT p2)), (OR (AND (NOT p0) p3) (AND (NOT p2) p3)), true, (NOT p2), (AND p2 (NOT p1)), (NOT p2), (AND p3 p0), (OR (AND (NOT p2) (NOT p1) p3 p0) (AND (NOT p2) p1 p3 (NOT p0))), (AND p2 (NOT p1) p3 p0), (AND (NOT p2) p3 p0)]
Running random walk in product with property : ShieldPPPs-PT-005A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 0}, { cond=p3, acceptance={0} source=0 dest: 0}, { cond=p3, acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p3) p0), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(AND p3 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p3 p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p3) p0), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p2 p1), acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 3}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(AND p3 p0), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p3) p0), acceptance={} source=7 dest: 7}], [{ cond=(AND p3 p0 (NOT p2) (NOT p1)), acceptance={} source=8 dest: 3}, { cond=(AND p3 (NOT p0) p1), acceptance={} source=8 dest: 4}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=8 dest: 5}, { cond=(AND p3 p2 (NOT p1)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p3) p0 (NOT p2) (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=8 dest: 9}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=8 dest: 10}], [{ cond=(AND p3 p0 p2 (NOT p1)), acceptance={} source=9 dest: 3}, { cond=(AND p3 p2 p1), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p3) p0 p2 (NOT p1)), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=9 dest: 9}], [{ cond=(AND p3 p0 (NOT p2)), acceptance={} source=10 dest: 3}, { cond=(AND p3 p2), acceptance={} source=10 dest: 6}, { cond=(AND (NOT p3) p0 (NOT p2)), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p3) p2), acceptance={} source=10 dest: 10}]], initial=0, aps=[p3:(AND (EQ s142 1) (EQ s151 1)), p0:(AND (EQ s142 1) (EQ s151 1)), p2:(AND (EQ s73 1) (EQ s83 1)), p1:(AND (EQ s11 1) (EQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5733 steps with 1441 reset in 13 ms.
FORMULA ShieldPPPs-PT-005A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-005A-LTLFireability-10 finished in 994 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&p0)))'
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Applied a total of 0 rules in 1 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2023-03-19 03:52:30] [INFO ] Invariant cache hit.
[2023-03-19 03:52:30] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-19 03:52:30] [INFO ] Invariant cache hit.
[2023-03-19 03:52:30] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2023-03-19 03:52:30] [INFO ] Invariant cache hit.
[2023-03-19 03:52:30] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 428 ms. Remains : 158/158 places, 133/133 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-005A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (EQ s5 0) (EQ s24 0)), p0:(AND (EQ s43 1) (EQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-005A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-005A-LTLFireability-11 finished in 596 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((!p0 U (!p1||G(!p0))))||(F(p2)&&X(p3))))'
Support contains 5 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Applied a total of 0 rules in 1 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2023-03-19 03:52:30] [INFO ] Invariant cache hit.
[2023-03-19 03:52:30] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-19 03:52:30] [INFO ] Invariant cache hit.
[2023-03-19 03:52:31] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2023-03-19 03:52:31] [INFO ] Invariant cache hit.
[2023-03-19 03:52:31] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 544 ms. Remains : 158/158 places, 133/133 transitions.
Stuttering acceptance computed with spot in 303 ms :[(OR (AND p0 p1 (NOT p2)) (AND p0 p1 (NOT p3))), (AND (NOT p2) p1 p0), (AND p1 p0 (NOT p3)), (NOT p2), true, (AND p1 p0)]
Running random walk in product with property : ShieldPPPs-PT-005A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p0 (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 p0), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(OR (EQ s140 0) (EQ s155 0)), p1:(AND (EQ s20 1) (EQ s41 1)), p0:(AND (EQ s140 1) (EQ s155 1)), p3:(EQ s94 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 298 ms.
Product exploration explored 100000 steps with 50000 reset in 301 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0) p3), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND p1 p0 (NOT p3)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p3)))), true, (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X p2)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p1 (NOT p0) (NOT p3))))
Knowledge based reduction with 11 factoid took 223 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-005A-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-005A-LTLFireability-12 finished in 1703 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||G(p1)))&&G((F(p1) U X(!p0)))))'
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Applied a total of 0 rules in 2 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2023-03-19 03:52:32] [INFO ] Invariant cache hit.
[2023-03-19 03:52:32] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-19 03:52:32] [INFO ] Invariant cache hit.
[2023-03-19 03:52:32] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2023-03-19 03:52:32] [INFO ] Invariant cache hit.
[2023-03-19 03:52:32] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 528 ms. Remains : 158/158 places, 133/133 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), false, (AND (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-005A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s36 1) (EQ s55 1)), p1:(AND (EQ s46 1) (EQ s88 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4078 reset in 234 ms.
Product exploration explored 100000 steps with 4092 reset in 315 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 p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 891 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 379 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, (AND (NOT p1) p0), p0, (NOT p1)]
Finished random walk after 65 steps, including 0 resets, run visited all 5 properties in 10 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p1), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 682 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, (AND (NOT p1) p0), p0, (NOT p1)]
Stuttering acceptance computed with spot in 434 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, (AND (NOT p1) p0), p0, (NOT p1)]
[2023-03-19 03:52:36] [INFO ] Invariant cache hit.
[2023-03-19 03:52:36] [INFO ] [Real]Absence check using 56 positive place invariants in 14 ms returned sat
[2023-03-19 03:52:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 03:52:36] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2023-03-19 03:52:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 03:52:37] [INFO ] [Nat]Absence check using 56 positive place invariants in 18 ms returned sat
[2023-03-19 03:52:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 03:52:37] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2023-03-19 03:52:37] [INFO ] Computed and/alt/rep : 132/363/132 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-19 03:52:37] [INFO ] Added : 107 causal constraints over 22 iterations in 672 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 133/133 transitions.
Applied a total of 0 rules in 1 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2023-03-19 03:52:37] [INFO ] Invariant cache hit.
[2023-03-19 03:52:38] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-19 03:52:38] [INFO ] Invariant cache hit.
[2023-03-19 03:52:38] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
[2023-03-19 03:52:38] [INFO ] Invariant cache hit.
[2023-03-19 03:52:38] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 563 ms. Remains : 158/158 places, 133/133 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 p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 479 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 470 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, (AND (NOT p1) p0), p0, (NOT p1)]
Finished random walk after 132 steps, including 0 resets, run visited all 5 properties in 4 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p1), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 1020 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 380 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, (AND (NOT p1) p0), p0, (NOT p1)]
Stuttering acceptance computed with spot in 422 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, (AND (NOT p1) p0), p0, (NOT p1)]
[2023-03-19 03:52:41] [INFO ] Invariant cache hit.
[2023-03-19 03:52:41] [INFO ] [Real]Absence check using 56 positive place invariants in 17 ms returned sat
[2023-03-19 03:52:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 03:52:41] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2023-03-19 03:52:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 03:52:41] [INFO ] [Nat]Absence check using 56 positive place invariants in 11 ms returned sat
[2023-03-19 03:52:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 03:52:41] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2023-03-19 03:52:41] [INFO ] Computed and/alt/rep : 132/363/132 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-19 03:52:42] [INFO ] Added : 107 causal constraints over 22 iterations in 600 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 293 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, (AND (NOT p1) p0), p0, (NOT p1)]
Product exploration explored 100000 steps with 2127 reset in 269 ms.
Product exploration explored 100000 steps with 2147 reset in 280 ms.
Applying partial POR strategy [false, true, false, true, false, true]
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, (AND (NOT p1) p0), p0, (NOT p1)]
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 133/133 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 158 transition count 133
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 6 ms. Remains 158 /158 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2023-03-19 03:52:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 133 rows 158 cols
[2023-03-19 03:52:43] [INFO ] Computed 56 place invariants in 1 ms
[2023-03-19 03:52:43] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/158 places, 133/133 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 179 ms. Remains : 158/158 places, 133/133 transitions.
Built C files in :
/tmp/ltsmin13026410665446174511
[2023-03-19 03:52:43] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13026410665446174511
Running compilation step : cd /tmp/ltsmin13026410665446174511;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 239 ms.
Running link step : cd /tmp/ltsmin13026410665446174511;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin13026410665446174511;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1612627434468720402.hoa' '--buchi-type=spotba'
LTSmin run took 1283 ms.
FORMULA ShieldPPPs-PT-005A-LTLFireability-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-005A-LTLFireability-13 finished in 12923 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((!p0 U p1))))'
Support contains 2 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 133/133 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 156 transition count 131
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 155 transition count 130
Applied a total of 4 rules in 8 ms. Remains 155 /158 variables (removed 3) and now considering 130/133 (removed 3) transitions.
// Phase 1: matrix 130 rows 155 cols
[2023-03-19 03:52:45] [INFO ] Computed 56 place invariants in 0 ms
[2023-03-19 03:52:45] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-19 03:52:45] [INFO ] Invariant cache hit.
[2023-03-19 03:52:45] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
[2023-03-19 03:52:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 03:52:45] [INFO ] Invariant cache hit.
[2023-03-19 03:52:45] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 155/158 places, 130/133 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 561 ms. Remains : 155/158 places, 130/133 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-005A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s149 1), p0:(OR (EQ s52 1) (EQ s149 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 11837 steps with 1294 reset in 25 ms.
FORMULA ShieldPPPs-PT-005A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-005A-LTLFireability-14 finished in 682 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
[2023-03-19 03:52:46] [INFO ] Flatten gal took : 8 ms
Using solver Z3 to compute partial order matrices.
[2023-03-19 03:52:46] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin14213329682217146821
[2023-03-19 03:52:46] [INFO ] Computing symmetric may disable matrix : 133 transitions.
[2023-03-19 03:52:46] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:52:46] [INFO ] Computing symmetric may enable matrix : 133 transitions.
[2023-03-19 03:52:46] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:52:46] [INFO ] Computing Do-Not-Accords matrix : 133 transitions.
[2023-03-19 03:52:46] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:52:46] [INFO ] Flatten gal took : 12 ms
[2023-03-19 03:52:46] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14213329682217146821
Running compilation step : cd /tmp/ltsmin14213329682217146821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4709316684912155462.txt' '-o' '/tmp/graph4709316684912155462.bin' '-w' '/tmp/graph4709316684912155462.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4709316684912155462.bin' '-l' '-1' '-v' '-w' '/tmp/graph4709316684912155462.weights' '-q' '0' '-e' '0.001'
[2023-03-19 03:52:46] [INFO ] Decomposing Gal with order
[2023-03-19 03:52:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 03:52:46] [INFO ] Removed a total of 30 redundant transitions.
[2023-03-19 03:52:46] [INFO ] Flatten gal took : 46 ms
[2023-03-19 03:52:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 7 ms.
[2023-03-19 03:52:46] [INFO ] Time to serialize gal into /tmp/LTLFireability16048940395837369094.gal : 3 ms
[2023-03-19 03:52:46] [INFO ] Time to serialize properties into /tmp/LTLFireability1246023790489181379.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16048940395837369094.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1246023790489181379.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i4.u18.p49==0)||(i4.u21.p60==0))")||(("(i8.i1.u33.p94==0)")||(G("(i8.i1.u33.p94!=1)")))))))
Formula 0 simplified : G(F!"(i8.i1.u33.p94!=1)" & FG(!"((i4.u18.p49==0)||(i4.u21.p60==0))" & !"(i8.i1.u33.p94==0)"))
Compilation finished in 311 ms.
Running link step : cd /tmp/ltsmin14213329682217146821;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin14213329682217146821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: Initializing POR dependencies: labels 135, guards 133
pins2lts-mc-linux64( 2/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.022: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.022: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.031: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.031: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.032: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.103: LTL layer: formula: [](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))
pins2lts-mc-linux64( 6/ 8), 0.103: "[](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.103: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.198: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.220: There are 136 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.220: State length is 159, there are 139 groups
pins2lts-mc-linux64( 0/ 8), 0.220: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.220: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.220: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.220: Visible groups: 0 / 139, labels: 2 / 136
pins2lts-mc-linux64( 0/ 8), 0.220: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.220: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.263: [Blue] ~97 levels ~960 states ~2800 transitions
pins2lts-mc-linux64( 3/ 8), 0.358: [Blue] ~163 levels ~1920 states ~5064 transitions
pins2lts-mc-linux64( 3/ 8), 0.403: [Blue] ~163 levels ~3840 states ~7128 transitions
pins2lts-mc-linux64( 3/ 8), 0.534: [Blue] ~169 levels ~7680 states ~11920 transitions
pins2lts-mc-linux64( 1/ 8), 0.708: [Blue] ~162 levels ~15360 states ~21544 transitions
pins2lts-mc-linux64( 4/ 8), 1.079: [Blue] ~340 levels ~30720 states ~66816 transitions
pins2lts-mc-linux64( 4/ 8), 1.428: [Blue] ~344 levels ~61440 states ~135120 transitions
pins2lts-mc-linux64( 4/ 8), 1.911: [Blue] ~344 levels ~122880 states ~271288 transitions
pins2lts-mc-linux64( 5/ 8), 2.803: [Blue] ~381 levels ~245760 states ~705936 transitions
pins2lts-mc-linux64( 5/ 8), 4.118: [Blue] ~394 levels ~491520 states ~1356864 transitions
pins2lts-mc-linux64( 7/ 8), 6.356: [Blue] ~460 levels ~983040 states ~2262328 transitions
pins2lts-mc-linux64( 5/ 8), 10.210: [Blue] ~1575 levels ~1966080 states ~5160648 transitions
pins2lts-mc-linux64( 5/ 8), 17.791: [Blue] ~3391 levels ~3932160 states ~10162328 transitions
pins2lts-mc-linux64( 7/ 8), 33.384: [Blue] ~460 levels ~7864320 states ~18882816 transitions
pins2lts-mc-linux64( 7/ 8), 63.693: [Blue] ~460 levels ~15728640 states ~37435504 transitions
pins2lts-mc-linux64( 7/ 8), 123.739: [Blue] ~460 levels ~31457280 states ~74240616 transitions
pins2lts-mc-linux64( 7/ 8), 248.410: [Blue] ~480 levels ~62914560 states ~151634752 transitions
pins2lts-mc-linux64( 7/ 8), 519.277: [Blue] ~480 levels ~125829120 states ~319470656 transitions
pins2lts-mc-linux64( 3/ 8), 727.728: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 727.772:
pins2lts-mc-linux64( 0/ 8), 727.772: Explored 134092789 states 382456209 transitions, fanout: 2.852
pins2lts-mc-linux64( 0/ 8), 727.772: Total exploration time 727.530 sec (727.490 sec minimum, 727.515 sec on average)
pins2lts-mc-linux64( 0/ 8), 727.772: States per second: 184312, Transitions per second: 525691
pins2lts-mc-linux64( 0/ 8), 727.772:
pins2lts-mc-linux64( 0/ 8), 727.772: State space has 134217340 states, 26787798 are accepting
pins2lts-mc-linux64( 0/ 8), 727.772: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 727.772: blue states: 134092789 (99.91%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 727.772: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 727.772: all-red states: 26787798 (19.96%), bogus 24 (0.00%)
pins2lts-mc-linux64( 0/ 8), 727.772:
pins2lts-mc-linux64( 0/ 8), 727.772: Total memory used for local state coloring: 22.5MB
pins2lts-mc-linux64( 0/ 8), 727.772:
pins2lts-mc-linux64( 0/ 8), 727.772: Queue width: 8B, total height: 1476343, memory: 11.26MB
pins2lts-mc-linux64( 0/ 8), 727.772: Tree memory: 1221.2MB, 9.5 B/state, compr.: 1.5%
pins2lts-mc-linux64( 0/ 8), 727.772: Tree fill ratio (roots/leafs): 99.0%/77.0%
pins2lts-mc-linux64( 0/ 8), 727.772: Stored 133 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 727.772: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 727.772: Est. total memory use: 1232.4MB (~1035.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14213329682217146821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14213329682217146821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t9, t10, t11, t18, t19, t20, t27, t28, t29, t36, t37, i0.i1.t131, i0.i1.t132, i0....944
Computing Next relation with stutter on 1.73169e+07 deadlock states
Detected timeout of ITS tools.
[2023-03-19 04:13:38] [INFO ] Applying decomposition
[2023-03-19 04:13:38] [INFO ] Flatten gal took : 23 ms
[2023-03-19 04:13:38] [INFO ] Decomposing Gal with order
[2023-03-19 04:13:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 04:13:38] [INFO ] Removed a total of 45 redundant transitions.
[2023-03-19 04:13:38] [INFO ] Flatten gal took : 25 ms
[2023-03-19 04:13:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 3 ms.
[2023-03-19 04:13:38] [INFO ] Time to serialize gal into /tmp/LTLFireability9186619599390012414.gal : 2 ms
[2023-03-19 04:13:38] [INFO ] Time to serialize properties into /tmp/LTLFireability14615310724867807295.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9186619599390012414.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14615310724867807295.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i12.u25.p49==0)||(u28.p60==0))")||(("(u43.p94==0)")||(G("(u43.p94!=1)")))))))
Formula 0 simplified : G(F!"(u43.p94!=1)" & FG(!"((i12.u25.p49==0)||(u28.p60==0))" & !"(u43.p94==0)"))
Reverse transition relation is NOT exact ! Due to transitions t60, t61, t62, t63, t69, t70, t73, t74, t77, t79, t86, t87, t88, t89, t92, t93, t99, t100, t1...725
Computing Next relation with stutter on 1.73169e+07 deadlock states
Detected timeout of ITS tools.
[2023-03-19 04:34:30] [INFO ] Flatten gal took : 20 ms
[2023-03-19 04:34:30] [INFO ] Input system was already deterministic with 133 transitions.
[2023-03-19 04:34:30] [INFO ] Transformed 158 places.
[2023-03-19 04:34:30] [INFO ] Transformed 133 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-19 04:34:30] [INFO ] Time to serialize gal into /tmp/LTLFireability6995343122550019800.gal : 2 ms
[2023-03-19 04:34:30] [INFO ] Time to serialize properties into /tmp/LTLFireability8793010161058318996.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6995343122550019800.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8793010161058318996.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("((p49==0)||(p60==0))")||(("(p94==0)")||(G("(p94!=1)")))))))
Formula 0 simplified : G(F!"(p94!=1)" & FG(!"((p49==0)||(p60==0))" & !"(p94==0)"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 160808 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16095016 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-005A"
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-5348"
echo " Executing tool itstools"
echo " Input is ShieldPPPs-PT-005A, 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 r389-oct2-167903713500420"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-005A.tgz
mv ShieldPPPs-PT-005A 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 '
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 ;