fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r043-smll-171620180400217
Last Updated
July 7, 2024

About the Execution of 2023-gold for AutonomousCar-PT-09a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
467.892 50850.00 72755.00 694.90 TTFFFFTFTFFFFTTF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 12 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 12 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 781K May 18 16:42 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-09a-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-09a-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-09a-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-09a-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-09a-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-09a-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-09a-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-09a-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-09a-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-09a-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-09a-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-09a-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-09a-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-09a-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-09a-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-09a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716316413364

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-09a
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-21 18:33:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 18:33:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 18:33:36] [INFO ] Load time of PNML (sax parser for PT used): 251 ms
[2024-05-21 18:33:36] [INFO ] Transformed 89 places.
[2024-05-21 18:33:36] [INFO ] Transformed 1249 transitions.
[2024-05-21 18:33:36] [INFO ] Found NUPN structural information;
[2024-05-21 18:33:36] [INFO ] Parsed PT model containing 89 places and 1249 transitions and 15631 arcs in 390 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 345 transitions
Reduce redundant transitions removed 345 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-09a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 904/904 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 85 transition count 864
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 85 transition count 864
Applied a total of 8 rules in 61 ms. Remains 85 /89 variables (removed 4) and now considering 864/904 (removed 40) transitions.
[2024-05-21 18:33:36] [INFO ] Flow matrix only has 863 transitions (discarded 1 similar events)
// Phase 1: matrix 863 rows 85 cols
[2024-05-21 18:33:36] [INFO ] Computed 14 invariants in 42 ms
[2024-05-21 18:33:37] [INFO ] Implicit Places using invariants in 681 ms returned []
[2024-05-21 18:33:37] [INFO ] Flow matrix only has 863 transitions (discarded 1 similar events)
[2024-05-21 18:33:37] [INFO ] Invariant cache hit.
[2024-05-21 18:33:37] [INFO ] State equation strengthened by 291 read => feed constraints.
[2024-05-21 18:33:38] [INFO ] Implicit Places using invariants and state equation in 779 ms returned [80, 83]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1509 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 83/89 places, 864/904 transitions.
Applied a total of 0 rules in 9 ms. Remains 83 /83 variables (removed 0) and now considering 864/864 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1580 ms. Remains : 83/89 places, 864/904 transitions.
Support contains 25 out of 83 places after structural reductions.
[2024-05-21 18:33:38] [INFO ] Flatten gal took : 360 ms
[2024-05-21 18:33:38] [INFO ] Flatten gal took : 190 ms
[2024-05-21 18:33:39] [INFO ] Input system was already deterministic with 864 transitions.
Incomplete random walk after 10000 steps, including 468 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 20) seen :19
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 18:33:39] [INFO ] Flow matrix only has 863 transitions (discarded 1 similar events)
// Phase 1: matrix 863 rows 83 cols
[2024-05-21 18:33:39] [INFO ] Computed 12 invariants in 15 ms
[2024-05-21 18:33:39] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2024-05-21 18:33:40] [INFO ] After 448ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 18:33:40] [INFO ] [Nat]Absence check using 12 positive place invariants in 9 ms returned sat
[2024-05-21 18:33:40] [INFO ] After 388ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 18:33:40] [INFO ] State equation strengthened by 291 read => feed constraints.
[2024-05-21 18:33:40] [INFO ] After 81ms SMT Verify possible using 291 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 18:33:40] [INFO ] After 163ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2024-05-21 18:33:40] [INFO ] After 686ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 18 ms.
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 864/864 transitions.
Graph (complete) has 990 edges and 83 vertex of which 82 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.25 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 82 transition count 849
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 26 place count 71 transition count 849
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 26 place count 71 transition count 848
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 28 place count 70 transition count 848
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 34 place count 64 transition count 797
Iterating global reduction 2 with 6 rules applied. Total rules applied 40 place count 64 transition count 797
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 44 place count 62 transition count 795
Free-agglomeration rule applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 53 place count 62 transition count 786
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 143 place count 53 transition count 705
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 144 place count 53 transition count 705
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 145 place count 52 transition count 704
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 146 place count 51 transition count 704
Applied a total of 146 rules in 428 ms. Remains 51 /83 variables (removed 32) and now considering 704/864 (removed 160) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 428 ms. Remains : 51/83 places, 704/864 transitions.
Finished random walk after 307 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=51 )
Parikh walk visited 0 properties in 0 ms.
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Support contains 4 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 864/864 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 77 transition count 813
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 77 transition count 813
Applied a total of 12 rules in 15 ms. Remains 77 /83 variables (removed 6) and now considering 813/864 (removed 51) transitions.
// Phase 1: matrix 813 rows 77 cols
[2024-05-21 18:33:41] [INFO ] Computed 11 invariants in 21 ms
[2024-05-21 18:33:42] [INFO ] Implicit Places using invariants in 537 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 542 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 76/83 places, 813/864 transitions.
Applied a total of 0 rules in 5 ms. Remains 76 /76 variables (removed 0) and now considering 813/813 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 564 ms. Remains : 76/83 places, 813/864 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 382 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-09a-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (EQ s65 0) (EQ s22 1)), p1:(OR (EQ s69 0) (EQ s45 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 5771 steps with 275 reset in 172 ms.
FORMULA AutonomousCar-PT-09a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLCardinality-03 finished in 1225 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 864/864 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 83 transition count 853
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 72 transition count 853
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 22 place count 72 transition count 852
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 24 place count 71 transition count 852
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 30 place count 65 transition count 801
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 65 transition count 801
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 63 transition count 799
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 42 place count 62 transition count 799
Applied a total of 42 rules in 220 ms. Remains 62 /83 variables (removed 21) and now considering 799/864 (removed 65) transitions.
// Phase 1: matrix 799 rows 62 cols
[2024-05-21 18:33:43] [INFO ] Computed 11 invariants in 10 ms
[2024-05-21 18:33:43] [INFO ] Implicit Places using invariants in 511 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 526 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/83 places, 799/864 transitions.
Applied a total of 0 rules in 90 ms. Remains 61 /61 variables (removed 0) and now considering 799/799 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 837 ms. Remains : 61/83 places, 799/864 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s33 0) (EQ s0 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 28 steps with 1 reset in 1 ms.
FORMULA AutonomousCar-PT-09a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLCardinality-04 finished in 907 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1)||G(p2))))'
Support contains 4 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 864/864 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 78 transition count 823
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 78 transition count 823
Applied a total of 10 rules in 13 ms. Remains 78 /83 variables (removed 5) and now considering 823/864 (removed 41) transitions.
// Phase 1: matrix 823 rows 78 cols
[2024-05-21 18:33:43] [INFO ] Computed 11 invariants in 10 ms
[2024-05-21 18:33:44] [INFO ] Implicit Places using invariants in 466 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 471 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 77/83 places, 823/864 transitions.
Applied a total of 0 rules in 5 ms. Remains 77 /77 variables (removed 0) and now considering 823/823 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 489 ms. Remains : 77/83 places, 823/864 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-09a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(OR (EQ s73 0) (EQ s69 1)), p2:(AND (EQ s58 0) (EQ s22 1)), p0:(OR (EQ s22 0) (EQ s58 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 4232 ms.
Product exploration explored 100000 steps with 33333 reset in 4184 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 p1 (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 24 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-09a-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-09a-LTLCardinality-06 finished in 9173 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((!p0 U (p1 U X(G(p0))))))))'
Support contains 3 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 864/864 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 79 transition count 833
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 79 transition count 833
Applied a total of 8 rules in 11 ms. Remains 79 /83 variables (removed 4) and now considering 833/864 (removed 31) transitions.
// Phase 1: matrix 833 rows 79 cols
[2024-05-21 18:33:52] [INFO ] Computed 11 invariants in 6 ms
[2024-05-21 18:33:53] [INFO ] Implicit Places using invariants in 477 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 479 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 78/83 places, 833/864 transitions.
Applied a total of 0 rules in 5 ms. Remains 78 /78 variables (removed 0) and now considering 833/833 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 495 ms. Remains : 78/83 places, 833/864 transitions.
Stuttering acceptance computed with spot in 279 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : AutonomousCar-PT-09a-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s58 0) (EQ s65 1)), p1:(EQ s50 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 32 steps with 1 reset in 1 ms.
FORMULA AutonomousCar-PT-09a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLCardinality-07 finished in 796 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&F(p1))))'
Support contains 4 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 864/864 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 83 transition count 854
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 73 transition count 854
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 20 place count 73 transition count 853
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 22 place count 72 transition count 853
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 67 transition count 812
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 67 transition count 812
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 65 transition count 810
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 38 place count 64 transition count 810
Applied a total of 38 rules in 135 ms. Remains 64 /83 variables (removed 19) and now considering 810/864 (removed 54) transitions.
// Phase 1: matrix 810 rows 64 cols
[2024-05-21 18:33:53] [INFO ] Computed 11 invariants in 6 ms
[2024-05-21 18:33:54] [INFO ] Implicit Places using invariants in 494 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 497 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/83 places, 810/864 transitions.
Applied a total of 0 rules in 56 ms. Remains 63 /63 variables (removed 0) and now considering 810/810 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 688 ms. Remains : 63/83 places, 810/864 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s38 0) (EQ s36 1)), p1:(AND (EQ s29 0) (EQ s57 1))], 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 16 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-09a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLCardinality-09 finished in 827 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p1)||F(p2)||p0) U G(!p3)))'
Support contains 4 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 864/864 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 81 transition count 854
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 72 transition count 853
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 71 transition count 853
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 21 place count 71 transition count 852
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 70 transition count 852
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 28 place count 65 transition count 811
Iterating global reduction 3 with 5 rules applied. Total rules applied 33 place count 65 transition count 811
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 35 place count 64 transition count 810
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 3 with 2 rules applied. Total rules applied 37 place count 63 transition count 810
Applied a total of 37 rules in 104 ms. Remains 63 /83 variables (removed 20) and now considering 810/864 (removed 54) transitions.
// Phase 1: matrix 810 rows 63 cols
[2024-05-21 18:33:54] [INFO ] Computed 10 invariants in 6 ms
[2024-05-21 18:33:54] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-21 18:33:54] [INFO ] Invariant cache hit.
[2024-05-21 18:33:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 18:33:55] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 896 ms to find 0 implicit places.
[2024-05-21 18:33:55] [INFO ] Redundant transitions in 74 ms returned []
[2024-05-21 18:33:55] [INFO ] Invariant cache hit.
[2024-05-21 18:33:56] [INFO ] Dead Transitions using invariants and state equation in 660 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/83 places, 810/864 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1761 ms. Remains : 63/83 places, 810/864 transitions.
Stuttering acceptance computed with spot in 244 ms :[p3, (NOT p2), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (OR (AND p0 (NOT p2) p3) (AND p1 (NOT p2) p3)), (AND (NOT p2) p3 (NOT p1) p0)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 0}, { cond=p3, acceptance={0} source=0 dest: 0}, { cond=(AND p3 (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p3 (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND (NOT p3) (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p2))), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p3) p1 (NOT p2)) (AND p0 p1 (NOT p2))), acceptance={} source=2 dest: 2}], [{ cond=(OR (AND p3 p0 (NOT p2)) (AND p3 p1 (NOT p2))), acceptance={} source=3 dest: 1}, { cond=(OR (AND (NOT p3) p0 (NOT p2)) (AND (NOT p3) p1 (NOT p2))), acceptance={} source=3 dest: 3}], [{ cond=(AND p3 p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p3 p0 p1 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) p0 p1 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(OR (EQ s58 0) (EQ s22 1)), p0:(OR (EQ s49 0) (EQ s31 1)), p1:(OR (EQ s49 0) (EQ s31 1)), p2:(OR (EQ s49 0) (EQ s31 1) (EQ s58 0) (EQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-09a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLCardinality-10 finished in 2028 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p1)&&p0))))'
Support contains 4 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 864/864 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 78 transition count 814
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 78 transition count 814
Applied a total of 10 rules in 9 ms. Remains 78 /83 variables (removed 5) and now considering 814/864 (removed 50) transitions.
[2024-05-21 18:33:56] [INFO ] Flow matrix only has 813 transitions (discarded 1 similar events)
// Phase 1: matrix 813 rows 78 cols
[2024-05-21 18:33:56] [INFO ] Computed 12 invariants in 14 ms
[2024-05-21 18:33:57] [INFO ] Implicit Places using invariants in 443 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 445 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 77/83 places, 814/864 transitions.
Applied a total of 0 rules in 4 ms. Remains 77 /77 variables (removed 0) and now considering 814/814 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 459 ms. Remains : 77/83 places, 814/864 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-09a-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=4, aps=[p1:(AND (EQ s21 0) (EQ s67 1)), p0:(AND (NEQ s27 0) (NEQ 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, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-09a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLCardinality-11 finished in 659 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 864/864 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 78 transition count 823
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 78 transition count 823
Applied a total of 10 rules in 8 ms. Remains 78 /83 variables (removed 5) and now considering 823/864 (removed 41) transitions.
// Phase 1: matrix 823 rows 78 cols
[2024-05-21 18:33:57] [INFO ] Computed 11 invariants in 6 ms
[2024-05-21 18:33:57] [INFO ] Implicit Places using invariants in 466 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 469 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 77/83 places, 823/864 transitions.
Applied a total of 0 rules in 4 ms. Remains 77 /77 variables (removed 0) and now considering 823/823 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 482 ms. Remains : 77/83 places, 823/864 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s20 0) (EQ s60 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 5349 ms.
Product exploration explored 100000 steps with 50000 reset in 5320 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 : [(NOT p0), (X p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 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-09a-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-09a-LTLCardinality-13 finished in 11279 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(!p0))||(F(!p0)&&X(p1)))))'
Support contains 3 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 864/864 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 78 transition count 823
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 78 transition count 823
Applied a total of 10 rules in 10 ms. Remains 78 /83 variables (removed 5) and now considering 823/864 (removed 41) transitions.
// Phase 1: matrix 823 rows 78 cols
[2024-05-21 18:34:08] [INFO ] Computed 11 invariants in 5 ms
[2024-05-21 18:34:08] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-05-21 18:34:08] [INFO ] Invariant cache hit.
[2024-05-21 18:34:09] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-21 18:34:09] [INFO ] Implicit Places using invariants and state equation in 684 ms returned []
Implicit Place search using SMT with State Equation took 1019 ms to find 0 implicit places.
[2024-05-21 18:34:09] [INFO ] Invariant cache hit.
[2024-05-21 18:34:10] [INFO ] Dead Transitions using invariants and state equation in 629 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 78/83 places, 823/864 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1660 ms. Remains : 78/83 places, 823/864 transitions.
Stuttering acceptance computed with spot in 116 ms :[p0, (AND (NOT p1) p0), p0]
Running random walk in product with property : AutonomousCar-PT-09a-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s35 1)), p1:(NEQ s71 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 6137 ms.
Product exploration explored 100000 steps with 50000 reset in 6161 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 p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 22 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-09a-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-09a-LTLCardinality-14 finished in 14131 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 864/864 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 78 transition count 823
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 78 transition count 823
Applied a total of 10 rules in 8 ms. Remains 78 /83 variables (removed 5) and now considering 823/864 (removed 41) transitions.
// Phase 1: matrix 823 rows 78 cols
[2024-05-21 18:34:22] [INFO ] Computed 11 invariants in 4 ms
[2024-05-21 18:34:23] [INFO ] Implicit Places using invariants in 447 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 449 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 77/83 places, 823/864 transitions.
Applied a total of 0 rules in 4 ms. Remains 77 /77 variables (removed 0) and now considering 823/823 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 462 ms. Remains : 77/83 places, 823/864 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09a-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s73 0) (EQ s56 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-09a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09a-LTLCardinality-15 finished in 564 ms.
All properties solved by simple procedures.
Total runtime 47374 ms.

BK_STOP 1716316464214

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-09a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is AutonomousCar-PT-09a, 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 r043-smll-171620180400217"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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