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-167903713600452.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-020A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713600452
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 5.5K Feb 26 02:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 02:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 02:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 02:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 9.0K Feb 26 02:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 02:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 02:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 26 02:14 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 176K 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-020A-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-020A-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-020A-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-020A-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-020A-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-020A-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-020A-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-020A-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-020A-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-020A-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-020A-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-020A-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-020A-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-020A-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-020A-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-020A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679201711443

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-020A
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-19 04:55:14] [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 04:55:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 04:55:14] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2023-03-19 04:55:14] [INFO ] Transformed 623 places.
[2023-03-19 04:55:14] [INFO ] Transformed 523 transitions.
[2023-03-19 04:55:14] [INFO ] Found NUPN structural information;
[2023-03-19 04:55:14] [INFO ] Parsed PT model containing 623 places and 523 transitions and 2006 arcs in 168 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldPPPs-PT-020A-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-020A-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 69 out of 623 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 523/523 transitions.
Applied a total of 0 rules in 76 ms. Remains 623 /623 variables (removed 0) and now considering 523/523 (removed 0) transitions.
// Phase 1: matrix 523 rows 623 cols
[2023-03-19 04:55:14] [INFO ] Computed 221 place invariants in 37 ms
[2023-03-19 04:55:17] [INFO ] Implicit Places using invariants in 2416 ms returned []
[2023-03-19 04:55:17] [INFO ] Invariant cache hit.
[2023-03-19 04:55:18] [INFO ] Implicit Places using invariants and state equation in 1382 ms returned []
Implicit Place search using SMT with State Equation took 3842 ms to find 0 implicit places.
[2023-03-19 04:55:18] [INFO ] Invariant cache hit.
[2023-03-19 04:55:19] [INFO ] Dead Transitions using invariants and state equation in 536 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4457 ms. Remains : 623/623 places, 523/523 transitions.
Support contains 69 out of 623 places after structural reductions.
[2023-03-19 04:55:19] [INFO ] Flatten gal took : 94 ms
[2023-03-19 04:55:19] [INFO ] Flatten gal took : 39 ms
[2023-03-19 04:55:19] [INFO ] Input system was already deterministic with 523 transitions.
Support contains 67 out of 623 places (down from 69) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 34) seen :33
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 04:55:20] [INFO ] Invariant cache hit.
[2023-03-19 04:55:20] [INFO ] [Real]Absence check using 221 positive place invariants in 162 ms returned sat
[2023-03-19 04:55:20] [INFO ] After 681ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 04:55:21] [INFO ] [Nat]Absence check using 221 positive place invariants in 33 ms returned sat
[2023-03-19 04:55:21] [INFO ] After 302ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 04:55:21] [INFO ] After 351ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-19 04:55:21] [INFO ] After 768ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 523/523 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 621 transition count 521
Partial Free-agglomeration rule applied 175 times.
Drop transitions removed 175 transitions
Iterating global reduction 0 with 175 rules applied. Total rules applied 179 place count 621 transition count 521
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 180 place count 620 transition count 520
Applied a total of 180 rules in 125 ms. Remains 620 /623 variables (removed 3) and now considering 520/523 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 620/623 places, 520/523 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Finished probabilistic random walk after 30390 steps, run visited all 1 properties in 202 ms. (steps per millisecond=150 )
Probabilistic random walk after 30390 steps, saw 29620 distinct states, run finished after 202 ms. (steps per millisecond=150 ) properties seen :1
FORMULA ShieldPPPs-PT-020A-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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((F(p0)&&F(p1))))'
Support contains 5 out of 623 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 523/523 transitions.
Applied a total of 0 rules in 28 ms. Remains 623 /623 variables (removed 0) and now considering 523/523 (removed 0) transitions.
[2023-03-19 04:55:22] [INFO ] Invariant cache hit.
[2023-03-19 04:55:23] [INFO ] Implicit Places using invariants in 821 ms returned []
[2023-03-19 04:55:23] [INFO ] Invariant cache hit.
[2023-03-19 04:55:24] [INFO ] Implicit Places using invariants and state equation in 783 ms returned []
Implicit Place search using SMT with State Equation took 1613 ms to find 0 implicit places.
[2023-03-19 04:55:24] [INFO ] Invariant cache hit.
[2023-03-19 04:55:24] [INFO ] Dead Transitions using invariants and state equation in 459 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2113 ms. Remains : 623/623 places, 523/523 transitions.
Stuttering acceptance computed with spot in 396 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-020A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s42 1) (EQ s54 1)), p0:(AND (NEQ s338 1) (OR (NEQ s190 1) (NEQ s211 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 12894 steps with 10 reset in 186 ms.
FORMULA ShieldPPPs-PT-020A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-020A-LTLFireability-01 finished in 2863 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 623 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 623/623 places, 523/523 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 621 transition count 521
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 620 transition count 520
Applied a total of 4 rules in 77 ms. Remains 620 /623 variables (removed 3) and now considering 520/523 (removed 3) transitions.
// Phase 1: matrix 520 rows 620 cols
[2023-03-19 04:55:25] [INFO ] Computed 221 place invariants in 3 ms
[2023-03-19 04:55:25] [INFO ] Implicit Places using invariants in 358 ms returned []
[2023-03-19 04:55:25] [INFO ] Invariant cache hit.
[2023-03-19 04:55:26] [INFO ] Implicit Places using invariants and state equation in 1024 ms returned []
Implicit Place search using SMT with State Equation took 1409 ms to find 0 implicit places.
[2023-03-19 04:55:26] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-19 04:55:27] [INFO ] Invariant cache hit.
[2023-03-19 04:55:27] [INFO ] Dead Transitions using invariants and state equation in 474 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 620/623 places, 520/523 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1997 ms. Remains : 620/623 places, 520/523 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-020A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s74 1) (EQ s93 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1344 steps with 0 reset in 25 ms.
FORMULA ShieldPPPs-PT-020A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-020A-LTLFireability-02 finished in 2092 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||F(p1)) U G((p2||F(p0))))))'
Support contains 5 out of 623 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 523/523 transitions.
Applied a total of 0 rules in 14 ms. Remains 623 /623 variables (removed 0) and now considering 523/523 (removed 0) transitions.
// Phase 1: matrix 523 rows 623 cols
[2023-03-19 04:55:27] [INFO ] Computed 221 place invariants in 4 ms
[2023-03-19 04:55:28] [INFO ] Implicit Places using invariants in 414 ms returned []
[2023-03-19 04:55:28] [INFO ] Invariant cache hit.
[2023-03-19 04:55:28] [INFO ] Implicit Places using invariants and state equation in 734 ms returned []
Implicit Place search using SMT with State Equation took 1165 ms to find 0 implicit places.
[2023-03-19 04:55:28] [INFO ] Invariant cache hit.
[2023-03-19 04:55:29] [INFO ] Dead Transitions using invariants and state equation in 583 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1770 ms. Remains : 623/623 places, 523/523 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-020A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s596 1) (EQ s598 1)), p0:(AND (EQ s104 1) (EQ s114 1)), p1:(EQ s331 1)], 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 213 reset in 628 ms.
Product exploration explored 100000 steps with 211 reset in 682 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 p2) (NOT p0) (NOT p1)), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (AND (NOT p2) (NOT p0))), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 576 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 340 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Finished random walk after 488 steps, including 0 resets, run visited all 4 properties in 9 ms. (steps per millisecond=54 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (AND (NOT p2) (NOT p0))), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2)), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2))))]
Knowledge based reduction with 8 factoid took 717 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 327 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 335 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
[2023-03-19 04:55:33] [INFO ] Invariant cache hit.
[2023-03-19 04:55:33] [INFO ] [Real]Absence check using 221 positive place invariants in 105 ms returned sat
[2023-03-19 04:55:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 04:55:34] [INFO ] [Real]Absence check using state equation in 836 ms returned sat
[2023-03-19 04:55:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 04:55:35] [INFO ] [Nat]Absence check using 221 positive place invariants in 87 ms returned sat
[2023-03-19 04:55:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 04:55:36] [INFO ] [Nat]Absence check using state equation in 909 ms returned sat
[2023-03-19 04:55:36] [INFO ] Computed and/alt/rep : 522/1443/522 causal constraints (skipped 0 transitions) in 50 ms.
[2023-03-19 04:55:49] [INFO ] Added : 498 causal constraints over 103 iterations in 13500 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p2))
[2023-03-19 04:55:49] [INFO ] Invariant cache hit.
[2023-03-19 04:55:50] [INFO ] [Real]Absence check using 221 positive place invariants in 99 ms returned sat
[2023-03-19 04:55:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 04:55:51] [INFO ] [Real]Absence check using state equation in 1359 ms returned sat
[2023-03-19 04:55:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 04:55:52] [INFO ] [Nat]Absence check using 221 positive place invariants in 71 ms returned sat
[2023-03-19 04:55:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 04:55:52] [INFO ] [Nat]Absence check using state equation in 746 ms returned sat
[2023-03-19 04:55:52] [INFO ] Computed and/alt/rep : 522/1443/522 causal constraints (skipped 0 transitions) in 52 ms.
[2023-03-19 04:56:06] [INFO ] Added : 489 causal constraints over 100 iterations in 13792 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 5 out of 623 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 523/523 transitions.
Applied a total of 0 rules in 9 ms. Remains 623 /623 variables (removed 0) and now considering 523/523 (removed 0) transitions.
[2023-03-19 04:56:06] [INFO ] Invariant cache hit.
[2023-03-19 04:56:07] [INFO ] Implicit Places using invariants in 332 ms returned []
[2023-03-19 04:56:07] [INFO ] Invariant cache hit.
[2023-03-19 04:56:07] [INFO ] Implicit Places using invariants and state equation in 735 ms returned []
Implicit Place search using SMT with State Equation took 1069 ms to find 0 implicit places.
[2023-03-19 04:56:07] [INFO ] Invariant cache hit.
[2023-03-19 04:56:08] [INFO ] Dead Transitions using invariants and state equation in 552 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1631 ms. Remains : 623/623 places, 523/523 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 p2) (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p1) (NOT p0))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (AND (NOT p0) (NOT p2))), true, (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 473 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Finished random walk after 429 steps, including 0 resets, run visited all 4 properties in 19 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p1) (NOT p0))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (AND (NOT p0) (NOT p2))), true, (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2)), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2))))]
Knowledge based reduction with 10 factoid took 712 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 229 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
[2023-03-19 04:56:10] [INFO ] Invariant cache hit.
[2023-03-19 04:56:10] [INFO ] [Real]Absence check using 221 positive place invariants in 97 ms returned sat
[2023-03-19 04:56:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 04:56:11] [INFO ] [Real]Absence check using state equation in 869 ms returned sat
[2023-03-19 04:56:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 04:56:12] [INFO ] [Nat]Absence check using 221 positive place invariants in 129 ms returned sat
[2023-03-19 04:56:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 04:56:13] [INFO ] [Nat]Absence check using state equation in 1520 ms returned sat
[2023-03-19 04:56:13] [INFO ] Computed and/alt/rep : 522/1443/522 causal constraints (skipped 0 transitions) in 40 ms.
[2023-03-19 04:56:26] [INFO ] Added : 498 causal constraints over 103 iterations in 12875 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p2))
[2023-03-19 04:56:26] [INFO ] Invariant cache hit.
[2023-03-19 04:56:27] [INFO ] [Real]Absence check using 221 positive place invariants in 82 ms returned sat
[2023-03-19 04:56:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 04:56:28] [INFO ] [Real]Absence check using state equation in 1123 ms returned sat
[2023-03-19 04:56:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 04:56:29] [INFO ] [Nat]Absence check using 221 positive place invariants in 111 ms returned sat
[2023-03-19 04:56:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 04:56:30] [INFO ] [Nat]Absence check using state equation in 891 ms returned sat
[2023-03-19 04:56:30] [INFO ] Computed and/alt/rep : 522/1443/522 causal constraints (skipped 0 transitions) in 46 ms.
[2023-03-19 04:56:43] [INFO ] Added : 489 causal constraints over 100 iterations in 13445 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 400 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering criterion allowed to conclude after 24879 steps with 49 reset in 209 ms.
FORMULA ShieldPPPs-PT-020A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-020A-LTLFireability-03 finished in 76549 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(!p0)) U ((X(X(!p0))&&G((p1&&F(p2))))||X(X(G(!p0))))))'
Support contains 7 out of 623 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 523/523 transitions.
Applied a total of 0 rules in 8 ms. Remains 623 /623 variables (removed 0) and now considering 523/523 (removed 0) transitions.
[2023-03-19 04:56:44] [INFO ] Invariant cache hit.
[2023-03-19 04:56:44] [INFO ] Implicit Places using invariants in 557 ms returned []
[2023-03-19 04:56:44] [INFO ] Invariant cache hit.
[2023-03-19 04:56:45] [INFO ] Implicit Places using invariants and state equation in 927 ms returned []
Implicit Place search using SMT with State Equation took 1511 ms to find 0 implicit places.
[2023-03-19 04:56:45] [INFO ] Invariant cache hit.
[2023-03-19 04:56:46] [INFO ] Dead Transitions using invariants and state equation in 572 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2105 ms. Remains : 623/623 places, 523/523 transitions.
Stuttering acceptance computed with spot in 770 ms :[p0, p0, p0, (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), true, (AND (NOT p2) p0), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ShieldPPPs-PT-020A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 7}], [{ cond=true, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p1 p0), acceptance={1} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={1} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 6}], [{ cond=(NOT p2), acceptance={} source=5 dest: 8}], [{ cond=(NOT p1), acceptance={} source=6 dest: 1}, { cond=p1, acceptance={} source=6 dest: 9}], [{ cond=true, acceptance={0, 1} source=7 dest: 7}], [{ cond=(AND (NOT p2) p0), acceptance={} source=8 dest: 10}], [{ cond=(AND (NOT p1) p0), acceptance={} source=9 dest: 7}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=9 dest: 10}, { cond=(AND p1 p0), acceptance={} source=9 dest: 11}], [{ cond=(NOT p2), acceptance={0, 1} source=10 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=11 dest: 7}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=11 dest: 10}, { cond=(AND p1 (NOT p0)), acceptance={} source=11 dest: 11}]], initial=2, aps=[p0:(AND (EQ s287 1) (EQ s307 1)), p1:(OR (AND (EQ s109 1) (EQ s126 1)) (EQ s270 1)), p2:(AND (EQ s376 1) (EQ s397 1) (EQ s109 1) (EQ s126 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25089 reset in 836 ms.
Product exploration explored 100000 steps with 24889 reset in 811 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) (NOT p2)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p1 p0))), true, (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 3834 ms. Reduced automaton from 12 states, 30 edges and 3 AP (stutter sensitive) to 12 states, 30 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 968 ms :[p0, p0, p0, (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), true, (AND (NOT p2) p0), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Finished random walk after 2132 steps, including 1 resets, run visited all 12 properties in 74 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p1 p0))), true, (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(F p2), (F (AND (NOT p2) p0)), (F p1), (F (AND (NOT p0) p1)), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND p0 p1)), (F p0), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p2) p0 p1))]
Knowledge based reduction with 21 factoid took 2308 ms. Reduced automaton from 12 states, 30 edges and 3 AP (stutter sensitive) to 12 states, 30 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 969 ms :[p0, p0, p0, (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), true, (AND (NOT p2) p0), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 1020 ms :[p0, p0, p0, (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), true, (AND (NOT p2) p0), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Support contains 7 out of 623 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 523/523 transitions.
Applied a total of 0 rules in 31 ms. Remains 623 /623 variables (removed 0) and now considering 523/523 (removed 0) transitions.
[2023-03-19 04:56:58] [INFO ] Invariant cache hit.
[2023-03-19 04:56:59] [INFO ] Implicit Places using invariants in 1122 ms returned []
[2023-03-19 04:56:59] [INFO ] Invariant cache hit.
[2023-03-19 04:57:00] [INFO ] Implicit Places using invariants and state equation in 899 ms returned []
Implicit Place search using SMT with State Equation took 2057 ms to find 0 implicit places.
[2023-03-19 04:57:00] [INFO ] Invariant cache hit.
[2023-03-19 04:57:00] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2538 ms. Remains : 623/623 places, 523/523 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) (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p2)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p2) p1)))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 1417 ms. Reduced automaton from 12 states, 30 edges and 3 AP (stutter sensitive) to 12 states, 30 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 943 ms :[p0, p0, p0, (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), true, (AND (NOT p2) p0), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Finished random walk after 8952 steps, including 6 resets, run visited all 12 properties in 216 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p2)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p2) p1)))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F p2), (F (AND (NOT p2) p0)), (F p1), (F (AND (NOT p0) p1)), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND p0 p1)), (F p0), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p2) p0 p1))]
Knowledge based reduction with 21 factoid took 2425 ms. Reduced automaton from 12 states, 30 edges and 3 AP (stutter sensitive) to 12 states, 30 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 793 ms :[p0, p0, p0, (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), true, (AND (NOT p2) p0), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 917 ms :[p0, p0, p0, (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), true, (AND (NOT p2) p0), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 877 ms :[p0, p0, p0, (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), true, (AND (NOT p2) p0), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Product exploration explored 100000 steps with 25089 reset in 774 ms.
Product exploration explored 100000 steps with 25023 reset in 810 ms.
Applying partial POR strategy [false, true, false, false, false, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 760 ms :[p0, p0, p0, (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), true, (AND (NOT p2) p0), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Support contains 7 out of 623 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 623/623 places, 523/523 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 623 transition count 523
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 79 ms. Remains 623 /623 variables (removed 0) and now considering 523/523 (removed 0) transitions.
[2023-03-19 04:57:10] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 523 rows 623 cols
[2023-03-19 04:57:10] [INFO ] Computed 221 place invariants in 2 ms
[2023-03-19 04:57:11] [INFO ] Dead Transitions using invariants and state equation in 477 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 623/623 places, 523/523 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 586 ms. Remains : 623/623 places, 523/523 transitions.
Built C files in :
/tmp/ltsmin6226652758957196368
[2023-03-19 04:57:11] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6226652758957196368
Running compilation step : cd /tmp/ltsmin6226652758957196368;'/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 1035 ms.
Running link step : cd /tmp/ltsmin6226652758957196368;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 152 ms.
Running LTSmin : cd /tmp/ltsmin6226652758957196368;'/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/stateBased12713425667582651596.hoa' '--buchi-type=spotba'
LTSmin run took 1548 ms.
FORMULA ShieldPPPs-PT-020A-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-020A-LTLFireability-04 finished in 30093 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||X((X(F(p2))||p1))))))'
Support contains 2 out of 623 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 523/523 transitions.
Applied a total of 0 rules in 29 ms. Remains 623 /623 variables (removed 0) and now considering 523/523 (removed 0) transitions.
// Phase 1: matrix 523 rows 623 cols
[2023-03-19 04:57:14] [INFO ] Computed 221 place invariants in 3 ms
[2023-03-19 04:57:14] [INFO ] Implicit Places using invariants in 518 ms returned []
[2023-03-19 04:57:14] [INFO ] Invariant cache hit.
[2023-03-19 04:57:15] [INFO ] Implicit Places using invariants and state equation in 885 ms returned []
Implicit Place search using SMT with State Equation took 1405 ms to find 0 implicit places.
[2023-03-19 04:57:15] [INFO ] Invariant cache hit.
[2023-03-19 04:57:16] [INFO ] Dead Transitions using invariants and state equation in 501 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1936 ms. Remains : 623/623 places, 523/523 transitions.
Stuttering acceptance computed with spot in 337 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-020A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=3, aps=[p0:(AND (EQ s132 1) (EQ s153 1)), p1:(OR (EQ s132 0) (EQ s153 0)), p2:(OR (EQ s132 0) (EQ s153 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 741 ms.
Product exploration explored 100000 steps with 25000 reset in 686 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 p2), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 5 states, 5 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 356 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 871 steps, including 0 resets, run visited all 2 properties in 45 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 2 factoid took 205 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 337 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 404 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 2 out of 623 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 523/523 transitions.
Applied a total of 0 rules in 32 ms. Remains 623 /623 variables (removed 0) and now considering 523/523 (removed 0) transitions.
[2023-03-19 04:57:19] [INFO ] Invariant cache hit.
[2023-03-19 04:57:20] [INFO ] Implicit Places using invariants in 613 ms returned []
[2023-03-19 04:57:20] [INFO ] Invariant cache hit.
[2023-03-19 04:57:20] [INFO ] Implicit Places using invariants and state equation in 866 ms returned []
Implicit Place search using SMT with State Equation took 1493 ms to find 0 implicit places.
[2023-03-19 04:57:20] [INFO ] Invariant cache hit.
[2023-03-19 04:57:21] [INFO ] Dead Transitions using invariants and state equation in 314 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1851 ms. Remains : 623/623 places, 523/523 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 p1 p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 760 steps, including 0 resets, run visited all 2 properties in 15 ms. (steps per millisecond=50 )
Knowledge obtained : [(AND p1 p2), true]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 2 factoid took 146 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 25000 reset in 711 ms.
Product exploration explored 100000 steps with 25000 reset in 697 ms.
Applying partial POR strategy [false, true, false, false, false]
Stuttering acceptance computed with spot in 353 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 2 out of 623 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 623/623 places, 523/523 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 2 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 623 transition count 523
Deduced a syphon composed of 2 places in 2 ms
Applied a total of 2 rules in 72 ms. Remains 623 /623 variables (removed 0) and now considering 523/523 (removed 0) transitions.
[2023-03-19 04:57:24] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 523 rows 623 cols
[2023-03-19 04:57:24] [INFO ] Computed 221 place invariants in 4 ms
[2023-03-19 04:57:25] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 623/623 places, 523/523 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 573 ms. Remains : 623/623 places, 523/523 transitions.
Built C files in :
/tmp/ltsmin13137687128374194091
[2023-03-19 04:57:25] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13137687128374194091
Running compilation step : cd /tmp/ltsmin13137687128374194091;'/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 954 ms.
Running link step : cd /tmp/ltsmin13137687128374194091;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin13137687128374194091;'/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/stateBased9862934553894475645.hoa' '--buchi-type=spotba'
LTSmin run took 433 ms.
FORMULA ShieldPPPs-PT-020A-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-020A-LTLFireability-05 finished in 12339 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(((p1 U (p2||X(p3)))&&p0))))'
Support contains 8 out of 623 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 523/523 transitions.
Applied a total of 0 rules in 12 ms. Remains 623 /623 variables (removed 0) and now considering 523/523 (removed 0) transitions.
// Phase 1: matrix 523 rows 623 cols
[2023-03-19 04:57:26] [INFO ] Computed 221 place invariants in 2 ms
[2023-03-19 04:57:27] [INFO ] Implicit Places using invariants in 500 ms returned []
[2023-03-19 04:57:27] [INFO ] Invariant cache hit.
[2023-03-19 04:57:27] [INFO ] Implicit Places using invariants and state equation in 814 ms returned []
Implicit Place search using SMT with State Equation took 1328 ms to find 0 implicit places.
[2023-03-19 04:57:27] [INFO ] Invariant cache hit.
[2023-03-19 04:57:28] [INFO ] Dead Transitions using invariants and state equation in 545 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1899 ms. Remains : 623/623 places, 523/523 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : ShieldPPPs-PT-020A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=0 dest: 2}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0 p1 (NOT p3)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s264 1) (EQ s281 1)), p2:(AND (EQ s259 1) (EQ s269 1)), p1:(AND (EQ s256 1) (EQ s277 1)), p3:(AND (EQ s597 1) (EQ s618 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1406 steps with 0 reset in 21 ms.
FORMULA ShieldPPPs-PT-020A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-020A-LTLFireability-07 finished in 2107 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((G(p0)||(!p1 U (p2||G(!p1))))))'
Support contains 8 out of 623 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 623/623 places, 523/523 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 621 transition count 521
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 620 transition count 520
Applied a total of 4 rules in 80 ms. Remains 620 /623 variables (removed 3) and now considering 520/523 (removed 3) transitions.
// Phase 1: matrix 520 rows 620 cols
[2023-03-19 04:57:28] [INFO ] Computed 221 place invariants in 4 ms
[2023-03-19 04:57:29] [INFO ] Implicit Places using invariants in 439 ms returned []
[2023-03-19 04:57:29] [INFO ] Invariant cache hit.
[2023-03-19 04:57:30] [INFO ] Implicit Places using invariants and state equation in 803 ms returned []
Implicit Place search using SMT with State Equation took 1245 ms to find 0 implicit places.
[2023-03-19 04:57:30] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-19 04:57:30] [INFO ] Invariant cache hit.
[2023-03-19 04:57:30] [INFO ] Dead Transitions using invariants and state equation in 427 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 620/623 places, 520/523 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1800 ms. Remains : 620/623 places, 520/523 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (AND p1 (NOT p2)), (AND (NOT p2) p1 (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-020A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(OR (AND p0 (NOT p1)) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p2:(AND (NOT (OR (AND (EQ s16 1) (EQ s18 1)) (NOT (AND (EQ s446 1) (EQ s465 1))))) (NOT (AND (EQ s46 1) (EQ s61 1)))), p1:(AND (EQ s46 1) (EQ s61 1)), p0:...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1244 steps with 0 reset in 12 ms.
FORMULA ShieldPPPs-PT-020A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-020A-LTLFireability-08 finished in 1971 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&F(G(p1))))))'
Support contains 3 out of 623 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 523/523 transitions.
Applied a total of 0 rules in 9 ms. Remains 623 /623 variables (removed 0) and now considering 523/523 (removed 0) transitions.
// Phase 1: matrix 523 rows 623 cols
[2023-03-19 04:57:30] [INFO ] Computed 221 place invariants in 2 ms
[2023-03-19 04:57:31] [INFO ] Implicit Places using invariants in 637 ms returned []
[2023-03-19 04:57:31] [INFO ] Invariant cache hit.
[2023-03-19 04:57:32] [INFO ] Implicit Places using invariants and state equation in 1084 ms returned []
Implicit Place search using SMT with State Equation took 1745 ms to find 0 implicit places.
[2023-03-19 04:57:32] [INFO ] Invariant cache hit.
[2023-03-19 04:57:32] [INFO ] Dead Transitions using invariants and state equation in 386 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2141 ms. Remains : 623/623 places, 523/523 transitions.
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-020A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s310 0), p1:(AND (EQ s593 1) (EQ s614 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1320 steps with 0 reset in 61 ms.
FORMULA ShieldPPPs-PT-020A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-020A-LTLFireability-09 finished in 2474 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 623 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 623/623 places, 523/523 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 621 transition count 521
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 620 transition count 520
Applied a total of 4 rules in 64 ms. Remains 620 /623 variables (removed 3) and now considering 520/523 (removed 3) transitions.
// Phase 1: matrix 520 rows 620 cols
[2023-03-19 04:57:33] [INFO ] Computed 221 place invariants in 2 ms
[2023-03-19 04:57:33] [INFO ] Implicit Places using invariants in 465 ms returned []
[2023-03-19 04:57:33] [INFO ] Invariant cache hit.
[2023-03-19 04:57:34] [INFO ] Implicit Places using invariants and state equation in 984 ms returned []
Implicit Place search using SMT with State Equation took 1464 ms to find 0 implicit places.
[2023-03-19 04:57:34] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-19 04:57:34] [INFO ] Invariant cache hit.
[2023-03-19 04:57:35] [INFO ] Dead Transitions using invariants and state equation in 778 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 620/623 places, 520/523 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2333 ms. Remains : 620/623 places, 520/523 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-020A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s224 1) (EQ s244 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1434 steps with 0 reset in 17 ms.
FORMULA ShieldPPPs-PT-020A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-020A-LTLFireability-10 finished in 2428 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&F(p1)))'
Support contains 7 out of 623 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 623/623 places, 523/523 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 621 transition count 521
Applied a total of 4 rules in 37 ms. Remains 621 /623 variables (removed 2) and now considering 521/523 (removed 2) transitions.
// Phase 1: matrix 521 rows 621 cols
[2023-03-19 04:57:35] [INFO ] Computed 221 place invariants in 3 ms
[2023-03-19 04:57:36] [INFO ] Implicit Places using invariants in 465 ms returned []
[2023-03-19 04:57:36] [INFO ] Invariant cache hit.
[2023-03-19 04:57:36] [INFO ] Implicit Places using invariants and state equation in 899 ms returned []
Implicit Place search using SMT with State Equation took 1390 ms to find 0 implicit places.
[2023-03-19 04:57:36] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-19 04:57:36] [INFO ] Invariant cache hit.
[2023-03-19 04:57:37] [INFO ] Dead Transitions using invariants and state equation in 497 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 621/623 places, 521/523 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1950 ms. Remains : 621/623 places, 521/523 transitions.
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-020A-LTLFireability-11 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=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (OR (EQ s283 0) (EQ s304 0)) (OR (EQ s511 0) (EQ s553 0))) (EQ s511 0) (EQ s553 0)), p1:(OR (AND (EQ s189 1) (EQ s216 1)) (EQ s275 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 299 reset in 615 ms.
Product exploration explored 100000 steps with 311 reset in 638 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 p0 (NOT p1)), (X (NOT p1)), (X p0), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 404 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 304 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p1)]
Finished random walk after 649 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=108 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 6 factoid took 537 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p1)]
[2023-03-19 04:57:40] [INFO ] Invariant cache hit.
[2023-03-19 04:57:41] [INFO ] [Real]Absence check using 221 positive place invariants in 103 ms returned sat
[2023-03-19 04:57:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 04:57:43] [INFO ] [Real]Absence check using state equation in 1557 ms returned sat
[2023-03-19 04:57:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 04:57:44] [INFO ] [Nat]Absence check using 221 positive place invariants in 99 ms returned sat
[2023-03-19 04:57:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 04:57:44] [INFO ] [Nat]Absence check using state equation in 966 ms returned sat
[2023-03-19 04:57:45] [INFO ] Computed and/alt/rep : 520/1447/520 causal constraints (skipped 0 transitions) in 45 ms.
[2023-03-19 04:57:57] [INFO ] Added : 520 causal constraints over 107 iterations in 12785 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 7 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 521/521 transitions.
Applied a total of 0 rules in 16 ms. Remains 621 /621 variables (removed 0) and now considering 521/521 (removed 0) transitions.
[2023-03-19 04:57:57] [INFO ] Invariant cache hit.
[2023-03-19 04:57:58] [INFO ] Implicit Places using invariants in 439 ms returned []
[2023-03-19 04:57:58] [INFO ] Invariant cache hit.
[2023-03-19 04:57:59] [INFO ] Implicit Places using invariants and state equation in 767 ms returned []
Implicit Place search using SMT with State Equation took 1220 ms to find 0 implicit places.
[2023-03-19 04:57:59] [INFO ] Invariant cache hit.
[2023-03-19 04:57:59] [INFO ] Dead Transitions using invariants and state equation in 418 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1670 ms. Remains : 621/621 places, 521/521 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 p0 (NOT p1)), (X (NOT p1)), (X p0), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 413 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 311 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p1)]
Finished random walk after 537 steps, including 0 resets, run visited all 2 properties in 23 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 6 factoid took 304 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p1)]
[2023-03-19 04:58:01] [INFO ] Invariant cache hit.
[2023-03-19 04:58:01] [INFO ] [Real]Absence check using 221 positive place invariants in 108 ms returned sat
[2023-03-19 04:58:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 04:58:02] [INFO ] [Real]Absence check using state equation in 1137 ms returned sat
[2023-03-19 04:58:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 04:58:03] [INFO ] [Nat]Absence check using 221 positive place invariants in 179 ms returned sat
[2023-03-19 04:58:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 04:58:04] [INFO ] [Nat]Absence check using state equation in 960 ms returned sat
[2023-03-19 04:58:04] [INFO ] Computed and/alt/rep : 520/1447/520 causal constraints (skipped 0 transitions) in 48 ms.
[2023-03-19 04:58:17] [INFO ] Added : 520 causal constraints over 107 iterations in 12931 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 301 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 297 reset in 613 ms.
Product exploration explored 100000 steps with 313 reset in 581 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 288 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p1)]
Support contains 7 out of 621 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 621/621 places, 521/521 transitions.
Applied a total of 0 rules in 30 ms. Remains 621 /621 variables (removed 0) and now considering 521/521 (removed 0) transitions.
[2023-03-19 04:58:19] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-19 04:58:19] [INFO ] Invariant cache hit.
[2023-03-19 04:58:20] [INFO ] Dead Transitions using invariants and state equation in 480 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 540 ms. Remains : 621/621 places, 521/521 transitions.
Built C files in :
/tmp/ltsmin15888323578480684232
[2023-03-19 04:58:20] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15888323578480684232
Running compilation step : cd /tmp/ltsmin15888323578480684232;'/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 880 ms.
Running link step : cd /tmp/ltsmin15888323578480684232;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin15888323578480684232;'/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/stateBased12395784544492325707.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 521/521 transitions.
Applied a total of 0 rules in 8 ms. Remains 621 /621 variables (removed 0) and now considering 521/521 (removed 0) transitions.
[2023-03-19 04:58:35] [INFO ] Invariant cache hit.
[2023-03-19 04:58:35] [INFO ] Implicit Places using invariants in 450 ms returned []
[2023-03-19 04:58:35] [INFO ] Invariant cache hit.
[2023-03-19 04:58:36] [INFO ] Implicit Places using invariants and state equation in 972 ms returned []
Implicit Place search using SMT with State Equation took 1449 ms to find 0 implicit places.
[2023-03-19 04:58:36] [INFO ] Invariant cache hit.
[2023-03-19 04:58:37] [INFO ] Dead Transitions using invariants and state equation in 385 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1858 ms. Remains : 621/621 places, 521/521 transitions.
Built C files in :
/tmp/ltsmin5285857346076610957
[2023-03-19 04:58:37] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5285857346076610957
Running compilation step : cd /tmp/ltsmin5285857346076610957;'/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 904 ms.
Running link step : cd /tmp/ltsmin5285857346076610957;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin5285857346076610957;'/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/stateBased3429492895747436525.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 04:58:52] [INFO ] Flatten gal took : 32 ms
[2023-03-19 04:58:52] [INFO ] Flatten gal took : 29 ms
[2023-03-19 04:58:52] [INFO ] Time to serialize gal into /tmp/LTL14745535109128401665.gal : 6 ms
[2023-03-19 04:58:52] [INFO ] Time to serialize properties into /tmp/LTL4346353526956970805.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14745535109128401665.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10870068071451743383.hoa' '-atoms' '/tmp/LTL4346353526956970805.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...319
Loading property file /tmp/LTL4346353526956970805.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10870068071451743383.hoa
Detected timeout of ITS tools.
[2023-03-19 04:59:07] [INFO ] Flatten gal took : 36 ms
[2023-03-19 04:59:07] [INFO ] Flatten gal took : 30 ms
[2023-03-19 04:59:07] [INFO ] Time to serialize gal into /tmp/LTL8869427275066849686.gal : 5 ms
[2023-03-19 04:59:07] [INFO ] Time to serialize properties into /tmp/LTL16709757017285232947.ltl : 3 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/LTL8869427275066849686.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16709757017285232947.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...276
Read 1 LTL properties
Checking formula 0 : !(((G(F("(((((p283==0)||(p304==0))&&((p511==0)||(p553==0)))||(p511==0))||(p553==0))")))&&(F("(((p189==1)&&(p216==1))||(p275==1))"))))
Formula 0 simplified : FG!"(((((p283==0)||(p304==0))&&((p511==0)||(p553==0)))||(p511==0))||(p553==0))" | G!"(((p189==1)&&(p216==1))||(p275==1))"
Detected timeout of ITS tools.
[2023-03-19 04:59:22] [INFO ] Flatten gal took : 25 ms
[2023-03-19 04:59:22] [INFO ] Applying decomposition
[2023-03-19 04:59:22] [INFO ] Flatten gal took : 22 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/graph12126345625076699459.txt' '-o' '/tmp/graph12126345625076699459.bin' '-w' '/tmp/graph12126345625076699459.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12126345625076699459.bin' '-l' '-1' '-v' '-w' '/tmp/graph12126345625076699459.weights' '-q' '0' '-e' '0.001'
[2023-03-19 04:59:22] [INFO ] Decomposing Gal with order
[2023-03-19 04:59:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 04:59:23] [INFO ] Removed a total of 120 redundant transitions.
[2023-03-19 04:59:23] [INFO ] Flatten gal took : 158 ms
[2023-03-19 04:59:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 240 labels/synchronizations in 28 ms.
[2023-03-19 04:59:23] [INFO ] Time to serialize gal into /tmp/LTL4802331562431274615.gal : 10 ms
[2023-03-19 04:59:23] [INFO ] Time to serialize properties into /tmp/LTL17916743301363147425.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/LTL4802331562431274615.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17916743301363147425.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...255
Read 1 LTL properties
Checking formula 0 : !(((G(F("(((((i9.i2.u100.p283==0)||(i9.i2.u108.p304==0))&&((i16.i0.u183.p511==0)||(i17.i2.u197.p553==0)))||(i16.i0.u183.p511==0))||(i1...254
Formula 0 simplified : FG!"(((((i9.i2.u100.p283==0)||(i9.i2.u108.p304==0))&&((i16.i0.u183.p511==0)||(i17.i2.u197.p553==0)))||(i16.i0.u183.p511==0))||(i17.i...244
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12409055313145834141
[2023-03-19 04:59:38] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12409055313145834141
Running compilation step : cd /tmp/ltsmin12409055313145834141;'/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 938 ms.
Running link step : cd /tmp/ltsmin12409055313145834141;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin12409055313145834141;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](<>((LTLAPp0==true)))&&<>((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-020A-LTLFireability-11 finished in 137952 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(((p0 U G(!p0))&&X(p1))))))'
Support contains 3 out of 623 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 523/523 transitions.
Applied a total of 0 rules in 7 ms. Remains 623 /623 variables (removed 0) and now considering 523/523 (removed 0) transitions.
// Phase 1: matrix 523 rows 623 cols
[2023-03-19 04:59:53] [INFO ] Computed 221 place invariants in 6 ms
[2023-03-19 04:59:54] [INFO ] Implicit Places using invariants in 793 ms returned []
[2023-03-19 04:59:54] [INFO ] Invariant cache hit.
[2023-03-19 04:59:55] [INFO ] Implicit Places using invariants and state equation in 717 ms returned []
Implicit Place search using SMT with State Equation took 1517 ms to find 0 implicit places.
[2023-03-19 04:59:55] [INFO ] Invariant cache hit.
[2023-03-19 04:59:55] [INFO ] Dead Transitions using invariants and state equation in 700 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2238 ms. Remains : 623/623 places, 523/523 transitions.
Stuttering acceptance computed with spot in 456 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), p0, p0, (NOT p1), true]
Running random walk in product with property : ShieldPPPs-PT-020A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}, { cond=true, acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 7}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(NEQ s0 1), p1:(AND (EQ s414 1) (EQ s426 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1386 steps with 0 reset in 21 ms.
FORMULA ShieldPPPs-PT-020A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-020A-LTLFireability-12 finished in 2749 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) U X(p2))))'
Support contains 8 out of 623 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 523/523 transitions.
Applied a total of 0 rules in 28 ms. Remains 623 /623 variables (removed 0) and now considering 523/523 (removed 0) transitions.
[2023-03-19 04:59:56] [INFO ] Invariant cache hit.
[2023-03-19 04:59:56] [INFO ] Implicit Places using invariants in 396 ms returned []
[2023-03-19 04:59:56] [INFO ] Invariant cache hit.
[2023-03-19 04:59:57] [INFO ] Implicit Places using invariants and state equation in 734 ms returned []
Implicit Place search using SMT with State Equation took 1132 ms to find 0 implicit places.
[2023-03-19 04:59:57] [INFO ] Invariant cache hit.
[2023-03-19 04:59:57] [INFO ] Dead Transitions using invariants and state equation in 354 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1515 ms. Remains : 623/623 places, 523/523 transitions.
Stuttering acceptance computed with spot in 336 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-020A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s352 1) (EQ s362 1) (EQ s316 1) (EQ s332 1)), p1:(AND (EQ s141 1) (EQ s143 1)), p2:(AND (EQ s379 1) (EQ s381 1))], 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]]
Stuttering criterion allowed to conclude after 1421 steps with 0 reset in 21 ms.
FORMULA ShieldPPPs-PT-020A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-020A-LTLFireability-13 finished in 1913 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(p0)||(X((F(p2)&&p1))&&G(p3)))))'
Support contains 5 out of 623 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 523/523 transitions.
Applied a total of 0 rules in 16 ms. Remains 623 /623 variables (removed 0) and now considering 523/523 (removed 0) transitions.
[2023-03-19 04:59:58] [INFO ] Invariant cache hit.
[2023-03-19 04:59:58] [INFO ] Implicit Places using invariants in 446 ms returned []
[2023-03-19 04:59:58] [INFO ] Invariant cache hit.
[2023-03-19 04:59:59] [INFO ] Implicit Places using invariants and state equation in 823 ms returned []
Implicit Place search using SMT with State Equation took 1307 ms to find 0 implicit places.
[2023-03-19 04:59:59] [INFO ] Invariant cache hit.
[2023-03-19 05:00:00] [INFO ] Dead Transitions using invariants and state equation in 548 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1888 ms. Remains : 623/623 places, 523/523 transitions.
Stuttering acceptance computed with spot in 600 ms :[true, (OR (NOT p3) (NOT p1) (NOT p2)), (OR (NOT p3) (NOT p2)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p3), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p3) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-020A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p3) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p3 p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p3 p1 p2), acceptance={} source=1 dest: 6}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 0}, { cond=(AND p3 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p3 p2), acceptance={0} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p3), acceptance={} source=4 dest: 1}, { cond=(AND p0 p3), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p3)), acceptance={} source=4 dest: 9}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p3 p1 (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p3 p1 p2), acceptance={} source=5 dest: 6}, { cond=(AND p0 p3 p1 (NOT p2)), acceptance={} source=5 dest: 7}, { cond=(AND p0 p3 p1 p2), acceptance={} source=5 dest: 8}, { cond=(OR (AND p0 (NOT p3)) (AND p0 (NOT p1))), acceptance={} source=5 dest: 9}], [{ cond=(NOT p3), acceptance={} source=6 dest: 0}, { cond=p3, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p0) p3 p2), acceptance={} source=7 dest: 6}, { cond=(AND p0 p3 (NOT p2)), acceptance={} source=7 dest: 7}, { cond=(AND p0 p3 p2), acceptance={} source=7 dest: 8}, { cond=(AND p0 (NOT p3)), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p0) p3), acceptance={} source=8 dest: 6}, { cond=(AND p0 p3), acceptance={} source=8 dest: 8}, { cond=(AND p0 (NOT p3)), acceptance={} source=8 dest: 9}], [{ cond=(NOT p0), acceptance={} source=9 dest: 0}, { cond=p0, acceptance={} source=9 dest: 9}]], initial=3, aps=[p3:(AND (EQ s39 1) (EQ s60 1)), p1:(AND (EQ s39 1) (EQ s60 1)), p2:(AND (EQ s192 1) (EQ s209 1)), p0:(EQ s90 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, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-020A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-020A-LTLFireability-14 finished in 2539 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&F(p1)))'
[2023-03-19 05:00:00] [INFO ] Flatten gal took : 34 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6259525116960744142
[2023-03-19 05:00:00] [INFO ] Computing symmetric may disable matrix : 523 transitions.
[2023-03-19 05:00:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 05:00:00] [INFO ] Computing symmetric may enable matrix : 523 transitions.
[2023-03-19 05:00:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 05:00:00] [INFO ] Applying decomposition
[2023-03-19 05:00:00] [INFO ] Flatten gal took : 23 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/graph18041011976368774032.txt' '-o' '/tmp/graph18041011976368774032.bin' '-w' '/tmp/graph18041011976368774032.weights'
[2023-03-19 05:00:00] [INFO ] Computing Do-Not-Accords matrix : 523 transitions.
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph18041011976368774032.bin' '-l' '-1' '-v' '-w' '/tmp/graph18041011976368774032.weights' '-q' '0' '-e' '0.001'
[2023-03-19 05:00:00] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 05:00:00] [INFO ] Decomposing Gal with order
[2023-03-19 05:00:00] [INFO ] Built C files in 125ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6259525116960744142
Running compilation step : cd /tmp/ltsmin6259525116960744142;'/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'
[2023-03-19 05:00:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 05:00:01] [INFO ] Removed a total of 120 redundant transitions.
[2023-03-19 05:00:01] [INFO ] Flatten gal took : 35 ms
[2023-03-19 05:00:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 246 labels/synchronizations in 27 ms.
[2023-03-19 05:00:01] [INFO ] Time to serialize gal into /tmp/LTLFireability13187248166843471128.gal : 6 ms
[2023-03-19 05:00:01] [INFO ] Time to serialize properties into /tmp/LTLFireability17346833243846673860.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/LTLFireability13187248166843471128.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17346833243846673860.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...278
Read 1 LTL properties
Checking formula 0 : !(((G(F("(((((i9.u100.p283==0)||(i9.u108.p304==0))&&((i16.u182.p511==0)||(i17.u197.p553==0)))||(i16.u182.p511==0))||(i17.u197.p553==0)...227
Formula 0 simplified : FG!"(((((i9.u100.p283==0)||(i9.u108.p304==0))&&((i16.u182.p511==0)||(i17.u197.p553==0)))||(i16.u182.p511==0))||(i17.u197.p553==0))" ...217
Compilation finished in 1279 ms.
Running link step : cd /tmp/ltsmin6259525116960744142;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin6259525116960744142;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([](<>((LTLAPp0==true)))&&<>((LTLAPp1==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-19 05:21:37] [INFO ] Applying decomposition
[2023-03-19 05:21:37] [INFO ] Flatten gal took : 79 ms
[2023-03-19 05:21:37] [INFO ] Decomposing Gal with order
[2023-03-19 05:21:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 05:21:37] [INFO ] Removed a total of 180 redundant transitions.
[2023-03-19 05:21:37] [INFO ] Flatten gal took : 98 ms
[2023-03-19 05:21:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 240 labels/synchronizations in 29 ms.
[2023-03-19 05:21:37] [INFO ] Time to serialize gal into /tmp/LTLFireability4533950309699882051.gal : 17 ms
[2023-03-19 05:21:37] [INFO ] Time to serialize properties into /tmp/LTLFireability1040954877289884187.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/LTLFireability4533950309699882051.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1040954877289884187.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...276
Read 1 LTL properties
Checking formula 0 : !(((G(F("(((((u128.p283==0)||(u139.p304==0))&&((i132.u304.p511==0)||(u252.p553==0)))||(i132.u304.p511==0))||(u252.p553==0))")))&&(F("(...207
Formula 0 simplified : FG!"(((((u128.p283==0)||(u139.p304==0))&&((i132.u304.p511==0)||(u252.p553==0)))||(i132.u304.p511==0))||(u252.p553==0))" | G!"(((u86....197
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.065: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.072: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.073: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.079: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.083: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.086: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.086: Initializing POR dependencies: labels 525, guards 523
pins2lts-mc-linux64( 1/ 8), 0.088: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.091: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 4.443: LTL layer: formula: ([](<>((LTLAPp0==true)))&&<>((LTLAPp1==true)))
pins2lts-mc-linux64( 5/ 8), 4.443: "([](<>((LTLAPp0==true)))&&<>((LTLAPp1==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 4.444: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 4.785: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 4.855: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 4.889: There are 527 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 4.889: State length is 624, there are 530 groups
pins2lts-mc-linux64( 0/ 8), 4.889: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 4.889: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 4.889: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 4.889: Visible groups: 0 / 530, labels: 2 / 527
pins2lts-mc-linux64( 0/ 8), 4.889: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 4.889: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 5/ 8), 4.979: [Blue] ~120 levels ~960 states ~3312 transitions
pins2lts-mc-linux64( 5/ 8), 5.071: [Blue] ~240 levels ~1920 states ~7024 transitions
pins2lts-mc-linux64( 5/ 8), 5.186: [Blue] ~448 levels ~3840 states ~16680 transitions
pins2lts-mc-linux64( 5/ 8), 5.489: [Blue] ~778 levels ~7680 states ~42832 transitions
pins2lts-mc-linux64( 5/ 8), 5.864: [Blue] ~1052 levels ~15360 states ~61832 transitions
pins2lts-mc-linux64( 5/ 8), 6.357: [Blue] ~1052 levels ~30720 states ~85264 transitions
pins2lts-mc-linux64( 0/ 8), 7.300: [Blue] ~1102 levels ~61440 states ~135296 transitions
pins2lts-mc-linux64( 0/ 8), 9.234: [Blue] ~1102 levels ~122880 states ~254288 transitions
pins2lts-mc-linux64( 0/ 8), 12.804: [Blue] ~1106 levels ~245760 states ~471544 transitions
pins2lts-mc-linux64( 3/ 8), 19.556: [Blue] ~1427 levels ~491520 states ~918632 transitions
pins2lts-mc-linux64( 3/ 8), 31.941: [Blue] ~1427 levels ~983040 states ~1757664 transitions
pins2lts-mc-linux64( 3/ 8), 57.256: [Blue] ~1427 levels ~1966080 states ~3546808 transitions
pins2lts-mc-linux64( 3/ 8), 110.307: [Blue] ~1428 levels ~3932160 states ~7291576 transitions
pins2lts-mc-linux64( 3/ 8), 210.317: [Blue] ~1430 levels ~7864320 states ~14354200 transitions
pins2lts-mc-linux64( 3/ 8), 429.212: [Blue] ~1430 levels ~15728640 states ~29787992 transitions
pins2lts-mc-linux64( 3/ 8), 843.601: [Blue] ~1430 levels ~31457280 states ~59342688 transitions
pins2lts-mc-linux64( 0/ 8), 1533.492: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1533.586:
pins2lts-mc-linux64( 0/ 8), 1533.586: Explored 52595079 states 111505321 transitions, fanout: 2.120
pins2lts-mc-linux64( 0/ 8), 1533.586: Total exploration time 1528.670 sec (1528.570 sec minimum, 1528.609 sec on average)
pins2lts-mc-linux64( 0/ 8), 1533.586: States per second: 34406, Transitions per second: 72943
pins2lts-mc-linux64( 0/ 8), 1533.586:
pins2lts-mc-linux64( 0/ 8), 1533.586: State space has 52658031 states, 52585363 are accepting
pins2lts-mc-linux64( 0/ 8), 1533.586: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1533.586: blue states: 52595079 (99.88%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1533.586: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1533.586: all-red states: 52585363 (99.86%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1533.586:
pins2lts-mc-linux64( 0/ 8), 1533.586: Total memory used for local state coloring: 0.2MB
pins2lts-mc-linux64( 0/ 8), 1533.586:
pins2lts-mc-linux64( 0/ 8), 1533.586: Queue width: 8B, total height: 9907, memory: 0.08MB
pins2lts-mc-linux64( 0/ 8), 1533.586: Tree memory: 657.7MB, 13.1 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 1533.586: Tree fill ratio (roots/leafs): 39.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1533.586: Stored 663 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1533.586: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1533.586: Est. total memory use: 657.8MB (~1024.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6259525116960744142;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([](<>((LTLAPp0==true)))&&<>((LTLAPp1==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6259525116960744142;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([](<>((LTLAPp0==true)))&&<>((LTLAPp1==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-19 05:43:17] [INFO ] Flatten gal took : 2801 ms
[2023-03-19 05:43:20] [INFO ] Input system was already deterministic with 523 transitions.
[2023-03-19 05:43:20] [INFO ] Transformed 623 places.
[2023-03-19 05:43:20] [INFO ] Transformed 523 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 05:43:20] [INFO ] Time to serialize gal into /tmp/LTLFireability14257951465031101380.gal : 26 ms
[2023-03-19 05:43:21] [INFO ] Time to serialize properties into /tmp/LTLFireability12957165051783580110.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/LTLFireability14257951465031101380.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12957165051783580110.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...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G(F("(((((p283==0)||(p304==0))&&((p511==0)||(p553==0)))||(p511==0))||(p553==0))")))&&(F("(((p189==1)&&(p216==1))||(p275==1))"))))
Formula 0 simplified : FG!"(((((p283==0)||(p304==0))&&((p511==0)||(p553==0)))||(p511==0))||(p553==0))" | G!"(((p189==1)&&(p216==1))||(p275==1))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 1512436 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16137516 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-020A"
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-020A, 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-167903713600452"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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