About the Execution of ITS-Tools for FlexibleBarrier-PT-10b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
627.207 | 103138.00 | 208494.00 | 285.20 | T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r189-tall-171640617000037.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 FlexibleBarrier-PT-10b, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-tall-171640617000037
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 748K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 18:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Apr 13 07:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 13 07:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 13 07:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 13 07:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 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 374K 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
FORMULA_NAME QuasiLiveness
=== Now, execution of the tool begins
BK_START 1716472401253
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FlexibleBarrier-PT-10b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
QuasiLiveness PT
Running Version 202405141337
[2024-05-23 13:53:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-23 13:53:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 13:53:22] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2024-05-23 13:53:22] [INFO ] Transformed 1402 places.
[2024-05-23 13:53:22] [INFO ] Transformed 1613 transitions.
[2024-05-23 13:53:22] [INFO ] Found NUPN structural information;
[2024-05-23 13:53:22] [INFO ] Parsed PT model containing 1402 places and 1613 transitions and 4025 arcs in 242 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1402/1402 places, 1613/1613 transitions.
Graph (trivial) has 1370 edges and 1402 vertex of which 62 / 1402 are part of one of the 10 SCC in 9 ms
Free SCC test removed 52 places
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 359 transitions
Trivial Post-agglo rules discarded 359 transitions
Performed 359 trivial Post agglomeration. Transition count delta: 359
Iterating post reduction 0 with 359 rules applied. Total rules applied 360 place count 1350 transition count 1201
Reduce places removed 359 places and 0 transitions.
Iterating post reduction 1 with 359 rules applied. Total rules applied 719 place count 991 transition count 1201
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 90 Pre rules applied. Total rules applied 719 place count 991 transition count 1111
Deduced a syphon composed of 90 places in 6 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 899 place count 901 transition count 1111
Performed 575 Post agglomeration using F-continuation condition.Transition count delta: 575
Deduced a syphon composed of 575 places in 0 ms
Reduce places removed 575 places and 0 transitions.
Iterating global reduction 2 with 1150 rules applied. Total rules applied 2049 place count 326 transition count 536
Applied a total of 2049 rules in 150 ms. Remains 326 /1402 variables (removed 1076) and now considering 536/1613 (removed 1077) transitions.
[2024-05-23 13:53:22] [INFO ] Flow matrix only has 507 transitions (discarded 29 similar events)
// Phase 1: matrix 507 rows 326 cols
[2024-05-23 13:53:22] [INFO ] Computed 12 invariants in 29 ms
[2024-05-23 13:53:23] [INFO ] Implicit Places using invariants in 434 ms returned []
[2024-05-23 13:53:23] [INFO ] Flow matrix only has 507 transitions (discarded 29 similar events)
[2024-05-23 13:53:23] [INFO ] Invariant cache hit.
[2024-05-23 13:53:23] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-23 13:53:23] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 985 ms to find 0 implicit places.
Running 535 sub problems to find dead transitions.
[2024-05-23 13:53:23] [INFO ] Flow matrix only has 507 transitions (discarded 29 similar events)
[2024-05-23 13:53:23] [INFO ] Invariant cache hit.
[2024-05-23 13:53:23] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 325/325 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 2 (OVERLAPS) 1/326 variables, 12/337 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 5 (OVERLAPS) 506/832 variables, 326/664 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/832 variables, 60/724 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/832 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 8 (OVERLAPS) 1/833 variables, 1/725 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/833 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 535 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 833/833 variables, and 725 constraints, problems are : Problem set: 0 solved, 535 unsolved in 30031 ms.
Refiners :[Domain max(s): 326/326 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 326/326 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 535/535 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 535 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 325/325 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 2 (OVERLAPS) 1/326 variables, 12/337 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 5 (OVERLAPS) 506/832 variables, 326/664 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/832 variables, 60/724 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/832 variables, 535/1259 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/832 variables, 0/1259 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 9 (OVERLAPS) 1/833 variables, 1/1260 constraints. Problems are: Problem set: 0 solved, 535 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 833/833 variables, and 1260 constraints, problems are : Problem set: 0 solved, 535 unsolved in 30018 ms.
Refiners :[Domain max(s): 326/326 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 326/326 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 535/535 constraints, Known Traps: 0/0 constraints]
After SMT, in 60872ms problems are : Problem set: 0 solved, 535 unsolved
Search for dead transitions found 0 dead transitions in 60901ms
Starting structural reductions in LIVENESS mode, iteration 1 : 326/1402 places, 536/1613 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 62075 ms. Remains : 326/1402 places, 536/1613 transitions.
Discarding 303 transitions out of 536. Remains 233
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (2559 resets) in 3015 ms. (13 steps per ms) remains 182/232 properties
BEST_FIRST walk for 404 steps (0 resets) in 19 ms. (20 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 182/182 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 182/182 properties
[2024-05-23 13:54:25] [INFO ] Flow matrix only has 507 transitions (discarded 29 similar events)
[2024-05-23 13:54:25] [INFO ] Invariant cache hit.
[2024-05-23 13:54:25] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-23 13:54:25] [INFO ] Flatten gal took : 92 ms
[2024-05-23 13:54:25] [INFO ] Flatten gal took : 54 ms
[2024-05-23 13:54:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11273380118917033779.gal : 16 ms
[2024-05-23 13:54:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5766773904914650262.prop : 12 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/ReachabilityCardinality11273380118917033779.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5766773904914650262.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 ...329
Loading property file /tmp/ReachabilityCardinality5766773904914650262.prop.
SDD proceeding with computation,182 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,182 properties remain. new max is 8
SDD size :16 after 253
SDD proceeding with computation,182 properties remain. new max is 16
SDD size :253 after 49897
Reachability property qltransition_342 is true.
Reachability property qltransition_341 is true.
Reachability property qltransition_340 is true.
Reachability property qltransition_339 is true.
Reachability property qltransition_338 is true.
Reachability property qltransition_337 is true.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 273/273 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Reachability property qltransition_328 is true.
Reachability property qltransition_327 is true.
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/273 constraints. Problems are: Problem set: 8 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 53/326 variables, 12/285 constraints. Problems are: Problem set: 8 solved, 174 unsolved
Reachability property qltransition_326 is true.
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 53/338 constraints. Problems are: Problem set: 8 solved, 174 unsolved
Reachability property qltransition_325 is true.
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 0/338 constraints. Problems are: Problem set: 10 solved, 172 unsolved
At refinement iteration 5 (OVERLAPS) 506/832 variables, 326/664 constraints. Problems are: Problem set: 10 solved, 172 unsolved
Reachability property qltransition_324 is true.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/832 variables, 60/724 constraints. Problems are: Problem set: 10 solved, 172 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 832/833 variables, and 724 constraints, problems are : Problem set: 11 solved, 171 unsolved in 5020 ms.
Refiners :[Domain max(s): 326/326 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 326/326 constraints, ReadFeed: 60/61 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 257/257 constraints. Problems are: Problem set: 11 solved, 171 unsolved
Reachability property qltransition_323 is true.
Reachability property qltransition_322 is true.
Reachability property qltransition_321 is true.
At refinement iteration 1 (INCLUDED_ONLY) 0/257 variables, 0/257 constraints. Problems are: Problem set: 14 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 69/326 variables, 12/269 constraints. Problems are: Problem set: 14 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 69/338 constraints. Problems are: Problem set: 14 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 0/338 constraints. Problems are: Problem set: 14 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 506/832 variables, 326/664 constraints. Problems are: Problem set: 14 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/832 variables, 60/724 constraints. Problems are: Problem set: 14 solved, 168 unsolved
Reachability property qltransition_312 is true.
At refinement iteration 7 (INCLUDED_ONLY) 0/832 variables, 168/892 constraints. Problems are: Problem set: 15 solved, 167 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 832/833 variables, and 892 constraints, problems are : Problem set: 15 solved, 167 unsolved in 5010 ms.
Refiners :[Domain max(s): 326/326 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 326/326 constraints, ReadFeed: 60/61 constraints, PredecessorRefiner: 168/182 constraints, Known Traps: 0/0 constraints]
After SMT, in 10261ms problems are : Problem set: 15 solved, 167 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 251 out of 326 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 326/326 places, 536/536 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 326 transition count 506
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 38 place count 318 transition count 498
Iterating global reduction 1 with 8 rules applied. Total rules applied 46 place count 318 transition count 498
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 54 place count 318 transition count 490
Free-agglomeration rule applied 27 times.
Iterating global reduction 2 with 27 rules applied. Total rules applied 81 place count 318 transition count 463
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 108 place count 291 transition count 463
Applied a total of 108 rules in 112 ms. Remains 291 /326 variables (removed 35) and now considering 463/536 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 291/326 places, 463/536 transitions.
Reachability property qltransition_311 is true.
Reachability property qltransition_310 is true.
Reachability property qltransition_309 is true.
Reachability property qltransition_308 is true.
Reachability property qltransition_307 is true.
Reachability property qltransition_306 is true.
Reachability property qltransition_305 is true.
RANDOM walk for 4000000 steps (282427 resets) in 64278 ms. (62 steps per ms) remains 21/167 properties
BEST_FIRST walk for 400004 steps (219 resets) in 697 ms. (573 steps per ms) remains 18/21 properties
BEST_FIRST walk for 400004 steps (351 resets) in 646 ms. (618 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (350 resets) in 843 ms. (473 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (346 resets) in 281 ms. (1418 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (347 resets) in 261 ms. (1526 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (347 resets) in 233 ms. (1709 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (348 resets) in 231 ms. (1724 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (347 resets) in 225 ms. (1769 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (348 resets) in 257 ms. (1550 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (350 resets) in 236 ms. (1687 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (348 resets) in 238 ms. (1673 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (350 resets) in 227 ms. (1754 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (348 resets) in 255 ms. (1562 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (353 resets) in 230 ms. (1731 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (346 resets) in 245 ms. (1626 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (349 resets) in 228 ms. (1746 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (353 resets) in 232 ms. (1716 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (353 resets) in 240 ms. (1659 steps per ms) remains 18/18 properties
// Phase 1: matrix 463 rows 291 cols
[2024-05-23 13:54:55] [INFO ] Computed 12 invariants in 5 ms
[2024-05-23 13:54:55] [INFO ] State equation strengthened by 77 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 248/268 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 23/291 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 463/754 variables, 291/303 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/754 variables, 77/380 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/754 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/754 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 754/754 variables, and 380 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1091 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 291/291 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 248/268 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 23/291 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 463/754 variables, 291/303 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/754 variables, 77/380 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/754 variables, 18/398 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/754 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/754 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 754/754 variables, and 398 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1257 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 291/291 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 2378ms problems are : Problem set: 0 solved, 18 unsolved
Reachability property qltransition_296 is true.
Finished Parikh walk after 6951 steps, including 334 resets, run visited all 2 properties in 76 ms. (steps per millisecond=91 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 18 properties in 6313 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query QuasiLiveness after proving 233 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK DECISION_DIAGRAMS COLLATERAL_PROCESSING BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 102004 ms.
BK_STOP 1716472504391
--------------------
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
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
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="FlexibleBarrier-PT-10b"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 FlexibleBarrier-PT-10b, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r189-tall-171640617000037"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-10b.tgz
mv FlexibleBarrier-PT-10b execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.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 '
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;