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-171620180400227.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-10a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-171620180400227
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 17:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 12 17:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 17:53 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 1.5M 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-10a-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-10a-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-10a-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-10a-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-10a-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-10a-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-10a-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-10a-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-10a-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-10a-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-10a-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-10a-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-10a-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-10a-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-10a-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-10a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716323187923

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-10a
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-21 20:26:30] [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 20:26:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:26:30] [INFO ] Load time of PNML (sax parser for PT used): 366 ms
[2024-05-21 20:26:30] [INFO ] Transformed 97 places.
[2024-05-21 20:26:30] [INFO ] Transformed 1921 transitions.
[2024-05-21 20:26:30] [INFO ] Found NUPN structural information;
[2024-05-21 20:26:30] [INFO ] Parsed PT model containing 97 places and 1921 transitions and 29152 arcs in 507 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 2 formulas.
Ensure Unique test removed 423 transitions
Reduce redundant transitions removed 423 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-10a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 1498/1498 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 92 transition count 1443
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 92 transition count 1443
Applied a total of 10 rules in 122 ms. Remains 92 /97 variables (removed 5) and now considering 1443/1498 (removed 55) transitions.
[2024-05-21 20:26:31] [INFO ] Flow matrix only has 1442 transitions (discarded 1 similar events)
// Phase 1: matrix 1442 rows 92 cols
[2024-05-21 20:26:31] [INFO ] Computed 15 invariants in 79 ms
[2024-05-21 20:26:32] [INFO ] Implicit Places using invariants in 1334 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1384 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 91/97 places, 1443/1498 transitions.
Applied a total of 0 rules in 24 ms. Remains 91 /91 variables (removed 0) and now considering 1443/1443 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1537 ms. Remains : 91/97 places, 1443/1498 transitions.
Support contains 30 out of 91 places after structural reductions.
[2024-05-21 20:26:33] [INFO ] Flatten gal took : 572 ms
[2024-05-21 20:26:33] [INFO ] Flatten gal took : 320 ms
[2024-05-21 20:26:34] [INFO ] Input system was already deterministic with 1443 transitions.
Support contains 29 out of 91 places (down from 30) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 455 resets, run finished after 1127 ms. (steps per millisecond=8 ) properties (out of 18) seen :16
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 20:26:35] [INFO ] Flow matrix only has 1442 transitions (discarded 1 similar events)
// Phase 1: matrix 1442 rows 91 cols
[2024-05-21 20:26:35] [INFO ] Computed 14 invariants in 21 ms
[2024-05-21 20:26:36] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 20:26:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-21 20:26:37] [INFO ] After 834ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 20:26:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 20:26:37] [INFO ] After 248ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 20:26:37] [INFO ] After 547ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 249 ms.
[2024-05-21 20:26:38] [INFO ] After 1762ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 84 ms.
Support contains 6 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 1443/1443 transitions.
Graph (complete) has 1162 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.36 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 11 rules applied. Total rules applied 12 place count 90 transition count 1431
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 81 transition count 1429
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 25 place count 79 transition count 1429
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 25 place count 79 transition count 1428
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 27 place count 78 transition count 1428
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 32 place count 73 transition count 1373
Iterating global reduction 3 with 5 rules applied. Total rules applied 37 place count 73 transition count 1373
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 3 with 4 rules applied. Total rules applied 41 place count 71 transition count 1371
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 49 place count 71 transition count 1363
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 3 with 88 rules applied. Total rules applied 137 place count 63 transition count 1283
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 138 place count 63 transition count 1283
Applied a total of 138 rules in 722 ms. Remains 63 /91 variables (removed 28) and now considering 1283/1443 (removed 160) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 724 ms. Remains : 63/91 places, 1283/1443 transitions.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 495 ms. (steps per millisecond=20 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 388910 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :{}
Probabilistic random walk after 388910 steps, saw 60026 distinct states, run finished after 3002 ms. (steps per millisecond=129 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1283 rows 63 cols
[2024-05-21 20:26:42] [INFO ] Computed 14 invariants in 14 ms
[2024-05-21 20:26:42] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 20:26:42] [INFO ] [Nat]Absence check using 14 positive place invariants in 24 ms returned sat
[2024-05-21 20:26:43] [INFO ] After 746ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 20:26:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 20:26:43] [INFO ] After 212ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 20:26:43] [INFO ] After 483ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 191 ms.
[2024-05-21 20:26:44] [INFO ] After 1504ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 52 ms.
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 1283/1283 transitions.
Applied a total of 0 rules in 98 ms. Remains 63 /63 variables (removed 0) and now considering 1283/1283 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 63/63 places, 1283/1283 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 1283/1283 transitions.
Applied a total of 0 rules in 101 ms. Remains 63 /63 variables (removed 0) and now considering 1283/1283 (removed 0) transitions.
[2024-05-21 20:26:44] [INFO ] Invariant cache hit.
[2024-05-21 20:26:45] [INFO ] Implicit Places using invariants in 663 ms returned []
[2024-05-21 20:26:45] [INFO ] Invariant cache hit.
[2024-05-21 20:26:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 20:26:46] [INFO ] Implicit Places using invariants and state equation in 1167 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1839 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 62/63 places, 1283/1283 transitions.
Applied a total of 0 rules in 92 ms. Remains 62 /62 variables (removed 0) and now considering 1283/1283 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2034 ms. Remains : 62/63 places, 1283/1283 transitions.
Incomplete random walk after 10000 steps, including 136 resets, run finished after 557 ms. (steps per millisecond=17 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 439395 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :{}
Probabilistic random walk after 439395 steps, saw 66680 distinct states, run finished after 3001 ms. (steps per millisecond=146 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1283 rows 62 cols
[2024-05-21 20:26:49] [INFO ] Computed 13 invariants in 10 ms
[2024-05-21 20:26:50] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 20:26:50] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-21 20:26:50] [INFO ] After 690ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 20:26:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 20:26:51] [INFO ] After 205ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 20:26:51] [INFO ] After 475ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 201 ms.
[2024-05-21 20:26:51] [INFO ] After 1416ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 109 ms.
Support contains 6 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 1283/1283 transitions.
Applied a total of 0 rules in 84 ms. Remains 62 /62 variables (removed 0) and now considering 1283/1283 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 62/62 places, 1283/1283 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 1283/1283 transitions.
Applied a total of 0 rules in 87 ms. Remains 62 /62 variables (removed 0) and now considering 1283/1283 (removed 0) transitions.
[2024-05-21 20:26:51] [INFO ] Invariant cache hit.
[2024-05-21 20:26:52] [INFO ] Implicit Places using invariants in 609 ms returned []
[2024-05-21 20:26:52] [INFO ] Invariant cache hit.
[2024-05-21 20:26:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 20:26:53] [INFO ] Implicit Places using invariants and state equation in 1024 ms returned []
Implicit Place search using SMT with State Equation took 1635 ms to find 0 implicit places.
[2024-05-21 20:26:53] [INFO ] Redundant transitions in 166 ms returned []
[2024-05-21 20:26:53] [INFO ] Invariant cache hit.
[2024-05-21 20:26:54] [INFO ] Dead Transitions using invariants and state equation in 1043 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2943 ms. Remains : 62/62 places, 1283/1283 transitions.
Applied a total of 0 rules in 89 ms. Remains 62 /62 variables (removed 0) and now considering 1283/1283 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-21 20:26:54] [INFO ] Invariant cache hit.
[2024-05-21 20:26:54] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 20:26:54] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-21 20:26:55] [INFO ] After 636ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 20:26:55] [INFO ] After 883ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 193 ms.
[2024-05-21 20:26:55] [INFO ] After 1115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Computed a total of 2 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' '!(G(F(p0)))'
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 1443/1443 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 91 transition count 1433
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 81 transition count 1433
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 25 place count 76 transition count 1388
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 76 transition count 1388
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 75 transition count 1387
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 34 place count 74 transition count 1387
Applied a total of 34 rules in 281 ms. Remains 74 /91 variables (removed 17) and now considering 1387/1443 (removed 56) transitions.
// Phase 1: matrix 1387 rows 74 cols
[2024-05-21 20:26:56] [INFO ] Computed 13 invariants in 13 ms
[2024-05-21 20:26:57] [INFO ] Implicit Places using invariants in 648 ms returned []
[2024-05-21 20:26:57] [INFO ] Invariant cache hit.
[2024-05-21 20:26:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 20:26:58] [INFO ] Implicit Places using invariants and state equation in 1226 ms returned [70, 72]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1895 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/91 places, 1387/1443 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 72 transition count 1386
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 71 transition count 1386
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 70 transition count 1385
Applied a total of 4 rules in 295 ms. Remains 70 /72 variables (removed 2) and now considering 1385/1387 (removed 2) transitions.
// Phase 1: matrix 1385 rows 70 cols
[2024-05-21 20:26:58] [INFO ] Computed 11 invariants in 12 ms
[2024-05-21 20:26:59] [INFO ] Implicit Places using invariants in 722 ms returned []
[2024-05-21 20:26:59] [INFO ] Invariant cache hit.
[2024-05-21 20:26:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 20:27:00] [INFO ] Implicit Places using invariants and state equation in 1021 ms returned []
Implicit Place search using SMT with State Equation took 1749 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 70/91 places, 1385/1443 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4221 ms. Remains : 70/91 places, 1385/1443 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 236 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLCardinality-00 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 (AND (EQ s1 0) (EQ s35 1)) (AND (EQ s57 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 20 steps with 1 reset in 7 ms.
FORMULA AutonomousCar-PT-10a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLCardinality-00 finished in 4543 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))&&((p1&&F(!p1)) U G(p2))))'
Support contains 5 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 1443/1443 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 86 transition count 1398
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 86 transition count 1398
Applied a total of 10 rules in 21 ms. Remains 86 /91 variables (removed 5) and now considering 1398/1443 (removed 45) transitions.
// Phase 1: matrix 1398 rows 86 cols
[2024-05-21 20:27:00] [INFO ] Computed 13 invariants in 13 ms
[2024-05-21 20:27:01] [INFO ] Implicit Places using invariants in 690 ms returned []
[2024-05-21 20:27:01] [INFO ] Invariant cache hit.
[2024-05-21 20:27:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 20:27:02] [INFO ] Implicit Places using invariants and state equation in 1051 ms returned [82, 84]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1745 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 84/91 places, 1398/1443 transitions.
Applied a total of 0 rules in 8 ms. Remains 84 /84 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1775 ms. Remains : 84/91 places, 1398/1443 transitions.
Stuttering acceptance computed with spot in 203 ms :[true, (OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2) p1)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p2 p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p2) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p2 p0), acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p2 p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 4}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=4 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p2:(OR (EQ s4 0) (EQ s83 1)), p1:(NEQ s50 1), p0:(OR (EQ s36 0) (EQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][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-10a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLCardinality-01 finished in 2005 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 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 1443/1443 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 86 transition count 1398
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 86 transition count 1398
Applied a total of 10 rules in 17 ms. Remains 86 /91 variables (removed 5) and now considering 1398/1443 (removed 45) transitions.
// Phase 1: matrix 1398 rows 86 cols
[2024-05-21 20:27:02] [INFO ] Computed 13 invariants in 12 ms
[2024-05-21 20:27:03] [INFO ] Implicit Places using invariants in 638 ms returned []
[2024-05-21 20:27:03] [INFO ] Invariant cache hit.
[2024-05-21 20:27:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 20:27:04] [INFO ] Implicit Places using invariants and state equation in 1032 ms returned [82, 84]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1678 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 84/91 places, 1398/1443 transitions.
Applied a total of 0 rules in 8 ms. Remains 84 /84 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1705 ms. Remains : 84/91 places, 1398/1443 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLCardinality-02 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 (NEQ s73 0) (NEQ s69 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 timeout after 82560 steps with 41280 reset in 10001 ms.
Product exploration timeout after 84380 steps with 42190 reset in 10001 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 24 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-10a-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-10a-LTLCardinality-02 finished in 21845 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(F(p1)))))'
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 1443/1443 transitions.
Reduce places removed 1 places and 1 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 9 rules applied. Total rules applied 9 place count 90 transition count 1433
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 81 transition count 1433
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 23 place count 76 transition count 1388
Iterating global reduction 2 with 5 rules applied. Total rules applied 28 place count 76 transition count 1388
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 32 place count 74 transition count 1386
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 34 place count 73 transition count 1386
Applied a total of 34 rules in 189 ms. Remains 73 /91 variables (removed 18) and now considering 1386/1443 (removed 57) transitions.
// Phase 1: matrix 1386 rows 73 cols
[2024-05-21 20:27:24] [INFO ] Computed 13 invariants in 9 ms
[2024-05-21 20:27:25] [INFO ] Implicit Places using invariants in 644 ms returned []
[2024-05-21 20:27:25] [INFO ] Invariant cache hit.
[2024-05-21 20:27:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 20:27:26] [INFO ] Implicit Places using invariants and state equation in 1062 ms returned [69, 71]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1711 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/91 places, 1386/1443 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 71 transition count 1385
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 1385
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 69 transition count 1384
Applied a total of 4 rules in 142 ms. Remains 69 /71 variables (removed 2) and now considering 1384/1386 (removed 2) transitions.
// Phase 1: matrix 1384 rows 69 cols
[2024-05-21 20:27:26] [INFO ] Computed 11 invariants in 10 ms
[2024-05-21 20:27:27] [INFO ] Implicit Places using invariants in 654 ms returned []
[2024-05-21 20:27:27] [INFO ] Invariant cache hit.
[2024-05-21 20:27:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 20:27:28] [INFO ] Implicit Places using invariants and state equation in 1056 ms returned []
Implicit Place search using SMT with State Equation took 1712 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 69/91 places, 1384/1443 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3754 ms. Remains : 69/91 places, 1384/1443 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-10a-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s3 0) (NEQ s32 1)), p1:(OR (EQ s58 0) (EQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 33 steps with 1 reset in 1 ms.
FORMULA AutonomousCar-PT-10a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLCardinality-03 finished in 3848 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 1443/1443 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 91 transition count 1432
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 80 transition count 1432
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 28 place count 74 transition count 1376
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 74 transition count 1376
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 73 transition count 1375
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 72 transition count 1375
Applied a total of 38 rules in 174 ms. Remains 72 /91 variables (removed 19) and now considering 1375/1443 (removed 68) transitions.
// Phase 1: matrix 1375 rows 72 cols
[2024-05-21 20:27:28] [INFO ] Computed 13 invariants in 9 ms
[2024-05-21 20:27:29] [INFO ] Implicit Places using invariants in 638 ms returned []
[2024-05-21 20:27:29] [INFO ] Invariant cache hit.
[2024-05-21 20:27:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 20:27:30] [INFO ] Implicit Places using invariants and state equation in 1012 ms returned [68, 70]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1654 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/91 places, 1375/1443 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 70 transition count 1374
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 69 transition count 1374
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 68 transition count 1373
Applied a total of 4 rules in 137 ms. Remains 68 /70 variables (removed 2) and now considering 1373/1375 (removed 2) transitions.
// Phase 1: matrix 1373 rows 68 cols
[2024-05-21 20:27:30] [INFO ] Computed 11 invariants in 8 ms
[2024-05-21 20:27:30] [INFO ] Implicit Places using invariants in 584 ms returned []
[2024-05-21 20:27:30] [INFO ] Invariant cache hit.
[2024-05-21 20:27:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 20:27:31] [INFO ] Implicit Places using invariants and state equation in 987 ms returned []
Implicit Place search using SMT with State Equation took 1574 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 68/91 places, 1373/1443 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3541 ms. Remains : 68/91 places, 1373/1443 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-10a-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s2 1), p0:(AND (EQ s27 0) (EQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 25 steps with 1 reset in 1 ms.
FORMULA AutonomousCar-PT-10a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLCardinality-04 finished in 3634 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 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 1443/1443 transitions.
Reduce places removed 1 places and 1 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 90 transition count 1431
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 79 transition count 1431
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 74 transition count 1386
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 74 transition count 1386
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 36 place count 72 transition count 1384
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 38 place count 71 transition count 1384
Applied a total of 38 rules in 164 ms. Remains 71 /91 variables (removed 20) and now considering 1384/1443 (removed 59) transitions.
// Phase 1: matrix 1384 rows 71 cols
[2024-05-21 20:27:32] [INFO ] Computed 13 invariants in 14 ms
[2024-05-21 20:27:32] [INFO ] Implicit Places using invariants in 652 ms returned []
[2024-05-21 20:27:32] [INFO ] Invariant cache hit.
[2024-05-21 20:27:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 20:27:33] [INFO ] Implicit Places using invariants and state equation in 1031 ms returned [67, 69]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1687 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/91 places, 1384/1443 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 68 transition count 1383
Applied a total of 2 rules in 117 ms. Remains 68 /69 variables (removed 1) and now considering 1383/1384 (removed 1) transitions.
// Phase 1: matrix 1383 rows 68 cols
[2024-05-21 20:27:34] [INFO ] Computed 11 invariants in 9 ms
[2024-05-21 20:27:34] [INFO ] Implicit Places using invariants in 649 ms returned []
[2024-05-21 20:27:34] [INFO ] Invariant cache hit.
[2024-05-21 20:27:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 20:27:35] [INFO ] Implicit Places using invariants and state equation in 1045 ms returned []
Implicit Place search using SMT with State Equation took 1696 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 68/91 places, 1383/1443 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3668 ms. Remains : 68/91 places, 1383/1443 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s19 0) (EQ s66 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 13 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-10a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLCardinality-06 finished in 3723 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(X(p0)) U p1)&&X(G(p2))))'
Support contains 6 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 1443/1443 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 87 transition count 1409
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 87 transition count 1409
Applied a total of 8 rules in 16 ms. Remains 87 /91 variables (removed 4) and now considering 1409/1443 (removed 34) transitions.
// Phase 1: matrix 1409 rows 87 cols
[2024-05-21 20:27:35] [INFO ] Computed 13 invariants in 9 ms
[2024-05-21 20:27:36] [INFO ] Implicit Places using invariants in 1075 ms returned []
[2024-05-21 20:27:36] [INFO ] Invariant cache hit.
[2024-05-21 20:27:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 20:27:37] [INFO ] Implicit Places using invariants and state equation in 1050 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2129 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 86/91 places, 1409/1443 transitions.
Applied a total of 0 rules in 8 ms. Remains 86 /86 variables (removed 0) and now considering 1409/1409 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2166 ms. Remains : 86/91 places, 1409/1443 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p2), true, (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-10a-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p2 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p2), acceptance={0} source=3 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 p2 p0), acceptance={0} source=4 dest: 0}, { cond=(NOT p2), acceptance={0} source=4 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p2:(OR (EQ s42 0) (EQ s23 1)), p1:(OR (EQ s30 0) (EQ s83 1)), p0:(OR (EQ s19 0) (EQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 19 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-10a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLCardinality-09 finished in 2367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p1)||p0)))'
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 1443/1443 transitions.
Reduce places removed 1 places and 1 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 90 transition count 1431
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 79 transition count 1431
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 74 transition count 1386
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 74 transition count 1386
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 72 transition count 1384
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 38 place count 71 transition count 1384
Applied a total of 38 rules in 173 ms. Remains 71 /91 variables (removed 20) and now considering 1384/1443 (removed 59) transitions.
// Phase 1: matrix 1384 rows 71 cols
[2024-05-21 20:27:38] [INFO ] Computed 13 invariants in 8 ms
[2024-05-21 20:27:38] [INFO ] Implicit Places using invariants in 634 ms returned []
[2024-05-21 20:27:38] [INFO ] Invariant cache hit.
[2024-05-21 20:27:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 20:27:39] [INFO ] Implicit Places using invariants and state equation in 1028 ms returned [67, 69]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1667 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/91 places, 1384/1443 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 69 transition count 1383
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 68 transition count 1383
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 67 transition count 1382
Applied a total of 4 rules in 136 ms. Remains 67 /69 variables (removed 2) and now considering 1382/1384 (removed 2) transitions.
// Phase 1: matrix 1382 rows 67 cols
[2024-05-21 20:27:40] [INFO ] Computed 11 invariants in 7 ms
[2024-05-21 20:27:40] [INFO ] Implicit Places using invariants in 619 ms returned []
[2024-05-21 20:27:40] [INFO ] Invariant cache hit.
[2024-05-21 20:27:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 20:27:41] [INFO ] Implicit Places using invariants and state equation in 1099 ms returned []
Implicit Place search using SMT with State Equation took 1720 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/91 places, 1382/1443 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3699 ms. Remains : 67/91 places, 1382/1443 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-10a-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(AND (EQ s48 0) (EQ s49 1)), p0:(OR (EQ s49 0) (EQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 41 steps with 1 reset in 4 ms.
FORMULA AutonomousCar-PT-10a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLCardinality-10 finished in 3809 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((G(p0) U X(p1))||G(p2))))'
Support contains 5 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 1443/1443 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 86 transition count 1388
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 86 transition count 1388
Applied a total of 10 rules in 15 ms. Remains 86 /91 variables (removed 5) and now considering 1388/1443 (removed 55) transitions.
[2024-05-21 20:27:41] [INFO ] Flow matrix only has 1387 transitions (discarded 1 similar events)
// Phase 1: matrix 1387 rows 86 cols
[2024-05-21 20:27:41] [INFO ] Computed 14 invariants in 8 ms
[2024-05-21 20:27:42] [INFO ] Implicit Places using invariants in 631 ms returned []
[2024-05-21 20:27:42] [INFO ] Flow matrix only has 1387 transitions (discarded 1 similar events)
[2024-05-21 20:27:42] [INFO ] Invariant cache hit.
[2024-05-21 20:27:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 20:27:43] [INFO ] Implicit Places using invariants and state equation in 1033 ms returned [81, 84]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1668 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 84/91 places, 1388/1443 transitions.
Applied a total of 0 rules in 7 ms. Remains 84 /84 variables (removed 0) and now considering 1388/1388 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1691 ms. Remains : 84/91 places, 1388/1443 transitions.
Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p1)), true, (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p0 p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 7}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 5}, { cond=p0, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=8 dest: 7}, { cond=(AND p0 p2 p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(OR (EQ s7 0) (EQ s70 1)), p2:(AND (EQ s81 0) (EQ s41 1) (EQ s53 1)), p1:(OR (EQ s7 0) (EQ s70 1) (EQ s41 0) (EQ s81 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33338 reset in 8285 ms.
Product exploration explored 100000 steps with 33322 reset in 8423 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 p0 (NOT p2) p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X p1), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X p0)), true, (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p2 p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 19 factoid took 254 ms. Reduced automaton from 9 states, 24 edges and 3 AP (stutter sensitive) to 8 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 285 ms :[(AND (NOT p1) (NOT p2)), (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p2) (NOT p1) p0), (NOT p1), true, (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 463 resets, run finished after 479 ms. (steps per millisecond=20 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :2
Running SMT prover for 9 properties.
[2024-05-21 20:28:02] [INFO ] Flow matrix only has 1387 transitions (discarded 1 similar events)
// Phase 1: matrix 1387 rows 84 cols
[2024-05-21 20:28:02] [INFO ] Computed 12 invariants in 8 ms
[2024-05-21 20:28:02] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:5
[2024-05-21 20:28:02] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-05-21 20:28:03] [INFO ] After 1086ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :5
[2024-05-21 20:28:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 20:28:04] [INFO ] After 653ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :4 sat :5
[2024-05-21 20:28:05] [INFO ] After 1460ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :5
Attempting to minimize the solution found.
Minimization took 653 ms.
[2024-05-21 20:28:06] [INFO ] After 3271ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :5
Fused 9 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 216 ms.
Support contains 5 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 1388/1388 transitions.
Graph (complete) has 1092 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 83 transition count 1374
Reduce places removed 10 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 12 rules applied. Total rules applied 26 place count 73 transition count 1372
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 28 place count 71 transition count 1372
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 28 place count 71 transition count 1371
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 30 place count 70 transition count 1371
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 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 36 place count 67 transition count 1368
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 44 place count 67 transition count 1360
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 3 with 88 rules applied. Total rules applied 132 place count 59 transition count 1280
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 133 place count 58 transition count 1279
Applied a total of 133 rules in 322 ms. Remains 58 /84 variables (removed 26) and now considering 1279/1388 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 322 ms. Remains : 58/84 places, 1279/1388 transitions.
Incomplete random walk after 10000 steps, including 107 resets, run finished after 445 ms. (steps per millisecond=22 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1279 rows 58 cols
[2024-05-21 20:28:07] [INFO ] Computed 13 invariants in 8 ms
[2024-05-21 20:28:07] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 20:28:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-21 20:28:07] [INFO ] After 691ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 20:28:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 20:28:08] [INFO ] After 274ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 20:28:08] [INFO ] After 591ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 285 ms.
[2024-05-21 20:28:08] [INFO ] After 1607ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1279/1279 transitions.
Applied a total of 0 rules in 81 ms. Remains 58 /58 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 58/58 places, 1279/1279 transitions.
Incomplete random walk after 10000 steps, including 115 resets, run finished after 534 ms. (steps per millisecond=18 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 343950 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :{}
Probabilistic random walk after 343950 steps, saw 54046 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-21 20:28:12] [INFO ] Invariant cache hit.
[2024-05-21 20:28:12] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 20:28:12] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-21 20:28:13] [INFO ] After 690ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 20:28:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 20:28:13] [INFO ] After 279ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 20:28:13] [INFO ] After 595ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 271 ms.
[2024-05-21 20:28:14] [INFO ] After 1597ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1279/1279 transitions.
Applied a total of 0 rules in 80 ms. Remains 58 /58 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 58/58 places, 1279/1279 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1279/1279 transitions.
Applied a total of 0 rules in 82 ms. Remains 58 /58 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
[2024-05-21 20:28:14] [INFO ] Invariant cache hit.
[2024-05-21 20:28:14] [INFO ] Implicit Places using invariants in 585 ms returned []
[2024-05-21 20:28:14] [INFO ] Invariant cache hit.
[2024-05-21 20:28:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 20:28:16] [INFO ] Implicit Places using invariants and state equation in 1077 ms returned []
Implicit Place search using SMT with State Equation took 1664 ms to find 0 implicit places.
[2024-05-21 20:28:16] [INFO ] Redundant transitions in 47 ms returned []
[2024-05-21 20:28:16] [INFO ] Invariant cache hit.
[2024-05-21 20:28:17] [INFO ] Dead Transitions using invariants and state equation in 1259 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3061 ms. Remains : 58/58 places, 1279/1279 transitions.
Applied a total of 0 rules in 81 ms. Remains 58 /58 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-21 20:28:17] [INFO ] Invariant cache hit.
[2024-05-21 20:28:17] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 20:28:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-21 20:28:18] [INFO ] After 661ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 20:28:18] [INFO ] After 986ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 278 ms.
[2024-05-21 20:28:18] [INFO ] After 1304ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X p1), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X p0)), true, (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p2 p1))), (G (NOT (AND (NOT p1) p0 p2))), (G (NOT (AND (NOT p1) p0))), (G (NOT (AND (NOT p1) p0 (NOT p2)))), (G (NOT (AND p1 (NOT p0) p2)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0) (NOT p2))), (F (AND p1 p0 p2)), (F (NOT (AND p0 (NOT p2)))), (F (NOT (AND p1 p0 (NOT p2)))), (F (NOT p0)), (F (NOT (OR p1 p0))), (F (AND p1 (NOT p0) (NOT p2))), (F p2), (F (AND (NOT p1) (NOT p0)))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p1) (NOT p0) (NOT p2)))
Knowledge based reduction with 23 factoid took 493 ms. Reduced automaton from 8 states, 23 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-10a-LTLCardinality-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-10a-LTLCardinality-11 finished in 37415 ms.
All properties solved by simple procedures.
Total runtime 109049 ms.

BK_STOP 1716323300453

--------------------
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-10a"
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-10a, 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-171620180400227"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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