fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r009-oct2-167813598100563
Last Updated
May 14, 2023

About the Execution of LTSMin+red for AutonomousCar-PT-03a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
473.964 25898.00 49284.00 80.30 F?FTTFFFFFFFTTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r009-oct2-167813598100563.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 ltsminxred
Input is AutonomousCar-PT-03a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598100563
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 12:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 12:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 25 12:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 25 12:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 12:56 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 42K 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-03a-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-03a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678636738012

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-03a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 15:59:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 15:59:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 15:59:01] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2023-03-12 15:59:01] [INFO ] Transformed 41 places.
[2023-03-12 15:59:01] [INFO ] Transformed 121 transitions.
[2023-03-12 15:59:01] [INFO ] Found NUPN structural information;
[2023-03-12 15:59:01] [INFO ] Parsed PT model containing 41 places and 121 transitions and 745 arcs in 298 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
FORMULA AutonomousCar-PT-03a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 76/76 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 40 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 40 transition count 75
Applied a total of 2 rules in 34 ms. Remains 40 /41 variables (removed 1) and now considering 75/76 (removed 1) transitions.
// Phase 1: matrix 75 rows 40 cols
[2023-03-12 15:59:02] [INFO ] Computed 7 place invariants in 4 ms
[2023-03-12 15:59:02] [INFO ] Implicit Places using invariants in 274 ms returned []
[2023-03-12 15:59:02] [INFO ] Invariant cache hit.
[2023-03-12 15:59:02] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-12 15:59:02] [INFO ] Implicit Places using invariants and state equation in 210 ms returned [38]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 533 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 39/41 places, 75/76 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 568 ms. Remains : 39/41 places, 75/76 transitions.
Support contains 25 out of 39 places after structural reductions.
[2023-03-12 15:59:03] [INFO ] Flatten gal took : 32 ms
[2023-03-12 15:59:03] [INFO ] Flatten gal took : 11 ms
[2023-03-12 15:59:03] [INFO ] Input system was already deterministic with 75 transitions.
Support contains 24 out of 39 places (down from 25) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 590 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 19) seen :17
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 126 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 75 rows 39 cols
[2023-03-12 15:59:03] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-12 15:59:03] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 15:59:03] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-12 15:59:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-12 15:59:03] [INFO ] After 59ms 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.
FORMULA AutonomousCar-PT-03a-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 9 simplifications.
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' '!(((p0&&X(F(!p1))) U (p2&&X(X(X(p2))))))'
Support contains 5 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 75/75 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 36 transition count 63
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 36 transition count 63
Applied a total of 6 rules in 2 ms. Remains 36 /39 variables (removed 3) and now considering 63/75 (removed 12) transitions.
// Phase 1: matrix 63 rows 36 cols
[2023-03-12 15:59:03] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 15:59:04] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-12 15:59:04] [INFO ] Invariant cache hit.
[2023-03-12 15:59:04] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-12 15:59:04] [INFO ] Implicit Places using invariants and state equation in 293 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 382 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 35/39 places, 63/75 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 385 ms. Remains : 35/39 places, 63/75 transitions.
Stuttering acceptance computed with spot in 1486 ms :[(NOT p2), true, p1, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) p1), (NOT p2), (NOT p2), (NOT p2), (AND p1 (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND p1 (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p2 p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(OR (AND (NOT p2) p0) (AND p2 p1)), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 8}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 9}, { cond=(AND p2 p0), acceptance={} source=4 dest: 10}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 1}], [{ cond=p1, acceptance={} source=7 dest: 11}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p2) p0), acceptance={} source=8 dest: 12}, { cond=(AND p2 (NOT p0)), acceptance={} source=8 dest: 13}, { cond=(AND p2 p0), acceptance={} source=8 dest: 14}], [{ cond=true, acceptance={} source=9 dest: 15}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=10 dest: 15}, { cond=(AND p2 p1), acceptance={} source=10 dest: 16}, { cond=(AND (NOT p2) p0), acceptance={} source=10 dest: 17}, { cond=(AND p2 (NOT p0)), acceptance={} source=10 dest: 18}, { cond=(AND p2 p0), acceptance={} source=10 dest: 19}], [{ cond=(AND (NOT p2) p1), acceptance={} source=11 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={} source=12 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=12 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=12 dest: 2}], [{ cond=(NOT p2), acceptance={} source=13 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=14 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=14 dest: 7}, { cond=(AND (NOT p2) p0), acceptance={} source=14 dest: 8}], [{ cond=(NOT p2), acceptance={} source=15 dest: 6}], [{ cond=(AND (NOT p2) p1), acceptance={} source=16 dest: 11}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=17 dest: 6}, { cond=(AND (NOT p2) p0), acceptance={} source=17 dest: 12}], [{ cond=(NOT p2), acceptance={} source=18 dest: 15}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=19 dest: 15}, { cond=(AND (NOT p2) p0), acceptance={} source=19 dest: 17}]], initial=0, aps=[p2:(OR (EQ s27 0) (EQ s3 1)), p0:(EQ s1 1), p1:(OR (EQ s2 0) (EQ s28 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 444 ms.
Product exploration explored 100000 steps with 25000 reset in 249 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Detected a total of 3/35 stabilizing places and 2/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (OR (AND (NOT p2) p0) (AND p2 p1)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (AND p2 p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (OR (AND (NOT p2) p0) (AND p2 p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 1236 ms. Reduced automaton from 20 states, 41 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 289 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Finished random walk after 37 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (OR (AND (NOT p2) p0) (AND p2 p1)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (AND p2 p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (OR (AND (NOT p2) p0) (AND p2 p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 16 factoid took 1234 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 311 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 307 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Support contains 2 out of 35 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 35 cols
[2023-03-12 15:59:10] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 15:59:10] [INFO ] Implicit Places using invariants in 525 ms returned []
[2023-03-12 15:59:10] [INFO ] Invariant cache hit.
[2023-03-12 15:59:10] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-12 15:59:10] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 825 ms to find 0 implicit places.
[2023-03-12 15:59:10] [INFO ] Invariant cache hit.
[2023-03-12 15:59:10] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 942 ms. Remains : 35/35 places, 63/63 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 : [p2, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 270 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Finished random walk after 256 steps, including 11 resets, run visited all 1 properties in 4 ms. (steps per millisecond=64 )
Knowledge obtained : [p2, true]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 2 factoid took 157 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 309 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 271 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 256 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Product exploration explored 100000 steps with 25000 reset in 329 ms.
Product exploration explored 100000 steps with 25000 reset in 190 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 283 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Support contains 2 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 63/63 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 35 transition count 63
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 5 place count 35 transition count 65
Deduced a syphon composed of 6 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 35 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 35 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 34 transition count 64
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 34 transition count 64
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 9 rules in 26 ms. Remains 34 /35 variables (removed 1) and now considering 64/63 (removed -1) transitions.
[2023-03-12 15:59:13] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 64 rows 34 cols
[2023-03-12 15:59:13] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 15:59:13] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/35 places, 64/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 241 ms. Remains : 34/35 places, 64/63 transitions.
Support contains 2 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 35 cols
[2023-03-12 15:59:13] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 15:59:13] [INFO ] Implicit Places using invariants in 119 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 121 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 34/35 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 124 ms. Remains : 34/35 places, 63/63 transitions.
Treatment of property AutonomousCar-PT-03a-LTLCardinality-01 finished in 10014 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(p1))))'
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 75/75 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 36 transition count 63
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 36 transition count 63
Applied a total of 6 rules in 20 ms. Remains 36 /39 variables (removed 3) and now considering 63/75 (removed 12) transitions.
// Phase 1: matrix 63 rows 36 cols
[2023-03-12 15:59:13] [INFO ] Computed 6 place invariants in 4 ms
[2023-03-12 15:59:14] [INFO ] Implicit Places using invariants in 102 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 103 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 35/39 places, 63/75 transitions.
Applied a total of 0 rules in 0 ms. Remains 35 /35 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 124 ms. Remains : 35/39 places, 63/75 transitions.
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-03a-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s3 0) (EQ s31 1)), p0:(AND (EQ s11 0) (EQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLCardinality-02 finished in 380 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)))'
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 75/75 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 37 transition count 67
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 37 transition count 67
Applied a total of 4 rules in 1 ms. Remains 37 /39 variables (removed 2) and now considering 67/75 (removed 8) transitions.
// Phase 1: matrix 67 rows 37 cols
[2023-03-12 15:59:14] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 15:59:14] [INFO ] Implicit Places using invariants in 168 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 177 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 36/39 places, 67/75 transitions.
Applied a total of 0 rules in 1 ms. Remains 36 /36 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 179 ms. Remains : 36/39 places, 67/75 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s16 0) (EQ s28 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 143 ms.
Product exploration explored 100000 steps with 50000 reset in 116 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-03a-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-03a-LTLCardinality-03 finished in 692 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U p1))'
Support contains 3 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 75/75 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 37 transition count 67
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 37 transition count 67
Applied a total of 4 rules in 3 ms. Remains 37 /39 variables (removed 2) and now considering 67/75 (removed 8) transitions.
// Phase 1: matrix 67 rows 37 cols
[2023-03-12 15:59:15] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 15:59:15] [INFO ] Implicit Places using invariants in 150 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 152 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 36/39 places, 67/75 transitions.
Applied a total of 0 rules in 1 ms. Remains 36 /36 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 156 ms. Remains : 36/39 places, 67/75 transitions.
Stuttering acceptance computed with spot in 206 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-03a-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s35 1), p0:(OR (EQ s33 0) (EQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLCardinality-05 finished in 387 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)))'
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 75/75 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 37 transition count 70
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 33 transition count 70
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 11 place count 31 transition count 62
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 31 transition count 62
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 20 place count 27 transition count 59
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 27 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 22 place count 26 transition count 58
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 4 with 2 rules applied. Total rules applied 24 place count 25 transition count 58
Applied a total of 24 rules in 11 ms. Remains 25 /39 variables (removed 14) and now considering 58/75 (removed 17) transitions.
// Phase 1: matrix 58 rows 25 cols
[2023-03-12 15:59:15] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-12 15:59:15] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-12 15:59:15] [INFO ] Invariant cache hit.
[2023-03-12 15:59:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 15:59:15] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2023-03-12 15:59:15] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-12 15:59:15] [INFO ] Invariant cache hit.
[2023-03-12 15:59:15] [INFO ] Dead Transitions using invariants and state equation in 303 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/39 places, 58/75 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 562 ms. Remains : 25/39 places, 58/75 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLCardinality-06 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:(OR (EQ s10 0) (EQ s21 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]]
Stuttering criterion allowed to conclude after 197 steps with 19 reset in 1 ms.
FORMULA AutonomousCar-PT-03a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLCardinality-06 finished in 680 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 75/75 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 36 transition count 63
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 36 transition count 63
Applied a total of 6 rules in 2 ms. Remains 36 /39 variables (removed 3) and now considering 63/75 (removed 12) transitions.
// Phase 1: matrix 63 rows 36 cols
[2023-03-12 15:59:16] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 15:59:16] [INFO ] Implicit Places using invariants in 124 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 127 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 35/39 places, 63/75 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 130 ms. Remains : 35/39 places, 63/75 transitions.
Stuttering acceptance computed with spot in 277 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s21 0) (EQ s6 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLCardinality-07 finished in 430 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G(p1))))'
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 75/75 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 37 transition count 70
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 33 transition count 70
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 11 place count 31 transition count 62
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 31 transition count 62
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 20 place count 27 transition count 59
Applied a total of 20 rules in 27 ms. Remains 27 /39 variables (removed 12) and now considering 59/75 (removed 16) transitions.
// Phase 1: matrix 59 rows 27 cols
[2023-03-12 15:59:16] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-12 15:59:16] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-12 15:59:16] [INFO ] Invariant cache hit.
[2023-03-12 15:59:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:59:16] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2023-03-12 15:59:16] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 15:59:16] [INFO ] Invariant cache hit.
[2023-03-12 15:59:16] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/39 places, 59/75 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 375 ms. Remains : 27/39 places, 59/75 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s10 0) (EQ s20 1)), p1:(AND (EQ s20 0) (EQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 61 steps with 2 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLCardinality-09 finished in 492 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))'
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 75/75 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 36 transition count 63
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 36 transition count 63
Applied a total of 6 rules in 1 ms. Remains 36 /39 variables (removed 3) and now considering 63/75 (removed 12) transitions.
// Phase 1: matrix 63 rows 36 cols
[2023-03-12 15:59:16] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-12 15:59:17] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-12 15:59:17] [INFO ] Invariant cache hit.
[2023-03-12 15:59:17] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-12 15:59:17] [INFO ] Implicit Places using invariants and state equation in 120 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 181 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 35/39 places, 63/75 transitions.
Applied a total of 0 rules in 0 ms. Remains 35 /35 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 182 ms. Remains : 35/39 places, 63/75 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : AutonomousCar-PT-03a-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 145 ms.
Product exploration explored 100000 steps with 50000 reset in 146 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Detected a total of 3/35 stabilizing places and 2/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 102 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-03a-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-03a-LTLCardinality-12 finished in 728 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((p1 U (p2||G(p1)))||p0))))'
Support contains 5 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 75/75 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 36 transition count 63
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 36 transition count 63
Applied a total of 6 rules in 2 ms. Remains 36 /39 variables (removed 3) and now considering 63/75 (removed 12) transitions.
[2023-03-12 15:59:17] [INFO ] Invariant cache hit.
[2023-03-12 15:59:17] [INFO ] Implicit Places using invariants in 68 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 69 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 35/39 places, 63/75 transitions.
Applied a total of 0 rules in 0 ms. Remains 35 /35 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 71 ms. Remains : 35/39 places, 63/75 transitions.
Stuttering acceptance computed with spot in 178 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-03a-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(OR p0 p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(AND (NOT (OR (EQ s3 0) (EQ s2 1))) (NEQ s1 1)), p1:(NEQ s1 1), p0:(OR (EQ s18 0) (EQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 142 ms.
Product exploration explored 100000 steps with 0 reset in 121 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 p2) p1 p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (OR p0 p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (OR p0 p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 552 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Finished random walk after 319 steps, including 16 resets, run visited all 6 properties in 5 ms. (steps per millisecond=63 )
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (OR p0 p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (OR p0 p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (OR p0 p2))), (F (AND (NOT p1) (NOT p2))), (F p2), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 11 factoid took 664 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 276 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 331 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 5 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 35 cols
[2023-03-12 15:59:20] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-12 15:59:20] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-12 15:59:20] [INFO ] Invariant cache hit.
[2023-03-12 15:59:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:59:20] [INFO ] Implicit Places using invariants and state equation in 159 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 235 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 34/35 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 237 ms. Remains : 34/35 places, 63/63 transitions.
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 p1 (NOT p2) p0), (X (OR p0 p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT p2))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (OR p0 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 734 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Finished random walk after 187 steps, including 10 resets, run visited all 6 properties in 3 ms. (steps per millisecond=62 )
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (OR p0 p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT p2))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (OR p0 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (OR p0 p2))), (F (AND (NOT p1) (NOT p2))), (F p2), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 11 factoid took 805 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 229 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 200 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-03a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLCardinality-14 finished in 5311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X(F(!p1))) U (p2&&X(X(X(p2))))))'
[2023-03-12 15:59:23] [INFO ] Flatten gal took : 13 ms
[2023-03-12 15:59:23] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-12 15:59:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 39 places, 75 transitions and 433 arcs took 2 ms.
Total runtime 21610 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1303/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : AutonomousCar-PT-03a-LTLCardinality-01

