Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r294-smll-165463873100534.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is AutonomousCar-PT-08b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463873100534
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1016K
-rw-r--r-- 1 mcc users 8.4K Jun 7 15:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Jun 7 15:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 7 15:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 7 15:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 3 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 3 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 3 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 3 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 3 16:02 NewModel
-rw-r--r-- 1 mcc users 13K Jun 7 15:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Jun 7 15:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Jun 7 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Jun 7 15:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 3 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 3 16:02 instance
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 iscolored
-rw-r--r-- 1 mcc users 517K Jun 3 16:02 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-08b-ReachabilityCardinality-00
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-01
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-02
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-03
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-04
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-05
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-06
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-07
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-08
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-09
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-10
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-11
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-12
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-13
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-14
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654914892637

Running Version 202205111006
[2022-06-11 02:34:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-11 02:34:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 02:34:55] [INFO ] Load time of PNML (sax parser for PT used): 297 ms
[2022-06-11 02:34:55] [INFO ] Transformed 357 places.
[2022-06-11 02:34:55] [INFO ] Transformed 1128 transitions.
[2022-06-11 02:34:55] [INFO ] Found NUPN structural information;
[2022-06-11 02:34:55] [INFO ] Parsed PT model containing 357 places and 1128 transitions in 491 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 89 resets, run finished after 1008 ms. (steps per millisecond=9 ) properties (out of 15) seen :5
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 1128 rows 357 cols
[2022-06-11 02:34:57] [INFO ] Computed 13 place invariants in 33 ms
[2022-06-11 02:34:58] [INFO ] After 528ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-06-11 02:34:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned sat
[2022-06-11 02:34:59] [INFO ] After 1078ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :4
[2022-06-11 02:35:00] [INFO ] Deduced a trap composed of 53 places in 550 ms of which 11 ms to minimize.
[2022-06-11 02:35:01] [INFO ] Deduced a trap composed of 40 places in 543 ms of which 2 ms to minimize.
[2022-06-11 02:35:01] [INFO ] Deduced a trap composed of 40 places in 507 ms of which 1 ms to minimize.
[2022-06-11 02:35:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1785 ms
[2022-06-11 02:35:02] [INFO ] Deduced a trap composed of 52 places in 404 ms of which 2 ms to minimize.
[2022-06-11 02:35:02] [INFO ] Deduced a trap composed of 38 places in 560 ms of which 1 ms to minimize.
[2022-06-11 02:35:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1108 ms
[2022-06-11 02:35:03] [INFO ] Deduced a trap composed of 48 places in 209 ms of which 1 ms to minimize.
[2022-06-11 02:35:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 297 ms
[2022-06-11 02:35:03] [INFO ] Deduced a trap composed of 23 places in 460 ms of which 0 ms to minimize.
[2022-06-11 02:35:04] [INFO ] Deduced a trap composed of 47 places in 327 ms of which 3 ms to minimize.
[2022-06-11 02:35:04] [INFO ] Deduced a trap composed of 48 places in 326 ms of which 1 ms to minimize.
[2022-06-11 02:35:05] [INFO ] Deduced a trap composed of 25 places in 529 ms of which 1 ms to minimize.
[2022-06-11 02:35:05] [INFO ] Deduced a trap composed of 49 places in 463 ms of which 1 ms to minimize.
[2022-06-11 02:35:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2472 ms
[2022-06-11 02:35:05] [INFO ] After 7114ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :4
Attempting to minimize the solution found.
Minimization took 597 ms.
[2022-06-11 02:35:06] [INFO ] After 8005ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :4
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 4 different solutions.
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 4743 ms.
Support contains 36 out of 357 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 357/357 places, 1128/1128 transitions.
Graph (trivial) has 263 edges and 357 vertex of which 2 / 357 are part of one of the 1 SCC in 6 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1430 edges and 356 vertex of which 353 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.20 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 106 rules applied. Total rules applied 108 place count 353 transition count 1018
Reduce places removed 106 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 1 with 123 rules applied. Total rules applied 231 place count 247 transition count 1001
Reduce places removed 8 places and 0 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 2 with 31 rules applied. Total rules applied 262 place count 239 transition count 978
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 3 with 31 rules applied. Total rules applied 293 place count 216 transition count 970
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 297 place count 212 transition count 970
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 297 place count 212 transition count 958
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 321 place count 200 transition count 958
Discarding 26 places :
Symmetric choice reduction at 5 with 26 rule applications. Total rules 347 place count 174 transition count 932
Iterating global reduction 5 with 26 rules applied. Total rules applied 373 place count 174 transition count 932
Ensure Unique test removed 257 transitions
Reduce isomorphic transitions removed 257 transitions.
Iterating post reduction 5 with 257 rules applied. Total rules applied 630 place count 174 transition count 675
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 630 place count 174 transition count 674
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 632 place count 173 transition count 674
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 638 place count 167 transition count 626
Iterating global reduction 6 with 6 rules applied. Total rules applied 644 place count 167 transition count 626
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 646 place count 167 transition count 624
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 647 place count 166 transition count 624
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 8 with 72 rules applied. Total rules applied 719 place count 130 transition count 588
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 723 place count 126 transition count 552
Iterating global reduction 8 with 4 rules applied. Total rules applied 727 place count 126 transition count 552
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 8 with 2 rules applied. Total rules applied 729 place count 125 transition count 552
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 731 place count 125 transition count 550
Free-agglomeration rule applied 10 times.
Iterating global reduction 8 with 10 rules applied. Total rules applied 741 place count 125 transition count 540
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 751 place count 115 transition count 540
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 755 place count 115 transition count 536
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 759 place count 115 transition count 536
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 760 place count 114 transition count 535
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 761 place count 113 transition count 535
Applied a total of 761 rules in 565 ms. Remains 113 /357 variables (removed 244) and now considering 535/1128 (removed 593) transitions.
Finished structural reductions, in 1 iterations. Remains : 113/357 places, 535/1128 transitions.
Incomplete random walk after 1000000 steps, including 312 resets, run finished after 14540 ms. (steps per millisecond=68 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4105 resets, run finished after 4055 ms. (steps per millisecond=246 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4299 resets, run finished after 3018 ms. (steps per millisecond=331 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 895 resets, run finished after 3622 ms. (steps per millisecond=276 ) properties (out of 3) seen :1
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 535 rows 113 cols
[2022-06-11 02:35:37] [INFO ] Computed 11 place invariants in 5 ms
[2022-06-11 02:35:37] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 02:35:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-06-11 02:35:37] [INFO ] After 322ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 02:35:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 02:35:37] [INFO ] After 136ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 02:35:38] [INFO ] Deduced a trap composed of 13 places in 332 ms of which 0 ms to minimize.
[2022-06-11 02:35:38] [INFO ] Deduced a trap composed of 12 places in 303 ms of which 2 ms to minimize.
[2022-06-11 02:35:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 727 ms
[2022-06-11 02:35:38] [INFO ] Deduced a trap composed of 18 places in 279 ms of which 0 ms to minimize.
[2022-06-11 02:35:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 327 ms
[2022-06-11 02:35:38] [INFO ] After 1346ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 164 ms.
[2022-06-11 02:35:39] [INFO ] After 1899ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 595 ms.
Support contains 34 out of 113 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 113/113 places, 535/535 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 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 534
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 112 transition count 534
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 110 transition count 532
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 109 transition count 530
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 109 transition count 530
Applied a total of 8 rules in 66 ms. Remains 109 /113 variables (removed 4) and now considering 530/535 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 109/113 places, 530/535 transitions.
Incomplete random walk after 1000000 steps, including 485 resets, run finished after 11707 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4118 resets, run finished after 3958 ms. (steps per millisecond=252 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4318 resets, run finished after 2544 ms. (steps per millisecond=393 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 20386845 steps, run timeout after 54001 ms. (steps per millisecond=377 ) properties seen :{1=1}
Probabilistic random walk after 20386845 steps, saw 2569958 distinct states, run finished after 54005 ms. (steps per millisecond=377 ) properties seen :1
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 530 rows 109 cols
[2022-06-11 02:36:51] [INFO ] Computed 11 place invariants in 5 ms
[2022-06-11 02:36:52] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 02:36:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-06-11 02:36:52] [INFO ] After 247ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 02:36:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 02:36:52] [INFO ] After 75ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 02:36:52] [INFO ] Deduced a trap composed of 13 places in 369 ms of which 1 ms to minimize.
[2022-06-11 02:36:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 418 ms
[2022-06-11 02:36:52] [INFO ] After 568ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 82 ms.
[2022-06-11 02:36:52] [INFO ] After 947ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 84 ms.
Support contains 27 out of 109 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 109/109 places, 530/530 transitions.
Graph (trivial) has 30 edges and 109 vertex of which 2 / 109 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 802 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output 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 6 place count 107 transition count 524
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 103 transition count 523
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 102 transition count 523
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 100 transition count 521
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 19 place count 100 transition count 518
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 22 place count 97 transition count 518
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 23 place count 97 transition count 517
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 24 place count 96 transition count 516
Applied a total of 24 rules in 185 ms. Remains 96 /109 variables (removed 13) and now considering 516/530 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 96/109 places, 516/530 transitions.
Incomplete random walk after 1000000 steps, including 37303 resets, run finished after 5179 ms. (steps per millisecond=193 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4416 resets, run finished after 2257 ms. (steps per millisecond=443 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 10650035 steps, run timeout after 21001 ms. (steps per millisecond=507 ) properties seen :{}
Probabilistic random walk after 10650035 steps, saw 1335924 distinct states, run finished after 21003 ms. (steps per millisecond=507 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 516 rows 96 cols
[2022-06-11 02:37:21] [INFO ] Computed 10 place invariants in 4 ms
[2022-06-11 02:37:21] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 02:37:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-11 02:37:22] [INFO ] After 255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 02:37:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 02:37:22] [INFO ] After 74ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 02:37:22] [INFO ] Deduced a trap composed of 10 places in 240 ms of which 0 ms to minimize.
[2022-06-11 02:37:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
[2022-06-11 02:37:22] [INFO ] After 416ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 75 ms.
[2022-06-11 02:37:22] [INFO ] After 795ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 46 ms.
Support contains 27 out of 96 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 96/96 places, 516/516 transitions.
Applied a total of 0 rules in 22 ms. Remains 96 /96 variables (removed 0) and now considering 516/516 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 96/96 places, 516/516 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 96/96 places, 516/516 transitions.
Applied a total of 0 rules in 24 ms. Remains 96 /96 variables (removed 0) and now considering 516/516 (removed 0) transitions.
// Phase 1: matrix 516 rows 96 cols
[2022-06-11 02:37:22] [INFO ] Computed 10 place invariants in 3 ms
[2022-06-11 02:37:22] [INFO ] Implicit Places using invariants in 203 ms returned []
// Phase 1: matrix 516 rows 96 cols
[2022-06-11 02:37:22] [INFO ] Computed 10 place invariants in 5 ms
[2022-06-11 02:37:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 02:37:23] [INFO ] Implicit Places using invariants and state equation in 348 ms returned [85, 94]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 555 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 94/96 places, 516/516 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 94 transition count 515
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 93 transition count 515
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 93 transition count 515
Applied a total of 3 rules in 46 ms. Remains 93 /94 variables (removed 1) and now considering 515/516 (removed 1) transitions.
// Phase 1: matrix 515 rows 93 cols
[2022-06-11 02:37:23] [INFO ] Computed 9 place invariants in 5 ms
[2022-06-11 02:37:23] [INFO ] Implicit Places using invariants in 179 ms returned []
// Phase 1: matrix 515 rows 93 cols
[2022-06-11 02:37:23] [INFO ] Computed 9 place invariants in 10 ms
[2022-06-11 02:37:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 02:37:23] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 93/96 places, 515/516 transitions.
Finished structural reductions, in 2 iterations. Remains : 93/96 places, 515/516 transitions.
Incomplete random walk after 1000000 steps, including 36853 resets, run finished after 5222 ms. (steps per millisecond=191 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4413 resets, run finished after 2247 ms. (steps per millisecond=445 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 10807324 steps, run timeout after 21001 ms. (steps per millisecond=514 ) properties seen :{}
Probabilistic random walk after 10807324 steps, saw 1352252 distinct states, run finished after 21001 ms. (steps per millisecond=514 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 515 rows 93 cols
[2022-06-11 02:37:52] [INFO ] Computed 9 place invariants in 4 ms
[2022-06-11 02:37:52] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 02:37:52] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2022-06-11 02:37:52] [INFO ] After 236ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 02:37:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 02:37:52] [INFO ] After 79ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 02:37:52] [INFO ] Deduced a trap composed of 6 places in 240 ms of which 1 ms to minimize.
[2022-06-11 02:37:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
[2022-06-11 02:37:53] [INFO ] After 430ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2022-06-11 02:37:53] [INFO ] After 801ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 56 ms.
Support contains 27 out of 93 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 93/93 places, 515/515 transitions.
Applied a total of 0 rules in 23 ms. Remains 93 /93 variables (removed 0) and now considering 515/515 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 93/93 places, 515/515 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 93/93 places, 515/515 transitions.
Applied a total of 0 rules in 22 ms. Remains 93 /93 variables (removed 0) and now considering 515/515 (removed 0) transitions.
// Phase 1: matrix 515 rows 93 cols
[2022-06-11 02:37:53] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-11 02:37:53] [INFO ] Implicit Places using invariants in 192 ms returned []
// Phase 1: matrix 515 rows 93 cols
[2022-06-11 02:37:53] [INFO ] Computed 9 place invariants in 11 ms
[2022-06-11 02:37:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 02:37:53] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
[2022-06-11 02:37:53] [INFO ] Redundant transitions in 44 ms returned []
// Phase 1: matrix 515 rows 93 cols
[2022-06-11 02:37:53] [INFO ] Computed 9 place invariants in 3 ms
[2022-06-11 02:37:54] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/93 places, 515/515 transitions.
Incomplete random walk after 1000000 steps, including 36652 resets, run finished after 5030 ms. (steps per millisecond=198 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4406 resets, run finished after 2358 ms. (steps per millisecond=424 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 10433143 steps, run timeout after 21001 ms. (steps per millisecond=496 ) properties seen :{}
Probabilistic random walk after 10433143 steps, saw 1311488 distinct states, run finished after 21001 ms. (steps per millisecond=496 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 515 rows 93 cols
[2022-06-11 02:38:22] [INFO ] Computed 9 place invariants in 3 ms
[2022-06-11 02:38:22] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 02:38:22] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-11 02:38:22] [INFO ] After 255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 02:38:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 02:38:22] [INFO ] After 77ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 02:38:23] [INFO ] Deduced a trap composed of 6 places in 227 ms of which 1 ms to minimize.
[2022-06-11 02:38:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
[2022-06-11 02:38:23] [INFO ] After 413ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2022-06-11 02:38:23] [INFO ] After 805ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 53 ms.
Support contains 27 out of 93 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 93/93 places, 515/515 transitions.
Applied a total of 0 rules in 22 ms. Remains 93 /93 variables (removed 0) and now considering 515/515 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 93/93 places, 515/515 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 93/93 places, 515/515 transitions.
Applied a total of 0 rules in 22 ms. Remains 93 /93 variables (removed 0) and now considering 515/515 (removed 0) transitions.
// Phase 1: matrix 515 rows 93 cols
[2022-06-11 02:38:23] [INFO ] Computed 9 place invariants in 3 ms
[2022-06-11 02:38:23] [INFO ] Implicit Places using invariants in 179 ms returned []
// Phase 1: matrix 515 rows 93 cols
[2022-06-11 02:38:23] [INFO ] Computed 9 place invariants in 3 ms
[2022-06-11 02:38:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 02:38:23] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
[2022-06-11 02:38:24] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 515 rows 93 cols
[2022-06-11 02:38:24] [INFO ] Computed 9 place invariants in 3 ms
[2022-06-11 02:38:24] [INFO ] Dead Transitions using invariants and state equation in 329 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/93 places, 515/515 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 93 transition count 514
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 93 transition count 513
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 92 transition count 513
Applied a total of 3 rules in 49 ms. Remains 92 /93 variables (removed 1) and now considering 513/515 (removed 2) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 513 rows 92 cols
[2022-06-11 02:38:24] [INFO ] Computed 9 place invariants in 3 ms
[2022-06-11 02:38:24] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 02:38:24] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2022-06-11 02:38:24] [INFO ] After 248ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 02:38:25] [INFO ] Deduced a trap composed of 10 places in 217 ms of which 1 ms to minimize.
[2022-06-11 02:38:25] [INFO ] Deduced a trap composed of 8 places in 224 ms of which 1 ms to minimize.
[2022-06-11 02:38:25] [INFO ] Deduced a trap composed of 8 places in 214 ms of which 1 ms to minimize.
[2022-06-11 02:38:25] [INFO ] Deduced a trap composed of 10 places in 237 ms of which 1 ms to minimize.
[2022-06-11 02:38:26] [INFO ] Deduced a trap composed of 8 places in 214 ms of which 1 ms to minimize.
[2022-06-11 02:38:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1227 ms
[2022-06-11 02:38:26] [INFO ] After 1547ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 77 ms.
[2022-06-11 02:38:26] [INFO ] After 1673ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-11 02:38:26] [INFO ] Flatten gal took : 238 ms
[2022-06-11 02:38:26] [INFO ] Flatten gal took : 128 ms
[2022-06-11 02:38:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10637009193502149491.gal : 48 ms
[2022-06-11 02:38:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12061113749113783553.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10637009193502149491.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12061113749113783553.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality12061113749113783553.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 18
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :18 after 60
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :60 after 124
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :124 after 1804
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1804 after 16278
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :16278 after 801928
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :801928 after 1.17863e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.17863e+06 after 1.93493e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.93493e+06 after 3.44497e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3.44497e+06 after 4.64656e+07
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,8.85504e+08,5.95263,125528,2,7711,17,291174,7,0,932,344075,0
Total reachable state count : 885504427

Verifying 1 reachability properties.
Reachability property AutonomousCar-PT-08b-ReachabilityCardinality-00 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutonomousCar-PT-08b-ReachabilityCardinality-00,1.93055e+07,5.97595,125528,2,2826,17,291174,7,0,970,344075,0
[2022-06-11 02:38:33] [INFO ] Flatten gal took : 106 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17408987428257596984
[2022-06-11 02:38:33] [INFO ] Computing symmetric may disable matrix : 515 transitions.
[2022-06-11 02:38:33] [INFO ] Applying decomposition
[2022-06-11 02:38:33] [INFO ] Computation of Complete disable matrix. took 94 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 02:38:33] [INFO ] Computing symmetric may enable matrix : 515 transitions.
[2022-06-11 02:38:33] [INFO ] Computation of Complete enable matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 02:38:33] [INFO ] Flatten gal took : 130 ms
[2022-06-11 02:38:33] [INFO ] Flatten gal took : 216 ms
[2022-06-11 02:38:33] [INFO ] Computing Do-Not-Accords matrix : 515 transitions.
[2022-06-11 02:38:33] [INFO ] Computation of Completed DNA matrix. took 39 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 02:38:33] [INFO ] Built C files in 426ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17408987428257596984
Running compilation step : cd /tmp/ltsmin17408987428257596984;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-11 02:38:33] [INFO ] Input system was already deterministic with 515 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11113933603944420578.txt' '-o' '/tmp/graph11113933603944420578.bin' '-w' '/tmp/graph11113933603944420578.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11113933603944420578.bin' '-l' '-1' '-v' '-w' '/tmp/graph11113933603944420578.weights' '-q' '0' '-e' '0.001'
[2022-06-11 02:38:33] [INFO ] Decomposing Gal with order
[2022-06-11 02:38:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 02:38:34] [INFO ] Removed a total of 2671 redundant transitions.
[2022-06-11 02:38:34] [INFO ] Ran tautology test, simplified 0 / 1 in 1068 ms.
[2022-06-11 02:38:34] [INFO ] BMC solution for property AutonomousCar-PT-08b-ReachabilityCardinality-00(UNSAT) depth K=0 took 12 ms
[2022-06-11 02:38:34] [INFO ] BMC solution for property AutonomousCar-PT-08b-ReachabilityCardinality-00(UNSAT) depth K=1 took 17 ms
[2022-06-11 02:38:34] [INFO ] Flatten gal took : 577 ms
[2022-06-11 02:38:34] [INFO ] BMC solution for property AutonomousCar-PT-08b-ReachabilityCardinality-00(UNSAT) depth K=2 took 222 ms
[2022-06-11 02:38:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 87 ms.
[2022-06-11 02:38:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13281678374225332038.gal : 20 ms
[2022-06-11 02:38:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14244042380548238926.prop : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13281678374225332038.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14244042380548238926.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
Loading property file /tmp/ReachabilityCardinality14244042380548238926.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 60
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :60 after 1426
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1426 after 7.68377e+06
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 515 rows 93 cols
[2022-06-11 02:38:35] [INFO ] Computed 9 place invariants in 3 ms
[2022-06-11 02:38:35] [INFO ] Computed 9 place invariants in 3 ms
[2022-06-11 02:38:35] [INFO ] BMC solution for property AutonomousCar-PT-08b-ReachabilityCardinality-00(UNSAT) depth K=3 took 729 ms
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,9.94626e+08,1.6009,46204,2228,116,60577,1544,571,338508,109,6243,0
Total reachable state count : 994626475

Verifying 1 reachability properties.
Reachability property AutonomousCar-PT-08b-ReachabilityCardinality-00 is true.
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutonomousCar-PT-08b-ReachabilityCardinality-00,1.93055e+07,1.64893,46204,1058,66,60577,1544,624,338508,117,6243,4064
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 02:38:36] [WARNING] Interrupting SMT solver.
[2022-06-11 02:38:36] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
Exception in thread "Thread-7" java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:117)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:283)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-11 02:38:36] [WARNING] Unexpected error occurred while running SMT. Was verifying AutonomousCar-PT-08b-ReachabilityCardinality-00 SMT depth 4
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:411)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
... 2 more
[2022-06-11 02:38:36] [INFO ] During BMC, SMT solver timed out at depth 4
[2022-06-11 02:38:36] [INFO ] BMC solving timed out (3600000 secs) at depth 4
[2022-06-11 02:38:36] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.
Total runtime 221869 ms.

BK_STOP 1654915116831

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-08b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-08b, 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 r294-smll-165463873100534"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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