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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 928K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K 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.2K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 18:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 12 18:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 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 517K 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-08b-ReachabilityCardinality-2024-00
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2024-01
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2024-02
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2024-03
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2024-04
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2024-05
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2024-06
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2024-07
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2024-08
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2024-09
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2024-10
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2024-11
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2024-12
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2024-13
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2024-14
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716343472187

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-08b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-22 02:04:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 02:04:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 02:04:35] [INFO ] Load time of PNML (sax parser for PT used): 393 ms
[2024-05-22 02:04:35] [INFO ] Transformed 357 places.
[2024-05-22 02:04:35] [INFO ] Transformed 1128 transitions.
[2024-05-22 02:04:35] [INFO ] Found NUPN structural information;
[2024-05-22 02:04:35] [INFO ] Parsed PT model containing 357 places and 1128 transitions and 9454 arcs in 762 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 42 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (230 resets) in 2671 ms. (14 steps per ms) remains 6/14 properties
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (46 resets) in 617 ms. (64 steps per ms) remains 5/6 properties
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (57 resets) in 398 ms. (100 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (53 resets) in 289 ms. (137 steps per ms) remains 5/5 properties
[2024-05-22 02:04:37] [INFO ] Flatten gal took : 639 ms
BEST_FIRST walk for 40004 steps (43 resets) in 443 ms. (90 steps per ms) remains 4/5 properties
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (58 resets) in 248 ms. (160 steps per ms) remains 4/4 properties
// Phase 1: matrix 1128 rows 357 cols
[2024-05-22 02:04:37] [INFO ] Computed 13 invariants in 41 ms
[2024-05-22 02:04:37] [INFO ] Flatten gal took : 245 ms
[2024-05-22 02:04:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14455029730487445107.gal : 199 ms
[2024-05-22 02:04:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16349643778970107838.prop : 9 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/ReachabilityCardinality14455029730487445107.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16349643778970107838.prop' '--nowitness' '--gen-order' 'FOLLOW'

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
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 318/357 variables, 13/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 318/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Loading property file /tmp/ReachabilityCardinality16349643778970107838.prop.
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AutonomousCar-PT-08b-ReachabilityCardinality-2024-01 is UNSAT
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 1128/1485 variables, 357/727 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :4 after 5
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :5 after 6
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :6 after 25
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :25 after 53
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :53 after 88
At refinement iteration 6 (INCLUDED_ONLY) 0/1485 variables, 0/727 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/1485 variables, 0/727 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1485/1485 variables, and 727 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1433 ms.
Refiners :[Domain max(s): 357/357 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 198/213 variables, 7/22 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 198/220 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-22 02:04:39] [INFO ] Deduced a trap composed of 38 places in 525 ms of which 36 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :88 after 177556
[2024-05-22 02:04:40] [INFO ] Deduced a trap composed of 24 places in 379 ms of which 3 ms to minimize.
[2024-05-22 02:04:40] [INFO ] Deduced a trap composed of 35 places in 236 ms of which 3 ms to minimize.
[2024-05-22 02:04:40] [INFO ] Deduced a trap composed of 46 places in 240 ms of which 3 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :177556 after 1.42152e+06
[2024-05-22 02:04:40] [INFO ] Deduced a trap composed of 52 places in 247 ms of which 3 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :1.42152e+06 after 1.47697e+06
[2024-05-22 02:04:41] [INFO ] Deduced a trap composed of 52 places in 271 ms of which 35 ms to minimize.
Problem AutonomousCar-PT-08b-ReachabilityCardinality-2024-11 is UNSAT
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 6/226 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/226 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 144/357 variables, 6/232 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 144/376 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-22 02:04:41] [INFO ] Deduced a trap composed of 7 places in 337 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 1/377 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 0/377 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1128/1485 variables, 357/734 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1485 variables, 2/736 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-22 02:04:43] [INFO ] Deduced a trap composed of 18 places in 662 ms of which 4 ms to minimize.
[2024-05-22 02:04:43] [INFO ] Deduced a trap composed of 37 places in 477 ms of which 4 ms to minimize.
[2024-05-22 02:04:44] [INFO ] Deduced a trap composed of 35 places in 412 ms of which 3 ms to minimize.
SMT process timed out in 6742ms, After SMT, problems are : Problem set: 2 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 9 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 1128/1128 transitions.
Graph (trivial) has 328 edges and 357 vertex of which 4 / 357 are part of one of the 2 SCC in 9 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 1428 edges and 355 vertex of which 348 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.15 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 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 0 with 149 rules applied. Total rules applied 151 place count 348 transition count 970
Reduce places removed 147 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 188 rules applied. Total rules applied 339 place count 201 transition count 929
Reduce places removed 23 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 25 rules applied. Total rules applied 364 place count 178 transition count 927
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 366 place count 176 transition count 927
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 366 place count 176 transition count 921
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 378 place count 170 transition count 921
Discarding 29 places :
Symmetric choice reduction at 4 with 29 rule applications. Total rules 407 place count 141 transition count 892
Iterating global reduction 4 with 29 rules applied. Total rules applied 436 place count 141 transition count 892
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 4 with 256 rules applied. Total rules applied 692 place count 141 transition count 636
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 692 place count 141 transition count 634
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 696 place count 139 transition count 634
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 704 place count 131 transition count 577
Iterating global reduction 5 with 8 rules applied. Total rules applied 712 place count 131 transition count 577
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 5 with 12 rules applied. Total rules applied 724 place count 131 transition count 565
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 730 place count 125 transition count 565
Performed 42 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 7 with 84 rules applied. Total rules applied 814 place count 83 transition count 522
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 821 place count 76 transition count 459
Iterating global reduction 7 with 7 rules applied. Total rules applied 828 place count 76 transition count 459
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 829 place count 76 transition count 458
Free-agglomeration rule applied 11 times.
Iterating global reduction 7 with 11 rules applied. Total rules applied 840 place count 76 transition count 447
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 851 place count 65 transition count 447
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 853 place count 65 transition count 445
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 854 place count 65 transition count 445
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 855 place count 64 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 856 place count 63 transition count 444
Applied a total of 856 rules in 461 ms. Remains 63 /357 variables (removed 294) and now considering 444/1128 (removed 684) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 479 ms. Remains : 63/357 places, 444/1128 transitions.
RANDOM walk for 40000 steps (422 resets) in 597 ms. (66 steps per ms) remains 1/2 properties
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (260 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
// Phase 1: matrix 444 rows 63 cols
[2024-05-22 02:04:44] [INFO ] Computed 12 invariants in 4 ms
[2024-05-22 02:04:44] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/30 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 364/394 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 112/506 variables, 32/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/506 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/506 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/506 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/507 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/507 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/507 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/507 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 76 constraints, problems are : Problem set: 0 solved, 1 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/30 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 364/394 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 112/506 variables, 32/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/506 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/506 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/506 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/506 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/507 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/507 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/507 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/507 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 77 constraints, problems are : Problem set: 0 solved, 1 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 497ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 59 ms.
Support contains 8 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 444/444 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 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 62 transition count 443
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 61 transition count 442
Applied a total of 4 rules in 76 ms. Remains 61 /63 variables (removed 2) and now considering 442/444 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 61/63 places, 442/444 transitions.
RANDOM walk for 40000 steps (466 resets) in 517 ms. (77 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (263 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1303195 steps, run timeout after 3001 ms. (steps per millisecond=434 ) properties seen :0 out of 1
Probabilistic random walk after 1303195 steps, saw 187991 distinct states, run finished after 3008 ms. (steps per millisecond=433 ) properties seen :0
// Phase 1: matrix 442 rows 61 cols
[2024-05-22 02:04:48] [INFO ] Computed 12 invariants in 24 ms
[2024-05-22 02:04:48] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/30 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 364/394 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 109/503 variables, 31/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 7/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/503 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/503 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 74 constraints, problems are : Problem set: 0 solved, 1 unsolved in 268 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/30 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 364/394 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 109/503 variables, 31/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 7/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/503 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/503 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/503 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 503/503 variables, and 75 constraints, problems are : Problem set: 0 solved, 1 unsolved in 245 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 573ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 51 ms.
Support contains 8 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 442/442 transitions.
Applied a total of 0 rules in 25 ms. Remains 61 /61 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 61/61 places, 442/442 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 442/442 transitions.
Applied a total of 0 rules in 21 ms. Remains 61 /61 variables (removed 0) and now considering 442/442 (removed 0) transitions.
[2024-05-22 02:04:49] [INFO ] Invariant cache hit.
[2024-05-22 02:04:49] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-05-22 02:04:49] [INFO ] Invariant cache hit.
[2024-05-22 02:04:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 02:04:50] [INFO ] Implicit Places using invariants and state equation in 516 ms returned [53, 60]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 813 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 59/61 places, 442/442 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 58 transition count 441
Applied a total of 2 rules in 40 ms. Remains 58 /59 variables (removed 1) and now considering 441/442 (removed 1) transitions.
// Phase 1: matrix 441 rows 58 cols
[2024-05-22 02:04:50] [INFO ] Computed 10 invariants in 13 ms
[2024-05-22 02:04:50] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-05-22 02:04:50] [INFO ] Invariant cache hit.
[2024-05-22 02:04:50] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 665 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 58/61 places, 441/442 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1540 ms. Remains : 58/61 places, 441/442 transitions.
RANDOM walk for 40000 steps (449 resets) in 2785 ms. (14 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (262 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1590829 steps, run timeout after 3001 ms. (steps per millisecond=530 ) properties seen :0 out of 1
Probabilistic random walk after 1590829 steps, saw 225339 distinct states, run finished after 3005 ms. (steps per millisecond=529 ) properties seen :0
[2024-05-22 02:04:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/27 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 363/390 variables, 27/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 109/499 variables, 31/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 6/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/499 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 68 constraints, problems are : Problem set: 0 solved, 1 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/27 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 363/390 variables, 27/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 109/499 variables, 31/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 6/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/499 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/499 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 499/499 variables, and 69 constraints, problems are : Problem set: 0 solved, 1 unsolved in 260 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 561ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 57 ms.
Support contains 8 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 441/441 transitions.
Applied a total of 0 rules in 21 ms. Remains 58 /58 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 58/58 places, 441/441 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 441/441 transitions.
Applied a total of 0 rules in 17 ms. Remains 58 /58 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2024-05-22 02:04:55] [INFO ] Invariant cache hit.
[2024-05-22 02:04:55] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-22 02:04:55] [INFO ] Invariant cache hit.
[2024-05-22 02:04:55] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
[2024-05-22 02:04:55] [INFO ] Redundant transitions in 62 ms returned []
Running 440 sub problems to find dead transitions.
[2024-05-22 02:04:55] [INFO ] Invariant cache hit.
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1.47697e+06 after 3.11974e+06
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-22 02:05:05] [INFO ] Deduced a trap composed of 7 places in 217 ms of which 1 ms to minimize.
[2024-05-22 02:05:06] [INFO ] Deduced a trap composed of 9 places in 222 ms of which 1 ms to minimize.
[2024-05-22 02:05:06] [INFO ] Deduced a trap composed of 9 places in 191 ms of which 1 ms to minimize.
[2024-05-22 02:05:06] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 1 ms to minimize.
[2024-05-22 02:05:06] [INFO ] Deduced a trap composed of 9 places in 242 ms of which 2 ms to minimize.
[2024-05-22 02:05:06] [INFO ] Deduced a trap composed of 9 places in 203 ms of which 1 ms to minimize.
[2024-05-22 02:05:07] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 1 ms to minimize.
[2024-05-22 02:05:07] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 440 unsolved
Problem TDEAD369 is UNSAT
At refinement iteration 5 (OVERLAPS) 441/499 variables, 58/76 constraints. Problems are: Problem set: 1 solved, 439 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 0/76 constraints. Problems are: Problem set: 1 solved, 439 unsolved
At refinement iteration 7 (OVERLAPS) 0/499 variables, 0/76 constraints. Problems are: Problem set: 1 solved, 439 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 76 constraints, problems are : Problem set: 1 solved, 439 unsolved in 20520 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 440/440 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 1 solved, 439 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 439 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 7/15 constraints. Problems are: Problem set: 1 solved, 439 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 439 unsolved
At refinement iteration 3 (OVERLAPS) 1/58 variables, 2/17 constraints. Problems are: Problem set: 1 solved, 439 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/18 constraints. Problems are: Problem set: 1 solved, 439 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 439 unsolved
At refinement iteration 6 (OVERLAPS) 441/499 variables, 58/76 constraints. Problems are: Problem set: 1 solved, 439 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 439/515 constraints. Problems are: Problem set: 1 solved, 439 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 499/499 variables, and 515 constraints, problems are : Problem set: 1 solved, 439 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 439/440 constraints, Known Traps: 8/8 constraints]
After SMT, in 56665ms problems are : Problem set: 1 solved, 439 unsolved
Search for dead transitions found 1 dead transitions in 56678ms
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 : 58/58 places, 440/441 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 57 transition count 439
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 57 transition count 439
Applied a total of 2 rules in 50 ms. Remains 57 /58 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 57 cols
[2024-05-22 02:05:52] [INFO ] Computed 10 invariants in 4 ms
[2024-05-22 02:05:52] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-05-22 02:05:52] [INFO ] Invariant cache hit.
[2024-05-22 02:05:53] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 57/58 places, 439/441 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 57919 ms. Remains : 57/58 places, 439/441 transitions.
RANDOM walk for 40000 steps (433 resets) in 471 ms. (84 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (262 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1363803 steps, run timeout after 3001 ms. (steps per millisecond=454 ) properties seen :0 out of 1
Probabilistic random walk after 1363803 steps, saw 190970 distinct states, run finished after 3001 ms. (steps per millisecond=454 ) properties seen :0
[2024-05-22 02:05:56] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/27 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 362/389 variables, 27/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 107/496 variables, 30/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/496 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 67 constraints, problems are : Problem set: 0 solved, 1 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/27 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 362/389 variables, 27/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 107/496 variables, 30/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/496 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 496/496 variables, and 68 constraints, problems are : Problem set: 0 solved, 1 unsolved in 232 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 447ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 51 ms.
Support contains 8 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 439/439 transitions.
Applied a total of 0 rules in 17 ms. Remains 57 /57 variables (removed 0) and now considering 439/439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 57/57 places, 439/439 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 439/439 transitions.
Applied a total of 0 rules in 16 ms. Remains 57 /57 variables (removed 0) and now considering 439/439 (removed 0) transitions.
[2024-05-22 02:05:56] [INFO ] Invariant cache hit.
[2024-05-22 02:05:56] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-22 02:05:56] [INFO ] Invariant cache hit.
[2024-05-22 02:05:57] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
[2024-05-22 02:05:57] [INFO ] Redundant transitions in 7 ms returned []
Running 438 sub problems to find dead transitions.
[2024-05-22 02:05:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-22 02:06:06] [INFO ] Deduced a trap composed of 7 places in 343 ms of which 1 ms to minimize.
[2024-05-22 02:06:06] [INFO ] Deduced a trap composed of 9 places in 349 ms of which 2 ms to minimize.
[2024-05-22 02:06:06] [INFO ] Deduced a trap composed of 9 places in 282 ms of which 1 ms to minimize.
[2024-05-22 02:06:07] [INFO ] Deduced a trap composed of 9 places in 274 ms of which 2 ms to minimize.
[2024-05-22 02:06:07] [INFO ] Deduced a trap composed of 9 places in 216 ms of which 1 ms to minimize.
[2024-05-22 02:06:07] [INFO ] Deduced a trap composed of 9 places in 208 ms of which 1 ms to minimize.
[2024-05-22 02:06:07] [INFO ] Deduced a trap composed of 9 places in 168 ms of which 1 ms to minimize.
[2024-05-22 02:06:07] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 5 (OVERLAPS) 439/496 variables, 57/75 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/496 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 7 (OVERLAPS) 0/496 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 438 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 75 constraints, problems are : Problem set: 0 solved, 438 unsolved in 20512 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 438/438 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 438 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 3 (OVERLAPS) 1/57 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 6 (OVERLAPS) 439/496 variables, 57/75 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 438/513 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-22 02:06:49] [INFO ] Deduced a trap composed of 20 places in 289 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/496 variables, and 514 constraints, problems are : Problem set: 0 solved, 438 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 438/438 constraints, Known Traps: 9/9 constraints]
After SMT, in 55527ms problems are : Problem set: 0 solved, 438 unsolved
Search for dead transitions found 0 dead transitions in 55538ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56104 ms. Remains : 57/57 places, 439/439 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-22 02:06:53] [INFO ] Flatten gal took : 143 ms
[2024-05-22 02:06:53] [INFO ] Applying decomposition
[2024-05-22 02:06:53] [INFO ] Flatten gal took : 151 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/graph8826817899552349335.txt' '-o' '/tmp/graph8826817899552349335.bin' '-w' '/tmp/graph8826817899552349335.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8826817899552349335.bin' '-l' '-1' '-v' '-w' '/tmp/graph8826817899552349335.weights' '-q' '0' '-e' '0.001'
[2024-05-22 02:06:53] [INFO ] Decomposing Gal with order
[2024-05-22 02:06:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:06:54] [INFO ] Removed a total of 3088 redundant transitions.
[2024-05-22 02:06:54] [INFO ] Flatten gal took : 383 ms
[2024-05-22 02:06:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 42 ms.
[2024-05-22 02:06:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17423002198916346537.gal : 18 ms
[2024-05-22 02:06:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17144365919829324392.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/ReachabilityCardinality17423002198916346537.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17144365919829324392.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 ...309
Loading property file /tmp/ReachabilityCardinality17144365919829324392.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 3.16453e+07
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.16453e+07 after 8.23143e+12
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :8.23143e+12 after 8.23145e+12
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :8.23145e+12 after 8.23146e+12
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :8.23146e+12 after 8.23169e+12
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :8.23169e+12 after 8.23249e+12
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :8.23249e+12 after 8.23255e+12
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :8.23255e+12 after 8.25476e+12
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :8.25476e+12 after 2.44573e+13
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.44573e+13 after 2.44579e+13
ITS-tools command line returned an error code 137
[2024-05-22 02:18:38] [INFO ] Flatten gal took : 88 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14600374449957095215
[2024-05-22 02:18:38] [INFO ] Computing symmetric may disable matrix : 439 transitions.
[2024-05-22 02:18:38] [INFO ] Applying decomposition
[2024-05-22 02:18:38] [INFO ] Computation of Complete disable matrix. took 55 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 02:18:38] [INFO ] Computing symmetric may enable matrix : 439 transitions.
[2024-05-22 02:18:38] [INFO ] Flatten gal took : 80 ms
[2024-05-22 02:18:38] [INFO ] Computation of Complete enable matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 02:18:38] [INFO ] Computing Do-Not-Accords matrix : 439 transitions.
[2024-05-22 02:18:38] [INFO ] Computation of Completed DNA matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 02:18:38] [INFO ] Built C files in 298ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14600374449957095215
Running compilation step : cd /tmp/ltsmin14600374449957095215;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/graph8814119648500126465.txt' '-o' '/tmp/graph8814119648500126465.bin' '-w' '/tmp/graph8814119648500126465.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8814119648500126465.bin' '-l' '-1' '-v' '-w' '/tmp/graph8814119648500126465.weights' '-q' '0' '-e' '0.001'
[2024-05-22 02:18:38] [INFO ] Decomposing Gal with order
[2024-05-22 02:18:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:18:38] [INFO ] Removed a total of 2574 redundant transitions.
[2024-05-22 02:18:38] [INFO ] Flatten gal took : 86 ms
[2024-05-22 02:18:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 30 ms.
[2024-05-22 02:18:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11246200246747714943.gal : 7 ms
[2024-05-22 02:18:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3385342246458213761.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/ReachabilityCardinality11246200246747714943.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3385342246458213761.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 ...308
Loading property file /tmp/ReachabilityCardinality3385342246458213761.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 279
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :279 after 2839
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2839 after 583223
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,2.2782e+07,0.873816,25524,1509,62,48771,694,716,53150,80,3578,0
Total reachable state count : 22781954

Verifying 1 reachability properties.
Invariant property AutonomousCar-PT-08b-ReachabilityCardinality-2024-14 does not hold.
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-14 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-08b-ReachabilityCardinality-2024-14,458496,0.89141,25524,1074,55,48771,694,726,53150,86,3578,2054
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 845111 ms.

BK_STOP 1716344319933

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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-08b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-08b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r026-smll-171620167500342"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-08b.tgz
mv AutonomousCar-PT-08b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;