BK_STOP 1678636763910

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name AutonomousCar-PT-03a-LTLCardinality-01
ltl formula formula --ltl=/tmp/1303/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 39 places, 75 transitions and 433 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.020 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1303/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1303/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1303/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1303/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 42 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x559ed58e23f4]
1: pnml2lts-mc(+0xa2496) [0x559ed58e2496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f448c24c140]
3: pnml2lts-mc(+0x405be5) [0x559ed5c45be5]
4: pnml2lts-mc(+0x16b3f9) [0x559ed59ab3f9]
5: pnml2lts-mc(+0x164ac4) [0x559ed59a4ac4]
6: pnml2lts-mc(+0x272e0a) [0x559ed5ab2e0a]
7: pnml2lts-mc(+0xb61f0) [0x559ed58f61f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f448c09f4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f448c09f67a]
10: pnml2lts-mc(+0xa1581) [0x559ed58e1581]
11: pnml2lts-mc(+0xa1910) [0x559ed58e1910]
12: pnml2lts-mc(+0xa32a2) [0x559ed58e32a2]
13: pnml2lts-mc(+0xa50f4) [0x559ed58e50f4]
14: pnml2lts-mc(+0xa516b) [0x559ed58e516b]
15: pnml2lts-mc(+0x3f34b3) [0x559ed5c334b3]
16: pnml2lts-mc(+0x7c63d) [0x559ed58bc63d]
17: pnml2lts-mc(+0x67d86) [0x559ed58a7d86]
18: pnml2lts-mc(+0x60a8a) [0x559ed58a0a8a]
19: pnml2lts-mc(+0x5eb15) [0x559ed589eb15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f448c087d0a]
21: pnml2lts-mc(+0x6075e) [0x559ed58a075e]

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-03a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is AutonomousCar-PT-03a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r009-oct2-167813598100563"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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