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.r007-oct2-167813595800638.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 lolaxred
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 r007-oct2-167813595800638
=====================================================================

--------------------
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 1678352292102

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=lolaxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-07b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 08:58:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 08:58:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 08:58:15] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2023-03-09 08:58:15] [INFO ] Transformed 323 places.
[2023-03-09 08:58:15] [INFO ] Transformed 846 transitions.
[2023-03-09 08:58:15] [INFO ] Found NUPN structural information;
[2023-03-09 08:58:15] [INFO ] Parsed PT model containing 323 places and 846 transitions and 5865 arcs in 187 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 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 98 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 15) seen :8
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-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 15 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :1
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
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 10001 steps, including 17 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 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 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 846 rows 323 cols
[2023-03-09 08:58:15] [INFO ] Computed 12 place invariants in 16 ms
[2023-03-09 08:58:16] [INFO ] After 412ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 08:58:16] [INFO ] [Nat]Absence check using 12 positive place invariants in 9 ms returned sat
[2023-03-09 08:58:16] [INFO ] After 524ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2023-03-09 08:58:17] [INFO ] Deduced a trap composed of 22 places in 304 ms of which 10 ms to minimize.
[2023-03-09 08:58:17] [INFO ] Deduced a trap composed of 59 places in 204 ms of which 1 ms to minimize.
[2023-03-09 08:58:17] [INFO ] Deduced a trap composed of 46 places in 275 ms of which 1 ms to minimize.
[2023-03-09 08:58:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 919 ms
[2023-03-09 08:58:18] [INFO ] Deduced a trap composed of 38 places in 341 ms of which 2 ms to minimize.
[2023-03-09 08:58:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 399 ms
[2023-03-09 08:58:18] [INFO ] After 2049ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 268 ms.
[2023-03-09 08:58:18] [INFO ] After 2506ms 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 125 ms.
Support contains 38 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 846/846 transitions.
Drop transitions removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 113 place count 323 transition count 733
Reduce places removed 113 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 134 rules applied. Total rules applied 247 place count 210 transition count 712
Reduce places removed 10 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 2 with 22 rules applied. Total rules applied 269 place count 200 transition count 700
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 282 place count 188 transition count 699
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 282 place count 188 transition count 688
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 304 place count 177 transition count 688
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 326 place count 155 transition count 666
Iterating global reduction 4 with 22 rules applied. Total rules applied 348 place count 155 transition count 666
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 197 transitions.
Iterating post reduction 4 with 197 rules applied. Total rules applied 545 place count 155 transition count 469
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 545 place count 155 transition count 467
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 549 place count 153 transition count 467
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 551 place count 151 transition count 453
Iterating global reduction 5 with 2 rules applied. Total rules applied 553 place count 151 transition count 453
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 555 place count 151 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 556 place count 150 transition count 451
Performed 32 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 7 with 64 rules applied. Total rules applied 620 place count 118 transition count 418
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 622 place count 116 transition count 402
Iterating global reduction 7 with 2 rules applied. Total rules applied 624 place count 116 transition count 402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 626 place count 115 transition count 402
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 628 place count 115 transition count 400
Free-agglomeration rule applied 11 times.
Iterating global reduction 7 with 11 rules applied. Total rules applied 639 place count 115 transition count 389
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 650 place count 104 transition count 389
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 651 place count 104 transition count 388
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 653 place count 104 transition count 388
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 654 place count 103 transition count 387
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 655 place count 102 transition count 387
Applied a total of 655 rules in 308 ms. Remains 102 /323 variables (removed 221) and now considering 387/846 (removed 459) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 308 ms. Remains : 102/323 places, 387/846 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 4) seen :1
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :1
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 387 rows 102 cols
[2023-03-09 08:58:19] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-09 08:58:19] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 08:58:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-09 08:58:19] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 08:58:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:58:19] [INFO ] After 77ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 08:58:20] [INFO ] Deduced a trap composed of 13 places in 249 ms of which 1 ms to minimize.
[2023-03-09 08:58:20] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 1 ms to minimize.
[2023-03-09 08:58:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 498 ms
[2023-03-09 08:58:20] [INFO ] After 702ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 84 ms.
[2023-03-09 08:58:20] [INFO ] After 995ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 14 ms.
Support contains 21 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 387/387 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 102 transition count 379
Reduce places removed 8 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 94 transition count 375
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 25 place count 90 transition count 374
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 28 place count 87 transition count 359
Iterating global reduction 3 with 3 rules applied. Total rules applied 31 place count 87 transition count 359
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 32 place count 87 transition count 358
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 44 place count 81 transition count 352
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 45 place count 80 transition count 344
Iterating global reduction 4 with 1 rules applied. Total rules applied 46 place count 80 transition count 344
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 47 place count 80 transition count 343
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 49 place count 80 transition count 341
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 51 place count 78 transition count 341
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 52 place count 78 transition count 341
Applied a total of 52 rules in 98 ms. Remains 78 /102 variables (removed 24) and now considering 341/387 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 78/102 places, 341/387 transitions.
Incomplete random walk after 10000 steps, including 128 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1609086 steps, run timeout after 3001 ms. (steps per millisecond=536 ) properties seen :{1=1}
Probabilistic random walk after 1609086 steps, saw 233909 distinct states, run finished after 3003 ms. (steps per millisecond=535 ) properties seen :1
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 341 rows 78 cols
[2023-03-09 08:58:23] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-09 08:58:23] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:58:24] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-09 08:58:24] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:58:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:58:24] [INFO ] After 42ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:58:24] [INFO ] Deduced a trap composed of 3 places in 205 ms of which 1 ms to minimize.
[2023-03-09 08:58:24] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 0 ms to minimize.
[2023-03-09 08:58:24] [INFO ] Deduced a trap composed of 9 places in 189 ms of which 1 ms to minimize.
[2023-03-09 08:58:24] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 1 ms to minimize.
[2023-03-09 08:58:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 785 ms
[2023-03-09 08:58:24] [INFO ] After 886ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-09 08:58:25] [INFO ] After 1098ms 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 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 341/341 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 78 transition count 338
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 75 transition count 337
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 74 transition count 336
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 9 place count 74 transition count 335
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 11 place count 73 transition count 335
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 12 place count 72 transition count 333
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 72 transition count 333
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 14 place count 71 transition count 332
Applied a total of 14 rules in 60 ms. Remains 71 /78 variables (removed 7) and now considering 332/341 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 71/78 places, 332/341 transitions.
Incomplete random walk after 10000 steps, including 73 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2128660 steps, run timeout after 3001 ms. (steps per millisecond=709 ) properties seen :{}
Probabilistic random walk after 2128660 steps, saw 294926 distinct states, run finished after 3002 ms. (steps per millisecond=709 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 332 rows 71 cols
[2023-03-09 08:58:28] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-09 08:58:28] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:58:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-09 08:58:28] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:58:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:58:28] [INFO ] After 57ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:58:28] [INFO ] Deduced a trap composed of 7 places in 305 ms of which 8 ms to minimize.
[2023-03-09 08:58:29] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 1 ms to minimize.
[2023-03-09 08:58:29] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 0 ms to minimize.
[2023-03-09 08:58:29] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 0 ms to minimize.
[2023-03-09 08:58:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 771 ms
[2023-03-09 08:58:29] [INFO ] After 869ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-09 08:58:29] [INFO ] After 1176ms 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 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 332/332 transitions.
Applied a total of 0 rules in 18 ms. Remains 71 /71 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 71/71 places, 332/332 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 332/332 transitions.
Applied a total of 0 rules in 13 ms. Remains 71 /71 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-09 08:58:29] [INFO ] Invariant cache hit.
[2023-03-09 08:58:29] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-03-09 08:58:29] [INFO ] Invariant cache hit.
[2023-03-09 08:58:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:58:30] [INFO ] Implicit Places using invariants and state equation in 476 ms returned [64, 70]
Discarding 2 places :
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 672 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 69/71 places, 331/332 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 69 transition count 330
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 68 transition count 330
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 68 transition count 331
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 67 transition count 331
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 5 place count 67 transition count 331
Applied a total of 5 rules in 63 ms. Remains 67 /69 variables (removed 2) and now considering 331/331 (removed 0) transitions.
// Phase 1: matrix 331 rows 67 cols
[2023-03-09 08:58:30] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-09 08:58:30] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-09 08:58:30] [INFO ] Invariant cache hit.
[2023-03-09 08:58:30] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 67/71 places, 331/332 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1209 ms. Remains : 67/71 places, 331/332 transitions.
Incomplete random walk after 10000 steps, including 12 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2212475 steps, run timeout after 3001 ms. (steps per millisecond=737 ) properties seen :{}
Probabilistic random walk after 2212475 steps, saw 303277 distinct states, run finished after 3001 ms. (steps per millisecond=737 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 08:58:33] [INFO ] Invariant cache hit.
[2023-03-09 08:58:33] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:58:33] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-09 08:58:33] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:58:34] [INFO ] Deduced a trap composed of 7 places in 366 ms of which 1 ms to minimize.
[2023-03-09 08:58:34] [INFO ] Deduced a trap composed of 7 places in 296 ms of which 0 ms to minimize.
[2023-03-09 08:58:34] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 0 ms to minimize.
[2023-03-09 08:58:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 817 ms
[2023-03-09 08:58:34] [INFO ] After 945ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-09 08:58:34] [INFO ] After 1059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 16 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 331/331 transitions.
Applied a total of 0 rules in 13 ms. Remains 67 /67 variables (removed 0) and now considering 331/331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 67/67 places, 331/331 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 331/331 transitions.
Applied a total of 0 rules in 13 ms. Remains 67 /67 variables (removed 0) and now considering 331/331 (removed 0) transitions.
[2023-03-09 08:58:34] [INFO ] Invariant cache hit.
[2023-03-09 08:58:35] [INFO ] Implicit Places using invariants in 246 ms returned []
[2023-03-09 08:58:35] [INFO ] Invariant cache hit.
[2023-03-09 08:58:35] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
[2023-03-09 08:58:35] [INFO ] Redundant transitions in 97 ms returned []
[2023-03-09 08:58:35] [INFO ] Invariant cache hit.
[2023-03-09 08:58:35] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 848 ms. Remains : 67/67 places, 331/331 transitions.
Applied a total of 0 rules in 10 ms. Remains 67 /67 variables (removed 0) and now considering 331/331 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-09 08:58:35] [INFO ] Invariant cache hit.
[2023-03-09 08:58:35] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:58:35] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-09 08:58:35] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:58:36] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 0 ms to minimize.
[2023-03-09 08:58:36] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 0 ms to minimize.
[2023-03-09 08:58:36] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 1 ms to minimize.
[2023-03-09 08:58:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 460 ms
[2023-03-09 08:58:36] [INFO ] After 590ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-09 08:58:36] [INFO ] After 680ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:58:36] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2023-03-09 08:58:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 67 places, 331 transitions and 3064 arcs took 5 ms.
[2023-03-09 08:58:36] [INFO ] Flatten gal took : 86 ms
Total runtime 21915 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT AutonomousCar-PT-07b
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/379
ReachabilityCardinality

FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678352317156

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/379/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/379/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/379/ReachabilityCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 8 (type EXCL) for 0 AutonomousCar-PT-07b-ReachabilityCardinality-05
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 4 (type FNDP) for 0 AutonomousCar-PT-07b-ReachabilityCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 5 (type EQUN) for 0 AutonomousCar-PT-07b-ReachabilityCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 7 (type SRCH) for 0 AutonomousCar-PT-07b-ReachabilityCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 7 (type SRCH) for AutonomousCar-PT-07b-ReachabilityCardinality-05
lola: result : truesara:
try reading problem file /home/mcc/execution/379/ReachabilityCardinality-5.sara.lola:
markings : 1490
lola: fired transitions : 1712
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 4 (type FNDP) for AutonomousCar-PT-07b-ReachabilityCardinality-05 (obsolete)
lola: CANCELED task # 5 (type EQUN) for AutonomousCar-PT-07b-ReachabilityCardinality-05 (obsolete)
lola: CANCELED task # 8 (type EXCL) for AutonomousCar-PT-07b-ReachabilityCardinality-05 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-07b-ReachabilityCardinality-05: AG false tandem / insertion


Time elapsed: 1 secs. Pages in use: 2

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="lolaxred"
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 lolaxred"
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 r007-oct2-167813595800638"
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 ;