fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r026-smll-171620167600375
Last Updated
July 7, 2024

About the Execution of ITS-Tools for AutonomousCar-PT-10b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
735.775 19873.00 64752.00 119.50 FFTTTTTFFTTFFTFT normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 18:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 12 18:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 12 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716366068493

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-10b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-22 08:21:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 08:21:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 08:21:10] [INFO ] Load time of PNML (sax parser for PT used): 439 ms
[2024-05-22 08:21:10] [INFO ] Transformed 425 places.
[2024-05-22 08:21:10] [INFO ] Transformed 2252 transitions.
[2024-05-22 08:21:10] [INFO ] Found NUPN structural information;
[2024-05-22 08:21:10] [INFO ] Parsed PT model containing 425 places and 2252 transitions and 29816 arcs in 649 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (295 resets) in 5074 ms. (7 steps per ms) remains 13/16 properties
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-22 08:21:12] [INFO ] Flatten gal took : 978 ms
BEST_FIRST walk for 40003 steps (56 resets) in 1445 ms. (27 steps per ms) remains 12/13 properties
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (39 resets) in 289 ms. (137 steps per ms) remains 11/12 properties
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (48 resets) in 406 ms. (98 steps per ms) remains 11/11 properties
[2024-05-22 08:21:13] [INFO ] Flatten gal took : 521 ms
BEST_FIRST walk for 40003 steps (54 resets) in 538 ms. (74 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (55 resets) in 392 ms. (101 steps per ms) remains 10/11 properties
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-22 08:21:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12432600088871398084.gal : 400 ms
[2024-05-22 08:21:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14788690450066618112.prop : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12432600088871398084.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14788690450066618112.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (51 resets) in 947 ms. (42 steps per ms) remains 10/10 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40003 steps (46 resets) in 494 ms. (80 steps per ms) remains 9/10 properties
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (55 resets) in 1212 ms. (32 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (58 resets) in 527 ms. (75 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (58 resets) in 1217 ms. (32 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (39 resets) in 559 ms. (71 steps per ms) remains 8/9 properties
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (55 resets) in 297 ms. (134 steps per ms) remains 7/8 properties
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 2252 rows 425 cols
[2024-05-22 08:21:15] [INFO ] Computed 15 invariants in 97 ms
Loading property file /tmp/ReachabilityCardinality14788690450066618112.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AutonomousCar-PT-10b-ReachabilityFireability-2024-08 is UNSAT
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem AutonomousCar-PT-10b-ReachabilityFireability-2024-11 is UNSAT
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 355/414 variables, 14/73 constraints. Problems are: Problem set: 2 solved, 5 unsolved
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :4 after 5
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :5 after 6
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :6 after 27
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :27 after 61
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :61 after 76
At refinement iteration 3 (INCLUDED_ONLY) 0/414 variables, 355/428 constraints. Problems are: Problem set: 2 solved, 5 unsolved
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :76 after 1041
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 0/428 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 11/425 variables, 1/429 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 11/440 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 0/440 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 2252/2677 variables, 425/865 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2677 variables, 0/865 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/2677 variables, 0/865 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2677/2677 variables, and 865 constraints, problems are : Problem set: 2 solved, 5 unsolved in 2521 ms.
Refiners :[Domain max(s): 425/425 constraints, Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 425/425 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/40 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Problem AutonomousCar-PT-10b-ReachabilityFireability-2024-06 is UNSAT
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem AutonomousCar-PT-10b-ReachabilityFireability-2024-09 is UNSAT
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 374/414 variables, 14/54 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/414 variables, 374/428 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 0/428 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 11/425 variables, 1/429 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 11/440 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 0/440 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2252/2677 variables, 425/865 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2677 variables, 0/865 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/2677 variables, 0/865 constraints. Problems are: Problem set: 4 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2677/2677 variables, and 865 constraints, problems are : Problem set: 4 solved, 3 unsolved in 2330 ms.
Refiners :[Domain max(s): 425/425 constraints, Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 425/425 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 6120ms problems are : Problem set: 4 solved, 3 unsolved
Parikh walk visited 0 properties in 1367 ms.
Support contains 20 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 2252/2252 transitions.
Graph (trivial) has 350 edges and 425 vertex of which 4 / 425 are part of one of the 2 SCC in 13 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1994 edges and 423 vertex of which 416 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.42 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 175 transitions
Trivial Post-agglo rules discarded 175 transitions
Performed 175 trivial Post agglomeration. Transition count delta: 175
Iterating post reduction 0 with 177 rules applied. Total rules applied 179 place count 416 transition count 2066
Reduce places removed 175 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 231 rules applied. Total rules applied 410 place count 241 transition count 2010
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 442 place count 209 transition count 2010
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 442 place count 209 transition count 1992
Deduced a syphon composed of 18 places in 4 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 478 place count 191 transition count 1992
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 516 place count 153 transition count 1954
Iterating global reduction 3 with 38 rules applied. Total rules applied 554 place count 153 transition count 1954
Ensure Unique test removed 401 transitions
Reduce isomorphic transitions removed 401 transitions.
Iterating post reduction 3 with 401 rules applied. Total rules applied 955 place count 153 transition count 1553
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 965 place count 143 transition count 1462
Iterating global reduction 4 with 10 rules applied. Total rules applied 975 place count 143 transition count 1462
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 4 with 18 rules applied. Total rules applied 993 place count 143 transition count 1444
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 1002 place count 134 transition count 1444
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 6 with 68 rules applied. Total rules applied 1070 place count 100 transition count 1410
Free-agglomeration rule applied 21 times.
Iterating global reduction 6 with 21 rules applied. Total rules applied 1091 place count 100 transition count 1389
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 1112 place count 79 transition count 1389
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 7 with 11 rules applied. Total rules applied 1123 place count 79 transition count 1389
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1124 place count 78 transition count 1388
Applied a total of 1124 rules in 1422 ms. Remains 78 /425 variables (removed 347) and now considering 1388/2252 (removed 864) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1445 ms. Remains : 78/425 places, 1388/2252 transitions.
RANDOM walk for 40000 steps (204 resets) in 1766 ms. (22 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (20 resets) in 235 ms. (169 steps per ms) remains 2/3 properties
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (144 resets) in 255 ms. (156 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (144 resets) in 280 ms. (142 steps per ms) remains 2/2 properties
// Phase 1: matrix 1388 rows 78 cols
[2024-05-22 08:21:25] [INFO ] Computed 15 invariants in 36 ms
[2024-05-22 08:21:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/60 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1384/1444 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1444 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 22/1466 variables, 18/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1466 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1466 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1466 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1466 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1466/1466 variables, and 94 constraints, problems are : Problem set: 0 solved, 2 unsolved in 754 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 78/78 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/60 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1384/1444 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1444 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 22/1466 variables, 18/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1466 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1466 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1466 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1466 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1466/1466 variables, and 94 constraints, problems are : Problem set: 0 solved, 2 unsolved in 984 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 78/78 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2086ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 209 ms.
Support contains 16 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 1388/1388 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 78 transition count 1387
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 76 transition count 1387
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 76 transition count 1386
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 15 place count 75 transition count 1376
Applied a total of 15 rules in 281 ms. Remains 75 /78 variables (removed 3) and now considering 1376/1388 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 281 ms. Remains : 75/78 places, 1376/1388 transitions.
RANDOM walk for 40000 steps (94 resets) in 1661 ms. (24 steps per ms) remains 0/2 properties
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 18128 ms.

BK_STOP 1716366088366

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-10b"
export BK_EXAMINATION="ReachabilityFireability"
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-5568"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-10b, 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 r026-smll-171620167600375"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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