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.r305-smll-165463878600189.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 gold2021
Input is AutonomousCar-PT-06b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r305-smll-165463878600189
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 4.9K Jun 7 15:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Jun 7 15:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Jun 7 15:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Jun 7 15:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 3 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 3 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 3 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 3 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 3 16:02 NewModel
-rw-r--r-- 1 mcc users 9.6K Jun 7 15:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Jun 7 15:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 7 15:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 7 15:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 3 16:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:19 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 228K 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-06b-ReachabilityFireability-00
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-01
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-02
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-03
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-04
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-05
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-06
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-07
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-08
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-09
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-10
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-11
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-12
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-13
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-14
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654736274207

Running Version 0
[2022-06-09 00:57:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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-09 00:57:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 00:57:57] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2022-06-09 00:57:57] [INFO ] Transformed 289 places.
[2022-06-09 00:57:57] [INFO ] Transformed 644 transitions.
[2022-06-09 00:57:57] [INFO ] Found NUPN structural information;
[2022-06-09 00:57:57] [INFO ] Parsed PT model containing 289 places and 644 transitions in 214 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 17 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 16) seen :10
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :1
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :1
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 644 rows 289 cols
[2022-06-09 00:57:58] [INFO ] Computed 11 place invariants in 35 ms
[2022-06-09 00:57:58] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2022-06-09 00:57:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:57:59] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2022-06-09 00:57:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:57:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2022-06-09 00:57:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:57:59] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2022-06-09 00:58:00] [INFO ] Deduced a trap composed of 35 places in 385 ms of which 13 ms to minimize.
[2022-06-09 00:58:00] [INFO ] Deduced a trap composed of 35 places in 329 ms of which 3 ms to minimize.
[2022-06-09 00:58:00] [INFO ] Deduced a trap composed of 35 places in 250 ms of which 1 ms to minimize.
[2022-06-09 00:58:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1192 ms
[2022-06-09 00:58:01] [INFO ] Computed and/alt/rep : 237/274/237 causal constraints (skipped 406 transitions) in 206 ms.
[2022-06-09 00:58:02] [INFO ] Added : 88 causal constraints over 18 iterations in 1105 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-06-09 00:58:02] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2022-06-09 00:58:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:58:02] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2022-06-09 00:58:02] [INFO ] Deduced a trap composed of 35 places in 208 ms of which 2 ms to minimize.
[2022-06-09 00:58:03] [INFO ] Deduced a trap composed of 48 places in 240 ms of which 1 ms to minimize.
[2022-06-09 00:58:03] [INFO ] Deduced a trap composed of 44 places in 228 ms of which 1 ms to minimize.
[2022-06-09 00:58:03] [INFO ] Deduced a trap composed of 35 places in 170 ms of which 2 ms to minimize.
[2022-06-09 00:58:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1044 ms
[2022-06-09 00:58:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:58:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2022-06-09 00:58:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:58:03] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2022-06-09 00:58:04] [INFO ] Deduced a trap composed of 35 places in 212 ms of which 1 ms to minimize.
[2022-06-09 00:58:04] [INFO ] Deduced a trap composed of 48 places in 174 ms of which 1 ms to minimize.
[2022-06-09 00:58:04] [INFO ] Deduced a trap composed of 48 places in 296 ms of which 2 ms to minimize.
[2022-06-09 00:58:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 831 ms
[2022-06-09 00:58:04] [INFO ] Computed and/alt/rep : 237/274/237 causal constraints (skipped 406 transitions) in 114 ms.
[2022-06-09 00:58:05] [INFO ] Added : 83 causal constraints over 17 iterations in 799 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-06-09 00:58:05] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2022-06-09 00:58:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:58:06] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2022-06-09 00:58:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:58:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2022-06-09 00:58:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:58:06] [INFO ] [Nat]Absence check using state equation in 376 ms returned sat
[2022-06-09 00:58:06] [INFO ] Deduced a trap composed of 35 places in 240 ms of which 1 ms to minimize.
[2022-06-09 00:58:07] [INFO ] Deduced a trap composed of 48 places in 171 ms of which 1 ms to minimize.
[2022-06-09 00:58:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 526 ms
[2022-06-09 00:58:07] [INFO ] Computed and/alt/rep : 237/274/237 causal constraints (skipped 406 transitions) in 88 ms.
[2022-06-09 00:58:09] [INFO ] Added : 164 causal constraints over 33 iterations in 1961 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-06-09 00:58:09] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2022-06-09 00:58:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:58:09] [INFO ] [Real]Absence check using state equation in 315 ms returned sat
[2022-06-09 00:58:09] [INFO ] Deduced a trap composed of 35 places in 321 ms of which 2 ms to minimize.
[2022-06-09 00:58:10] [INFO ] Deduced a trap composed of 35 places in 297 ms of which 1 ms to minimize.
[2022-06-09 00:58:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 718 ms
[2022-06-09 00:58:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:58:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned sat
[2022-06-09 00:58:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:58:10] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2022-06-09 00:58:11] [INFO ] Deduced a trap composed of 35 places in 259 ms of which 1 ms to minimize.
[2022-06-09 00:58:11] [INFO ] Deduced a trap composed of 35 places in 309 ms of which 1 ms to minimize.
[2022-06-09 00:58:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 671 ms
[2022-06-09 00:58:11] [INFO ] Computed and/alt/rep : 237/274/237 causal constraints (skipped 406 transitions) in 92 ms.
[2022-06-09 00:58:12] [INFO ] Added : 96 causal constraints over 20 iterations in 1190 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
Incomplete Parikh walk after 17000 steps, including 239 resets, run finished after 108 ms. (steps per millisecond=157 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 16100 steps, including 231 resets, run finished after 80 ms. (steps per millisecond=201 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 53600 steps, including 759 resets, run finished after 192 ms. (steps per millisecond=279 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 19100 steps, including 238 resets, run finished after 77 ms. (steps per millisecond=248 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 25 out of 289 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 289/289 places, 644/644 transitions.
Graph (trivial) has 243 edges and 289 vertex of which 4 / 289 are part of one of the 2 SCC in 72 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 958 edges and 287 vertex of which 280 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.11 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 117 rules applied. Total rules applied 119 place count 280 transition count 518
Reduce places removed 115 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 1 with 144 rules applied. Total rules applied 263 place count 165 transition count 489
Reduce places removed 15 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 19 rules applied. Total rules applied 282 place count 150 transition count 485
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 288 place count 146 transition count 483
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 289 place count 145 transition count 483
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 289 place count 145 transition count 474
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 307 place count 136 transition count 474
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 330 place count 113 transition count 451
Iterating global reduction 5 with 23 rules applied. Total rules applied 353 place count 113 transition count 451
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 5 with 144 rules applied. Total rules applied 497 place count 113 transition count 307
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 497 place count 113 transition count 306
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 499 place count 112 transition count 306
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 501 place count 110 transition count 294
Iterating global reduction 6 with 2 rules applied. Total rules applied 503 place count 110 transition count 294
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 4 rules applied. Total rules applied 507 place count 110 transition count 290
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 509 place count 108 transition count 290
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 8 with 56 rules applied. Total rules applied 565 place count 80 transition count 262
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 567 place count 78 transition count 248
Iterating global reduction 8 with 2 rules applied. Total rules applied 569 place count 78 transition count 248
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 570 place count 78 transition count 247
Free-agglomeration rule applied 11 times.
Iterating global reduction 8 with 11 rules applied. Total rules applied 581 place count 78 transition count 236
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 592 place count 67 transition count 236
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 593 place count 67 transition count 236
Applied a total of 593 rules in 354 ms. Remains 67 /289 variables (removed 222) and now considering 236/644 (removed 408) transitions.
Finished structural reductions, in 1 iterations. Remains : 67/289 places, 236/644 transitions.
[2022-06-09 00:58:14] [INFO ] Flatten gal took : 196 ms
[2022-06-09 00:58:14] [INFO ] Flatten gal took : 85 ms
[2022-06-09 00:58:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5518395910083220309.gal : 52 ms
[2022-06-09 00:58:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality859532608428481947.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality5518395910083220309.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality859532608428481947.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality5518395910083220309.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality859532608428481947.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality859532608428481947.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 25
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :25 after 26
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :26 after 65
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :65 after 95
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :95 after 273
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :273 after 2267
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :2267 after 14667
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :14667 after 55363
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :55363 after 64299
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :64299 after 139567
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :139567 after 298857
Reachability property AutonomousCar-PT-06b-ReachabilityFireability-05 is true.
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property AutonomousCar-PT-06b-ReachabilityFireability-04 does not hold.
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :298857 after 954487
Reachability property AutonomousCar-PT-06b-ReachabilityFireability-12 is true.
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :954487 after 2.48557e+06
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.48557e+06 after 3.14101e+06
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,1.81015e+07,12.476,200892,2,12193,23,544990,7,0,543,491918,0
Total reachable state count : 18101527

Verifying 4 reachability properties.
Invariant property AutonomousCar-PT-06b-ReachabilityFireability-04 does not hold.

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-06b-ReachabilityFireability-04,16,12.4798,200892,2,88,23,544990,8,0,553,491918,0
Reachability property AutonomousCar-PT-06b-ReachabilityFireability-05 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-06b-ReachabilityFireability-05,48,12.4811,200892,2,106,23,544990,9,0,562,491918,0
Invariant property AutonomousCar-PT-06b-ReachabilityFireability-07 does not hold.
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING

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-06b-ReachabilityFireability-07,6300,12.4962,200892,2,850,23,544990,9,0,600,491918,0
Reachability property AutonomousCar-PT-06b-ReachabilityFireability-12 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-06b-ReachabilityFireability-12,12,12.4977,200892,2,81,23,544990,10,0,605,491918,0
All properties solved without resorting to model-checking.

BK_STOP 1654736308079

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-06b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is AutonomousCar-PT-06b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r305-smll-165463878600189"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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