Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r373-tall-171683789100368.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldPPPt-PT-004B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789100368
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 14:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 11 14:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 11 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 11 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 74K May 18 16:43 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 ShieldPPPt-PT-004B-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716983413250

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-004B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 11:50:15] [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]
[2024-05-29 11:50:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 11:50:15] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2024-05-29 11:50:15] [INFO ] Transformed 315 places.
[2024-05-29 11:50:15] [INFO ] Transformed 287 transitions.
[2024-05-29 11:50:15] [INFO ] Found NUPN structural information;
[2024-05-29 11:50:15] [INFO ] Parsed PT model containing 315 places and 287 transitions and 718 arcs in 152 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPt-PT-004B-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 287/287 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 280 transition count 252
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 280 transition count 252
Applied a total of 70 rules in 50 ms. Remains 280 /315 variables (removed 35) and now considering 252/287 (removed 35) transitions.
// Phase 1: matrix 252 rows 280 cols
[2024-05-29 11:50:15] [INFO ] Computed 45 invariants in 19 ms
[2024-05-29 11:50:16] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-05-29 11:50:16] [INFO ] Invariant cache hit.
[2024-05-29 11:50:16] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
[2024-05-29 11:50:16] [INFO ] Invariant cache hit.
[2024-05-29 11:50:16] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 280/315 places, 252/287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 786 ms. Remains : 280/315 places, 252/287 transitions.
Support contains 42 out of 280 places after structural reductions.
[2024-05-29 11:50:16] [INFO ] Flatten gal took : 48 ms
[2024-05-29 11:50:16] [INFO ] Flatten gal took : 18 ms
[2024-05-29 11:50:16] [INFO ] Input system was already deterministic with 252 transitions.
Support contains 40 out of 280 places (down from 42) after GAL structural reductions.
Finished random walk after 1416 steps, including 0 resets, run visited all 34 properties in 94 ms. (steps per millisecond=15 )
Parikh walk visited 0 properties in 1 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 67 stabilizing places and 67 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X((F(p0)&&X(p1)))&&G((p1||F(!p0))))||G((F(p0)&&X(p1))))))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 270 transition count 242
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 270 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 269 transition count 241
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 269 transition count 241
Applied a total of 22 rules in 24 ms. Remains 269 /280 variables (removed 11) and now considering 241/252 (removed 11) transitions.
// Phase 1: matrix 241 rows 269 cols
[2024-05-29 11:50:17] [INFO ] Computed 45 invariants in 6 ms
[2024-05-29 11:50:17] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-29 11:50:17] [INFO ] Invariant cache hit.
[2024-05-29 11:50:17] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2024-05-29 11:50:17] [INFO ] Invariant cache hit.
[2024-05-29 11:50:17] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 269/280 places, 241/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 491 ms. Remains : 269/280 places, 241/252 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 405 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=true, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(NEQ s16 1), p0:(EQ s211 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 335 ms.
Product exploration explored 100000 steps with 0 reset in 387 ms.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Detected a total of 62/269 stabilizing places and 62/241 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 140 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 11:50:19] [INFO ] Invariant cache hit.
[2024-05-29 11:50:19] [INFO ] [Real]Absence check using 45 positive place invariants in 22 ms returned sat
[2024-05-29 11:50:19] [INFO ] After 136ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 11:50:19] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 4 ms to minimize.
[2024-05-29 11:50:19] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 2 ms to minimize.
[2024-05-29 11:50:19] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-29 11:50:20] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-05-29 11:50:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 323 ms
[2024-05-29 11:50:20] [INFO ] After 469ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 11:50:20] [INFO ] After 583ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 11:50:20] [INFO ] [Nat]Absence check using 45 positive place invariants in 20 ms returned sat
[2024-05-29 11:50:20] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 11:50:20] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-29 11:50:20] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-29 11:50:20] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 11:50:20] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-29 11:50:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 175 ms
[2024-05-29 11:50:20] [INFO ] After 376ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-29 11:50:20] [INFO ] After 465ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 162 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=81 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p0), (F (AND p0 p1))]
Knowledge based reduction with 11 factoid took 268 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter insensitive) to 6 states, 14 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false]
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false]
[2024-05-29 11:50:21] [INFO ] Invariant cache hit.
[2024-05-29 11:50:21] [INFO ] [Real]Absence check using 45 positive place invariants in 13 ms returned sat
[2024-05-29 11:50:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 11:50:21] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2024-05-29 11:50:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 11:50:21] [INFO ] [Nat]Absence check using 45 positive place invariants in 12 ms returned sat
[2024-05-29 11:50:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 11:50:21] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2024-05-29 11:50:21] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-29 11:50:21] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-05-29 11:50:22] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-29 11:50:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 171 ms
[2024-05-29 11:50:22] [INFO ] Computed and/alt/rep : 240/357/240 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-29 11:50:22] [INFO ] Added : 205 causal constraints over 41 iterations in 794 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 269/269 places, 241/241 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 268 transition count 184
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 212 transition count 184
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 112 place count 212 transition count 152
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 176 place count 180 transition count 152
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 302 place count 117 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 303 place count 117 transition count 88
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 3 with 2 rules applied. Total rules applied 305 place count 116 transition count 87
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 327 place count 105 transition count 87
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 329 place count 103 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 330 place count 102 transition count 85
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 330 place count 102 transition count 83
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 334 place count 100 transition count 83
Applied a total of 334 rules in 45 ms. Remains 100 /269 variables (removed 169) and now considering 83/241 (removed 158) transitions.
// Phase 1: matrix 83 rows 100 cols
[2024-05-29 11:50:22] [INFO ] Computed 44 invariants in 0 ms
[2024-05-29 11:50:22] [INFO ] Implicit Places using invariants in 75 ms returned [83, 87]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 77 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 98/269 places, 83/241 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 96 transition count 81
Applied a total of 4 rules in 5 ms. Remains 96 /98 variables (removed 2) and now considering 81/83 (removed 2) transitions.
// Phase 1: matrix 81 rows 96 cols
[2024-05-29 11:50:22] [INFO ] Computed 42 invariants in 1 ms
[2024-05-29 11:50:23] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-29 11:50:23] [INFO ] Invariant cache hit.
[2024-05-29 11:50:23] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 96/269 places, 81/241 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 298 ms. Remains : 96/269 places, 81/241 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/96 stabilizing places and 2/81 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), true, (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 7 factoid took 220 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :1
Finished Best-First random walk after 133 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=66 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), true, (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p0)), (F (AND p0 (NOT p1))), (F (AND p0 p1))]
Knowledge based reduction with 7 factoid took 262 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 1 reset in 253 ms.
Product exploration explored 100000 steps with 1 reset in 367 ms.
Built C files in :
/tmp/ltsmin9701209223282095651
[2024-05-29 11:50:24] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2024-05-29 11:50:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:50:24] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2024-05-29 11:50:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:50:24] [INFO ] Computing Do-Not-Accords matrix : 81 transitions.
[2024-05-29 11:50:24] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:50:24] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9701209223282095651
Running compilation step : cd /tmp/ltsmin9701209223282095651;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 304 ms.
Running link step : cd /tmp/ltsmin9701209223282095651;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin9701209223282095651;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16290336828310777291.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 81/81 transitions.
Applied a total of 0 rules in 18 ms. Remains 96 /96 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-29 11:50:39] [INFO ] Invariant cache hit.
[2024-05-29 11:50:39] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-29 11:50:39] [INFO ] Invariant cache hit.
[2024-05-29 11:50:39] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-05-29 11:50:40] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 11:50:40] [INFO ] Invariant cache hit.
[2024-05-29 11:50:40] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 293 ms. Remains : 96/96 places, 81/81 transitions.
Built C files in :
/tmp/ltsmin6421246628894710468
[2024-05-29 11:50:40] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2024-05-29 11:50:40] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:50:40] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2024-05-29 11:50:40] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:50:40] [INFO ] Computing Do-Not-Accords matrix : 81 transitions.
[2024-05-29 11:50:40] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:50:40] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6421246628894710468
Running compilation step : cd /tmp/ltsmin6421246628894710468;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 174 ms.
Running link step : cd /tmp/ltsmin6421246628894710468;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin6421246628894710468;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7668734839218984167.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 11:50:55] [INFO ] Flatten gal took : 6 ms
[2024-05-29 11:50:55] [INFO ] Flatten gal took : 6 ms
[2024-05-29 11:50:55] [INFO ] Time to serialize gal into /tmp/LTL11818551468400616905.gal : 1 ms
[2024-05-29 11:50:55] [INFO ] Time to serialize properties into /tmp/LTL10326950012981246957.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11818551468400616905.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16422005565481621954.hoa' '-atoms' '/tmp/LTL10326950012981246957.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL10326950012981246957.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16422005565481621954.hoa
Reverse transition relation is NOT exact ! Due to transitions t0.t203, t1.t200, t2.t197, t3.t156, t4.t153, t5.t150, t6.t104, t7.t101, t8.t98, t204, t135.t2...318
Computing Next relation with stutter on 369558 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
37 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.413903,31592,1,0,212,94765,202,113,2997,126281,305
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-004B-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldPPPt-PT-004B-LTLFireability-00 finished in 38649 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(p0))) U G(p1)))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 271 transition count 243
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 271 transition count 243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 270 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 270 transition count 242
Applied a total of 20 rules in 17 ms. Remains 270 /280 variables (removed 10) and now considering 242/252 (removed 10) transitions.
// Phase 1: matrix 242 rows 270 cols
[2024-05-29 11:50:55] [INFO ] Computed 45 invariants in 4 ms
[2024-05-29 11:50:56] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-29 11:50:56] [INFO ] Invariant cache hit.
[2024-05-29 11:50:56] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2024-05-29 11:50:56] [INFO ] Invariant cache hit.
[2024-05-29 11:50:56] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 270/280 places, 242/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 525 ms. Remains : 270/280 places, 242/252 transitions.
Stuttering acceptance computed with spot in 328 ms :[(NOT p1), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 5}, { cond=(AND p1 p0), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(EQ s108 1), p0:(EQ s195 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-01 finished in 879 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 279 transition count 193
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 60 rules applied. Total rules applied 118 place count 221 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 119 place count 220 transition count 191
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 119 place count 220 transition count 163
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 175 place count 192 transition count 163
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 183 place count 184 transition count 155
Iterating global reduction 3 with 8 rules applied. Total rules applied 191 place count 184 transition count 155
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 191 place count 184 transition count 150
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 201 place count 179 transition count 150
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 323 place count 118 transition count 89
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 345 place count 107 transition count 89
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 347 place count 105 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 348 place count 104 transition count 87
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 348 place count 104 transition count 85
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 352 place count 102 transition count 85
Applied a total of 352 rules in 40 ms. Remains 102 /280 variables (removed 178) and now considering 85/252 (removed 167) transitions.
// Phase 1: matrix 85 rows 102 cols
[2024-05-29 11:50:56] [INFO ] Computed 44 invariants in 1 ms
[2024-05-29 11:50:56] [INFO ] Implicit Places using invariants in 128 ms returned [85, 89]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 129 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/280 places, 85/252 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 98 transition count 83
Applied a total of 4 rules in 5 ms. Remains 98 /100 variables (removed 2) and now considering 83/85 (removed 2) transitions.
// Phase 1: matrix 83 rows 98 cols
[2024-05-29 11:50:56] [INFO ] Computed 42 invariants in 0 ms
[2024-05-29 11:50:57] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-29 11:50:57] [INFO ] Invariant cache hit.
[2024-05-29 11:50:57] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 98/280 places, 83/252 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 360 ms. Remains : 98/280 places, 83/252 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s38 1) (EQ s49 1)), p1:(OR (EQ s28 0) (EQ s55 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 531 reset in 347 ms.
Stack based approach found an accepted trace after 440 steps with 2 reset with depth 196 and stack size 194 in 1 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-02 finished in 795 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&(F(p1) U X((X((p3 U p4))||p2)))))'
Support contains 7 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 272 transition count 244
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 272 transition count 244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 271 transition count 243
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 271 transition count 243
Applied a total of 18 rules in 16 ms. Remains 271 /280 variables (removed 9) and now considering 243/252 (removed 9) transitions.
// Phase 1: matrix 243 rows 271 cols
[2024-05-29 11:50:57] [INFO ] Computed 45 invariants in 2 ms
[2024-05-29 11:50:57] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-29 11:50:57] [INFO ] Invariant cache hit.
[2024-05-29 11:50:57] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2024-05-29 11:50:57] [INFO ] Invariant cache hit.
[2024-05-29 11:50:58] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 271/280 places, 243/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 574 ms. Remains : 271/280 places, 243/252 transitions.
Stuttering acceptance computed with spot in 400 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p4))), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p2) (NOT p4)), true, (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p2) (NOT p4)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(NOT p2), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p4) p3), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p4) (NOT p3)), acceptance={0} source=5 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p4)), acceptance={} source=6 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p4)), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p2) (NOT p4)), acceptance={0} source=7 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p1:(EQ s270 1), p0:(EQ s115 1), p2:(OR (EQ s194 1) (NOT (AND (EQ s98 1) (EQ s192 1)))), p4:(AND (EQ s154 1) (EQ s179 1) (EQ s194 1)), p3:(AND (EQ s154 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, null, null, null][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 ShieldPPPt-PT-004B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-03 finished in 1001 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0&&X(X(G(p1)))) U G(p2)))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 272 transition count 244
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 272 transition count 244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 271 transition count 243
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 271 transition count 243
Applied a total of 18 rules in 15 ms. Remains 271 /280 variables (removed 9) and now considering 243/252 (removed 9) transitions.
// Phase 1: matrix 243 rows 271 cols
[2024-05-29 11:50:58] [INFO ] Computed 45 invariants in 4 ms
[2024-05-29 11:50:58] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-29 11:50:58] [INFO ] Invariant cache hit.
[2024-05-29 11:50:58] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2024-05-29 11:50:58] [INFO ] Invariant cache hit.
[2024-05-29 11:50:59] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 271/280 places, 243/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 449 ms. Remains : 271/280 places, 243/252 transitions.
Stuttering acceptance computed with spot in 338 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p1), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p2 p0), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 7}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 7}, { cond=p2, acceptance={} source=6 dest: 8}], [{ cond=(NOT p1), acceptance={} source=7 dest: 3}, { cond=p1, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=8 dest: 7}, { cond=(AND p2 p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(AND (EQ s152 1) (EQ s184 1)), p0:(NEQ s140 1), p1:(NEQ s72 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 479 steps with 0 reset in 2 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-04 finished in 814 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 279 transition count 192
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 120 place count 220 transition count 190
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 123 place count 219 transition count 188
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 125 place count 217 transition count 188
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 26 Pre rules applied. Total rules applied 125 place count 217 transition count 162
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 177 place count 191 transition count 162
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 184 place count 184 transition count 155
Iterating global reduction 4 with 7 rules applied. Total rules applied 191 place count 184 transition count 155
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 191 place count 184 transition count 150
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 201 place count 179 transition count 150
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 325 place count 117 transition count 88
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 347 place count 106 transition count 88
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 349 place count 104 transition count 86
Applied a total of 349 rules in 35 ms. Remains 104 /280 variables (removed 176) and now considering 86/252 (removed 166) transitions.
// Phase 1: matrix 86 rows 104 cols
[2024-05-29 11:50:59] [INFO ] Computed 45 invariants in 1 ms
[2024-05-29 11:50:59] [INFO ] Implicit Places using invariants in 61 ms returned [96]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/280 places, 86/252 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 103 transition count 84
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 101 transition count 84
Applied a total of 4 rules in 3 ms. Remains 101 /103 variables (removed 2) and now considering 84/86 (removed 2) transitions.
// Phase 1: matrix 84 rows 101 cols
[2024-05-29 11:50:59] [INFO ] Computed 44 invariants in 1 ms
[2024-05-29 11:50:59] [INFO ] Implicit Places using invariants in 67 ms returned [83, 87]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 69 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/280 places, 84/252 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 97 transition count 82
Applied a total of 4 rules in 3 ms. Remains 97 /99 variables (removed 2) and now considering 82/84 (removed 2) transitions.
// Phase 1: matrix 82 rows 97 cols
[2024-05-29 11:50:59] [INFO ] Computed 42 invariants in 0 ms
[2024-05-29 11:50:59] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-29 11:50:59] [INFO ] Invariant cache hit.
[2024-05-29 11:50:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 11:50:59] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 97/280 places, 82/252 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 334 ms. Remains : 97/280 places, 82/252 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s73 0) (EQ s90 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 209 ms.
Stack based approach found an accepted trace after 14 steps with 1 reset with depth 13 and stack size 12 in 0 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-05 finished in 634 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&X(G(p1)))))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 270 transition count 242
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 270 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 269 transition count 241
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 269 transition count 241
Applied a total of 22 rules in 13 ms. Remains 269 /280 variables (removed 11) and now considering 241/252 (removed 11) transitions.
// Phase 1: matrix 241 rows 269 cols
[2024-05-29 11:51:00] [INFO ] Computed 45 invariants in 4 ms
[2024-05-29 11:51:00] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-29 11:51:00] [INFO ] Invariant cache hit.
[2024-05-29 11:51:00] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2024-05-29 11:51:00] [INFO ] Invariant cache hit.
[2024-05-29 11:51:00] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 269/280 places, 241/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 453 ms. Remains : 269/280 places, 241/252 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s145 1), p1:(EQ s218 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-06 finished in 592 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(G(p1)))))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 271 transition count 243
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 271 transition count 243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 270 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 270 transition count 242
Applied a total of 20 rules in 18 ms. Remains 270 /280 variables (removed 10) and now considering 242/252 (removed 10) transitions.
// Phase 1: matrix 242 rows 270 cols
[2024-05-29 11:51:00] [INFO ] Computed 45 invariants in 3 ms
[2024-05-29 11:51:00] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-29 11:51:00] [INFO ] Invariant cache hit.
[2024-05-29 11:51:01] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
[2024-05-29 11:51:01] [INFO ] Invariant cache hit.
[2024-05-29 11:51:01] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 270/280 places, 242/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 598 ms. Remains : 270/280 places, 242/252 transitions.
Stuttering acceptance computed with spot in 152 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s194 1), p1:(EQ s124 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-08 finished in 764 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 270 transition count 242
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 270 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 269 transition count 241
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 269 transition count 241
Applied a total of 22 rules in 12 ms. Remains 269 /280 variables (removed 11) and now considering 241/252 (removed 11) transitions.
// Phase 1: matrix 241 rows 269 cols
[2024-05-29 11:51:01] [INFO ] Computed 45 invariants in 4 ms
[2024-05-29 11:51:01] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-29 11:51:01] [INFO ] Invariant cache hit.
[2024-05-29 11:51:01] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2024-05-29 11:51:01] [INFO ] Invariant cache hit.
[2024-05-29 11:51:01] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 269/280 places, 241/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 451 ms. Remains : 269/280 places, 241/252 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s99 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 449 reset in 232 ms.
Stack based approach found an accepted trace after 810 steps with 3 reset with depth 118 and stack size 118 in 3 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-09 finished in 818 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||G(p1)))))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 270 transition count 242
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 270 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 269 transition count 241
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 269 transition count 241
Applied a total of 22 rules in 16 ms. Remains 269 /280 variables (removed 11) and now considering 241/252 (removed 11) transitions.
[2024-05-29 11:51:02] [INFO ] Invariant cache hit.
[2024-05-29 11:51:02] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-29 11:51:02] [INFO ] Invariant cache hit.
[2024-05-29 11:51:02] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2024-05-29 11:51:02] [INFO ] Invariant cache hit.
[2024-05-29 11:51:02] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 269/280 places, 241/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 466 ms. Remains : 269/280 places, 241/252 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s207 0), p1:(EQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 176 ms.
Product exploration explored 100000 steps with 33333 reset in 178 ms.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Detected a total of 62/269 stabilizing places and 62/241 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 20 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-004B-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-004B-LTLFireability-10 finished in 1025 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G((G(p0)||X(p1))) U p2)||G(!p1)))'
Support contains 3 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 271 transition count 243
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 271 transition count 243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 270 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 270 transition count 242
Applied a total of 20 rules in 13 ms. Remains 270 /280 variables (removed 10) and now considering 242/252 (removed 10) transitions.
// Phase 1: matrix 242 rows 270 cols
[2024-05-29 11:51:03] [INFO ] Computed 45 invariants in 2 ms
[2024-05-29 11:51:03] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-29 11:51:03] [INFO ] Invariant cache hit.
[2024-05-29 11:51:03] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2024-05-29 11:51:03] [INFO ] Invariant cache hit.
[2024-05-29 11:51:03] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 270/280 places, 242/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 446 ms. Remains : 270/280 places, 242/252 transitions.
Stuttering acceptance computed with spot in 389 ms :[(AND p1 (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p2), false, false, false, (AND (NOT p1) (NOT p0)), true, p1, (AND p1 (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 6}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=0 dest: 7}], [{ cond=(NOT p1), acceptance={} source=1 dest: 8}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(NOT p2), acceptance={0} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 7}], [{ cond=(NOT p1), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND p0 p1), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 9}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 10}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=p1, acceptance={} source=9 dest: 8}, { cond=(NOT p1), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p0) p1), acceptance={} source=10 dest: 8}, { cond=(AND p0 p1), acceptance={} source=10 dest: 10}]], initial=0, aps=[p2:(EQ s7 1), p1:(NEQ s253 1), p0:(EQ s112 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, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 59 steps with 19 reset in 0 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-11 finished in 856 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(p1 U (p1&&G((!p2||X(X(G(p1)))))))))'
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 271 transition count 243
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 271 transition count 243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 270 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 270 transition count 242
Applied a total of 20 rules in 22 ms. Remains 270 /280 variables (removed 10) and now considering 242/252 (removed 10) transitions.
// Phase 1: matrix 242 rows 270 cols
[2024-05-29 11:51:04] [INFO ] Computed 45 invariants in 1 ms
[2024-05-29 11:51:04] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-29 11:51:04] [INFO ] Invariant cache hit.
[2024-05-29 11:51:04] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2024-05-29 11:51:04] [INFO ] Invariant cache hit.
[2024-05-29 11:51:04] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 270/280 places, 242/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 437 ms. Remains : 270/280 places, 242/252 transitions.
Stuttering acceptance computed with spot in 372 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1)), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 4}, { cond=(AND p2 p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 9}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 7}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 7}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 9}], [{ cond=p2, acceptance={} source=6 dest: 3}, { cond=(NOT p2), acceptance={} source=6 dest: 6}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 7}, { cond=(AND p2 p1), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p2) p1), acceptance={} source=8 dest: 7}, { cond=(AND p2 p1), acceptance={} source=8 dest: 8}, { cond=(NOT p1), acceptance={} source=8 dest: 9}], [{ cond=(NOT p1), acceptance={} source=9 dest: 0}, { cond=p1, acceptance={} source=9 dest: 9}]], initial=2, aps=[p0:(AND (EQ s151 1) (EQ s183 1)), p1:(NEQ s113 1), p2:(AND (EQ s83 1) (EQ s121 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 196 ms.
Product exploration explored 100000 steps with 0 reset in 250 ms.
Computed a total of 63 stabilizing places and 63 stable transitions
Computed a total of 63 stabilizing places and 63 stable transitions
Detected a total of 63/270 stabilizing places and 63/242 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (AND (NOT p2) p1 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT p2))), true, (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 220 ms. Reduced automaton from 10 states, 24 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[true, (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 6) seen :5
Finished Best-First random walk after 2625 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=525 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (AND (NOT p2) p1 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT p2))), true, (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p1) p2)), (F p2), (F (AND (NOT p1) (NOT p2))), (F (NOT p1)), (F (NOT (AND p1 (NOT p2)))), (F (AND p1 p2))]
Knowledge based reduction with 15 factoid took 489 ms. Reduced automaton from 8 states, 15 edges and 2 AP (stutter sensitive) to 8 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[true, (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 265 ms :[true, (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Support contains 3 out of 270 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 242/242 transitions.
Applied a total of 0 rules in 8 ms. Remains 270 /270 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-29 11:51:07] [INFO ] Invariant cache hit.
[2024-05-29 11:51:07] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-29 11:51:07] [INFO ] Invariant cache hit.
[2024-05-29 11:51:07] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2024-05-29 11:51:07] [INFO ] Invariant cache hit.
[2024-05-29 11:51:07] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 458 ms. Remains : 270/270 places, 242/242 transitions.
Computed a total of 63 stabilizing places and 63 stable transitions
Computed a total of 63 stabilizing places and 63 stable transitions
Detected a total of 63/270 stabilizing places and 63/242 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 112 ms. Reduced automaton from 8 states, 15 edges and 2 AP (stutter sensitive) to 8 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[true, (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :5
Finished Best-First random walk after 3171 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=528 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p2)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p1) p2)), (F p2), (F (AND (NOT p1) (NOT p2))), (F (NOT p1)), (F (NOT (AND p1 (NOT p2)))), (F (AND p1 p2))]
Knowledge based reduction with 6 factoid took 279 ms. Reduced automaton from 8 states, 15 edges and 2 AP (stutter sensitive) to 8 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[true, (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 279 ms :[true, (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 284 ms :[true, (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 0 reset in 211 ms.
Product exploration explored 100000 steps with 0 reset in 406 ms.
Applying partial POR strategy [true, true, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 269 ms :[true, (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Support contains 3 out of 270 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 270/270 places, 242/242 transitions.
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 270 transition count 242
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 19 Pre rules applied. Total rules applied 55 place count 270 transition count 257
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 74 place count 270 transition count 257
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 151 places in 0 ms
Iterating global reduction 1 with 77 rules applied. Total rules applied 151 place count 270 transition count 258
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 152 place count 270 transition count 257
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 182 place count 240 transition count 226
Deduced a syphon composed of 121 places in 0 ms
Iterating global reduction 2 with 30 rules applied. Total rules applied 212 place count 240 transition count 226
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 122 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 213 place count 240 transition count 226
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 215 place count 238 transition count 224
Deduced a syphon composed of 120 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 217 place count 238 transition count 224
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 134 places in 0 ms
Iterating global reduction 2 with 14 rules applied. Total rules applied 231 place count 238 transition count 283
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 245 place count 224 transition count 255
Deduced a syphon composed of 120 places in 0 ms
Iterating global reduction 2 with 14 rules applied. Total rules applied 259 place count 224 transition count 255
Deduced a syphon composed of 120 places in 0 ms
Applied a total of 259 rules in 67 ms. Remains 224 /270 variables (removed 46) and now considering 255/242 (removed -13) transitions.
[2024-05-29 11:51:10] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 255 rows 224 cols
[2024-05-29 11:51:10] [INFO ] Computed 45 invariants in 2 ms
[2024-05-29 11:51:10] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 224/270 places, 255/242 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 231 ms. Remains : 224/270 places, 255/242 transitions.
Built C files in :
/tmp/ltsmin4821655012142674881
[2024-05-29 11:51:10] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4821655012142674881
Running compilation step : cd /tmp/ltsmin4821655012142674881;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 363 ms.
Running link step : cd /tmp/ltsmin4821655012142674881;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin4821655012142674881;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10555859809979982568.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 242/242 transitions.
Applied a total of 0 rules in 8 ms. Remains 270 /270 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 270 cols
[2024-05-29 11:51:25] [INFO ] Computed 45 invariants in 2 ms
[2024-05-29 11:51:25] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-29 11:51:25] [INFO ] Invariant cache hit.
[2024-05-29 11:51:25] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2024-05-29 11:51:25] [INFO ] Invariant cache hit.
[2024-05-29 11:51:25] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 426 ms. Remains : 270/270 places, 242/242 transitions.
Built C files in :
/tmp/ltsmin1725177733929818712
[2024-05-29 11:51:26] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1725177733929818712
Running compilation step : cd /tmp/ltsmin1725177733929818712;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 357 ms.
Running link step : cd /tmp/ltsmin1725177733929818712;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin1725177733929818712;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15993624311237951258.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 11:51:41] [INFO ] Flatten gal took : 12 ms
[2024-05-29 11:51:41] [INFO ] Flatten gal took : 11 ms
[2024-05-29 11:51:41] [INFO ] Time to serialize gal into /tmp/LTL13159141943718268849.gal : 6 ms
[2024-05-29 11:51:41] [INFO ] Time to serialize properties into /tmp/LTL11215126617869544754.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13159141943718268849.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10085728043667917004.hoa' '-atoms' '/tmp/LTL11215126617869544754.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL11215126617869544754.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10085728043667917004.hoa
Detected timeout of ITS tools.
[2024-05-29 11:51:56] [INFO ] Flatten gal took : 11 ms
[2024-05-29 11:51:56] [INFO ] Flatten gal took : 11 ms
[2024-05-29 11:51:56] [INFO ] Time to serialize gal into /tmp/LTL17371211868920290118.gal : 3 ms
[2024-05-29 11:51:56] [INFO ] Time to serialize properties into /tmp/LTL2650331350250554818.ltl : 7 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17371211868920290118.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2650331350250554818.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X("((p172==1)&&(p208==1))"))||(("(p126!=1)")U(("(p126!=1)")&&(G((!("((p94==1)&&(p135==1))"))||(X(X(G("(p126!=1)"))))))))))
Formula 0 simplified : X!"((p172==1)&&(p208==1))" & (F("((p94==1)&&(p135==1))" & XXF!"(p126!=1)") W !"(p126!=1)")
Detected timeout of ITS tools.
[2024-05-29 11:52:11] [INFO ] Flatten gal took : 25 ms
[2024-05-29 11:52:11] [INFO ] Applying decomposition
[2024-05-29 11:52:11] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6964616207364785777.txt' '-o' '/tmp/graph6964616207364785777.bin' '-w' '/tmp/graph6964616207364785777.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6964616207364785777.bin' '-l' '-1' '-v' '-w' '/tmp/graph6964616207364785777.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:52:11] [INFO ] Decomposing Gal with order
[2024-05-29 11:52:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:52:11] [INFO ] Removed a total of 43 redundant transitions.
[2024-05-29 11:52:11] [INFO ] Flatten gal took : 67 ms
[2024-05-29 11:52:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2024-05-29 11:52:11] [INFO ] Time to serialize gal into /tmp/LTL16469940382813632894.gal : 11 ms
[2024-05-29 11:52:11] [INFO ] Time to serialize properties into /tmp/LTL15347967890187889668.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16469940382813632894.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15347967890187889668.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((X("((i9.i1.u57.p172==1)&&(i9.i2.u66.p208==1))"))||(("(i5.u41.p126!=1)")U(("(i5.u41.p126!=1)")&&(G((!("((i6.i1.u30.p94==1)&&(i7.i1....208
Formula 0 simplified : X!"((i9.i1.u57.p172==1)&&(i9.i2.u66.p208==1))" & (F("((i6.i1.u30.p94==1)&&(i7.i1.u42.p135==1))" & XXF!"(i5.u41.p126!=1)") W !"(i5.u4...167
Reverse transition relation is NOT exact ! Due to transitions t50, t56, t96, t99, t154, t195, t198, t231, t235, t244, i0.i0.u9.t200, i0.i1.t188, i0.i1.u13....977
Computing Next relation with stutter on 369558 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin401364245177587965
[2024-05-29 11:52:26] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin401364245177587965
Running compilation step : cd /tmp/ltsmin401364245177587965;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 330 ms.
Running link step : cd /tmp/ltsmin401364245177587965;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin401364245177587965;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X((LTLAPp0==true))||((LTLAPp1==true) U ((LTLAPp1==true)&&[]((!(LTLAPp2==true)||X(X([]((LTLAPp1==true)))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPt-PT-004B-LTLFireability-13 finished in 97651 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&(p1 U G(p2))))))'
Support contains 3 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 279 transition count 192
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 120 place count 220 transition count 190
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 122 place count 219 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 123 place count 218 transition count 189
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 26 Pre rules applied. Total rules applied 123 place count 218 transition count 163
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 175 place count 192 transition count 163
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 180 place count 187 transition count 158
Iterating global reduction 4 with 5 rules applied. Total rules applied 185 place count 187 transition count 158
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 185 place count 187 transition count 154
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 193 place count 183 transition count 154
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 4 with 130 rules applied. Total rules applied 323 place count 118 transition count 89
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 345 place count 107 transition count 89
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 347 place count 105 transition count 87
Applied a total of 347 rules in 32 ms. Remains 105 /280 variables (removed 175) and now considering 87/252 (removed 165) transitions.
// Phase 1: matrix 87 rows 105 cols
[2024-05-29 11:52:41] [INFO ] Computed 45 invariants in 1 ms
[2024-05-29 11:52:41] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-29 11:52:41] [INFO ] Invariant cache hit.
[2024-05-29 11:52:41] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 11:52:42] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2024-05-29 11:52:42] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 11:52:42] [INFO ] Invariant cache hit.
[2024-05-29 11:52:42] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/280 places, 87/252 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 307 ms. Remains : 105/280 places, 87/252 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p2 p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND p2 (NOT p1))), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s98 1), p2:(EQ s97 1), p1:(EQ s28 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 235 ms.
Stack based approach found an accepted trace after 62 steps with 0 reset with depth 63 and stack size 63 in 0 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-14 finished in 729 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(X(!p1)&&F((p2&&X((p2 U (!p3||G(p2)))))))||X(G(!p1)))))'
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 271 transition count 243
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 271 transition count 243
Applied a total of 18 rules in 5 ms. Remains 271 /280 variables (removed 9) and now considering 243/252 (removed 9) transitions.
// Phase 1: matrix 243 rows 271 cols
[2024-05-29 11:52:42] [INFO ] Computed 45 invariants in 1 ms
[2024-05-29 11:52:42] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-29 11:52:42] [INFO ] Invariant cache hit.
[2024-05-29 11:52:42] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2024-05-29 11:52:42] [INFO ] Invariant cache hit.
[2024-05-29 11:52:42] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 271/280 places, 243/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 457 ms. Remains : 271/280 places, 243/252 transitions.
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND p1 (NOT p2)), (AND (NOT p2) p1 p3), true, (NOT p2), (AND (NOT p2) p3)]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 6}, { cond=(AND p2 p1), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=4 dest: 3}, { cond=(AND p2 (NOT p1) p3), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=4 dest: 6}, { cond=(AND p2 p1 p3), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}, { cond=p2, acceptance={0} source=6 dest: 7}], [{ cond=(AND (NOT p2) p3), acceptance={0} source=7 dest: 6}, { cond=(AND p2 p3), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(EQ s55 0), p2:(EQ s251 1), p1:(EQ s245 1), p3:(AND (EQ s94 1) (EQ s112 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]]
Product exploration explored 100000 steps with 50000 reset in 221 ms.
Product exploration explored 100000 steps with 50000 reset in 215 ms.
Computed a total of 64 stabilizing places and 64 stable transitions
Computed a total of 64 stabilizing places and 64 stable transitions
Detected a total of 64/271 stabilizing places and 64/243 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X p0), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 p3)))), (X (X (NOT (AND p2 (NOT p1) p3)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 p1 p3)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p1) p3)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 23 ms. Reduced automaton from 8 states, 18 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-004B-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-004B-LTLFireability-15 finished in 1201 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(p1 U (p1&&G((!p2||X(X(G(p1)))))))))'
[2024-05-29 11:52:43] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14680796181831461498
[2024-05-29 11:52:43] [INFO ] Computing symmetric may disable matrix : 252 transitions.
[2024-05-29 11:52:43] [INFO ] Applying decomposition
[2024-05-29 11:52:43] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:52:43] [INFO ] Computing symmetric may enable matrix : 252 transitions.
[2024-05-29 11:52:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:52:43] [INFO ] Flatten gal took : 12 ms
[2024-05-29 11:52:43] [INFO ] Computing Do-Not-Accords matrix : 252 transitions.
[2024-05-29 11:52:43] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:52:43] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14680796181831461498
Running compilation step : cd /tmp/ltsmin14680796181831461498;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3254204616875749195.txt' '-o' '/tmp/graph3254204616875749195.bin' '-w' '/tmp/graph3254204616875749195.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3254204616875749195.bin' '-l' '-1' '-v' '-w' '/tmp/graph3254204616875749195.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:52:43] [INFO ] Decomposing Gal with order
[2024-05-29 11:52:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:52:43] [INFO ] Removed a total of 35 redundant transitions.
[2024-05-29 11:52:43] [INFO ] Flatten gal took : 17 ms
[2024-05-29 11:52:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-29 11:52:43] [INFO ] Time to serialize gal into /tmp/LTLFireability4192735588615280932.gal : 4 ms
[2024-05-29 11:52:43] [INFO ] Time to serialize properties into /tmp/LTLFireability4053748560315560582.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4192735588615280932.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4053748560315560582.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X("((i9.i1.u59.p172==1)&&(i9.i2.u69.p208==1))"))||(("(i7.u36.p126!=1)")U(("(i7.u36.p126!=1)")&&(G((!("((i5.i1.u29.p94==1)&&(i5.i3....208
Formula 0 simplified : X!"((i9.i1.u59.p172==1)&&(i9.i2.u69.p208==1))" & (F("((i5.i1.u29.p94==1)&&(i5.i3.u42.p135==1))" & XXF!"(i7.u36.p126!=1)") W !"(i7.u3...167
Compilation finished in 474 ms.
Running link step : cd /tmp/ltsmin14680796181831461498;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin14680796181831461498;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X((LTLAPp0==true))||((LTLAPp1==true) U ((LTLAPp1==true)&&[]((!(LTLAPp2==true)||X(X([]((LTLAPp1==true)))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t50, t53, t96, t99, t148, t151, t201, t231, t234, t235, t242, t243, t244, i0.t226, i0.i1.u63....1147
Computing Next relation with stutter on 369558 deadlock states
8 unique states visited
8 strongly connected components in search stack
8 transitions explored
8 items max in DFS search stack
9008 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,90.1226,1360500,1,0,2.39761e+06,540,3670,5.25059e+06,272,2073,1874572
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-004B-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 376770 ms.

BK_STOP 1716983793132

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="ShieldPPPt-PT-004B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is ShieldPPPt-PT-004B, 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 r373-tall-171683789100368"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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