Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.8K Feb 25 12:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 12:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 12:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 25 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 12:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.6M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutonomousCar-PT-10b-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-10b-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-10b-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-10b-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-10b-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-10b-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-10b-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-10b-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-10b-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-10b-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-10b-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-10b-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-10b-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-10b-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-10b-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-10b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678642717066

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-10b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 17:38:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 17:38:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:38:40] [INFO ] Load time of PNML (sax parser for PT used): 232 ms
[2023-03-12 17:38:40] [INFO ] Transformed 425 places.
[2023-03-12 17:38:40] [INFO ] Transformed 2252 transitions.
[2023-03-12 17:38:40] [INFO ] Found NUPN structural information;
[2023-03-12 17:38:40] [INFO ] Parsed PT model containing 425 places and 2252 transitions and 29816 arcs in 540 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA AutonomousCar-PT-10b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 425 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 425/425 places, 2252/2252 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 369 transition count 2196
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 369 transition count 2196
Ensure Unique test removed 400 transitions
Reduce isomorphic transitions removed 400 transitions.
Iterating post reduction 0 with 400 rules applied. Total rules applied 512 place count 369 transition count 1796
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 520 place count 361 transition count 1788
Iterating global reduction 1 with 8 rules applied. Total rules applied 528 place count 361 transition count 1788
Applied a total of 528 rules in 115 ms. Remains 361 /425 variables (removed 64) and now considering 1788/2252 (removed 464) transitions.
// Phase 1: matrix 1788 rows 361 cols
[2023-03-12 17:38:40] [INFO ] Computed 15 place invariants in 44 ms
[2023-03-12 17:38:42] [INFO ] Implicit Places using invariants in 1277 ms returned []
[2023-03-12 17:38:42] [INFO ] Invariant cache hit.
[2023-03-12 17:38:44] [INFO ] Implicit Places using invariants and state equation in 2300 ms returned []
Implicit Place search using SMT with State Equation took 3604 ms to find 0 implicit places.
[2023-03-12 17:38:44] [INFO ] Invariant cache hit.
[2023-03-12 17:38:45] [INFO ] Dead Transitions using invariants and state equation in 1043 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 361/425 places, 1788/2252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4778 ms. Remains : 361/425 places, 1788/2252 transitions.
Support contains 31 out of 361 places after structural reductions.
[2023-03-12 17:38:46] [INFO ] Flatten gal took : 391 ms
[2023-03-12 17:38:46] [INFO ] Flatten gal took : 267 ms
[2023-03-12 17:38:47] [INFO ] Input system was already deterministic with 1788 transitions.
Incomplete random walk after 10000 steps, including 76 resets, run finished after 482 ms. (steps per millisecond=20 ) properties (out of 21) seen :15
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :1
Running SMT prover for 4 properties.
[2023-03-12 17:38:47] [INFO ] Invariant cache hit.
[2023-03-12 17:38:48] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-12 17:38:48] [INFO ] After 173ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 17:38:48] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-12 17:38:49] [INFO ] After 795ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 17:38:50] [INFO ] Deduced a trap composed of 32 places in 1237 ms of which 6 ms to minimize.
[2023-03-12 17:38:51] [INFO ] Deduced a trap composed of 31 places in 899 ms of which 6 ms to minimize.
[2023-03-12 17:38:52] [INFO ] Deduced a trap composed of 31 places in 912 ms of which 14 ms to minimize.
[2023-03-12 17:38:52] [INFO ] Deduced a trap composed of 31 places in 654 ms of which 10 ms to minimize.
[2023-03-12 17:38:53] [INFO ] Deduced a trap composed of 31 places in 872 ms of which 15 ms to minimize.
[2023-03-12 17:38:54] [INFO ] Deduced a trap composed of 32 places in 740 ms of which 0 ms to minimize.
[2023-03-12 17:38:54] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 5624 ms
[2023-03-12 17:38:55] [INFO ] Deduced a trap composed of 24 places in 919 ms of which 1 ms to minimize.
[2023-03-12 17:38:56] [INFO ] Deduced a trap composed of 29 places in 848 ms of which 0 ms to minimize.
[2023-03-12 17:38:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1966 ms
[2023-03-12 17:38:56] [INFO ] After 8710ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 288 ms.
[2023-03-12 17:38:57] [INFO ] After 9169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 98 ms.
Support contains 7 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 1788/1788 transitions.
Graph (trivial) has 333 edges and 361 vertex of which 2 / 361 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1878 edges and 360 vertex of which 359 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.18 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 138 rules applied. Total rules applied 140 place count 359 transition count 1648
Reduce places removed 137 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 191 rules applied. Total rules applied 331 place count 222 transition count 1594
Reduce places removed 32 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 33 rules applied. Total rules applied 364 place count 190 transition count 1593
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 365 place count 189 transition count 1593
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 365 place count 189 transition count 1588
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 375 place count 184 transition count 1588
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 379 place count 180 transition count 1584
Iterating global reduction 4 with 4 rules applied. Total rules applied 383 place count 180 transition count 1584
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 383 place count 180 transition count 1582
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 387 place count 178 transition count 1582
Performed 75 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 75 places in 2 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 537 place count 103 transition count 1506
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 555 place count 85 transition count 1327
Iterating global reduction 4 with 18 rules applied. Total rules applied 573 place count 85 transition count 1327
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 582 place count 85 transition count 1318
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 584 place count 85 transition count 1316
Free-agglomeration rule applied 13 times.
Iterating global reduction 5 with 13 rules applied. Total rules applied 597 place count 85 transition count 1303
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 610 place count 72 transition count 1303
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 611 place count 72 transition count 1303
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 612 place count 71 transition count 1302
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 613 place count 70 transition count 1302
Applied a total of 613 rules in 795 ms. Remains 70 /361 variables (removed 291) and now considering 1302/1788 (removed 486) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 808 ms. Remains : 70/361 places, 1302/1788 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :3
Finished Best-First random walk after 35 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=35 )
Computed a total of 57 stabilizing places and 58 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 1788/1788 transitions.
Graph (trivial) has 343 edges and 361 vertex of which 4 / 361 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 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 139 place count 358 transition count 1647
Reduce places removed 138 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 1 with 194 rules applied. Total rules applied 333 place count 220 transition count 1591
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 366 place count 187 transition count 1591
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 366 place count 187 transition count 1586
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 376 place count 182 transition count 1586
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 383 place count 175 transition count 1579
Iterating global reduction 3 with 7 rules applied. Total rules applied 390 place count 175 transition count 1579
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 390 place count 175 transition count 1577
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 394 place count 173 transition count 1577
Performed 76 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 546 place count 97 transition count 1500
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 567 place count 76 transition count 1289
Iterating global reduction 3 with 21 rules applied. Total rules applied 588 place count 76 transition count 1289
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 598 place count 76 transition count 1279
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 4 with 2 rules applied. Total rules applied 600 place count 75 transition count 1278
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 602 place count 73 transition count 1276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 603 place count 72 transition count 1276
Applied a total of 603 rules in 547 ms. Remains 72 /361 variables (removed 289) and now considering 1276/1788 (removed 512) transitions.
// Phase 1: matrix 1276 rows 72 cols
[2023-03-12 17:38:59] [INFO ] Computed 13 place invariants in 9 ms
[2023-03-12 17:38:59] [INFO ] Implicit Places using invariants in 747 ms returned []
[2023-03-12 17:39:00] [INFO ] Invariant cache hit.
[2023-03-12 17:39:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 17:39:01] [INFO ] Implicit Places using invariants and state equation in 1389 ms returned [67, 71]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2150 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/361 places, 1276/1788 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 69 transition count 1275
Applied a total of 2 rules in 120 ms. Remains 69 /70 variables (removed 1) and now considering 1275/1276 (removed 1) transitions.
// Phase 1: matrix 1275 rows 69 cols
[2023-03-12 17:39:01] [INFO ] Computed 11 place invariants in 38 ms
[2023-03-12 17:39:02] [INFO ] Implicit Places using invariants in 751 ms returned []
[2023-03-12 17:39:02] [INFO ] Invariant cache hit.
[2023-03-12 17:39:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:39:03] [INFO ] Implicit Places using invariants and state equation in 1280 ms returned []
Implicit Place search using SMT with State Equation took 2060 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 69/361 places, 1275/1788 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4897 ms. Remains : 69/361 places, 1275/1788 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 457 reset in 318 ms.
Product exploration explored 100000 steps with 236 reset in 139 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 167 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Finished random walk after 52 steps, including 2 resets, run visited all 1 properties in 10 ms. (steps per millisecond=5 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0)]
Support contains 1 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 1275/1275 transitions.
Applied a total of 0 rules in 93 ms. Remains 69 /69 variables (removed 0) and now considering 1275/1275 (removed 0) transitions.
[2023-03-12 17:39:04] [INFO ] Invariant cache hit.
[2023-03-12 17:39:05] [INFO ] Implicit Places using invariants in 847 ms returned []
[2023-03-12 17:39:05] [INFO ] Invariant cache hit.
[2023-03-12 17:39:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:39:07] [INFO ] Implicit Places using invariants and state equation in 1291 ms returned []
Implicit Place search using SMT with State Equation took 2149 ms to find 0 implicit places.
[2023-03-12 17:39:07] [INFO ] Redundant transitions in 134 ms returned [1272]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1274 rows 69 cols
[2023-03-12 17:39:07] [INFO ] Computed 11 place invariants in 9 ms
[2023-03-12 17:39:07] [INFO ] Dead Transitions using invariants and state equation in 465 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/69 places, 1274/1275 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 67 transition count 1272
Applied a total of 2 rules in 130 ms. Remains 67 /69 variables (removed 2) and now considering 1272/1274 (removed 2) transitions.
// Phase 1: matrix 1272 rows 67 cols
[2023-03-12 17:39:07] [INFO ] Computed 11 place invariants in 17 ms
[2023-03-12 17:39:08] [INFO ] Implicit Places using invariants in 1128 ms returned []
[2023-03-12 17:39:08] [INFO ] Invariant cache hit.
[2023-03-12 17:39:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:39:10] [INFO ] Implicit Places using invariants and state equation in 1423 ms returned []
Implicit Place search using SMT with State Equation took 2592 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/69 places, 1272/1275 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5575 ms. Remains : 67/69 places, 1272/1275 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 159 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0)]
Finished random walk after 81 steps, including 4 resets, run visited all 1 properties in 2 ms. (steps per millisecond=40 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 185 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 772 reset in 173 ms.
Product exploration explored 100000 steps with 370 reset in 227 ms.
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 1272/1272 transitions.
Applied a total of 0 rules in 59 ms. Remains 67 /67 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
[2023-03-12 17:39:11] [INFO ] Invariant cache hit.
[2023-03-12 17:39:12] [INFO ] Implicit Places using invariants in 722 ms returned []
[2023-03-12 17:39:12] [INFO ] Invariant cache hit.
[2023-03-12 17:39:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:39:13] [INFO ] Implicit Places using invariants and state equation in 1375 ms returned []
Implicit Place search using SMT with State Equation took 2111 ms to find 0 implicit places.
[2023-03-12 17:39:13] [INFO ] Redundant transitions in 261 ms returned []
[2023-03-12 17:39:13] [INFO ] Invariant cache hit.
[2023-03-12 17:39:14] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3044 ms. Remains : 67/67 places, 1272/1272 transitions.
Treatment of property AutonomousCar-PT-10b-LTLCardinality-00 finished in 16296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 1788/1788 transitions.
Graph (trivial) has 342 edges and 361 vertex of which 4 / 361 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 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 138 place count 358 transition count 1648
Reduce places removed 137 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 195 rules applied. Total rules applied 333 place count 221 transition count 1590
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 35 rules applied. Total rules applied 368 place count 187 transition count 1589
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 369 place count 186 transition count 1589
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 369 place count 186 transition count 1584
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 379 place count 181 transition count 1584
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 386 place count 174 transition count 1577
Iterating global reduction 4 with 7 rules applied. Total rules applied 393 place count 174 transition count 1577
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 393 place count 174 transition count 1575
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 397 place count 172 transition count 1575
Performed 75 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 547 place count 97 transition count 1499
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 567 place count 77 transition count 1299
Iterating global reduction 4 with 20 rules applied. Total rules applied 587 place count 77 transition count 1299
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 597 place count 77 transition count 1289
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 5 with 2 rules applied. Total rules applied 599 place count 76 transition count 1288
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 601 place count 74 transition count 1286
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 602 place count 73 transition count 1286
Applied a total of 602 rules in 367 ms. Remains 73 /361 variables (removed 288) and now considering 1286/1788 (removed 502) transitions.
// Phase 1: matrix 1286 rows 73 cols
[2023-03-12 17:39:15] [INFO ] Computed 13 place invariants in 21 ms
[2023-03-12 17:39:16] [INFO ] Implicit Places using invariants in 827 ms returned []
[2023-03-12 17:39:16] [INFO ] Invariant cache hit.
[2023-03-12 17:39:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 17:39:17] [INFO ] Implicit Places using invariants and state equation in 1538 ms returned [68, 72]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2384 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/361 places, 1286/1788 transitions.
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 2 place count 70 transition count 1285
Applied a total of 2 rules in 118 ms. Remains 70 /71 variables (removed 1) and now considering 1285/1286 (removed 1) transitions.
// Phase 1: matrix 1285 rows 70 cols
[2023-03-12 17:39:17] [INFO ] Computed 11 place invariants in 7 ms
[2023-03-12 17:39:18] [INFO ] Implicit Places using invariants in 707 ms returned []
[2023-03-12 17:39:18] [INFO ] Invariant cache hit.
[2023-03-12 17:39:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:39:19] [INFO ] Implicit Places using invariants and state equation in 1180 ms returned []
Implicit Place search using SMT with State Equation took 1907 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 70/361 places, 1285/1788 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4789 ms. Remains : 70/361 places, 1285/1788 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s12 0) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1382 reset in 471 ms.
Product exploration explored 100000 steps with 2295 reset in 597 ms.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 185 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 245 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Support contains 2 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 1285/1285 transitions.
Applied a total of 0 rules in 94 ms. Remains 70 /70 variables (removed 0) and now considering 1285/1285 (removed 0) transitions.
[2023-03-12 17:39:21] [INFO ] Invariant cache hit.
[2023-03-12 17:39:22] [INFO ] Implicit Places using invariants in 845 ms returned []
[2023-03-12 17:39:22] [INFO ] Invariant cache hit.
[2023-03-12 17:39:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:39:23] [INFO ] Implicit Places using invariants and state equation in 1404 ms returned []
Implicit Place search using SMT with State Equation took 2292 ms to find 0 implicit places.
[2023-03-12 17:39:24] [INFO ] Redundant transitions in 72 ms returned [1282]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1284 rows 70 cols
[2023-03-12 17:39:24] [INFO ] Computed 11 place invariants in 7 ms
[2023-03-12 17:39:24] [INFO ] Dead Transitions using invariants and state equation in 647 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/70 places, 1284/1285 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 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 1282
Applied a total of 2 rules in 90 ms. Remains 68 /70 variables (removed 2) and now considering 1282/1284 (removed 2) transitions.
// Phase 1: matrix 1282 rows 68 cols
[2023-03-12 17:39:24] [INFO ] Computed 11 place invariants in 8 ms
[2023-03-12 17:39:25] [INFO ] Implicit Places using invariants in 837 ms returned []
[2023-03-12 17:39:25] [INFO ] Invariant cache hit.
[2023-03-12 17:39:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:39:26] [INFO ] Implicit Places using invariants and state equation in 1354 ms returned []
Implicit Place search using SMT with State Equation took 2212 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 68/70 places, 1282/1285 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5423 ms. Remains : 68/70 places, 1282/1285 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 304 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 177 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0)]
Product exploration explored 100000 steps with 321 reset in 156 ms.
Product exploration explored 100000 steps with 503 reset in 181 ms.
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 1282/1282 transitions.
Applied a total of 0 rules in 105 ms. Remains 68 /68 variables (removed 0) and now considering 1282/1282 (removed 0) transitions.
[2023-03-12 17:39:28] [INFO ] Invariant cache hit.
[2023-03-12 17:39:29] [INFO ] Implicit Places using invariants in 1208 ms returned []
[2023-03-12 17:39:29] [INFO ] Invariant cache hit.
[2023-03-12 17:39:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:39:30] [INFO ] Implicit Places using invariants and state equation in 1498 ms returned []
Implicit Place search using SMT with State Equation took 2736 ms to find 0 implicit places.
[2023-03-12 17:39:31] [INFO ] Redundant transitions in 73 ms returned []
[2023-03-12 17:39:31] [INFO ] Invariant cache hit.
[2023-03-12 17:39:31] [INFO ] Dead Transitions using invariants and state equation in 780 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3713 ms. Remains : 68/68 places, 1282/1282 transitions.
Treatment of property AutonomousCar-PT-10b-LTLCardinality-01 finished in 17199 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(p1)))))'
Support contains 3 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 1788/1788 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 351 transition count 1778
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 351 transition count 1778
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 349 transition count 1776
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 349 transition count 1776
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 348 transition count 1775
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 348 transition count 1775
Applied a total of 26 rules in 39 ms. Remains 348 /361 variables (removed 13) and now considering 1775/1788 (removed 13) transitions.
// Phase 1: matrix 1775 rows 348 cols
[2023-03-12 17:39:32] [INFO ] Computed 15 place invariants in 9 ms
[2023-03-12 17:39:33] [INFO ] Implicit Places using invariants in 986 ms returned []
[2023-03-12 17:39:33] [INFO ] Invariant cache hit.
[2023-03-12 17:39:34] [INFO ] Implicit Places using invariants and state equation in 1610 ms returned []
Implicit Place search using SMT with State Equation took 2608 ms to find 0 implicit places.
[2023-03-12 17:39:34] [INFO ] Invariant cache hit.
[2023-03-12 17:39:35] [INFO ] Dead Transitions using invariants and state equation in 886 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 348/361 places, 1775/1788 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3535 ms. Remains : 348/361 places, 1775/1788 transitions.
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s303 1), p1:(AND (EQ s157 0) (EQ s147 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-10b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLCardinality-03 finished in 3817 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0))&&(G(p1) U X(p2)))))'
Support contains 5 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 1788/1788 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 353 transition count 1780
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 353 transition count 1780
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 352 transition count 1779
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 352 transition count 1779
Applied a total of 18 rules in 51 ms. Remains 352 /361 variables (removed 9) and now considering 1779/1788 (removed 9) transitions.
// Phase 1: matrix 1779 rows 352 cols
[2023-03-12 17:39:36] [INFO ] Computed 15 place invariants in 43 ms
[2023-03-12 17:39:36] [INFO ] Implicit Places using invariants in 959 ms returned []
[2023-03-12 17:39:36] [INFO ] Invariant cache hit.
[2023-03-12 17:39:38] [INFO ] Implicit Places using invariants and state equation in 1433 ms returned []
Implicit Place search using SMT with State Equation took 2434 ms to find 0 implicit places.
[2023-03-12 17:39:38] [INFO ] Invariant cache hit.
[2023-03-12 17:39:39] [INFO ] Dead Transitions using invariants and state equation in 776 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 352/361 places, 1779/1788 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3264 ms. Remains : 352/361 places, 1779/1788 transitions.
Stuttering acceptance computed with spot in 401 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (NOT p0), true, (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 6}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 7}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(OR (EQ s333 0) (EQ s88 1)), p2:(EQ s270 1), p0:(AND (EQ s39 0) (EQ s252 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][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLCardinality-07 finished in 3710 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G((p1&&X((G(p1)||X(F(!p1)))))))))'
Support contains 4 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 1788/1788 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 352 transition count 1779
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 352 transition count 1779
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 350 transition count 1777
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 350 transition count 1777
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 349 transition count 1776
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 349 transition count 1776
Applied a total of 24 rules in 64 ms. Remains 349 /361 variables (removed 12) and now considering 1776/1788 (removed 12) transitions.
// Phase 1: matrix 1776 rows 349 cols
[2023-03-12 17:39:39] [INFO ] Computed 15 place invariants in 8 ms
[2023-03-12 17:39:40] [INFO ] Implicit Places using invariants in 1074 ms returned []
[2023-03-12 17:39:40] [INFO ] Invariant cache hit.
[2023-03-12 17:39:42] [INFO ] Implicit Places using invariants and state equation in 1646 ms returned []
Implicit Place search using SMT with State Equation took 2746 ms to find 0 implicit places.
[2023-03-12 17:39:42] [INFO ] Invariant cache hit.
[2023-03-12 17:39:43] [INFO ] Dead Transitions using invariants and state equation in 821 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 349/361 places, 1776/1788 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3633 ms. Remains : 349/361 places, 1776/1788 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-10b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s5 0) (EQ s8 1)), p0:(AND (EQ s244 0) (EQ s199 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 21 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-10b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLCardinality-08 finished in 3821 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((X(p0) U (X(X(G(p2)))||p1))) U p2)))'
Support contains 6 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 1788/1788 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 353 transition count 1780
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 353 transition count 1780
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 351 transition count 1778
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 351 transition count 1778
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 350 transition count 1777
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 350 transition count 1777
Applied a total of 22 rules in 68 ms. Remains 350 /361 variables (removed 11) and now considering 1777/1788 (removed 11) transitions.
// Phase 1: matrix 1777 rows 350 cols
[2023-03-12 17:39:43] [INFO ] Computed 15 place invariants in 19 ms
[2023-03-12 17:39:44] [INFO ] Implicit Places using invariants in 952 ms returned []
[2023-03-12 17:39:44] [INFO ] Invariant cache hit.
[2023-03-12 17:39:45] [INFO ] Implicit Places using invariants and state equation in 1239 ms returned []
Implicit Place search using SMT with State Equation took 2223 ms to find 0 implicit places.
[2023-03-12 17:39:45] [INFO ] Invariant cache hit.
[2023-03-12 17:39:46] [INFO ] Dead Transitions using invariants and state equation in 688 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 350/361 places, 1777/1788 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2989 ms. Remains : 350/361 places, 1777/1788 transitions.
Stuttering acceptance computed with spot in 340 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : AutonomousCar-PT-10b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (EQ s108 0) (EQ s243 1)), p1:(OR (EQ s323 0) (EQ s286 1)), p0:(AND (OR (EQ s323 0) (EQ s286 1)) (OR (EQ s72 0) (EQ s245 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 552 ms.
Product exploration explored 100000 steps with 50000 reset in 340 ms.
Computed a total of 52 stabilizing places and 53 stable transitions
Computed a total of 52 stabilizing places and 53 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (X p0)), true, (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 9 factoid took 275 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-10b-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-10b-LTLCardinality-09 finished in 4568 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G((F(G(p2))&&p1)))))'
Support contains 4 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 1788/1788 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 350 transition count 1777
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 350 transition count 1777
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 348 transition count 1775
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 348 transition count 1775
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 347 transition count 1774
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 347 transition count 1774
Applied a total of 28 rules in 58 ms. Remains 347 /361 variables (removed 14) and now considering 1774/1788 (removed 14) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2023-03-12 17:39:48] [INFO ] Computed 15 place invariants in 24 ms
[2023-03-12 17:39:49] [INFO ] Implicit Places using invariants in 929 ms returned []
[2023-03-12 17:39:49] [INFO ] Invariant cache hit.
[2023-03-12 17:39:50] [INFO ] Implicit Places using invariants and state equation in 1713 ms returned []
Implicit Place search using SMT with State Equation took 2673 ms to find 0 implicit places.
[2023-03-12 17:39:50] [INFO ] Invariant cache hit.
[2023-03-12 17:39:51] [INFO ] Dead Transitions using invariants and state equation in 924 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 347/361 places, 1774/1788 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3674 ms. Remains : 347/361 places, 1774/1788 transitions.
Stuttering acceptance computed with spot in 312 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p2), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-10b-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s136 0) (EQ s140 1)), p1:(AND (NEQ s187 0) (NEQ s157 1)), p2:(AND (NEQ s187 0) (NEQ s157 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-10b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLCardinality-12 finished in 4024 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(p1)))'
Support contains 2 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 1788/1788 transitions.
Graph (trivial) has 341 edges and 361 vertex of which 4 / 361 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 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 138 place count 358 transition count 1648
Reduce places removed 137 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 195 rules applied. Total rules applied 333 place count 221 transition count 1590
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 35 rules applied. Total rules applied 368 place count 187 transition count 1589
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 369 place count 186 transition count 1589
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 369 place count 186 transition count 1584
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 379 place count 181 transition count 1584
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 386 place count 174 transition count 1577
Iterating global reduction 4 with 7 rules applied. Total rules applied 393 place count 174 transition count 1577
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 393 place count 174 transition count 1575
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 397 place count 172 transition count 1575
Performed 74 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 545 place count 98 transition count 1500
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 566 place count 77 transition count 1289
Iterating global reduction 4 with 21 rules applied. Total rules applied 587 place count 77 transition count 1289
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 597 place count 77 transition count 1279
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 5 with 2 rules applied. Total rules applied 599 place count 76 transition count 1278
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 601 place count 74 transition count 1276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 602 place count 73 transition count 1276
Applied a total of 602 rules in 335 ms. Remains 73 /361 variables (removed 288) and now considering 1276/1788 (removed 512) transitions.
// Phase 1: matrix 1276 rows 73 cols
[2023-03-12 17:39:52] [INFO ] Computed 13 place invariants in 5 ms
[2023-03-12 17:39:53] [INFO ] Implicit Places using invariants in 829 ms returned []
[2023-03-12 17:39:53] [INFO ] Invariant cache hit.
[2023-03-12 17:39:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 17:39:54] [INFO ] Implicit Places using invariants and state equation in 1352 ms returned [68, 72]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2214 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/361 places, 1276/1788 transitions.
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 2 place count 70 transition count 1275
Applied a total of 2 rules in 121 ms. Remains 70 /71 variables (removed 1) and now considering 1275/1276 (removed 1) transitions.
// Phase 1: matrix 1275 rows 70 cols
[2023-03-12 17:39:54] [INFO ] Computed 11 place invariants in 5 ms
[2023-03-12 17:39:55] [INFO ] Implicit Places using invariants in 917 ms returned []
[2023-03-12 17:39:55] [INFO ] Invariant cache hit.
[2023-03-12 17:39:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:39:57] [INFO ] Implicit Places using invariants and state equation in 1494 ms returned []
Implicit Place search using SMT with State Equation took 2427 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 70/361 places, 1275/1788 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5097 ms. Remains : 70/361 places, 1275/1788 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s12 0), p0:(EQ s33 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLCardinality-14 finished in 5269 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1))||(!p2 U (p3||G(!p2))))))'
Support contains 6 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 1788/1788 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 351 transition count 1778
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 351 transition count 1778
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 350 transition count 1777
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 350 transition count 1777
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 349 transition count 1776
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 349 transition count 1776
Applied a total of 24 rules in 75 ms. Remains 349 /361 variables (removed 12) and now considering 1776/1788 (removed 12) transitions.
// Phase 1: matrix 1776 rows 349 cols
[2023-03-12 17:39:57] [INFO ] Computed 15 place invariants in 26 ms
[2023-03-12 17:39:58] [INFO ] Implicit Places using invariants in 1193 ms returned []
[2023-03-12 17:39:58] [INFO ] Invariant cache hit.
[2023-03-12 17:40:00] [INFO ] Implicit Places using invariants and state equation in 1667 ms returned []
Implicit Place search using SMT with State Equation took 2865 ms to find 0 implicit places.
[2023-03-12 17:40:00] [INFO ] Invariant cache hit.
[2023-03-12 17:40:01] [INFO ] Dead Transitions using invariants and state equation in 734 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 349/361 places, 1776/1788 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3675 ms. Remains : 349/361 places, 1776/1788 transitions.
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p3) p2 (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p3) p2), (AND (NOT p0) (NOT p3) p2 (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-10b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(AND (EQ s339 0) (EQ s79 1)), p3:(AND (NOT (OR (EQ s253 0) (EQ s90 1))) (NOT (OR (EQ s329 0) (EQ s315 1)))), p2:(OR (EQ s329 0) (EQ s315 1)), p1:(AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 127 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLCardinality-15 finished in 3964 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-12 17:40:02] [INFO ] Flatten gal took : 284 ms
[2023-03-12 17:40:02] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 17:40:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 361 places, 1788 transitions and 26488 arcs took 54 ms.
Total runtime 82256 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1039/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1039/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : AutonomousCar-PT-10b-LTLCardinality-00
Could not compute solution for formula : AutonomousCar-PT-10b-LTLCardinality-01

BK_STOP 1678642803769

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name AutonomousCar-PT-10b-LTLCardinality-00
ltl formula formula --ltl=/tmp/1039/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 361 places, 1788 transitions and 26488 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.330 real 0.190 user 0.080 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1039/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1039/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1039/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1039/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55b4e6f453f4]
1: pnml2lts-mc(+0xa2496) [0x55b4e6f45496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fa023335140]
3: pnml2lts-mc(+0x405be5) [0x55b4e72a8be5]
4: pnml2lts-mc(+0x16b3f9) [0x55b4e700e3f9]
5: pnml2lts-mc(+0x164ac4) [0x55b4e7007ac4]
6: pnml2lts-mc(+0x272e0a) [0x55b4e7115e0a]
7: pnml2lts-mc(+0xb61f0) [0x55b4e6f591f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fa0231884d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fa02318867a]
10: pnml2lts-mc(+0xa1581) [0x55b4e6f44581]
11: pnml2lts-mc(+0xa1910) [0x55b4e6f44910]
12: pnml2lts-mc(+0xa32a2) [0x55b4e6f462a2]
13: pnml2lts-mc(+0xa50f4) [0x55b4e6f480f4]
14: pnml2lts-mc(+0xa516b) [0x55b4e6f4816b]
15: pnml2lts-mc(+0x3f34b3) [0x55b4e72964b3]
16: pnml2lts-mc(+0x7c63d) [0x55b4e6f1f63d]
17: pnml2lts-mc(+0x67d86) [0x55b4e6f0ad86]
18: pnml2lts-mc(+0x60a8a) [0x55b4e6f03a8a]
19: pnml2lts-mc(+0x5eb15) [0x55b4e6f01b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fa023170d0a]
21: pnml2lts-mc(+0x6075e) [0x55b4e6f0375e]
ltl formula name AutonomousCar-PT-10b-LTLCardinality-01
ltl formula formula --ltl=/tmp/1039/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 361 places, 1788 transitions and 26488 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.310 real 0.160 user 0.110 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1039/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1039/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1039/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1039/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-10b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is AutonomousCar-PT-10b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r009-oct2-167813598200683"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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