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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 18:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 12 18:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 12 18:06 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 228K 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-06b-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-06b-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-06b-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-06b-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-06b-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-06b-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-06b-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-06b-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-06b-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-06b-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-06b-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-06b-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-06b-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-06b-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-06b-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-06b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716307793358

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-06b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-21 16:09:55] [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 16:09:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 16:09:55] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2024-05-21 16:09:55] [INFO ] Transformed 289 places.
[2024-05-21 16:09:56] [INFO ] Transformed 644 transitions.
[2024-05-21 16:09:56] [INFO ] Found NUPN structural information;
[2024-05-21 16:09:56] [INFO ] Parsed PT model containing 289 places and 644 transitions and 3812 arcs in 242 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-06b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-06b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 644/644 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 257 transition count 612
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 257 transition count 612
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 70 place count 251 transition count 606
Iterating global reduction 0 with 6 rules applied. Total rules applied 76 place count 251 transition count 606
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 250 transition count 605
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 250 transition count 605
Applied a total of 78 rules in 101 ms. Remains 250 /289 variables (removed 39) and now considering 605/644 (removed 39) transitions.
// Phase 1: matrix 605 rows 250 cols
[2024-05-21 16:09:56] [INFO ] Computed 11 invariants in 24 ms
[2024-05-21 16:09:56] [INFO ] Implicit Places using invariants in 397 ms returned []
[2024-05-21 16:09:56] [INFO ] Invariant cache hit.
[2024-05-21 16:09:57] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 1009 ms to find 0 implicit places.
[2024-05-21 16:09:57] [INFO ] Invariant cache hit.
[2024-05-21 16:09:57] [INFO ] Dead Transitions using invariants and state equation in 411 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 250/289 places, 605/644 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1523 ms. Remains : 250/289 places, 605/644 transitions.
Support contains 30 out of 250 places after structural reductions.
[2024-05-21 16:09:58] [INFO ] Flatten gal took : 125 ms
[2024-05-21 16:09:58] [INFO ] Flatten gal took : 95 ms
[2024-05-21 16:09:58] [INFO ] Input system was already deterministic with 605 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 606 ms. (steps per millisecond=16 ) properties (out of 18) seen :9
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-05-21 16:09:59] [INFO ] Invariant cache hit.
[2024-05-21 16:09:59] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 16:09:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2024-05-21 16:09:59] [INFO ] After 94ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA AutonomousCar-PT-06b-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 43 stabilizing places and 44 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p1||F(G(p2)))&&p0))))'
Support contains 5 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Graph (trivial) has 228 edges and 250 vertex of which 4 / 250 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 91 rules applied. Total rules applied 92 place count 247 transition count 511
Reduce places removed 91 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 125 rules applied. Total rules applied 217 place count 156 transition count 477
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 21 rules applied. Total rules applied 238 place count 136 transition count 476
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 239 place count 135 transition count 476
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 239 place count 135 transition count 469
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 253 place count 128 transition count 469
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 260 place count 121 transition count 462
Iterating global reduction 4 with 7 rules applied. Total rules applied 267 place count 121 transition count 462
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 4 with 144 rules applied. Total rules applied 411 place count 121 transition count 318
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 411 place count 121 transition count 317
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 413 place count 120 transition count 317
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 414 place count 119 transition count 311
Iterating global reduction 5 with 1 rules applied. Total rules applied 415 place count 119 transition count 311
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 417 place count 119 transition count 309
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 418 place count 118 transition count 309
Performed 47 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 7 with 94 rules applied. Total rules applied 512 place count 71 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 513 place count 71 transition count 260
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 522 place count 62 transition count 201
Iterating global reduction 8 with 9 rules applied. Total rules applied 531 place count 62 transition count 201
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 535 place count 62 transition count 197
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 9 with 2 rules applied. Total rules applied 537 place count 61 transition count 196
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 9 with 2 rules applied. Total rules applied 539 place count 60 transition count 196
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 541 place count 58 transition count 194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 542 place count 57 transition count 194
Applied a total of 542 rules in 150 ms. Remains 57 /250 variables (removed 193) and now considering 194/605 (removed 411) transitions.
// Phase 1: matrix 194 rows 57 cols
[2024-05-21 16:09:59] [INFO ] Computed 9 invariants in 3 ms
[2024-05-21 16:09:59] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-21 16:09:59] [INFO ] Invariant cache hit.
[2024-05-21 16:10:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 16:10:00] [INFO ] Implicit Places using invariants and state equation in 151 ms returned [50, 54]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 256 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/250 places, 194/605 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 55 transition count 193
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 54 transition count 193
Applied a total of 2 rules in 12 ms. Remains 54 /55 variables (removed 1) and now considering 193/194 (removed 1) transitions.
// Phase 1: matrix 193 rows 54 cols
[2024-05-21 16:10:00] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 16:10:00] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 16:10:00] [INFO ] Invariant cache hit.
[2024-05-21 16:10:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 16:10:00] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 54/250 places, 193/605 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 644 ms. Remains : 54/250 places, 193/605 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 263 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : AutonomousCar-PT-06b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p1) p2) (AND (NOT p0) p2)), acceptance={1} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s25 0) (EQ s52 1)), p1:(EQ s45 1), p2:(OR (EQ s20 0) (EQ s17 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 177 reset in 348 ms.
Product exploration explored 100000 steps with 7 reset in 206 ms.
Computed a total of 3 stabilizing places and 5 stable transitions
Computed a total of 3 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (OR (AND (NOT p1) p2) (AND (NOT p0) p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (OR (AND (NOT p1) p2) (AND (NOT p0) p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 9 factoid took 407 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 704 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 16:10:01] [INFO ] Invariant cache hit.
[2024-05-21 16:10:01] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 16:10:02] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-21 16:10:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 16:10:02] [INFO ] After 92ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (OR (AND (NOT p1) p2) (AND (NOT p0) p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (OR (AND (NOT p1) p2) (AND (NOT p0) p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (G (NOT (AND p1 (NOT p2) p0))), (G (NOT (AND p1 p2 p0)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (NOT (OR (AND (NOT p1) p2) (AND p2 (NOT p0))))), (F (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p0)))), (F p0), (F (AND (NOT p1) p0))]
Knowledge based reduction with 11 factoid took 731 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
[2024-05-21 16:10:03] [INFO ] Invariant cache hit.
[2024-05-21 16:10:03] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-05-21 16:10:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 16:10:03] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-21 16:10:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 16:10:03] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 16:10:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 16:10:03] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-21 16:10:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 16:10:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-21 16:10:03] [INFO ] Computed and/alt/rep : 19/57/19 causal constraints (skipped 172 transitions) in 33 ms.
[2024-05-21 16:10:03] [INFO ] Added : 1 causal constraints over 1 iterations in 79 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 54 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 193/193 transitions.
Applied a total of 0 rules in 8 ms. Remains 54 /54 variables (removed 0) and now considering 193/193 (removed 0) transitions.
[2024-05-21 16:10:03] [INFO ] Invariant cache hit.
[2024-05-21 16:10:03] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 16:10:03] [INFO ] Invariant cache hit.
[2024-05-21 16:10:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 16:10:03] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2024-05-21 16:10:03] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-21 16:10:03] [INFO ] Invariant cache hit.
[2024-05-21 16:10:03] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 389 ms. Remains : 54/54 places, 193/193 transitions.
Computed a total of 3 stabilizing places and 5 stable transitions
Computed a total of 3 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p0) p2), (X p2), (X (NOT (AND (NOT p2) p0))), (X (X p2)), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 185 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Finished random walk after 128 steps, including 7 resets, run visited all 3 properties in 3 ms. (steps per millisecond=42 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p2), (X p2), (X (NOT (AND (NOT p2) p0))), (X (X p2)), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT p2)), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 5 factoid took 270 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 69 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
[2024-05-21 16:10:04] [INFO ] Invariant cache hit.
[2024-05-21 16:10:04] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 16:10:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 16:10:04] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-21 16:10:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 16:10:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 16:10:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 16:10:04] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-05-21 16:10:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 16:10:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-21 16:10:04] [INFO ] Computed and/alt/rep : 19/57/19 causal constraints (skipped 172 transitions) in 30 ms.
[2024-05-21 16:10:04] [INFO ] Added : 1 causal constraints over 1 iterations in 57 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering criterion allowed to conclude after 845 steps with 57 reset in 3 ms.
FORMULA AutonomousCar-PT-06b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLCardinality-01 finished in 5439 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Graph (trivial) has 235 edges and 250 vertex of which 4 / 250 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 95 place count 247 transition count 508
Reduce places removed 94 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 128 rules applied. Total rules applied 223 place count 153 transition count 474
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 21 rules applied. Total rules applied 244 place count 133 transition count 473
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 245 place count 132 transition count 473
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 245 place count 132 transition count 466
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 259 place count 125 transition count 466
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 266 place count 118 transition count 459
Iterating global reduction 4 with 7 rules applied. Total rules applied 273 place count 118 transition count 459
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 4 with 144 rules applied. Total rules applied 417 place count 118 transition count 315
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 417 place count 118 transition count 314
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 419 place count 117 transition count 314
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 421 place count 115 transition count 307
Iterating global reduction 5 with 2 rules applied. Total rules applied 423 place count 115 transition count 307
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 425 place count 115 transition count 305
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 426 place count 114 transition count 305
Performed 50 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 7 with 100 rules applied. Total rules applied 526 place count 64 transition count 254
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 527 place count 64 transition count 253
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 537 place count 54 transition count 187
Iterating global reduction 8 with 10 rules applied. Total rules applied 547 place count 54 transition count 187
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 551 place count 54 transition count 183
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 9 with 2 rules applied. Total rules applied 553 place count 53 transition count 182
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 555 place count 51 transition count 180
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 556 place count 50 transition count 180
Applied a total of 556 rules in 92 ms. Remains 50 /250 variables (removed 200) and now considering 180/605 (removed 425) transitions.
// Phase 1: matrix 180 rows 50 cols
[2024-05-21 16:10:05] [INFO ] Computed 9 invariants in 2 ms
[2024-05-21 16:10:05] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-21 16:10:05] [INFO ] Invariant cache hit.
[2024-05-21 16:10:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 16:10:05] [INFO ] Implicit Places using invariants and state equation in 152 ms returned [45, 49]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 244 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/250 places, 180/605 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 47 transition count 179
Applied a total of 2 rules in 10 ms. Remains 47 /48 variables (removed 1) and now considering 179/180 (removed 1) transitions.
// Phase 1: matrix 179 rows 47 cols
[2024-05-21 16:10:05] [INFO ] Computed 7 invariants in 3 ms
[2024-05-21 16:10:05] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-21 16:10:05] [INFO ] Invariant cache hit.
[2024-05-21 16:10:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 16:10:05] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/250 places, 179/605 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 571 ms. Remains : 47/250 places, 179/605 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s33 0) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 21 reset in 112 ms.
Product exploration explored 100000 steps with 83 reset in 122 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 179/179 transitions.
Applied a total of 0 rules in 7 ms. Remains 47 /47 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2024-05-21 16:10:06] [INFO ] Invariant cache hit.
[2024-05-21 16:10:06] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 16:10:06] [INFO ] Invariant cache hit.
[2024-05-21 16:10:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 16:10:06] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2024-05-21 16:10:06] [INFO ] Redundant transitions in 20 ms returned [99]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 178 rows 47 cols
[2024-05-21 16:10:06] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 16:10:06] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/47 places, 178/179 transitions.
Reduce places removed 1 places and 1 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 45 transition count 176
Applied a total of 2 rules in 10 ms. Remains 45 /47 variables (removed 2) and now considering 176/178 (removed 2) transitions.
// Phase 1: matrix 176 rows 45 cols
[2024-05-21 16:10:06] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 16:10:06] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 16:10:06] [INFO ] Invariant cache hit.
[2024-05-21 16:10:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 16:10:07] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/47 places, 176/179 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 601 ms. Remains : 45/47 places, 176/179 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Finished random walk after 32 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=32 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 150 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 97 reset in 57 ms.
Product exploration explored 100000 steps with 87 reset in 65 ms.
Built C files in :
/tmp/ltsmin5419563549771001939
[2024-05-21 16:10:07] [INFO ] Computing symmetric may disable matrix : 176 transitions.
[2024-05-21 16:10:07] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:10:07] [INFO ] Computing symmetric may enable matrix : 176 transitions.
[2024-05-21 16:10:07] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:10:07] [INFO ] Computing Do-Not-Accords matrix : 176 transitions.
[2024-05-21 16:10:07] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:10:07] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5419563549771001939
Running compilation step : cd /tmp/ltsmin5419563549771001939;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 859 ms.
Running link step : cd /tmp/ltsmin5419563549771001939;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin5419563549771001939;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14635837683508468823.hoa' '--buchi-type=spotba'
LTSmin run took 392 ms.
FORMULA AutonomousCar-PT-06b-LTLCardinality-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-06b-LTLCardinality-03 finished in 4039 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 1 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 238 transition count 593
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 238 transition count 593
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 168 place count 238 transition count 449
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 171 place count 235 transition count 446
Iterating global reduction 1 with 3 rules applied. Total rules applied 174 place count 235 transition count 446
Applied a total of 174 rules in 14 ms. Remains 235 /250 variables (removed 15) and now considering 446/605 (removed 159) transitions.
// Phase 1: matrix 446 rows 235 cols
[2024-05-21 16:10:09] [INFO ] Computed 11 invariants in 4 ms
[2024-05-21 16:10:09] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-21 16:10:09] [INFO ] Invariant cache hit.
[2024-05-21 16:10:09] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2024-05-21 16:10:09] [INFO ] Invariant cache hit.
[2024-05-21 16:10:09] [INFO ] Dead Transitions using invariants and state equation in 326 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/250 places, 446/605 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 778 ms. Remains : 235/250 places, 446/605 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLCardinality-04 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:(EQ s100 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 0 ms.
FORMULA AutonomousCar-PT-06b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLCardinality-04 finished in 877 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 6 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Graph (trivial) has 226 edges and 250 vertex of which 4 / 250 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 91 place count 247 transition count 512
Reduce places removed 90 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 122 rules applied. Total rules applied 213 place count 157 transition count 480
Reduce places removed 19 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 22 rules applied. Total rules applied 235 place count 138 transition count 477
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 240 place count 135 transition count 475
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 241 place count 134 transition count 475
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 241 place count 134 transition count 468
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 255 place count 127 transition count 468
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 261 place count 121 transition count 462
Iterating global reduction 5 with 6 rules applied. Total rules applied 267 place count 121 transition count 462
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 5 with 144 rules applied. Total rules applied 411 place count 121 transition count 318
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 411 place count 121 transition count 317
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 413 place count 120 transition count 317
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 414 place count 119 transition count 311
Iterating global reduction 6 with 1 rules applied. Total rules applied 415 place count 119 transition count 311
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 417 place count 119 transition count 309
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 418 place count 118 transition count 309
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 8 with 92 rules applied. Total rules applied 510 place count 72 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 511 place count 72 transition count 262
Discarding 10 places :
Symmetric choice reduction at 9 with 10 rule applications. Total rules 521 place count 62 transition count 196
Iterating global reduction 9 with 10 rules applied. Total rules applied 531 place count 62 transition count 196
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 534 place count 62 transition count 193
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 10 with 2 rules applied. Total rules applied 536 place count 61 transition count 192
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 10 with 2 rules applied. Total rules applied 538 place count 60 transition count 192
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 539 place count 60 transition count 191
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 541 place count 60 transition count 191
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 543 place count 58 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 544 place count 57 transition count 189
Applied a total of 544 rules in 72 ms. Remains 57 /250 variables (removed 193) and now considering 189/605 (removed 416) transitions.
// Phase 1: matrix 189 rows 57 cols
[2024-05-21 16:10:10] [INFO ] Computed 9 invariants in 1 ms
[2024-05-21 16:10:10] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-21 16:10:10] [INFO ] Invariant cache hit.
[2024-05-21 16:10:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 16:10:10] [INFO ] Implicit Places using invariants and state equation in 139 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 268 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/250 places, 189/605 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 55 transition count 188
Applied a total of 2 rules in 8 ms. Remains 55 /56 variables (removed 1) and now considering 188/189 (removed 1) transitions.
// Phase 1: matrix 188 rows 55 cols
[2024-05-21 16:10:10] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 16:10:10] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 16:10:10] [INFO ] Invariant cache hit.
[2024-05-21 16:10:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 16:10:10] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/250 places, 188/605 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 560 ms. Remains : 55/250 places, 188/605 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLCardinality-05 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 s25 1) (EQ s13 1) (OR (EQ s53 0) (EQ s50 1)) (OR (EQ s18 0) (EQ s44 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 9 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLCardinality-05 finished in 612 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)&&(F(p1)||G(((p2&&F(p3)) U p4))))))'
Support contains 6 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 241 transition count 596
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 241 transition count 596
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 162 place count 241 transition count 452
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 164 place count 239 transition count 450
Iterating global reduction 1 with 2 rules applied. Total rules applied 166 place count 239 transition count 450
Applied a total of 166 rules in 11 ms. Remains 239 /250 variables (removed 11) and now considering 450/605 (removed 155) transitions.
// Phase 1: matrix 450 rows 239 cols
[2024-05-21 16:10:10] [INFO ] Computed 11 invariants in 2 ms
[2024-05-21 16:10:10] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-21 16:10:10] [INFO ] Invariant cache hit.
[2024-05-21 16:10:11] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
[2024-05-21 16:10:11] [INFO ] Invariant cache hit.
[2024-05-21 16:10:11] [INFO ] Dead Transitions using invariants and state equation in 337 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 239/250 places, 450/605 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 803 ms. Remains : 239/250 places, 450/605 transitions.
Stuttering acceptance computed with spot in 578 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p4))), (NOT p0), (OR (AND (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p4))]
Running random walk in product with property : AutonomousCar-PT-06b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p4) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p4) p2 (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p4) p2), acceptance={} source=0 dest: 4}, { cond=(OR (AND (NOT p1) p4) (AND (NOT p1) p2)), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p4) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p4) p2 (NOT p3) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p4) p2 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(OR (AND (NOT p1) p4 (NOT p0)) (AND (NOT p1) p2 (NOT p0))), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p4) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p4) p2 (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p4) p2), acceptance={0} source=2 dest: 4}, { cond=(OR (AND (NOT p1) p4) (AND (NOT p1) p2)), acceptance={} source=2 dest: 5}, { cond=(OR (AND (NOT p1) p4) (AND (NOT p1) p2)), acceptance={0} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p4) (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p4 (NOT p3)), acceptance={0} source=3 dest: 7}, { cond=(AND (NOT p1) p4 (NOT p3)), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p1) (NOT p4) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p4) p2 (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p4) p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p4) (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p4) p2 (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p4) p2), acceptance={0} source=5 dest: 4}, { cond=(OR (AND (NOT p1) p4) (AND (NOT p1) p2)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p4) (NOT p2) (NOT p0)), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p1) (NOT p4) p2 (NOT p3) (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p4) p2 (NOT p0)), acceptance={0} source=6 dest: 4}, { cond=(OR (AND (NOT p1) p4 (NOT p0)) (AND (NOT p1) p2 (NOT p0))), acceptance={} source=6 dest: 5}, { cond=(OR (AND (NOT p1) p4 (NOT p0)) (AND (NOT p1) p2 (NOT p0))), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p4) (NOT p3) (NOT p0)), acceptance={0} source=7 dest: 3}, { cond=(AND (NOT p1) p4 (NOT p3) (NOT p0)), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p1) p4 (NOT p3) (NOT p0)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p1) (NOT p4) (NOT p3)), acceptance={0} source=8 dest: 3}, { cond=(AND (NOT p1) p4 (NOT p3)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(AND (EQ s69 0) (EQ s147 1)), p4:(EQ s73 1), p2:(OR (EQ s147 0) (EQ s69 1)), p3:(OR (EQ s185 0) (EQ s132 1)), p0:(EQ s133 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 106 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-06b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLCardinality-07 finished in 1413 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(G(p0)))))'
Support contains 1 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 238 transition count 593
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 238 transition count 593
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 168 place count 238 transition count 449
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 171 place count 235 transition count 446
Iterating global reduction 1 with 3 rules applied. Total rules applied 174 place count 235 transition count 446
Applied a total of 174 rules in 12 ms. Remains 235 /250 variables (removed 15) and now considering 446/605 (removed 159) transitions.
// Phase 1: matrix 446 rows 235 cols
[2024-05-21 16:10:12] [INFO ] Computed 11 invariants in 3 ms
[2024-05-21 16:10:12] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-21 16:10:12] [INFO ] Invariant cache hit.
[2024-05-21 16:10:12] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
[2024-05-21 16:10:12] [INFO ] Invariant cache hit.
[2024-05-21 16:10:12] [INFO ] Dead Transitions using invariants and state equation in 326 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/250 places, 446/605 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 756 ms. Remains : 235/250 places, 446/605 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(EQ s40 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 74 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-06b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLCardinality-08 finished in 929 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 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 238 transition count 593
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 238 transition count 593
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 168 place count 238 transition count 449
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 171 place count 235 transition count 446
Iterating global reduction 1 with 3 rules applied. Total rules applied 174 place count 235 transition count 446
Applied a total of 174 rules in 21 ms. Remains 235 /250 variables (removed 15) and now considering 446/605 (removed 159) transitions.
[2024-05-21 16:10:12] [INFO ] Invariant cache hit.
[2024-05-21 16:10:13] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-21 16:10:13] [INFO ] Invariant cache hit.
[2024-05-21 16:10:13] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2024-05-21 16:10:13] [INFO ] Invariant cache hit.
[2024-05-21 16:10:13] [INFO ] Dead Transitions using invariants and state equation in 325 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/250 places, 446/605 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 783 ms. Remains : 235/250 places, 446/605 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s116 0) (EQ s55 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 333 ms.
Product exploration explored 100000 steps with 50000 reset in 325 ms.
Computed a total of 39 stabilizing places and 40 stable transitions
Computed a total of 39 stabilizing places and 40 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 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-06b-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-06b-LTLCardinality-09 finished in 1557 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))'
Support contains 1 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Graph (trivial) has 237 edges and 250 vertex of which 4 / 250 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 247 transition count 505
Reduce places removed 97 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 134 rules applied. Total rules applied 232 place count 150 transition count 468
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 254 place count 128 transition count 468
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 254 place count 128 transition count 462
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 266 place count 122 transition count 462
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 273 place count 115 transition count 455
Iterating global reduction 3 with 7 rules applied. Total rules applied 280 place count 115 transition count 455
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 283 place count 112 transition count 430
Iterating global reduction 3 with 3 rules applied. Total rules applied 286 place count 112 transition count 430
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 290 place count 112 transition count 426
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 292 place count 110 transition count 426
Performed 49 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 5 with 98 rules applied. Total rules applied 390 place count 61 transition count 376
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 391 place count 61 transition count 375
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 401 place count 51 transition count 249
Iterating global reduction 6 with 10 rules applied. Total rules applied 411 place count 51 transition count 249
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 415 place count 51 transition count 245
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 7 with 2 rules applied. Total rules applied 417 place count 50 transition count 244
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 419 place count 48 transition count 242
Applied a total of 419 rules in 55 ms. Remains 48 /250 variables (removed 202) and now considering 242/605 (removed 363) transitions.
// Phase 1: matrix 242 rows 48 cols
[2024-05-21 16:10:14] [INFO ] Computed 10 invariants in 1 ms
[2024-05-21 16:10:14] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-21 16:10:14] [INFO ] Invariant cache hit.
[2024-05-21 16:10:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 16:10:14] [INFO ] Implicit Places using invariants and state equation in 155 ms returned [43, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 252 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/250 places, 242/605 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 45 transition count 241
Applied a total of 2 rules in 9 ms. Remains 45 /46 variables (removed 1) and now considering 241/242 (removed 1) transitions.
// Phase 1: matrix 241 rows 45 cols
[2024-05-21 16:10:14] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 16:10:14] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-21 16:10:14] [INFO ] Invariant cache hit.
[2024-05-21 16:10:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 16:10:15] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/250 places, 241/605 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 563 ms. Remains : 45/250 places, 241/605 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 15 steps with 1 reset in 0 ms.
FORMULA AutonomousCar-PT-06b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLCardinality-11 finished in 618 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(p1)||p0)))'
Support contains 4 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 240 transition count 595
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 240 transition count 595
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 164 place count 240 transition count 451
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 167 place count 237 transition count 448
Iterating global reduction 1 with 3 rules applied. Total rules applied 170 place count 237 transition count 448
Applied a total of 170 rules in 12 ms. Remains 237 /250 variables (removed 13) and now considering 448/605 (removed 157) transitions.
// Phase 1: matrix 448 rows 237 cols
[2024-05-21 16:10:15] [INFO ] Computed 11 invariants in 3 ms
[2024-05-21 16:10:15] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-21 16:10:15] [INFO ] Invariant cache hit.
[2024-05-21 16:10:15] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2024-05-21 16:10:15] [INFO ] Invariant cache hit.
[2024-05-21 16:10:15] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 237/250 places, 448/605 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 747 ms. Remains : 237/250 places, 448/605 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-06b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(AND (NEQ s64 0) (NEQ s174 1)), p0:(OR (EQ s123 0) (EQ s139 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 305 ms.
Product exploration explored 100000 steps with 50000 reset in 304 ms.
Computed a total of 39 stabilizing places and 40 stable transitions
Computed a total of 39 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-06b-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-06b-LTLCardinality-15 finished in 1503 ms.
All properties solved by simple procedures.
Total runtime 20895 ms.

BK_STOP 1716307817793

--------------------
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-06b"
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-06b, 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-171620180300192"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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