Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r007-oct2-167813595700532.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is AutonomousCar-PT-01a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-oct2-167813595700532
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 5.6K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 12:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 12:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 12:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 12:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 12:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 11K Mar 5 18:22 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 AutonomousCar-PT-01a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678351086841

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-01a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 08:38:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 08:38:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 08:38:10] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2023-03-09 08:38:10] [INFO ] Transformed 25 places.
[2023-03-09 08:38:10] [INFO ] Transformed 35 transitions.
[2023-03-09 08:38:10] [INFO ] Found NUPN structural information;
[2023-03-09 08:38:10] [INFO ] Parsed PT model containing 25 places and 35 transitions and 143 arcs in 139 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 6 formulas.
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
FORMULA AutonomousCar-PT-01a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01a-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01a-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01a-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01a-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-01a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 26/26 transitions.
Applied a total of 0 rules in 18 ms. Remains 25 /25 variables (removed 0) and now considering 26/26 (removed 0) transitions.
[2023-03-09 08:38:10] [INFO ] Flow matrix only has 25 transitions (discarded 1 similar events)
// Phase 1: matrix 25 rows 25 cols
[2023-03-09 08:38:10] [INFO ] Computed 6 place invariants in 8 ms
[2023-03-09 08:38:10] [INFO ] Implicit Places using invariants in 392 ms returned []
[2023-03-09 08:38:10] [INFO ] Flow matrix only has 25 transitions (discarded 1 similar events)
[2023-03-09 08:38:10] [INFO ] Invariant cache hit.
[2023-03-09 08:38:11] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-09 08:38:11] [INFO ] Implicit Places using invariants and state equation in 147 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 634 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/25 places, 26/26 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 26/26 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 665 ms. Remains : 24/25 places, 26/26 transitions.
Support contains 17 out of 24 places after structural reductions.
[2023-03-09 08:38:11] [INFO ] Flatten gal took : 32 ms
[2023-03-09 08:38:11] [INFO ] Flatten gal took : 7 ms
[2023-03-09 08:38:11] [INFO ] Input system was already deterministic with 26 transitions.
Finished random walk after 156 steps, including 14 resets, run visited all 15 properties in 59 ms. (steps per millisecond=2 )
FORMULA AutonomousCar-PT-01a-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 3 stabilizing places and 2 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X((X(p1) U ((X(p1)&&(p1 U (p2||G(p1))))||X(G(p1))))))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 26/26 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 22 transition count 23
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 22 transition count 23
Applied a total of 4 rules in 5 ms. Remains 22 /24 variables (removed 2) and now considering 23/26 (removed 3) transitions.
// Phase 1: matrix 23 rows 22 cols
[2023-03-09 08:38:12] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 08:38:12] [INFO ] Implicit Places using invariants in 56 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 59 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 23/26 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 23/23 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66 ms. Remains : 21/24 places, 23/26 transitions.
Stuttering acceptance computed with spot in 742 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-01a-LTLFireability-00 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) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 5}]], initial=0, aps=[p0:(EQ s14 1), p2:(AND (NOT (AND (EQ s17 1) (EQ s19 1))) (NEQ s0 1)), p1:(NEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 274 ms.
Product exploration explored 100000 steps with 25000 reset in 207 ms.
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/21 stabilizing places and 2/23 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 432 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 554 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1))]
Finished random walk after 40 steps, including 4 resets, run visited all 4 properties in 5 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (F (AND (NOT p2) p1 (NOT p0))), (F p0)]
Knowledge based reduction with 6 factoid took 548 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 449 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 453 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1))]
// Phase 1: matrix 23 rows 21 cols
[2023-03-09 08:38:15] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-09 08:38:15] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 08:38:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:38:15] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-09 08:38:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:38:16] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-09 08:38:16] [INFO ] Computed and/alt/rep : 22/65/22 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-09 08:38:16] [INFO ] Added : 0 causal constraints over 0 iterations in 20 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 23/23 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2023-03-09 08:38:16] [INFO ] Invariant cache hit.
[2023-03-09 08:38:16] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-09 08:38:16] [INFO ] Invariant cache hit.
[2023-03-09 08:38:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:38:16] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2023-03-09 08:38:16] [INFO ] Invariant cache hit.
[2023-03-09 08:38:16] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 192 ms. Remains : 21/21 places, 23/23 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/21 stabilizing places and 2/23 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 384 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 480 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1))]
Finished random walk after 24 steps, including 1 resets, run visited all 4 properties in 3 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (F (AND (NOT p2) p1 (NOT p0))), (F p0)]
Knowledge based reduction with 5 factoid took 596 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 639 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 591 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1))]
[2023-03-09 08:38:19] [INFO ] Invariant cache hit.
[2023-03-09 08:38:19] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 08:38:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:38:19] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2023-03-09 08:38:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:38:19] [INFO ] [Real]Added 1 Read/Feed constraints in 11 ms returned sat
[2023-03-09 08:38:19] [INFO ] Computed and/alt/rep : 22/65/22 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-09 08:38:19] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 618 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 172 ms.
Product exploration explored 100000 steps with 25000 reset in 180 ms.
Applying partial POR strategy [false, false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 510 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 23/23 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 21 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 21 transition count 25
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 4 rules in 20 ms. Remains 21 /21 variables (removed 0) and now considering 25/23 (removed -2) transitions.
[2023-03-09 08:38:20] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 25 rows 21 cols
[2023-03-09 08:38:20] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-09 08:38:20] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/21 places, 25/23 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106 ms. Remains : 21/21 places, 25/23 transitions.
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 23/23 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 21 cols
[2023-03-09 08:38:20] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-09 08:38:21] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-09 08:38:21] [INFO ] Invariant cache hit.
[2023-03-09 08:38:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:38:21] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2023-03-09 08:38:21] [INFO ] Invariant cache hit.
[2023-03-09 08:38:21] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 193 ms. Remains : 21/21 places, 23/23 transitions.
Treatment of property AutonomousCar-PT-01a-LTLFireability-00 finished in 9322 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(p1))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 26/26 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 22 transition count 23
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 22 transition count 23
Applied a total of 4 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 23/26 (removed 3) transitions.
// Phase 1: matrix 23 rows 22 cols
[2023-03-09 08:38:21] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-09 08:38:21] [INFO ] Implicit Places using invariants in 45 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 57 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 23/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 23/23 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59 ms. Remains : 21/24 places, 23/26 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-01a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s16 1)), p1:(EQ s13 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 144 ms.
Product exploration explored 100000 steps with 50000 reset in 77 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-01a-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-01a-LTLFireability-02 finished in 539 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(X((!p1||G(p0)))&&F((!p1&&X((!p1 U (p2||G(!p1))))))))))'
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 26/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 26/26 (removed 0) transitions.
[2023-03-09 08:38:21] [INFO ] Flow matrix only has 25 transitions (discarded 1 similar events)
// Phase 1: matrix 25 rows 24 cols
[2023-03-09 08:38:21] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 08:38:21] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-09 08:38:21] [INFO ] Flow matrix only has 25 transitions (discarded 1 similar events)
[2023-03-09 08:38:21] [INFO ] Invariant cache hit.
[2023-03-09 08:38:22] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-09 08:38:22] [INFO ] Implicit Places using invariants and state equation in 126 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 224 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/24 places, 26/26 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 26/26 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 225 ms. Remains : 23/24 places, 26/26 transitions.
Stuttering acceptance computed with spot in 472 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) (NOT p2)), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-01a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s16 1), p0:(NEQ s13 1), p2:(AND (EQ s1 1) (EQ s2 1) (EQ s7 1) (EQ s17 1))], nbAcceptance=2, 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 13 reset in 142 ms.
Product exploration explored 100000 steps with 2 reset in 130 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND (NOT p1) p0)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 1333 ms. Reduced automaton from 6 states, 21 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 829 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10000 steps, including 378 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 379 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 08:38:24] [INFO ] Flow matrix only has 25 transitions (discarded 1 similar events)
// Phase 1: matrix 25 rows 23 cols
[2023-03-09 08:38:24] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-09 08:38:24] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 08:38:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 08:38:24] [INFO ] After 65ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND (NOT p1) p0)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND (NOT p2) (NOT p0) p1))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p2) p0 (NOT p1)))), (F (AND (NOT p2) p0 p1)), (F (AND (NOT p2) (NOT p0) (NOT p1)))]
Knowledge based reduction with 20 factoid took 1453 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Support contains 6 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 26/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 26/26 (removed 0) transitions.
[2023-03-09 08:38:26] [INFO ] Flow matrix only has 25 transitions (discarded 1 similar events)
[2023-03-09 08:38:26] [INFO ] Invariant cache hit.
[2023-03-09 08:38:26] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-09 08:38:26] [INFO ] Flow matrix only has 25 transitions (discarded 1 similar events)
[2023-03-09 08:38:26] [INFO ] Invariant cache hit.
[2023-03-09 08:38:27] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-09 08:38:27] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
[2023-03-09 08:38:27] [INFO ] Flow matrix only has 25 transitions (discarded 1 similar events)
[2023-03-09 08:38:27] [INFO ] Invariant cache hit.
[2023-03-09 08:38:27] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 533 ms. Remains : 23/23 places, 26/26 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0 (NOT p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p0 (NOT p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 555 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Finished random walk after 19 steps, including 2 resets, run visited all 6 properties in 3 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0 (NOT p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p0 (NOT p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (AND (NOT p2) p0 (NOT p1)))), (F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 10 factoid took 869 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 298 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Product exploration explored 100000 steps with 2 reset in 129 ms.
Product exploration explored 100000 steps with 0 reset in 89 ms.
Support contains 6 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 26/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 26/26 (removed 0) transitions.
[2023-03-09 08:38:30] [INFO ] Flow matrix only has 25 transitions (discarded 1 similar events)
[2023-03-09 08:38:30] [INFO ] Invariant cache hit.
[2023-03-09 08:38:30] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-09 08:38:30] [INFO ] Flow matrix only has 25 transitions (discarded 1 similar events)
[2023-03-09 08:38:30] [INFO ] Invariant cache hit.
[2023-03-09 08:38:30] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-09 08:38:30] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2023-03-09 08:38:30] [INFO ] Flow matrix only has 25 transitions (discarded 1 similar events)
[2023-03-09 08:38:30] [INFO ] Invariant cache hit.
[2023-03-09 08:38:30] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 196 ms. Remains : 23/23 places, 26/26 transitions.
Treatment of property AutonomousCar-PT-01a-LTLFireability-03 finished in 8515 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&((F(p1) U X(p2)) U (p3&&F(!p2))))))'
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 26/26 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 22 transition count 23
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 22 transition count 23
Applied a total of 4 rules in 3 ms. Remains 22 /24 variables (removed 2) and now considering 23/26 (removed 3) transitions.
// Phase 1: matrix 23 rows 22 cols
[2023-03-09 08:38:30] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-09 08:38:30] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-09 08:38:30] [INFO ] Invariant cache hit.
[2023-03-09 08:38:30] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-09 08:38:30] [INFO ] Implicit Places using invariants and state equation in 66 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 120 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 23/26 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 23/23 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 125 ms. Remains : 21/24 places, 23/26 transitions.
Stuttering acceptance computed with spot in 532 ms :[(OR (NOT p0) (NOT p3) p2), (OR (NOT p0) (NOT p3) p2), true, (OR (NOT p3) p2), (AND (NOT p1) (NOT p2)), (NOT p2), p2, (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-01a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p3)), acceptance={} source=1 dest: 5}, { cond=(AND p0 p3 p2), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 5}, { cond=(AND p3 p2), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(NOT p2), acceptance={} source=5 dest: 5}], [{ cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s4 0) (EQ s16 0) (EQ s20 0)), p3:(EQ s13 1), p1:(AND (EQ s1 1) (EQ s4 1) (EQ s16 1) (EQ s20 1)), p2:(EQ s9 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01a-LTLFireability-10 finished in 709 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 26/26 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 24 transition count 23
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 21 transition count 23
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 21 transition count 22
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 20 transition count 22
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 19 transition count 21
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 19 transition count 21
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 2 with 2 rules applied. Total rules applied 12 place count 18 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 17 transition count 20
Applied a total of 14 rules in 10 ms. Remains 17 /24 variables (removed 7) and now considering 20/26 (removed 6) transitions.
// Phase 1: matrix 20 rows 17 cols
[2023-03-09 08:38:31] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-09 08:38:31] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-09 08:38:31] [INFO ] Invariant cache hit.
[2023-03-09 08:38:31] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-09 08:38:31] [INFO ] Implicit Places using invariants and state equation in 67 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 120 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/24 places, 20/26 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 132 ms. Remains : 16/24 places, 20/26 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s2 1) (EQ s6 1) (EQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01a-LTLFireability-12 finished in 221 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 26/26 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 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 23 transition count 25
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 23 transition count 23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 21 transition count 23
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 20 transition count 22
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 20 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 19 transition count 22
Applied a total of 10 rules in 11 ms. Remains 19 /24 variables (removed 5) and now considering 22/26 (removed 4) transitions.
// Phase 1: matrix 22 rows 19 cols
[2023-03-09 08:38:31] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 08:38:31] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-09 08:38:31] [INFO ] Invariant cache hit.
[2023-03-09 08:38:31] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-09 08:38:31] [INFO ] Implicit Places using invariants and state equation in 67 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 115 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/24 places, 22/26 transitions.
Applied a total of 0 rules in 3 ms. Remains 18 /18 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 129 ms. Remains : 18/24 places, 22/26 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-01a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s15 1)), p1:(OR (EQ s1 0) (EQ s2 0) (EQ s8 0) (EQ s14 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01a-LTLFireability-13 finished in 361 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(p1&&X(X(F(p0)))))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 26/26 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 22 transition count 23
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 22 transition count 23
Applied a total of 4 rules in 2 ms. Remains 22 /24 variables (removed 2) and now considering 23/26 (removed 3) transitions.
// Phase 1: matrix 23 rows 22 cols
[2023-03-09 08:38:31] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 08:38:31] [INFO ] Implicit Places using invariants in 52 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 23/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 23/23 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57 ms. Remains : 21/24 places, 23/26 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s14 1), p0:(EQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 13 steps with 1 reset in 0 ms.
FORMULA AutonomousCar-PT-01a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01a-LTLFireability-14 finished in 283 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((F(p1)&&p0) U G((p2 U X(p1))))&&G(p3))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 26/26 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 22 transition count 23
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 22 transition count 23
Applied a total of 4 rules in 2 ms. Remains 22 /24 variables (removed 2) and now considering 23/26 (removed 3) transitions.
[2023-03-09 08:38:31] [INFO ] Invariant cache hit.
[2023-03-09 08:38:31] [INFO ] Implicit Places using invariants in 56 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 23/26 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 23/23 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61 ms. Remains : 21/24 places, 23/26 transitions.
Stuttering acceptance computed with spot in 748 ms :[(OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), true, (NOT p1), (NOT p1), (NOT p3), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-01a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p3), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p3), acceptance={} source=1 dest: 4}, { cond=p3, acceptance={} source=1 dest: 5}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p2) p0 p3), acceptance={} source=1 dest: 7}, { cond=(AND p0 p3), acceptance={} source=1 dest: 8}, { cond=(AND p2 (NOT p0) p3), acceptance={} source=1 dest: 9}, { cond=(AND p2 p0 p3), acceptance={} source=1 dest: 10}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 9}], [{ cond=(NOT p3), acceptance={} source=5 dest: 2}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=7 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 8}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=7 dest: 9}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=7 dest: 10}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=8 dest: 3}, { cond=(NOT p0), acceptance={} source=8 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p2) p0), acceptance={0} source=8 dest: 7}, { cond=p0, acceptance={} source=8 dest: 8}, { cond=(AND p2 (NOT p0)), acceptance={} source=8 dest: 9}, { cond=(AND p2 p0), acceptance={0} source=8 dest: 10}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=9 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={0} source=9 dest: 9}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=10 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=10 dest: 6}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=10 dest: 7}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=10 dest: 9}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=10 dest: 10}]], initial=0, aps=[p3:(EQ s13 0), p2:(EQ s13 1), p0:(AND (EQ s7 1) (EQ s16 1)), p1:(EQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 1 reset in 0 ms.
FORMULA AutonomousCar-PT-01a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01a-LTLFireability-15 finished in 866 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X((X(p1) U ((X(p1)&&(p1 U (p2||G(p1))))||X(G(p1))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(X((!p1||G(p0)))&&F((!p1&&X((!p1 U (p2||G(!p1))))))))))'
Found a Shortening insensitive property : AutonomousCar-PT-01a-LTLFireability-03
Stuttering acceptance computed with spot in 365 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) (NOT p2)), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0) (NOT p2))]
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 24/24 places, 26/26 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 24 transition count 24
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 22 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 21 transition count 23
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 6 place count 21 transition count 22
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 8 place count 20 transition count 22
Applied a total of 8 rules in 5 ms. Remains 20 /24 variables (removed 4) and now considering 22/26 (removed 4) transitions.
[2023-03-09 08:38:33] [INFO ] Flow matrix only has 21 transitions (discarded 1 similar events)
// Phase 1: matrix 21 rows 20 cols
[2023-03-09 08:38:33] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 08:38:33] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-09 08:38:33] [INFO ] Flow matrix only has 21 transitions (discarded 1 similar events)
[2023-03-09 08:38:33] [INFO ] Invariant cache hit.
[2023-03-09 08:38:33] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 08:38:33] [INFO ] Implicit Places using invariants and state equation in 78 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 148 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 19/24 places, 22/26 transitions.
Applied a total of 0 rules in 5 ms. Remains 19 /19 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 158 ms. Remains : 19/24 places, 22/26 transitions.
Running random walk in product with property : AutonomousCar-PT-01a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s13 1), p0:(NEQ s11 1), p2:(AND (EQ s1 1) (EQ s2 1) (EQ s6 1) (EQ s14 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 92 ms.
Product exploration explored 100000 steps with 0 reset in 58 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND (NOT p1) p0)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 803 ms. Reduced automaton from 6 states, 21 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 1023 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 416 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 413 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 08:38:34] [INFO ] Flow matrix only has 21 transitions (discarded 1 similar events)
// Phase 1: matrix 21 rows 19 cols
[2023-03-09 08:38:34] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-09 08:38:34] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 08:38:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 08:38:34] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND (NOT p1) p0)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND (NOT p2) (NOT p0) p1))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p2) p0 (NOT p1)))), (F (AND (NOT p2) p0 p1)), (F (AND (NOT p2) (NOT p0) (NOT p1)))]
Knowledge based reduction with 20 factoid took 1181 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Support contains 6 out of 19 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-09 08:38:36] [INFO ] Flow matrix only has 21 transitions (discarded 1 similar events)
[2023-03-09 08:38:36] [INFO ] Invariant cache hit.
[2023-03-09 08:38:36] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-09 08:38:36] [INFO ] Flow matrix only has 21 transitions (discarded 1 similar events)
[2023-03-09 08:38:36] [INFO ] Invariant cache hit.
[2023-03-09 08:38:36] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-09 08:38:36] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2023-03-09 08:38:36] [INFO ] Flow matrix only has 21 transitions (discarded 1 similar events)
[2023-03-09 08:38:36] [INFO ] Invariant cache hit.
[2023-03-09 08:38:36] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 304 ms. Remains : 19/19 places, 22/22 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0 (NOT p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p0 (NOT p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 526 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Finished random walk after 22 steps, including 1 resets, run visited all 6 properties in 2 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0 (NOT p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p0 (NOT p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (AND (NOT p2) p0 (NOT p1)))), (F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 10 factoid took 830 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 285 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Product exploration explored 100000 steps with 5 reset in 189 ms.
Product exploration explored 100000 steps with 1 reset in 88 ms.
Support contains 6 out of 19 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-09 08:38:39] [INFO ] Flow matrix only has 21 transitions (discarded 1 similar events)
[2023-03-09 08:38:39] [INFO ] Invariant cache hit.
[2023-03-09 08:38:39] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-09 08:38:39] [INFO ] Flow matrix only has 21 transitions (discarded 1 similar events)
[2023-03-09 08:38:39] [INFO ] Invariant cache hit.
[2023-03-09 08:38:39] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-09 08:38:39] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2023-03-09 08:38:39] [INFO ] Flow matrix only has 21 transitions (discarded 1 similar events)
[2023-03-09 08:38:39] [INFO ] Invariant cache hit.
[2023-03-09 08:38:39] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 244 ms. Remains : 19/19 places, 22/22 transitions.
Treatment of property AutonomousCar-PT-01a-LTLFireability-03 finished in 6950 ms.
[2023-03-09 08:38:39] [INFO ] Flatten gal took : 19 ms
[2023-03-09 08:38:39] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-09 08:38:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 24 places, 26 transitions and 98 arcs took 0 ms.
Total runtime 29910 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT AutonomousCar-PT-01a
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
LTLFireability

FORMULA AutonomousCar-PT-01a-LTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutonomousCar-PT-01a-LTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678351120316

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 AutonomousCar-PT-01a-LTLFireability-00
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for AutonomousCar-PT-01a-LTLFireability-00
lola: result : true
lola: markings : 11
lola: fired transitions : 10
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 AutonomousCar-PT-01a-LTLFireability-03
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for AutonomousCar-PT-01a-LTLFireability-03
lola: result : true
lola: markings : 808
lola: fired transitions : 2412
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-01a-LTLFireability-00: LTL true LTL model checker
AutonomousCar-PT-01a-LTLFireability-03: LTL true LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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="AutonomousCar-PT-01a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is AutonomousCar-PT-01a, 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 r007-oct2-167813595700532"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-01a.tgz
mv AutonomousCar-PT-01a 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 ;