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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 804K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 17:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 17:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 17:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 17:49 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 334K 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-07b-ReachabilityCardinality-2024-00
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-01
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-02
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-03
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-04
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-05
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-06
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-07
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-08
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-09
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-10
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-11
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-12
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-13
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-14
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716338083150

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-07b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-22 00:34:45] [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 00:34:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:34:46] [INFO ] Load time of PNML (sax parser for PT used): 288 ms
[2024-05-22 00:34:46] [INFO ] Transformed 323 places.
[2024-05-22 00:34:46] [INFO ] Transformed 846 transitions.
[2024-05-22 00:34:46] [INFO ] Found NUPN structural information;
[2024-05-22 00:34:46] [INFO ] Parsed PT model containing 323 places and 846 transitions and 5865 arcs in 491 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 54 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (132 resets) in 4168 ms. (9 steps per ms) remains 7/12 properties
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-22 00:34:47] [INFO ] Flatten gal took : 626 ms
BEST_FIRST walk for 40003 steps (51 resets) in 447 ms. (89 steps per ms) remains 6/7 properties
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (62 resets) in 621 ms. (64 steps per ms) remains 5/6 properties
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-22 00:34:47] [INFO ] Flatten gal took : 373 ms
[2024-05-22 00:34:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12872800454698325286.gal : 197 ms
[2024-05-22 00:34:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2981640347399362511.prop : 4 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/ReachabilityCardinality12872800454698325286.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2981640347399362511.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (55 resets) in 1286 ms. (31 steps per ms) remains 4/5 properties
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK

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 (57 resets) in 543 ms. (73 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (67 resets) in 289 ms. (137 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (65 resets) in 630 ms. (63 steps per ms) remains 4/4 properties
Loading property file /tmp/ReachabilityCardinality2981640347399362511.prop.
// Phase 1: matrix 846 rows 323 cols
[2024-05-22 00:34:48] [INFO ] Computed 12 invariants in 36 ms
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :4 after 5
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :5 after 6
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :6 after 24
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :24 after 49
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :49 after 109
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AutonomousCar-PT-07b-ReachabilityCardinality-2024-11 is UNSAT
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 248/323 variables, 12/87 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 248/335 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/335 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :109 after 355243
At refinement iteration 5 (OVERLAPS) 846/1169 variables, 323/658 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1169 variables, 0/658 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-22 00:34:51] [INFO ] Deduced a trap composed of 15 places in 695 ms of which 43 ms to minimize.
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :355243 after 357798
[2024-05-22 00:34:51] [INFO ] Deduced a trap composed of 14 places in 439 ms of which 4 ms to minimize.
Problem AutonomousCar-PT-07b-ReachabilityCardinality-2024-14 is UNSAT
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 0/1169 variables, 2/660 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1169 variables, 0/660 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1169 variables, 0/660 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1169/1169 variables, and 660 constraints, problems are : Problem set: 2 solved, 2 unsolved in 2772 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 282/312 variables, 11/41 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 282/323 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-22 00:34:52] [INFO ] Deduced a trap composed of 17 places in 334 ms of which 3 ms to minimize.
[2024-05-22 00:34:52] [INFO ] Deduced a trap composed of 42 places in 282 ms of which 3 ms to minimize.
[2024-05-22 00:34:53] [INFO ] Deduced a trap composed of 38 places in 418 ms of which 4 ms to minimize.
Invariant property AutonomousCar-PT-07b-ReachabilityCardinality-2024-08 does not hold.
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :357798 after 428242
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :428242 after 1.80776e+06
[2024-05-22 00:34:53] [INFO ] Deduced a trap composed of 28 places in 479 ms of which 4 ms to minimize.
[2024-05-22 00:34:53] [INFO ] Deduced a trap composed of 45 places in 297 ms of which 3 ms to minimize.
[2024-05-22 00:34:54] [INFO ] Deduced a trap composed of 44 places in 325 ms of which 3 ms to minimize.
[2024-05-22 00:34:54] [INFO ] Deduced a trap composed of 35 places in 320 ms of which 3 ms to minimize.
[2024-05-22 00:34:54] [INFO ] Deduced a trap composed of 42 places in 274 ms of which 3 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1.80776e+06 after 3.46076e+07
[2024-05-22 00:34:55] [INFO ] Deduced a trap composed of 35 places in 278 ms of which 3 ms to minimize.
Problem AutonomousCar-PT-07b-ReachabilityCardinality-2024-09 is UNSAT
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 9/332 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/332 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 11/323 variables, 1/333 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 11/344 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/323 variables, 2/346 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/323 variables, 0/346 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 846/1169 variables, 323/669 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1169 variables, 1/670 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-05-22 00:34:56] [INFO ] Deduced a trap composed of 32 places in 438 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1169 variables, 1/671 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1169 variables, 0/671 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1169 variables, 0/671 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1169/1169 variables, and 671 constraints, problems are : Problem set: 3 solved, 1 unsolved in 4592 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 12/12 constraints]
After SMT, in 7719ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 93 ms.
Support contains 17 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 846/846 transitions.
Graph (trivial) has 277 edges and 323 vertex of which 4 / 323 are part of one of the 2 SCC in 5 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 1181 edges and 321 vertex of which 314 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.10 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 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 123 rules applied. Total rules applied 125 place count 314 transition count 714
Reduce places removed 122 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 145 rules applied. Total rules applied 270 place count 192 transition count 691
Reduce places removed 13 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 2 with 22 rules applied. Total rules applied 292 place count 179 transition count 682
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 13 rules applied. Total rules applied 305 place count 170 transition count 678
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 307 place count 168 transition count 678
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 307 place count 168 transition count 670
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 323 place count 160 transition count 670
Discarding 27 places :
Symmetric choice reduction at 5 with 27 rule applications. Total rules 350 place count 133 transition count 643
Iterating global reduction 5 with 27 rules applied. Total rules applied 377 place count 133 transition count 643
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 379 place count 133 transition count 641
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 379 place count 133 transition count 638
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 385 place count 130 transition count 638
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 392 place count 123 transition count 553
Iterating global reduction 6 with 7 rules applied. Total rules applied 399 place count 123 transition count 553
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 6 rules applied. Total rules applied 405 place count 123 transition count 547
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 407 place count 121 transition count 547
Performed 35 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 8 with 70 rules applied. Total rules applied 477 place count 86 transition count 511
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 483 place count 80 transition count 421
Iterating global reduction 8 with 6 rules applied. Total rules applied 489 place count 80 transition count 421
Drop transitions (Redundant composition of simpler transitions.) removed 115 transitions
Redundant transition composition rules discarded 115 transitions
Iterating global reduction 8 with 115 rules applied. Total rules applied 604 place count 80 transition count 306
Free-agglomeration rule applied 7 times.
Iterating global reduction 8 with 7 rules applied. Total rules applied 611 place count 80 transition count 299
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 618 place count 73 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 619 place count 73 transition count 298
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 620 place count 73 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 621 place count 72 transition count 297
Applied a total of 621 rules in 380 ms. Remains 72 /323 variables (removed 251) and now considering 297/846 (removed 549) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 400 ms. Remains : 72/323 places, 297/846 transitions.
RANDOM walk for 40000 steps (1558 resets) in 502 ms. (79 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (183 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1508624 steps, run timeout after 3001 ms. (steps per millisecond=502 ) properties seen :0 out of 1
Probabilistic random walk after 1508624 steps, saw 222256 distinct states, run finished after 3007 ms. (steps per millisecond=501 ) properties seen :0
// Phase 1: matrix 297 rows 72 cols
[2024-05-22 00:35:00] [INFO ] Computed 11 invariants in 2 ms
[2024-05-22 00:35:00] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/60 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 297/357 variables, 60/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 12/369 variables, 12/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/369 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 84 constraints, problems are : Problem set: 0 solved, 1 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 72/72 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/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/60 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 297/357 variables, 60/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 12/369 variables, 12/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:35:01] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 1 ms to minimize.
[2024-05-22 00:35:01] [INFO ] Deduced a trap composed of 3 places in 196 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/369 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 87 constraints, problems are : Problem set: 0 solved, 1 unsolved in 778 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1094ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 81 ms.
Support contains 17 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 297/297 transitions.
Applied a total of 0 rules in 24 ms. Remains 72 /72 variables (removed 0) and now considering 297/297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 72/72 places, 297/297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 297/297 transitions.
Applied a total of 0 rules in 16 ms. Remains 72 /72 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-05-22 00:35:01] [INFO ] Invariant cache hit.
[2024-05-22 00:35:01] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-22 00:35:01] [INFO ] Invariant cache hit.
[2024-05-22 00:35:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 00:35:01] [INFO ] Implicit Places using invariants and state equation in 233 ms returned [64, 71]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 402 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 70/72 places, 297/297 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 70 transition count 296
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 69 transition count 296
Applied a total of 2 rules in 23 ms. Remains 69 /70 variables (removed 1) and now considering 296/297 (removed 1) transitions.
// Phase 1: matrix 296 rows 69 cols
[2024-05-22 00:35:01] [INFO ] Computed 9 invariants in 3 ms
[2024-05-22 00:35:02] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-22 00:35:02] [INFO ] Invariant cache hit.
[2024-05-22 00:35:02] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 69/72 places, 296/297 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 790 ms. Remains : 69/72 places, 296/297 transitions.
RANDOM walk for 40000 steps (1611 resets) in 2407 ms. (16 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (209 resets) in 72 ms. (548 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1426208 steps, run timeout after 3001 ms. (steps per millisecond=475 ) properties seen :0 out of 1
Probabilistic random walk after 1426208 steps, saw 210915 distinct states, run finished after 3001 ms. (steps per millisecond=475 ) properties seen :0
[2024-05-22 00:35:05] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/54 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 296/350 variables, 54/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 15/365 variables, 15/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 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/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/54 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 296/350 variables, 54/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 15/365 variables, 15/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:35:06] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 1 ms to minimize.
[2024-05-22 00:35:06] [INFO ] Deduced a trap composed of 3 places in 248 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/365 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 81 constraints, problems are : Problem set: 0 solved, 1 unsolved in 952 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1169ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 70 ms.
Support contains 17 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 296/296 transitions.
Applied a total of 0 rules in 19 ms. Remains 69 /69 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 69/69 places, 296/296 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 296/296 transitions.
Applied a total of 0 rules in 18 ms. Remains 69 /69 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-05-22 00:35:07] [INFO ] Invariant cache hit.
[2024-05-22 00:35:07] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-22 00:35:07] [INFO ] Invariant cache hit.
[2024-05-22 00:35:07] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
[2024-05-22 00:35:07] [INFO ] Redundant transitions in 52 ms returned []
Running 295 sub problems to find dead transitions.
[2024-05-22 00:35:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/69 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-22 00:35:12] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 1 ms to minimize.
[2024-05-22 00:35:12] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 1 ms to minimize.
[2024-05-22 00:35:12] [INFO ] Deduced a trap composed of 11 places in 276 ms of which 1 ms to minimize.
[2024-05-22 00:35:12] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 1 ms to minimize.
[2024-05-22 00:35:13] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 1 ms to minimize.
[2024-05-22 00:35:13] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
[2024-05-22 00:35:14] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Problem TDEAD260 is UNSAT
At refinement iteration 5 (OVERLAPS) 296/365 variables, 69/85 constraints. Problems are: Problem set: 1 solved, 294 unsolved
[2024-05-22 00:35:17] [INFO ] Deduced a trap composed of 4 places in 622 ms of which 2 ms to minimize.
[2024-05-22 00:35:17] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 1 ms to minimize.
[2024-05-22 00:35:18] [INFO ] Deduced a trap composed of 10 places in 249 ms of which 1 ms to minimize.
[2024-05-22 00:35:18] [INFO ] Deduced a trap composed of 5 places in 200 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 4/89 constraints. Problems are: Problem set: 1 solved, 294 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 294 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 89 constraints, problems are : Problem set: 1 solved, 294 unsolved in 18190 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 1 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 294 unsolved
At refinement iteration 3 (OVERLAPS) 1/69 variables, 7/11 constraints. Problems are: Problem set: 1 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 9/20 constraints. Problems are: Problem set: 1 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 294 unsolved
At refinement iteration 6 (OVERLAPS) 296/365 variables, 69/89 constraints. Problems are: Problem set: 1 solved, 294 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 294/383 constraints. Problems are: Problem set: 1 solved, 294 unsolved
[2024-05-22 00:35:39] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 1/384 constraints. Problems are: Problem set: 1 solved, 294 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 0/384 constraints. Problems are: Problem set: 1 solved, 294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/365 variables, and 384 constraints, problems are : Problem set: 1 solved, 294 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 294/295 constraints, Known Traps: 12/12 constraints]
After SMT, in 50368ms problems are : Problem set: 1 solved, 294 unsolved
Search for dead transitions found 1 dead transitions in 50381ms
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 : 69/69 places, 295/296 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 68 transition count 294
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 68 transition count 294
Applied a total of 2 rules in 27 ms. Remains 68 /69 variables (removed 1) and now considering 294/295 (removed 1) transitions.
// Phase 1: matrix 294 rows 68 cols
[2024-05-22 00:35:58] [INFO ] Computed 9 invariants in 4 ms
[2024-05-22 00:35:58] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-22 00:35:58] [INFO ] Invariant cache hit.
[2024-05-22 00:35:58] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 68/69 places, 294/296 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 51495 ms. Remains : 68/69 places, 294/296 transitions.
RANDOM walk for 40000 steps (1595 resets) in 354 ms. (112 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (188 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1613800 steps, run timeout after 3001 ms. (steps per millisecond=537 ) properties seen :0 out of 1
Probabilistic random walk after 1613800 steps, saw 237889 distinct states, run finished after 3001 ms. (steps per millisecond=537 ) properties seen :0
[2024-05-22 00:36:01] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/54 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 294/348 variables, 54/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/362 variables, 14/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/362 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 77 constraints, problems are : Problem set: 0 solved, 1 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 68/68 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/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/54 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 294/348 variables, 54/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/362 variables, 14/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:36:02] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 1 ms to minimize.
[2024-05-22 00:36:02] [INFO ] Deduced a trap composed of 3 places in 214 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/362 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/362 variables, and 80 constraints, problems are : Problem set: 0 solved, 1 unsolved in 786 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1026ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 60 ms.
Support contains 17 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 294/294 transitions.
Applied a total of 0 rules in 18 ms. Remains 68 /68 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 68/68 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 294/294 transitions.
Applied a total of 0 rules in 16 ms. Remains 68 /68 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-22 00:36:02] [INFO ] Invariant cache hit.
[2024-05-22 00:36:03] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-22 00:36:03] [INFO ] Invariant cache hit.
[2024-05-22 00:36:03] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
[2024-05-22 00:36:03] [INFO ] Redundant transitions in 7 ms returned []
Running 293 sub problems to find dead transitions.
[2024-05-22 00:36:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/68 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 00:36:07] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:36:07] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 1 ms to minimize.
[2024-05-22 00:36:07] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 1 ms to minimize.
[2024-05-22 00:36:07] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 7 ms to minimize.
[2024-05-22 00:36:08] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 1 ms to minimize.
[2024-05-22 00:36:08] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2024-05-22 00:36:09] [INFO ] Deduced a trap composed of 23 places in 287 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (OVERLAPS) 294/362 variables, 68/84 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 00:36:11] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 1 ms to minimize.
[2024-05-22 00:36:11] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:36:11] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:36:11] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (OVERLAPS) 0/362 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 88 constraints, problems are : Problem set: 0 solved, 293 unsolved in 13931 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (OVERLAPS) 1/68 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (OVERLAPS) 294/362 variables, 68/88 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 293/381 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 00:36:29] [INFO ] Deduced a trap composed of 19 places in 197 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 00:36:38] [INFO ] Deduced a trap composed of 18 places in 179 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 362/362 variables, and 383 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 13/13 constraints]
After SMT, in 45655ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 45663ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46208 ms. Remains : 68/68 places, 294/294 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 10 ms. Remains 68 /68 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-22 00:36:49] [INFO ] Invariant cache hit.
[2024-05-22 00:36:49] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:36:49] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-22 00:36:49] [INFO ] After 229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 00:36:49] [INFO ] Deduced a trap composed of 4 places in 231 ms of which 2 ms to minimize.
[2024-05-22 00:36:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
TRAPS : Iteration 1
[2024-05-22 00:36:49] [INFO ] After 601ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 00:36:49] [INFO ] After 686ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-22 00:36:49] [INFO ] Flatten gal took : 64 ms
[2024-05-22 00:36:50] [INFO ] Flatten gal took : 58 ms
[2024-05-22 00:36:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9039604777721289864.gal : 10 ms
[2024-05-22 00:36:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8681233752439340874.prop : 0 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/ReachabilityCardinality9039604777721289864.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8681233752439340874.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 ...328
Loading property file /tmp/ReachabilityCardinality8681233752439340874.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 11
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :11 after 32
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :32 after 154
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :154 after 12487
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :12487 after 15654
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :15654 after 62062
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :62062 after 80626
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :80626 after 243574
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :243574 after 474102
Detected timeout of ITS tools.
[2024-05-22 00:37:05] [INFO ] Flatten gal took : 46 ms
[2024-05-22 00:37:05] [INFO ] Applying decomposition
[2024-05-22 00:37:05] [INFO ] Flatten gal took : 39 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/graph18393827619723242177.txt' '-o' '/tmp/graph18393827619723242177.bin' '-w' '/tmp/graph18393827619723242177.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18393827619723242177.bin' '-l' '-1' '-v' '-w' '/tmp/graph18393827619723242177.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:37:05] [INFO ] Decomposing Gal with order
[2024-05-22 00:37:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:37:05] [INFO ] Removed a total of 1362 redundant transitions.
[2024-05-22 00:37:05] [INFO ] Flatten gal took : 132 ms
[2024-05-22 00:37:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 46 ms.
[2024-05-22 00:37:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7431978086837287674.gal : 10 ms
[2024-05-22 00:37:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4102937806866345157.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/ReachabilityCardinality7431978086837287674.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4102937806866345157.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 ...307
Loading property file /tmp/ReachabilityCardinality4102937806866345157.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 38
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :38 after 12662
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12662 after 473510
Reachability property AutonomousCar-PT-07b-ReachabilityCardinality-2024-07 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 fixpoint passes
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.57851e+07,0.709256,18808,358,67,39358,755,331,38183,77,4899,0
Total reachable state count : 45785093

Verifying 1 reachability properties.
Reachability property AutonomousCar-PT-07b-ReachabilityCardinality-2024-07 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutonomousCar-PT-07b-ReachabilityCardinality-2024-07,512,0.726744,19068,38,24,39358,755,400,38183,93,4899,0
Over-approximation ignoring read arcs solved 0 properties in 17397 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-22 00:37:06] [INFO ] Flatten gal took : 48 ms
[2024-05-22 00:37:06] [INFO ] Applying decomposition
[2024-05-22 00:37:06] [INFO ] Flatten gal took : 48 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/graph5519926250252034936.txt' '-o' '/tmp/graph5519926250252034936.bin' '-w' '/tmp/graph5519926250252034936.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5519926250252034936.bin' '-l' '-1' '-v' '-w' '/tmp/graph5519926250252034936.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:37:06] [INFO ] Decomposing Gal with order
[2024-05-22 00:37:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:37:07] [INFO ] Removed a total of 1934 redundant transitions.
[2024-05-22 00:37:07] [INFO ] Flatten gal took : 183 ms
[2024-05-22 00:37:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 24 ms.
[2024-05-22 00:37:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5485453556130437919.gal : 13 ms
[2024-05-22 00:37:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17706196011295005707.prop : 0 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/ReachabilityCardinality5485453556130437919.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17706196011295005707.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/ReachabilityCardinality17706196011295005707.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 32
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :32 after 2.1397e+06
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2.1397e+06 after 3.74167e+11
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3.74167e+11 after 3.74235e+11
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3.74235e+11 after 1.29167e+12
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.29167e+12 after 3.74788e+12
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3.74788e+12 after 3.78099e+12
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3.78099e+12 after 3.81762e+12
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3.81762e+12 after 1.9055e+13
Reachability property AutonomousCar-PT-07b-ReachabilityCardinality-2024-07 is true.
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 4097 fixpoint passes
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.6707e+13,76.8392,961112,7301,2155,1.49072e+06,75321,726,2.22942e+06,202,1.95789e+06,0
Total reachable state count : 46707027619306

Verifying 1 reachability properties.
Reachability property AutonomousCar-PT-07b-ReachabilityCardinality-2024-07 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutonomousCar-PT-07b-ReachabilityCardinality-2024-07,5.3958e+06,78.3747,961112,182,74,1.49072e+06,75321,797,2.22942e+06,215,1.95789e+06,0
All properties solved without resorting to model-checking.
Total runtime 220336 ms.

BK_STOP 1716338305995

--------------------
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-07b"
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-07b, 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-171620167500326"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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