About the Execution of ITS-Tools for StigmergyElection-PT-06b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 158621.00 | 0.00 | 0.00 | T???????T??????? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r400-tall-171690532100322.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 StigmergyElection-PT-06b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532100322
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 18:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 11 18:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 11 18:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 11 18:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.2M May 18 16:43 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 StigmergyElection-PT-06b-CTLFireability-2024-00
FORMULA_NAME StigmergyElection-PT-06b-CTLFireability-2024-01
FORMULA_NAME StigmergyElection-PT-06b-CTLFireability-2024-02
FORMULA_NAME StigmergyElection-PT-06b-CTLFireability-2024-03
FORMULA_NAME StigmergyElection-PT-06b-CTLFireability-2024-04
FORMULA_NAME StigmergyElection-PT-06b-CTLFireability-2024-05
FORMULA_NAME StigmergyElection-PT-06b-CTLFireability-2024-06
FORMULA_NAME StigmergyElection-PT-06b-CTLFireability-2024-07
FORMULA_NAME StigmergyElection-PT-06b-CTLFireability-2024-08
FORMULA_NAME StigmergyElection-PT-06b-CTLFireability-2024-09
FORMULA_NAME StigmergyElection-PT-06b-CTLFireability-2024-10
FORMULA_NAME StigmergyElection-PT-06b-CTLFireability-2024-11
FORMULA_NAME StigmergyElection-PT-06b-CTLFireability-2023-12
FORMULA_NAME StigmergyElection-PT-06b-CTLFireability-2023-13
FORMULA_NAME StigmergyElection-PT-06b-CTLFireability-2023-14
FORMULA_NAME StigmergyElection-PT-06b-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717008822079
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-29 18:53:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 18:53:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 18:53:43] [INFO ] Load time of PNML (sax parser for PT used): 191 ms
[2024-05-29 18:53:43] [INFO ] Transformed 835 places.
[2024-05-29 18:53:43] [INFO ] Transformed 2416 transitions.
[2024-05-29 18:53:43] [INFO ] Found NUPN structural information;
[2024-05-29 18:53:43] [INFO ] Parsed PT model containing 835 places and 2416 transitions and 20130 arcs in 304 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 90 out of 835 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 835/835 places, 2416/2416 transitions.
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 100 place count 735 transition count 2316
Iterating global reduction 0 with 100 rules applied. Total rules applied 200 place count 735 transition count 2316
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 250 place count 685 transition count 2266
Iterating global reduction 0 with 50 rules applied. Total rules applied 300 place count 685 transition count 2266
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 309 place count 676 transition count 2257
Iterating global reduction 0 with 9 rules applied. Total rules applied 318 place count 676 transition count 2257
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 322 place count 672 transition count 2253
Iterating global reduction 0 with 4 rules applied. Total rules applied 326 place count 672 transition count 2253
Applied a total of 326 rules in 267 ms. Remains 672 /835 variables (removed 163) and now considering 2253/2416 (removed 163) transitions.
// Phase 1: matrix 2253 rows 672 cols
[2024-05-29 18:53:44] [INFO ] Computed 7 invariants in 68 ms
[2024-05-29 18:53:44] [INFO ] Implicit Places using invariants in 354 ms returned []
[2024-05-29 18:53:44] [INFO ] Invariant cache hit.
[2024-05-29 18:53:44] [INFO ] Implicit Places using invariants and state equation in 636 ms returned []
Implicit Place search using SMT with State Equation took 1017 ms to find 0 implicit places.
Running 2252 sub problems to find dead transitions.
[2024-05-29 18:53:45] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/671 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2252 unsolved
SMT process timed out in 51643ms, After SMT, problems are : Problem set: 0 solved, 2252 unsolved
Search for dead transitions found 0 dead transitions in 51696ms
Starting structural reductions in LTL mode, iteration 1 : 672/835 places, 2253/2416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53020 ms. Remains : 672/835 places, 2253/2416 transitions.
Support contains 90 out of 672 places after structural reductions.
[2024-05-29 18:54:37] [INFO ] Flatten gal took : 317 ms
[2024-05-29 18:54:37] [INFO ] Flatten gal took : 157 ms
[2024-05-29 18:54:38] [INFO ] Input system was already deterministic with 2253 transitions.
RANDOM walk for 40000 steps (378 resets) in 2108 ms. (18 steps per ms) remains 82/98 properties
BEST_FIRST walk for 4003 steps (8 resets) in 93 ms. (42 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4001 steps (8 resets) in 11 ms. (333 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 82/82 properties
[2024-05-29 18:54:39] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp92 is UNSAT
At refinement iteration 1 (OVERLAPS) 596/672 variables, 7/7 constraints. Problems are: Problem set: 8 solved, 74 unsolved
[2024-05-29 18:54:41] [INFO ] Deduced a trap composed of 166 places in 778 ms of which 27 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/672 variables, 1/8 constraints. Problems are: Problem set: 8 solved, 74 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 672/2925 variables, and 8 constraints, problems are : Problem set: 8 solved, 74 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/672 constraints, PredecessorRefiner: 82/75 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 8 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 74 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 1 (OVERLAPS) 602/672 variables, 7/7 constraints. Problems are: Problem set: 9 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/672 variables, 1/8 constraints. Problems are: Problem set: 9 solved, 73 unsolved
[2024-05-29 18:54:46] [INFO ] Deduced a trap composed of 167 places in 549 ms of which 4 ms to minimize.
[2024-05-29 18:54:48] [INFO ] Deduced a trap composed of 167 places in 631 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/672 variables, 2/10 constraints. Problems are: Problem set: 9 solved, 73 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 672/2925 variables, and 10 constraints, problems are : Problem set: 9 solved, 73 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/672 constraints, PredecessorRefiner: 4/75 constraints, Known Traps: 3/3 constraints]
After SMT, in 10908ms problems are : Problem set: 9 solved, 73 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 69 out of 672 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 672/672 places, 2253/2253 transitions.
Graph (trivial) has 566 edges and 672 vertex of which 81 / 672 are part of one of the 15 SCC in 7 ms
Free SCC test removed 66 places
Drop transitions (Empty/Sink Transition effects.) removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Graph (complete) has 1420 edges and 606 vertex of which 600 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.36 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 330 transitions
Trivial Post-agglo rules discarded 330 transitions
Performed 330 trivial Post agglomeration. Transition count delta: 330
Iterating post reduction 0 with 334 rules applied. Total rules applied 336 place count 600 transition count 1831
Reduce places removed 330 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 344 rules applied. Total rules applied 680 place count 270 transition count 1817
Reduce places removed 7 places and 0 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Iterating post reduction 2 with 49 rules applied. Total rules applied 729 place count 263 transition count 1775
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 771 place count 221 transition count 1775
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 771 place count 221 transition count 1751
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 819 place count 197 transition count 1751
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 821 place count 195 transition count 1749
Iterating global reduction 4 with 2 rules applied. Total rules applied 823 place count 195 transition count 1749
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 824 place count 194 transition count 1748
Iterating global reduction 4 with 1 rules applied. Total rules applied 825 place count 194 transition count 1748
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 883 place count 165 transition count 1719
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 889 place count 165 transition count 1713
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 896 place count 158 transition count 1706
Iterating global reduction 5 with 7 rules applied. Total rules applied 903 place count 158 transition count 1706
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 904 place count 157 transition count 1704
Iterating global reduction 5 with 1 rules applied. Total rules applied 905 place count 157 transition count 1704
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 913 place count 153 transition count 1700
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 929 place count 145 transition count 1708
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 942 place count 145 transition count 1695
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 944 place count 144 transition count 1701
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 952 place count 144 transition count 1693
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 954 place count 143 transition count 1699
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 962 place count 143 transition count 1691
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 964 place count 143 transition count 1689
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 966 place count 141 transition count 1689
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 968 place count 141 transition count 1689
Applied a total of 968 rules in 885 ms. Remains 141 /672 variables (removed 531) and now considering 1689/2253 (removed 564) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 886 ms. Remains : 141/672 places, 1689/2253 transitions.
RANDOM walk for 40000 steps (2873 resets) in 1515 ms. (26 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (36 resets) in 17 ms. (222 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (23 resets) in 9 ms. (400 steps per ms) remains 72/73 properties
BEST_FIRST walk for 4004 steps (33 resets) in 12 ms. (308 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (37 resets) in 13 ms. (285 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (37 resets) in 16 ms. (235 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (33 resets) in 12 ms. (307 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (31 resets) in 10 ms. (364 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (37 resets) in 15 ms. (250 steps per ms) remains 71/72 properties
BEST_FIRST walk for 4004 steps (80 resets) in 23 ms. (166 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (36 resets) in 12 ms. (307 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (77 resets) in 13 ms. (285 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (37 resets) in 20 ms. (190 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (35 resets) in 10 ms. (364 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (42 resets) in 15 ms. (250 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (36 resets) in 13 ms. (286 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (44 resets) in 10 ms. (364 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (39 resets) in 11 ms. (333 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (40 resets) in 10 ms. (364 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (37 resets) in 11 ms. (333 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (33 resets) in 10 ms. (364 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (37 resets) in 13 ms. (285 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (36 resets) in 11 ms. (333 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (35 resets) in 12 ms. (308 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (39 resets) in 13 ms. (286 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (44 resets) in 12 ms. (307 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (38 resets) in 10 ms. (364 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (37 resets) in 9 ms. (400 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (35 resets) in 11 ms. (333 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (31 resets) in 10 ms. (363 steps per ms) remains 69/71 properties
BEST_FIRST walk for 4003 steps (38 resets) in 13 ms. (285 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (43 resets) in 22 ms. (174 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (42 resets) in 11 ms. (333 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (35 resets) in 10 ms. (364 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (39 resets) in 12 ms. (308 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (33 resets) in 11 ms. (333 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (33 resets) in 12 ms. (308 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (37 resets) in 10 ms. (364 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (40 resets) in 17 ms. (222 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (36 resets) in 19 ms. (200 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (38 resets) in 13 ms. (286 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (40 resets) in 15 ms. (250 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (37 resets) in 15 ms. (250 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (42 resets) in 12 ms. (307 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (28 resets) in 12 ms. (307 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (36 resets) in 15 ms. (250 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (39 resets) in 12 ms. (308 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (33 resets) in 11 ms. (333 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (38 resets) in 16 ms. (235 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (36 resets) in 17 ms. (222 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (40 resets) in 12 ms. (308 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (33 resets) in 12 ms. (307 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (40 resets) in 12 ms. (308 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (41 resets) in 18 ms. (210 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (42 resets) in 12 ms. (308 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (32 resets) in 14 ms. (266 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (35 resets) in 14 ms. (266 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (37 resets) in 14 ms. (266 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (20 resets) in 12 ms. (308 steps per ms) remains 68/69 properties
BEST_FIRST walk for 4003 steps (38 resets) in 16 ms. (235 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (34 resets) in 12 ms. (308 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (36 resets) in 11 ms. (333 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (41 resets) in 14 ms. (266 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (38 resets) in 10 ms. (364 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (32 resets) in 12 ms. (307 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (36 resets) in 12 ms. (308 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (32 resets) in 12 ms. (307 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (36 resets) in 16 ms. (235 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (40 resets) in 13 ms. (285 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (35 resets) in 13 ms. (285 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (41 resets) in 13 ms. (286 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (44 resets) in 10 ms. (363 steps per ms) remains 68/68 properties
Interrupted probabilistic random walk after 283378 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :0 out of 68
Probabilistic random walk after 283378 steps, saw 67656 distinct states, run finished after 3010 ms. (steps per millisecond=94 ) properties seen :0
// Phase 1: matrix 1689 rows 141 cols
[2024-05-29 18:54:55] [INFO ] Computed 5 invariants in 20 ms
[2024-05-29 18:54:55] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 54/108 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (OVERLAPS) 1666/1774 variables, 108/113 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1774 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1774 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (OVERLAPS) 50/1824 variables, 30/147 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1824 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1824 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 9 (OVERLAPS) 5/1829 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1829 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 11 (OVERLAPS) 1/1830 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1830 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 13 (OVERLAPS) 0/1830 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1830/1830 variables, and 152 constraints, problems are : Problem set: 0 solved, 68 unsolved in 12665 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 141/141 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 68/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 54/108 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (OVERLAPS) 1666/1774 variables, 108/113 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1774 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1774 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1774 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 50/1824 variables, 30/150 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1824 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1824 variables, 61/213 constraints. Problems are: Problem set: 0 solved, 68 unsolved
[2024-05-29 18:55:29] [INFO ] Deduced a trap composed of 42 places in 335 ms of which 1 ms to minimize.
[2024-05-29 18:55:35] [INFO ] Deduced a trap composed of 36 places in 324 ms of which 13 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1824 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 68 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1824/1830 variables, and 215 constraints, problems are : Problem set: 0 solved, 68 unsolved in 45011 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 138/141 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 68/64 constraints, Known Traps: 2/2 constraints]
After SMT, in 58407ms problems are : Problem set: 0 solved, 68 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 54 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 1689/1689 transitions.
Graph (trivial) has 55 edges and 141 vertex of which 2 / 141 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 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 0 with 2 rules applied. Total rules applied 3 place count 140 transition count 1685
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 138 transition count 1685
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 5 place count 138 transition count 1683
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 136 transition count 1683
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 11 place count 134 transition count 1680
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 134 transition count 1680
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 13 place count 134 transition count 1679
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 133 transition count 1679
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 130 transition count 1676
Free-agglomeration rule applied 43 times.
Iterating global reduction 2 with 43 rules applied. Total rules applied 64 place count 130 transition count 1633
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 2 with 43 rules applied. Total rules applied 107 place count 87 transition count 1633
Applied a total of 107 rules in 252 ms. Remains 87 /141 variables (removed 54) and now considering 1633/1689 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 252 ms. Remains : 87/141 places, 1633/1689 transitions.
RANDOM walk for 40000 steps (4309 resets) in 1126 ms. (35 steps per ms) remains 57/68 properties
BEST_FIRST walk for 4003 steps (15 resets) in 9 ms. (400 steps per ms) remains 56/57 properties
BEST_FIRST walk for 4004 steps (20 resets) in 12 ms. (308 steps per ms) remains 55/56 properties
BEST_FIRST walk for 4004 steps (16 resets) in 67 ms. (58 steps per ms) remains 54/55 properties
BEST_FIRST walk for 4004 steps (33 resets) in 29 ms. (133 steps per ms) remains 53/54 properties
BEST_FIRST walk for 4004 steps (21 resets) in 16 ms. (235 steps per ms) remains 52/53 properties
BEST_FIRST walk for 4004 steps (18 resets) in 52 ms. (75 steps per ms) remains 51/52 properties
BEST_FIRST walk for 4003 steps (22 resets) in 16 ms. (235 steps per ms) remains 50/51 properties
BEST_FIRST walk for 4004 steps (26 resets) in 9 ms. (400 steps per ms) remains 49/50 properties
BEST_FIRST walk for 4003 steps (30 resets) in 8 ms. (444 steps per ms) remains 48/49 properties
BEST_FIRST walk for 4004 steps (13 resets) in 8 ms. (444 steps per ms) remains 47/48 properties
BEST_FIRST walk for 4004 steps (21 resets) in 27 ms. (143 steps per ms) remains 43/47 properties
BEST_FIRST walk for 4004 steps (17 resets) in 10 ms. (364 steps per ms) remains 42/43 properties
BEST_FIRST walk for 4004 steps (18 resets) in 8 ms. (444 steps per ms) remains 41/42 properties
BEST_FIRST walk for 4003 steps (15 resets) in 11 ms. (333 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4004 steps (33 resets) in 10 ms. (364 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4002 steps (21 resets) in 21 ms. (181 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4004 steps (21 resets) in 21 ms. (182 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4004 steps (41 resets) in 9 ms. (400 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (38 resets) in 9 ms. (400 steps per ms) remains 35/37 properties
BEST_FIRST walk for 4003 steps (42 resets) in 8 ms. (444 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4002 steps (22 resets) in 37 ms. (105 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4002 steps (39 resets) in 12 ms. (307 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4004 steps (20 resets) in 11 ms. (333 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4004 steps (17 resets) in 17 ms. (222 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4004 steps (29 resets) in 11 ms. (333 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4004 steps (29 resets) in 19 ms. (200 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4004 steps (42 resets) in 21 ms. (182 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4003 steps (21 resets) in 24 ms. (160 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4004 steps (35 resets) in 16 ms. (235 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4003 steps (17 resets) in 16 ms. (235 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4003 steps (18 resets) in 16 ms. (235 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4004 steps (27 resets) in 9 ms. (400 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4004 steps (22 resets) in 9 ms. (400 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4003 steps (37 resets) in 25 ms. (153 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (22 resets) in 13 ms. (286 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4004 steps (14 resets) in 9 ms. (400 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4002 steps (16 resets) in 8 ms. (444 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4004 steps (21 resets) in 19 ms. (200 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4004 steps (30 resets) in 21 ms. (182 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4004 steps (42 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (19 resets) in 8 ms. (444 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4004 steps (33 resets) in 10 ms. (364 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4003 steps (19 resets) in 21 ms. (181 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4004 steps (22 resets) in 14 ms. (266 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4004 steps (16 resets) in 11 ms. (333 steps per ms) remains 11/12 properties
BEST_FIRST walk for 4003 steps (33 resets) in 11 ms. (333 steps per ms) remains 10/11 properties
BEST_FIRST walk for 4003 steps (18 resets) in 10 ms. (363 steps per ms) remains 9/10 properties
BEST_FIRST walk for 4004 steps (41 resets) in 11 ms. (333 steps per ms) remains 8/9 properties
BEST_FIRST walk for 4004 steps (40 resets) in 9 ms. (400 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4004 steps (27 resets) in 8 ms. (444 steps per ms) remains 7/8 properties
BEST_FIRST walk for 4004 steps (13 resets) in 8 ms. (444 steps per ms) remains 6/7 properties
BEST_FIRST walk for 4004 steps (18 resets) in 8 ms. (444 steps per ms) remains 5/6 properties
BEST_FIRST walk for 4003 steps (33 resets) in 8 ms. (444 steps per ms) remains 4/5 properties
// Phase 1: matrix 1633 rows 87 cols
[2024-05-29 18:55:54] [INFO ] Computed 5 invariants in 17 ms
[2024-05-29 18:55:54] [INFO ] State equation strengthened by 79 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 44/53 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/55 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1597/1652 variables, 55/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1652 variables, 40/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1652 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 47/1699 variables, 21/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1699 variables, 39/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1699 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 9/1708 variables, 5/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1708 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 7/1715 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1715 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 4/1719 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1719 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 1/1720 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1720 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/1720 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1720/1720 variables, and 171 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1068 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 87/87 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 44/53 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/55 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1597/1652 variables, 55/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1652 variables, 40/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1652 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 47/1699 variables, 21/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1699 variables, 39/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1699 variables, 4/164 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1699 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 9/1708 variables, 5/169 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1708 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 7/1715 variables, 3/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1715 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 4/1719 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1719 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 1/1720 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1720 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1720 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1720/1720 variables, and 175 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1782 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 87/87 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 2953ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 1390 steps, including 120 resets, run visited all 4 properties in 17 ms. (steps per millisecond=81 )
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 4 properties in 34 ms.
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyElection-PT-06b-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-06b-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 18:55:57] [INFO ] Flatten gal took : 105 ms
[2024-05-29 18:55:57] [INFO ] Flatten gal took : 112 ms
[2024-05-29 18:55:58] [INFO ] Input system was already deterministic with 2253 transitions.
Computed a total of 90 stabilizing places and 96 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 672/672 places, 2253/2253 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 661 transition count 2242
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 661 transition count 2242
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 657 transition count 2238
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 657 transition count 2238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 656 transition count 2237
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 656 transition count 2237
Applied a total of 32 rules in 138 ms. Remains 656 /672 variables (removed 16) and now considering 2237/2253 (removed 16) transitions.
// Phase 1: matrix 2237 rows 656 cols
[2024-05-29 18:55:58] [INFO ] Computed 7 invariants in 19 ms
[2024-05-29 18:55:59] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-05-29 18:55:59] [INFO ] Invariant cache hit.
[2024-05-29 18:56:00] [INFO ] Implicit Places using invariants and state equation in 1023 ms returned []
Implicit Place search using SMT with State Equation took 1403 ms to find 0 implicit places.
Running 2236 sub problems to find dead transitions.
[2024-05-29 18:56:00] [INFO ] Invariant cache hit.
BK_STOP 1717008980700
--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="StigmergyElection-PT-06b"
export BK_EXAMINATION="CTLFireability"
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 StigmergyElection-PT-06b, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r400-tall-171690532100322"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-06b.tgz
mv StigmergyElection-PT-06b execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;