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-171620167400311.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-06b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167400311
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 18:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 12 18:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 12 18:06 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 228K 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-06b-ReachabilityFireability-2024-00
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-2024-01
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-2024-02
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-2024-03
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-2024-04
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-2024-05
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-2024-06
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-2024-07
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-2024-08
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-2024-09
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-2024-10
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-2024-11
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-2024-12
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-2024-13
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-2024-14
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716332030953

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-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-21 22:53:53] [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-21 22:53:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:53:54] [INFO ] Load time of PNML (sax parser for PT used): 254 ms
[2024-05-21 22:53:54] [INFO ] Transformed 289 places.
[2024-05-21 22:53:54] [INFO ] Transformed 644 transitions.
[2024-05-21 22:53:54] [INFO ] Found NUPN structural information;
[2024-05-21 22:53:54] [INFO ] Parsed PT model containing 289 places and 644 transitions and 3812 arcs in 602 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 37 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (185 resets) in 3487 ms. (11 steps per ms) remains 8/16 properties
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-21 22:53:55] [INFO ] Flatten gal took : 502 ms
BEST_FIRST walk for 40003 steps (73 resets) in 546 ms. (73 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (71 resets) in 534 ms. (74 steps per ms) remains 8/8 properties
[2024-05-21 22:53:55] [INFO ] Flatten gal took : 283 ms
[2024-05-21 22:53:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16579862870894262594.gal : 129 ms
[2024-05-21 22:53:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5624588565382457298.prop : 5 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/ReachabilityCardinality16579862870894262594.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5624588565382457298.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (49 resets) in 1353 ms. (29 steps per ms) remains 8/8 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 ...329
BEST_FIRST walk for 40003 steps (126 resets) in 389 ms. (102 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (142 resets) in 235 ms. (169 steps per ms) remains 8/8 properties
Loading property file /tmp/ReachabilityCardinality5624588565382457298.prop.
BEST_FIRST walk for 40003 steps (82 resets) in 470 ms. (84 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (79 resets) in 405 ms. (98 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :2 after 5
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :5 after 6
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :6 after 23
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :23 after 24
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :24 after 55
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :55 after 93
BEST_FIRST walk for 40004 steps (71 resets) in 291 ms. (137 steps per ms) remains 7/8 properties
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :93 after 88984
// Phase 1: matrix 644 rows 289 cols
[2024-05-21 22:53:56] [INFO ] Computed 11 invariants in 36 ms
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :88984 after 91587
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :91587 after 516292
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :516292 after 1.87788e+06
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AutonomousCar-PT-06b-ReachabilityFireability-2024-06 is UNSAT
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem AutonomousCar-PT-06b-ReachabilityFireability-2024-10 is UNSAT
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem AutonomousCar-PT-06b-ReachabilityFireability-2024-13 is UNSAT
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 177/289 variables, 11/123 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 177/300 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 0/300 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 644/933 variables, 289/589 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/933 variables, 0/589 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/933 variables, 0/589 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 933/933 variables, and 589 constraints, problems are : Problem set: 3 solved, 4 unsolved in 1376 ms.
Refiners :[Domain max(s): 289/289 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 289/289 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 79/79 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/79 constraints. Problems are: Problem set: 3 solved, 4 unsolved
Problem AutonomousCar-PT-06b-ReachabilityFireability-2024-05 is UNSAT
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem AutonomousCar-PT-06b-ReachabilityFireability-2024-07 is UNSAT
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 210/289 variables, 11/90 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 210/300 constraints. Problems are: Problem set: 5 solved, 2 unsolved
[2024-05-21 22:53:59] [INFO ] Deduced a trap composed of 35 places in 294 ms of which 39 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 1/301 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 0/301 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 644/933 variables, 289/590 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/933 variables, 2/592 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/933 variables, 0/592 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/933 variables, 0/592 constraints. Problems are: Problem set: 5 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 933/933 variables, and 592 constraints, problems are : Problem set: 5 solved, 2 unsolved in 2089 ms.
Refiners :[Domain max(s): 289/289 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 289/289 constraints, PredecessorRefiner: 2/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 4147ms problems are : Problem set: 5 solved, 2 unsolved
Parikh walk visited 0 properties in 1098 ms.
Support contains 58 out of 289 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 289/289 places, 644/644 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 289 transition count 561
Reduce places removed 83 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 94 rules applied. Total rules applied 177 place count 206 transition count 550
Reduce places removed 5 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 15 rules applied. Total rules applied 192 place count 201 transition count 540
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 204 place count 191 transition count 538
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 204 place count 191 transition count 520
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 240 place count 173 transition count 520
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 266 place count 147 transition count 494
Iterating global reduction 4 with 26 rules applied. Total rules applied 292 place count 147 transition count 494
Ensure Unique test removed 147 transitions
Reduce isomorphic transitions removed 147 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 148 rules applied. Total rules applied 440 place count 147 transition count 346
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 441 place count 146 transition count 346
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 443 place count 144 transition count 339
Iterating global reduction 6 with 2 rules applied. Total rules applied 445 place count 144 transition count 339
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 447 place count 144 transition count 337
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 448 place count 143 transition count 337
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 8 with 42 rules applied. Total rules applied 490 place count 122 transition count 316
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 491 place count 122 transition count 315
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 493 place count 122 transition count 313
Free-agglomeration rule applied 11 times.
Iterating global reduction 9 with 11 rules applied. Total rules applied 504 place count 122 transition count 302
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 9 with 11 rules applied. Total rules applied 515 place count 111 transition count 302
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 517 place count 111 transition count 302
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 518 place count 110 transition count 295
Iterating global reduction 10 with 1 rules applied. Total rules applied 519 place count 110 transition count 295
Applied a total of 519 rules in 214 ms. Remains 110 /289 variables (removed 179) and now considering 295/644 (removed 349) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 228 ms. Remains : 110/289 places, 295/644 transitions.
RANDOM walk for 40000 steps (242 resets) in 448 ms. (89 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (71 resets) in 389 ms. (102 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (159 resets) in 299 ms. (133 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 847045 steps, run timeout after 3001 ms. (steps per millisecond=282 ) properties seen :0 out of 2
Probabilistic random walk after 847045 steps, saw 124447 distinct states, run finished after 3011 ms. (steps per millisecond=281 ) properties seen :0
// Phase 1: matrix 295 rows 110 cols
[2024-05-21 22:54:05] [INFO ] Computed 11 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 52/110 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 295/405 variables, 110/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/405 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/405 variables, and 121 constraints, problems are : Problem set: 0 solved, 2 unsolved in 279 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 52/110 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 295/405 variables, 110/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/405 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 405/405 variables, and 123 constraints, problems are : Problem set: 0 solved, 2 unsolved in 628 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1001ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 702 ms.
Support contains 58 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 295/295 transitions.
Applied a total of 0 rules in 11 ms. Remains 110 /110 variables (removed 0) and now considering 295/295 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 110/110 places, 295/295 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 295/295 transitions.
Applied a total of 0 rules in 10 ms. Remains 110 /110 variables (removed 0) and now considering 295/295 (removed 0) transitions.
[2024-05-21 22:54:07] [INFO ] Invariant cache hit.
[2024-05-21 22:54:07] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 22:54:07] [INFO ] Invariant cache hit.
[2024-05-21 22:54:07] [INFO ] Implicit Places using invariants and state equation in 157 ms returned [109]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 249 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 109/110 places, 295/295 transitions.
Applied a total of 0 rules in 11 ms. Remains 109 /109 variables (removed 0) and now considering 295/295 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 270 ms. Remains : 109/110 places, 295/295 transitions.
RANDOM walk for 40000 steps (661 resets) in 984 ms. (40 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (64 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (160 resets) in 177 ms. (224 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 945278 steps, run timeout after 3001 ms. (steps per millisecond=314 ) properties seen :0 out of 2
Probabilistic random walk after 945278 steps, saw 137815 distinct states, run finished after 3001 ms. (steps per millisecond=314 ) properties seen :0
// Phase 1: matrix 295 rows 109 cols
[2024-05-21 22:54:11] [INFO ] Computed 10 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/106 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 294/400 variables, 106/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/404 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/404 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 119 constraints, problems are : Problem set: 0 solved, 2 unsolved in 252 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/106 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 294/400 variables, 106/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/404 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/404 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 404/404 variables, and 121 constraints, problems are : Problem set: 0 solved, 2 unsolved in 725 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1058ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 447 ms.
Support contains 58 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 295/295 transitions.
Applied a total of 0 rules in 10 ms. Remains 109 /109 variables (removed 0) and now considering 295/295 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 109/109 places, 295/295 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 295/295 transitions.
Applied a total of 0 rules in 8 ms. Remains 109 /109 variables (removed 0) and now considering 295/295 (removed 0) transitions.
[2024-05-21 22:54:12] [INFO ] Invariant cache hit.
[2024-05-21 22:54:12] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-21 22:54:12] [INFO ] Invariant cache hit.
[2024-05-21 22:54:13] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-05-21 22:54:13] [INFO ] Redundant transitions in 27 ms returned []
Running 294 sub problems to find dead transitions.
[2024-05-21 22:54:13] [INFO ] Invariant cache hit.
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :1.87788e+06 after 2.8877e+08
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-21 22:54:16] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 2 ms to minimize.
[2024-05-21 22:54:16] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 1 ms to minimize.
[2024-05-21 22:54:16] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 2 ms to minimize.
[2024-05-21 22:54:16] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 1 ms to minimize.
[2024-05-21 22:54:16] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 2 ms to minimize.
[2024-05-21 22:54:16] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 12 ms to minimize.
[2024-05-21 22:54:17] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 1 ms to minimize.
[2024-05-21 22:54:17] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2024-05-21 22:54:17] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-21 22:54:17] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 3 ms to minimize.
[2024-05-21 22:54:17] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 10 ms to minimize.
[2024-05-21 22:54:17] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 2 ms to minimize.
[2024-05-21 22:54:17] [INFO ] Deduced a trap composed of 14 places in 215 ms of which 1 ms to minimize.
[2024-05-21 22:54:17] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 1 ms to minimize.
[2024-05-21 22:54:18] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 1 ms to minimize.
[2024-05-21 22:54:18] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 2 ms to minimize.
[2024-05-21 22:54:18] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 1 ms to minimize.
[2024-05-21 22:54:18] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 2 ms to minimize.
[2024-05-21 22:54:19] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 2 ms to minimize.
[2024-05-21 22:54:19] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Problem TDEAD270 is UNSAT
At refinement iteration 4 (OVERLAPS) 295/404 variables, 109/139 constraints. Problems are: Problem set: 1 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 0/139 constraints. Problems are: Problem set: 1 solved, 293 unsolved
At refinement iteration 6 (OVERLAPS) 0/404 variables, 0/139 constraints. Problems are: Problem set: 1 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 139 constraints, problems are : Problem set: 1 solved, 293 unsolved in 14721 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 1 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 20/30 constraints. Problems are: Problem set: 1 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 293 unsolved
At refinement iteration 4 (OVERLAPS) 295/404 variables, 109/139 constraints. Problems are: Problem set: 1 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 293/432 constraints. Problems are: Problem set: 1 solved, 293 unsolved
[2024-05-21 22:54:38] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 3 ms to minimize.
[2024-05-21 22:54:38] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 2/434 constraints. Problems are: Problem set: 1 solved, 293 unsolved
[2024-05-21 22:54:42] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 1/435 constraints. Problems are: Problem set: 1 solved, 293 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 0/435 constraints. Problems are: Problem set: 1 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 404/404 variables, and 435 constraints, problems are : Problem set: 1 solved, 293 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 293/294 constraints, Known Traps: 23/23 constraints]
After SMT, in 45737ms problems are : Problem set: 1 solved, 293 unsolved
Search for dead transitions found 1 dead transitions in 45749ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 109/109 places, 294/295 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 108 transition count 293
Applied a total of 2 rules in 21 ms. Remains 108 /109 variables (removed 1) and now considering 293/294 (removed 1) transitions.
// Phase 1: matrix 293 rows 108 cols
[2024-05-21 22:54:58] [INFO ] Computed 10 invariants in 2 ms
[2024-05-21 22:54:58] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 22:54:58] [INFO ] Invariant cache hit.
[2024-05-21 22:54:59] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 108/109 places, 293/295 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 46409 ms. Remains : 108/109 places, 293/295 transitions.
RANDOM walk for 40000 steps (549 resets) in 189 ms. (210 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (66 resets) in 223 ms. (178 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (161 resets) in 257 ms. (155 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 960575 steps, run timeout after 3001 ms. (steps per millisecond=320 ) properties seen :0 out of 2
Probabilistic random walk after 960575 steps, saw 139786 distinct states, run finished after 3001 ms. (steps per millisecond=320 ) properties seen :0
[2024-05-21 22:55:02] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/106 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 293/399 variables, 106/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/401 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/401 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 118 constraints, problems are : Problem set: 0 solved, 2 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/106 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 293/399 variables, 106/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/401 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 22:55:03] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/401 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 121 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1121 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1375ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 571 ms.
Support contains 58 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 293/293 transitions.
Applied a total of 0 rules in 11 ms. Remains 108 /108 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 108/108 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 293/293 transitions.
Applied a total of 0 rules in 11 ms. Remains 108 /108 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2024-05-21 22:55:04] [INFO ] Invariant cache hit.
[2024-05-21 22:55:04] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 22:55:04] [INFO ] Invariant cache hit.
[2024-05-21 22:55:04] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2024-05-21 22:55:04] [INFO ] Redundant transitions in 5 ms returned []
Running 292 sub problems to find dead transitions.
[2024-05-21 22:55:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-21 22:55:08] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 1 ms to minimize.
[2024-05-21 22:55:08] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 1 ms to minimize.
[2024-05-21 22:55:08] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 1 ms to minimize.
[2024-05-21 22:55:08] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 4 ms to minimize.
[2024-05-21 22:55:08] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
[2024-05-21 22:55:08] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
[2024-05-21 22:55:09] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-21 22:55:09] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-21 22:55:09] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 9 ms to minimize.
[2024-05-21 22:55:09] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2024-05-21 22:55:09] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-05-21 22:55:09] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 1 ms to minimize.
[2024-05-21 22:55:09] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 1 ms to minimize.
[2024-05-21 22:55:09] [INFO ] Deduced a trap composed of 12 places in 204 ms of which 1 ms to minimize.
[2024-05-21 22:55:10] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 2 ms to minimize.
[2024-05-21 22:55:10] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 2 ms to minimize.
[2024-05-21 22:55:10] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 2 ms to minimize.
[2024-05-21 22:55:10] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 2 ms to minimize.
[2024-05-21 22:55:11] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2024-05-21 22:55:11] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (OVERLAPS) 293/401 variables, 108/138 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (OVERLAPS) 0/401 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 138 constraints, problems are : Problem set: 0 solved, 292 unsolved in 13717 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (OVERLAPS) 293/401 variables, 108/138 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 292/430 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-21 22:55:26] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 2 ms to minimize.
[2024-05-21 22:55:29] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 2/432 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (OVERLAPS) 0/401 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 432 constraints, problems are : Problem set: 0 solved, 292 unsolved in 29533 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 22/22 constraints]
After SMT, in 44276ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 44281ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44559 ms. Remains : 108/108 places, 293/293 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-21 22:55:49] [INFO ] Flatten gal took : 146 ms
[2024-05-21 22:55:49] [INFO ] Applying decomposition
[2024-05-21 22:55:49] [INFO ] Flatten gal took : 97 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14626707847459002447.txt' '-o' '/tmp/graph14626707847459002447.bin' '-w' '/tmp/graph14626707847459002447.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14626707847459002447.bin' '-l' '-1' '-v' '-w' '/tmp/graph14626707847459002447.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:55:49] [INFO ] Decomposing Gal with order
[2024-05-21 22:55:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:55:49] [INFO ] Removed a total of 1203 redundant transitions.
[2024-05-21 22:55:50] [INFO ] Flatten gal took : 240 ms
[2024-05-21 22:55:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 25 ms.
[2024-05-21 22:55:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5196162969575758172.gal : 30 ms
[2024-05-21 22:55:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality802991843730510660.prop : 1 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/ReachabilityCardinality5196162969575758172.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality802991843730510660.prop' '--nowitness'

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 ...306
Loading property file /tmp/ReachabilityCardinality802991843730510660.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 156
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :156 after 6.98839e+06
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :6.98839e+06 after 3.04426e+11
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,4.86429e+12,0.56227,17952,2897,147,30277,1558,807,25946,123,5063,0
Total reachable state count : 4864294113772

Verifying 2 reachability properties.
Reachability property AutonomousCar-PT-06b-ReachabilityFireability-2024-03 is true.
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-2024-03 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-06b-ReachabilityFireability-2024-03,9180,0.61091,18212,124,29,30277,1558,900,25946,147,5063,19986
Invariant property AutonomousCar-PT-06b-ReachabilityFireability-2024-15 does not hold.
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-2024-15 FALSE 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-06b-ReachabilityFireability-2024-15,365010,0.667953,18212,175,25,30277,1558,988,25946,151,5063,38495
All properties solved without resorting to model-checking.
Total runtime 117419 ms.

BK_STOP 1716332150935

--------------------
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-06b"
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-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 r026-smll-171620167400311"
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 ;