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-167813598200638.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-07b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598200638
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 6.6K Feb 25 12:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 12:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 12:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 12:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 25 12:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Feb 25 12:57 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 334K 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-07b-ReachabilityCardinality-00
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-01
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-02
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-03
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-04
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-05
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-06
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-07
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-08
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-09
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-10
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-11
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-12
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-13
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-14
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678638859861

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-07b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:34:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 16:34:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:34:23] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2023-03-12 16:34:23] [INFO ] Transformed 323 places.
[2023-03-12 16:34:23] [INFO ] Transformed 846 transitions.
[2023-03-12 16:34:23] [INFO ] Found NUPN structural information;
[2023-03-12 16:34:23] [INFO ] Parsed PT model containing 323 places and 846 transitions and 5865 arcs in 327 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 72 resets, run finished after 435 ms. (steps per millisecond=22 ) properties (out of 15) seen :9
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 846 rows 323 cols
[2023-03-12 16:34:24] [INFO ] Computed 12 place invariants in 25 ms
[2023-03-12 16:34:25] [INFO ] After 400ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 16:34:25] [INFO ] [Nat]Absence check using 12 positive place invariants in 26 ms returned sat
[2023-03-12 16:34:26] [INFO ] After 605ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2023-03-12 16:34:27] [INFO ] Deduced a trap composed of 35 places in 785 ms of which 18 ms to minimize.
[2023-03-12 16:34:27] [INFO ] Deduced a trap composed of 45 places in 463 ms of which 1 ms to minimize.
[2023-03-12 16:34:27] [INFO ] Deduced a trap composed of 49 places in 224 ms of which 1 ms to minimize.
[2023-03-12 16:34:28] [INFO ] Deduced a trap composed of 48 places in 267 ms of which 2 ms to minimize.
[2023-03-12 16:34:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1911 ms
[2023-03-12 16:34:28] [INFO ] Deduced a trap composed of 15 places in 512 ms of which 14 ms to minimize.
[2023-03-12 16:34:29] [INFO ] Deduced a trap composed of 35 places in 327 ms of which 1 ms to minimize.
[2023-03-12 16:34:29] [INFO ] Deduced a trap composed of 35 places in 341 ms of which 1 ms to minimize.
[2023-03-12 16:34:30] [INFO ] Deduced a trap composed of 35 places in 404 ms of which 9 ms to minimize.
[2023-03-12 16:34:30] [INFO ] Deduced a trap composed of 7 places in 449 ms of which 1 ms to minimize.
[2023-03-12 16:34:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2231 ms
[2023-03-12 16:34:30] [INFO ] After 5159ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 299 ms.
[2023-03-12 16:34:31] [INFO ] After 5773ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 81 ms.
Support contains 62 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 846/846 transitions.
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 323 transition count 762
Reduce places removed 84 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 92 rules applied. Total rules applied 176 place count 239 transition count 754
Reduce places removed 3 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 2 with 24 rules applied. Total rules applied 200 place count 236 transition count 733
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 26 rules applied. Total rules applied 226 place count 215 transition count 728
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 228 place count 213 transition count 728
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 228 place count 213 transition count 715
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 254 place count 200 transition count 715
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 273 place count 181 transition count 696
Iterating global reduction 5 with 19 rules applied. Total rules applied 292 place count 181 transition count 696
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 5 with 198 rules applied. Total rules applied 490 place count 181 transition count 498
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 490 place count 181 transition count 496
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 494 place count 179 transition count 496
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 495 place count 178 transition count 489
Iterating global reduction 6 with 1 rules applied. Total rules applied 496 place count 178 transition count 489
Performed 26 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 52 rules applied. Total rules applied 548 place count 152 transition count 462
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 550 place count 151 transition count 462
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 554 place count 151 transition count 458
Free-agglomeration rule applied 11 times.
Iterating global reduction 6 with 11 rules applied. Total rules applied 565 place count 151 transition count 447
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 576 place count 140 transition count 447
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 577 place count 140 transition count 447
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 578 place count 139 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 579 place count 138 transition count 446
Applied a total of 579 rules in 264 ms. Remains 138 /323 variables (removed 185) and now considering 446/846 (removed 400) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 266 ms. Remains : 138/323 places, 446/846 transitions.
Incomplete random walk after 10000 steps, including 248 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :1
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 446 rows 138 cols
[2023-03-12 16:34:31] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-12 16:34:32] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 16:34:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-12 16:34:32] [INFO ] After 391ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 16:34:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:34:32] [INFO ] After 179ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 16:34:33] [INFO ] Deduced a trap composed of 11 places in 201 ms of which 0 ms to minimize.
[2023-03-12 16:34:33] [INFO ] Deduced a trap composed of 15 places in 229 ms of which 1 ms to minimize.
[2023-03-12 16:34:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 489 ms
[2023-03-12 16:34:33] [INFO ] After 842ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 204 ms.
[2023-03-12 16:34:33] [INFO ] After 1631ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 25 ms.
Support contains 47 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 446/446 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 138 transition count 442
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 7 rules applied. Total rules applied 11 place count 134 transition count 439
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 14 place count 131 transition count 439
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 14 place count 131 transition count 437
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 18 place count 129 transition count 437
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 22 place count 125 transition count 421
Iterating global reduction 3 with 4 rules applied. Total rules applied 26 place count 125 transition count 421
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
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 36 place count 120 transition count 416
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 38 place count 120 transition count 414
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 40 place count 120 transition count 412
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 42 place count 118 transition count 412
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 43 place count 118 transition count 412
Applied a total of 43 rules in 82 ms. Remains 118 /138 variables (removed 20) and now considering 412/446 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 118/138 places, 412/446 transitions.
Incomplete random walk after 10000 steps, including 315 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :1
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 46 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 412 rows 118 cols
[2023-03-12 16:34:34] [INFO ] Computed 11 place invariants in 6 ms
[2023-03-12 16:34:34] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:34:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2023-03-12 16:34:34] [INFO ] After 228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 16:34:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:34:34] [INFO ] After 50ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 16:34:34] [INFO ] Deduced a trap composed of 13 places in 236 ms of which 1 ms to minimize.
[2023-03-12 16:34:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
[2023-03-12 16:34:34] [INFO ] After 420ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 127 ms.
[2023-03-12 16:34:35] [INFO ] After 882ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 21 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 412/412 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 118 transition count 397
Reduce places removed 15 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 19 rules applied. Total rules applied 34 place count 103 transition count 393
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 40 place count 99 transition count 391
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 42 place count 98 transition count 390
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 42 place count 98 transition count 389
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 44 place count 97 transition count 389
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 46 place count 95 transition count 374
Iterating global reduction 4 with 2 rules applied. Total rules applied 48 place count 95 transition count 374
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 50 place count 95 transition count 372
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 51 place count 94 transition count 372
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 67 place count 86 transition count 364
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 68 place count 86 transition count 363
Free-agglomeration rule applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 74 place count 86 transition count 357
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 80 place count 80 transition count 357
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 82 place count 78 transition count 355
Applied a total of 82 rules in 68 ms. Remains 78 /118 variables (removed 40) and now considering 355/412 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 78/118 places, 355/412 transitions.
Incomplete random walk after 10000 steps, including 59 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 984658 steps, run timeout after 3001 ms. (steps per millisecond=328 ) properties seen :{}
Probabilistic random walk after 984658 steps, saw 142160 distinct states, run finished after 3005 ms. (steps per millisecond=327 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 355 rows 78 cols
[2023-03-12 16:34:38] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-12 16:34:38] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:34:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-12 16:34:38] [INFO ] After 519ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 16:34:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:34:39] [INFO ] After 84ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 16:34:39] [INFO ] Deduced a trap composed of 7 places in 561 ms of which 1 ms to minimize.
[2023-03-12 16:34:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 592 ms
[2023-03-12 16:34:39] [INFO ] Deduced a trap composed of 7 places in 222 ms of which 0 ms to minimize.
[2023-03-12 16:34:40] [INFO ] Deduced a trap composed of 7 places in 237 ms of which 0 ms to minimize.
[2023-03-12 16:34:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 513 ms
[2023-03-12 16:34:40] [INFO ] After 1249ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-12 16:34:40] [INFO ] After 1963ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 21 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 355/355 transitions.
Applied a total of 0 rules in 9 ms. Remains 78 /78 variables (removed 0) and now considering 355/355 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 78/78 places, 355/355 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 355/355 transitions.
Applied a total of 0 rules in 9 ms. Remains 78 /78 variables (removed 0) and now considering 355/355 (removed 0) transitions.
[2023-03-12 16:34:40] [INFO ] Invariant cache hit.
[2023-03-12 16:34:40] [INFO ] Implicit Places using invariants in 348 ms returned []
[2023-03-12 16:34:40] [INFO ] Invariant cache hit.
[2023-03-12 16:34:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:34:41] [INFO ] Implicit Places using invariants and state equation in 667 ms returned [69, 76]
Discarding 2 places :
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 1020 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 76/78 places, 354/355 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 76 transition count 353
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 75 transition count 353
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 75 transition count 352
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 74 transition count 352
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 5 place count 74 transition count 352
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6 place count 73 transition count 352
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 7 place count 73 transition count 352
Applied a total of 7 rules in 79 ms. Remains 73 /76 variables (removed 3) and now considering 352/354 (removed 2) transitions.
// Phase 1: matrix 352 rows 73 cols
[2023-03-12 16:34:41] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-12 16:34:41] [INFO ] Implicit Places using invariants in 407 ms returned []
[2023-03-12 16:34:41] [INFO ] Invariant cache hit.
[2023-03-12 16:34:42] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 73/78 places, 352/355 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1742 ms. Remains : 73/78 places, 352/355 transitions.
Incomplete random walk after 10000 steps, including 31 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1338596 steps, run timeout after 3001 ms. (steps per millisecond=446 ) properties seen :{1=1}
Probabilistic random walk after 1338596 steps, saw 189804 distinct states, run finished after 3001 ms. (steps per millisecond=446 ) properties seen :1
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
[2023-03-12 16:34:45] [INFO ] Invariant cache hit.
[2023-03-12 16:34:45] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:34:45] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 16:34:45] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:34:45] [INFO ] Deduced a trap composed of 5 places in 202 ms of which 1 ms to minimize.
[2023-03-12 16:34:45] [INFO ] Deduced a trap composed of 7 places in 281 ms of which 0 ms to minimize.
[2023-03-12 16:34:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 521 ms
[2023-03-12 16:34:45] [INFO ] After 701ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-12 16:34:46] [INFO ] After 785ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 16 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 352/352 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 73 transition count 349
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 70 transition count 348
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 69 transition count 347
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 10 place count 69 transition count 346
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 11 place count 68 transition count 346
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 12 place count 67 transition count 345
Applied a total of 12 rules in 72 ms. Remains 67 /73 variables (removed 6) and now considering 345/352 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 67/73 places, 345/352 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2128010 steps, run timeout after 3001 ms. (steps per millisecond=709 ) properties seen :{}
Probabilistic random walk after 2128010 steps, saw 294148 distinct states, run finished after 3014 ms. (steps per millisecond=706 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 345 rows 67 cols
[2023-03-12 16:34:49] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-12 16:34:49] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:34:49] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-12 16:34:49] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:34:49] [INFO ] Deduced a trap composed of 7 places in 242 ms of which 1 ms to minimize.
[2023-03-12 16:34:49] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 0 ms to minimize.
[2023-03-12 16:34:50] [INFO ] Deduced a trap composed of 7 places in 266 ms of which 22 ms to minimize.
[2023-03-12 16:34:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 688 ms
[2023-03-12 16:34:50] [INFO ] After 842ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-12 16:34:50] [INFO ] After 984ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 16 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 345/345 transitions.
Applied a total of 0 rules in 23 ms. Remains 67 /67 variables (removed 0) and now considering 345/345 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 67/67 places, 345/345 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 345/345 transitions.
Applied a total of 0 rules in 27 ms. Remains 67 /67 variables (removed 0) and now considering 345/345 (removed 0) transitions.
[2023-03-12 16:34:50] [INFO ] Invariant cache hit.
[2023-03-12 16:34:50] [INFO ] Implicit Places using invariants in 310 ms returned []
[2023-03-12 16:34:50] [INFO ] Invariant cache hit.
[2023-03-12 16:34:50] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
[2023-03-12 16:34:50] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-12 16:34:50] [INFO ] Invariant cache hit.
[2023-03-12 16:34:51] [INFO ] Dead Transitions using invariants and state equation in 495 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1250 ms. Remains : 67/67 places, 345/345 transitions.
Applied a total of 0 rules in 24 ms. Remains 67 /67 variables (removed 0) and now considering 345/345 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-12 16:34:51] [INFO ] Invariant cache hit.
[2023-03-12 16:34:51] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:34:51] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-12 16:34:51] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:34:51] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 0 ms to minimize.
[2023-03-12 16:34:52] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 0 ms to minimize.
[2023-03-12 16:34:52] [INFO ] Deduced a trap composed of 7 places in 226 ms of which 0 ms to minimize.
[2023-03-12 16:34:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 453 ms
[2023-03-12 16:34:52] [INFO ] After 656ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-12 16:34:52] [INFO ] After 767ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-12 16:34:52] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-12 16:34:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 67 places, 345 transitions and 3148 arcs took 5 ms.
[2023-03-12 16:34:52] [INFO ] Flatten gal took : 174 ms
Total runtime 29341 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/626/inv_0_ --inv-par
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678638902428

--------------------
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'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023
rfs formula name AutonomousCar-PT-07b-ReachabilityCardinality-05
rfs formula type AG
rfs formula formula --invariant=/tmp/626/inv_0_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 67 places, 345 transitions and 3148 arcs
pnml2lts-sym: Petri net AutonomousCar_PT_07b analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.020 real 0.020 user 0.010 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 345->321 groups
pnml2lts-sym: Regrouping took 0.090 real 0.080 user 0.000 sys
pnml2lts-sym: state vector length is 67; there are 321 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/626/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 7.930 real 31.680 user 0.000 sys
pnml2lts-sym: max token count: 1

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-07b"
export BK_EXAMINATION="ReachabilityCardinality"
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-07b, examination is ReachabilityCardinality"
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-167813598200638"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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