About the Execution of LTSMin+red for EisenbergMcGuire-PT-09
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
2759.659 | 187309.00 | 270619.00 | 640.20 | ??????F?F??????? | 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.r492-smll-171636266400193.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 ltsminxred
Input is EisenbergMcGuire-PT-09, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266400193
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K 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 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 28K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.3M 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 EisenbergMcGuire-PT-09-CTLCardinality-2024-00
FORMULA_NAME EisenbergMcGuire-PT-09-CTLCardinality-2024-01
FORMULA_NAME EisenbergMcGuire-PT-09-CTLCardinality-2024-02
FORMULA_NAME EisenbergMcGuire-PT-09-CTLCardinality-2024-03
FORMULA_NAME EisenbergMcGuire-PT-09-CTLCardinality-2024-04
FORMULA_NAME EisenbergMcGuire-PT-09-CTLCardinality-2024-05
FORMULA_NAME EisenbergMcGuire-PT-09-CTLCardinality-2024-06
FORMULA_NAME EisenbergMcGuire-PT-09-CTLCardinality-2024-07
FORMULA_NAME EisenbergMcGuire-PT-09-CTLCardinality-2024-08
FORMULA_NAME EisenbergMcGuire-PT-09-CTLCardinality-2024-09
FORMULA_NAME EisenbergMcGuire-PT-09-CTLCardinality-2024-10
FORMULA_NAME EisenbergMcGuire-PT-09-CTLCardinality-2024-11
FORMULA_NAME EisenbergMcGuire-PT-09-CTLCardinality-2023-12
FORMULA_NAME EisenbergMcGuire-PT-09-CTLCardinality-2023-13
FORMULA_NAME EisenbergMcGuire-PT-09-CTLCardinality-2023-14
FORMULA_NAME EisenbergMcGuire-PT-09-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1717231315916
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:41:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 08:41:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:41:59] [INFO ] Load time of PNML (sax parser for PT used): 589 ms
[2024-06-01 08:41:59] [INFO ] Transformed 891 places.
[2024-06-01 08:41:59] [INFO ] Transformed 3888 transitions.
[2024-06-01 08:41:59] [INFO ] Found NUPN structural information;
[2024-06-01 08:41:59] [INFO ] Parsed PT model containing 891 places and 3888 transitions and 18792 arcs in 1017 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 37 ms.
FORMULA EisenbergMcGuire-PT-09-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 134 out of 891 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 891/891 places, 3888/3888 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 833 transition count 3366
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 833 transition count 3366
Applied a total of 116 rules in 306 ms. Remains 833 /891 variables (removed 58) and now considering 3366/3888 (removed 522) transitions.
[2024-06-01 08:42:00] [INFO ] Flow matrix only has 1287 transitions (discarded 2079 similar events)
// Phase 1: matrix 1287 rows 833 cols
[2024-06-01 08:42:00] [INFO ] Computed 28 invariants in 61 ms
[2024-06-01 08:42:01] [INFO ] Implicit Places using invariants in 1607 ms returned []
[2024-06-01 08:42:01] [INFO ] Flow matrix only has 1287 transitions (discarded 2079 similar events)
[2024-06-01 08:42:01] [INFO ] Invariant cache hit.
[2024-06-01 08:42:02] [INFO ] State equation strengthened by 468 read => feed constraints.
[2024-06-01 08:42:11] [INFO ] Implicit Places using invariants and state equation in 9365 ms returned []
Implicit Place search using SMT with State Equation took 11038 ms to find 0 implicit places.
Running 3357 sub problems to find dead transitions.
[2024-06-01 08:42:11] [INFO ] Flow matrix only has 1287 transitions (discarded 2079 similar events)
[2024-06-01 08:42:11] [INFO ] Invariant cache hit.
[2024-06-01 08:42:11] [INFO ] State equation strengthened by 468 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/833 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3357 unsolved
SMT process timed out in 33609ms, After SMT, problems are : Problem set: 0 solved, 3357 unsolved
Search for dead transitions found 0 dead transitions in 33729ms
Starting structural reductions in LTL mode, iteration 1 : 833/891 places, 3366/3888 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45159 ms. Remains : 833/891 places, 3366/3888 transitions.
Support contains 134 out of 833 places after structural reductions.
[2024-06-01 08:42:45] [INFO ] Flatten gal took : 393 ms
[2024-06-01 08:42:46] [INFO ] Flatten gal took : 217 ms
[2024-06-01 08:42:46] [INFO ] Input system was already deterministic with 3366 transitions.
Support contains 133 out of 833 places (down from 134) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2931 ms. (13 steps per ms) remains 26/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
[2024-06-01 08:42:47] [INFO ] Flow matrix only has 1287 transitions (discarded 2079 similar events)
[2024-06-01 08:42:47] [INFO ] Invariant cache hit.
[2024-06-01 08:42:48] [INFO ] State equation strengthened by 468 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 769/808 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/808 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 16/824 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/824 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 1287/2111 variables, 824/851 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2111 variables, 468/1319 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2111 variables, 0/1319 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 9/2120 variables, 9/1328 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2120 variables, 1/1329 constraints. Problems are: Problem set: 0 solved, 26 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 Real declared 2120/2120 variables, and 1329 constraints, problems are : Problem set: 0 solved, 26 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 833/833 constraints, ReadFeed: 468/468 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 769/808 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 08:42:54] [INFO ] Deduced a trap composed of 46 places in 666 ms of which 90 ms to minimize.
[2024-06-01 08:42:55] [INFO ] Deduced a trap composed of 78 places in 841 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/808 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 808/2120 variables, and 20 constraints, problems are : Problem set: 0 solved, 26 unsolved in 5030 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 0/9 constraints, State Equation: 0/833 constraints, ReadFeed: 0/468 constraints, PredecessorRefiner: 0/26 constraints, Known Traps: 2/2 constraints]
After SMT, in 10120ms problems are : Problem set: 0 solved, 26 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 39 out of 833 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 833/833 places, 3366/3366 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 833 transition count 3357
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 824 transition count 3357
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 237 Pre rules applied. Total rules applied 18 place count 824 transition count 3120
Deduced a syphon composed of 237 places in 8 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 2 with 474 rules applied. Total rules applied 492 place count 587 transition count 3120
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 504 place count 575 transition count 3012
Iterating global reduction 2 with 12 rules applied. Total rules applied 516 place count 575 transition count 3012
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 15 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 656 place count 505 transition count 2942
Applied a total of 656 rules in 679 ms. Remains 505 /833 variables (removed 328) and now considering 2942/3366 (removed 424) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 680 ms. Remains : 505/833 places, 2942/3366 transitions.
RANDOM walk for 40000 steps (8 resets) in 756 ms. (52 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
Interrupted probabilistic random walk after 89710 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :15 out of 26
Probabilistic random walk after 89710 steps, saw 62386 distinct states, run finished after 3007 ms. (steps per millisecond=29 ) properties seen :15
[2024-06-01 08:43:02] [INFO ] Flow matrix only has 863 transitions (discarded 2079 similar events)
// Phase 1: matrix 863 rows 505 cols
[2024-06-01 08:43:02] [INFO ] Computed 28 invariants in 7 ms
[2024-06-01 08:43:02] [INFO ] State equation strengthened by 372 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 409/427 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/427 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 15/442 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 770/1212 variables, 442/466 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1212 variables, 184/650 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1212 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 25/1237 variables, 9/659 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1237 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1237 variables, 102/762 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1237 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 24/1261 variables, 11/773 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1261 variables, 11/784 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1261 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 41/1302 variables, 2/786 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1302 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 2/1304 variables, 1/787 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1304 variables, 0/787 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (OVERLAPS) 64/1368 variables, 43/830 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1368 variables, 75/905 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1368 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (OVERLAPS) 0/1368 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1368/1368 variables, and 905 constraints, problems are : Problem set: 0 solved, 11 unsolved in 4099 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 505/505 constraints, ReadFeed: 372/372 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 409/427 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/427 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 15/442 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 08:43:07] [INFO ] Deduced a trap composed of 3 places in 401 ms of which 6 ms to minimize.
[2024-06-01 08:43:07] [INFO ] Deduced a trap composed of 3 places in 261 ms of which 4 ms to minimize.
[2024-06-01 08:43:07] [INFO ] Deduced a trap composed of 39 places in 247 ms of which 4 ms to minimize.
[2024-06-01 08:43:08] [INFO ] Deduced a trap composed of 42 places in 238 ms of which 3 ms to minimize.
[2024-06-01 08:43:08] [INFO ] Deduced a trap composed of 19 places in 276 ms of which 3 ms to minimize.
[2024-06-01 08:43:08] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 3 ms to minimize.
[2024-06-01 08:43:08] [INFO ] Deduced a trap composed of 26 places in 244 ms of which 4 ms to minimize.
[2024-06-01 08:43:08] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 3 ms to minimize.
[2024-06-01 08:43:09] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 3 ms to minimize.
[2024-06-01 08:43:09] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2024-06-01 08:43:09] [INFO ] Deduced a trap composed of 25 places in 249 ms of which 4 ms to minimize.
[2024-06-01 08:43:09] [INFO ] Deduced a trap composed of 15 places in 189 ms of which 4 ms to minimize.
[2024-06-01 08:43:09] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 2 ms to minimize.
[2024-06-01 08:43:10] [INFO ] Deduced a trap composed of 27 places in 228 ms of which 2 ms to minimize.
[2024-06-01 08:43:10] [INFO ] Deduced a trap composed of 25 places in 226 ms of which 3 ms to minimize.
[2024-06-01 08:43:10] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 2 ms to minimize.
[2024-06-01 08:43:10] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 2 ms to minimize.
[2024-06-01 08:43:10] [INFO ] Deduced a trap composed of 25 places in 155 ms of which 2 ms to minimize.
Problem AtomicPropp38 is UNSAT
[2024-06-01 08:43:11] [INFO ] Deduced a trap composed of 23 places in 400 ms of which 5 ms to minimize.
[2024-06-01 08:43:11] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 1 ms to minimize.
Problem AtomicPropp38 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 20/44 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-06-01 08:43:11] [INFO ] Deduced a trap composed of 38 places in 336 ms of which 3 ms to minimize.
[2024-06-01 08:43:12] [INFO ] Deduced a trap composed of 36 places in 155 ms of which 3 ms to minimize.
[2024-06-01 08:43:12] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 2 ms to minimize.
[2024-06-01 08:43:12] [INFO ] Deduced a trap composed of 79 places in 339 ms of which 4 ms to minimize.
[2024-06-01 08:43:12] [INFO ] Deduced a trap composed of 54 places in 351 ms of which 4 ms to minimize.
[2024-06-01 08:43:13] [INFO ] Deduced a trap composed of 35 places in 249 ms of which 3 ms to minimize.
[2024-06-01 08:43:13] [INFO ] Deduced a trap composed of 23 places in 254 ms of which 3 ms to minimize.
[2024-06-01 08:43:13] [INFO ] Deduced a trap composed of 50 places in 176 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 8/52 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 770/1212 variables, 442/494 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1212 variables, 184/678 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1212 variables, 0/678 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 25/1237 variables, 9/687 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1237 variables, 1/688 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1237 variables, 102/790 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1237 variables, 2/792 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1237 variables, 0/792 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 24/1261 variables, 11/803 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1261 variables, 11/814 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1261 variables, 0/814 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 41/1302 variables, 2/816 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1302 variables, 0/816 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 20 (OVERLAPS) 2/1304 variables, 1/817 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1304 variables, 8/825 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-06-01 08:43:17] [INFO ] Deduced a trap composed of 43 places in 833 ms of which 7 ms to minimize.
[2024-06-01 08:43:17] [INFO ] Deduced a trap composed of 34 places in 794 ms of which 9 ms to minimize.
[2024-06-01 08:43:18] [INFO ] Deduced a trap composed of 19 places in 803 ms of which 7 ms to minimize.
[2024-06-01 08:43:19] [INFO ] Deduced a trap composed of 21 places in 784 ms of which 7 ms to minimize.
[2024-06-01 08:43:20] [INFO ] Deduced a trap composed of 31 places in 745 ms of which 9 ms to minimize.
[2024-06-01 08:43:21] [INFO ] Deduced a trap composed of 34 places in 752 ms of which 8 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1304 variables, 6/831 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-06-01 08:43:23] [INFO ] Deduced a trap composed of 17 places in 755 ms of which 7 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1304 variables, 1/832 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1304 variables, 0/832 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 25 (OVERLAPS) 64/1368 variables, 43/875 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1368 variables, 75/950 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1368 variables, 0/950 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 28 (OVERLAPS) 0/1368 variables, 0/950 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1368/1368 variables, and 950 constraints, problems are : Problem set: 1 solved, 10 unsolved in 20328 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 505/505 constraints, ReadFeed: 372/372 constraints, PredecessorRefiner: 10/11 constraints, Known Traps: 35/35 constraints]
After SMT, in 24478ms problems are : Problem set: 1 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 5 properties in 6963 ms.
Support contains 10 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 2942/2942 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 505 transition count 2931
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 494 transition count 2931
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 493 transition count 2922
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 493 transition count 2922
Applied a total of 24 rules in 217 ms. Remains 493 /505 variables (removed 12) and now considering 2922/2942 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219 ms. Remains : 493/505 places, 2922/2942 transitions.
RANDOM walk for 40000 steps (8 resets) in 268 ms. (148 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 141180 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :1 out of 5
Probabilistic random walk after 141180 steps, saw 94378 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :1
[2024-06-01 08:43:37] [INFO ] Flow matrix only has 843 transitions (discarded 2079 similar events)
// Phase 1: matrix 843 rows 493 cols
[2024-06-01 08:43:37] [INFO ] Computed 28 invariants in 7 ms
[2024-06-01 08:43:37] [INFO ] State equation strengthened by 364 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) 254/263 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 51/314 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 11/325 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 567/892 variables, 325/343 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/892 variables, 102/445 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/892 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 57/949 variables, 9/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/949 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/949 variables, 74/529 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/949 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 72/1021 variables, 33/562 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1021 variables, 24/586 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1021 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 120/1141 variables, 6/592 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1141 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 6/1147 variables, 3/595 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1147 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 189/1336 variables, 126/721 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1336 variables, 164/885 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1336 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/1336 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1336/1336 variables, and 885 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1669 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 493/493 constraints, ReadFeed: 364/364 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) 254/263 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 51/314 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:43:39] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 3 ms to minimize.
[2024-06-01 08:43:39] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 1 ms to minimize.
[2024-06-01 08:43:39] [INFO ] Deduced a trap composed of 52 places in 255 ms of which 5 ms to minimize.
[2024-06-01 08:43:39] [INFO ] Deduced a trap composed of 54 places in 180 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 11/325 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 567/892 variables, 325/347 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/892 variables, 102/449 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:43:40] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/892 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/892 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 57/949 variables, 9/459 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/949 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/949 variables, 74/534 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/949 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:43:40] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 1 ms to minimize.
[2024-06-01 08:43:41] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/949 variables, 2/537 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/949 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 72/1021 variables, 33/570 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1021 variables, 24/594 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:43:41] [INFO ] Deduced a trap composed of 31 places in 197 ms of which 3 ms to minimize.
[2024-06-01 08:43:41] [INFO ] Deduced a trap composed of 23 places in 244 ms of which 3 ms to minimize.
[2024-06-01 08:43:42] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1021 variables, 3/597 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:43:42] [INFO ] Deduced a trap composed of 29 places in 249 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1021 variables, 1/598 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1021 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 120/1141 variables, 6/604 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1141 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 6/1147 variables, 3/607 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1147 variables, 3/610 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:43:43] [INFO ] Deduced a trap composed of 30 places in 574 ms of which 6 ms to minimize.
[2024-06-01 08:43:44] [INFO ] Deduced a trap composed of 31 places in 539 ms of which 6 ms to minimize.
[2024-06-01 08:43:45] [INFO ] Deduced a trap composed of 97 places in 536 ms of which 6 ms to minimize.
[2024-06-01 08:43:45] [INFO ] Deduced a trap composed of 35 places in 617 ms of which 6 ms to minimize.
[2024-06-01 08:43:46] [INFO ] Deduced a trap composed of 93 places in 620 ms of which 7 ms to minimize.
[2024-06-01 08:43:47] [INFO ] Deduced a trap composed of 93 places in 606 ms of which 6 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1147 variables, 6/616 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:43:48] [INFO ] Deduced a trap composed of 87 places in 502 ms of which 6 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/1147 variables, 1/617 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:43:48] [INFO ] Deduced a trap composed of 85 places in 553 ms of which 4 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/1147 variables, 1/618 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:43:49] [INFO ] Deduced a trap composed of 23 places in 567 ms of which 8 ms to minimize.
[2024-06-01 08:43:50] [INFO ] Deduced a trap composed of 11 places in 687 ms of which 7 ms to minimize.
[2024-06-01 08:43:51] [INFO ] Deduced a trap composed of 56 places in 723 ms of which 7 ms to minimize.
[2024-06-01 08:43:51] [INFO ] Deduced a trap composed of 54 places in 617 ms of which 7 ms to minimize.
[2024-06-01 08:43:52] [INFO ] Deduced a trap composed of 55 places in 631 ms of which 6 ms to minimize.
[2024-06-01 08:43:53] [INFO ] Deduced a trap composed of 19 places in 731 ms of which 7 ms to minimize.
[2024-06-01 08:43:54] [INFO ] Deduced a trap composed of 107 places in 702 ms of which 7 ms to minimize.
[2024-06-01 08:43:54] [INFO ] Deduced a trap composed of 78 places in 739 ms of which 74 ms to minimize.
[2024-06-01 08:43:55] [INFO ] Deduced a trap composed of 81 places in 628 ms of which 7 ms to minimize.
[2024-06-01 08:43:55] [INFO ] Deduced a trap composed of 27 places in 295 ms of which 3 ms to minimize.
[2024-06-01 08:43:56] [INFO ] Deduced a trap composed of 100 places in 717 ms of which 7 ms to minimize.
[2024-06-01 08:43:57] [INFO ] Deduced a trap composed of 85 places in 608 ms of which 6 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/1147 variables, 12/630 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1147 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 189/1336 variables, 126/756 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1336 variables, 164/920 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1336 variables, 0/920 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (OVERLAPS) 0/1336 variables, 0/920 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1336/1336 variables, and 920 constraints, problems are : Problem set: 0 solved, 4 unsolved in 19736 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 493/493 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 31/31 constraints]
After SMT, in 21450ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 1 properties in 1366 ms.
Support contains 8 out of 493 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 493/493 places, 2922/2922 transitions.
Applied a total of 0 rules in 131 ms. Remains 493 /493 variables (removed 0) and now considering 2922/2922 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 493/493 places, 2922/2922 transitions.
RANDOM walk for 40000 steps (8 resets) in 229 ms. (173 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 152700 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 3
Probabilistic random walk after 152700 steps, saw 101563 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
[2024-06-01 08:44:03] [INFO ] Flow matrix only has 843 transitions (discarded 2079 similar events)
[2024-06-01 08:44:03] [INFO ] Invariant cache hit.
[2024-06-01 08:44:03] [INFO ] State equation strengthened by 364 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 204/212 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 49/261 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 11/272 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 475/747 variables, 272/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/747 variables, 70/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/747 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 73/820 variables, 9/366 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/820 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/820 variables, 63/430 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/820 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 96/916 variables, 44/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/916 variables, 29/503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/916 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 160/1076 variables, 8/511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1076 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 8/1084 variables, 4/515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1084 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 252/1336 variables, 168/683 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1336 variables, 202/885 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1336 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 0/1336 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1336/1336 variables, and 885 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1284 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 493/493 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 204/212 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 49/261 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:44:04] [INFO ] Deduced a trap composed of 54 places in 168 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 11/272 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 475/747 variables, 272/288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/747 variables, 70/358 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:44:05] [INFO ] Deduced a trap composed of 3 places in 164 ms of which 3 ms to minimize.
[2024-06-01 08:44:05] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/747 variables, 2/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/747 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 73/820 variables, 9/369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/820 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/820 variables, 63/433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/820 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:44:06] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/820 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/820 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 96/916 variables, 44/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/916 variables, 29/508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/916 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 160/1076 variables, 8/516 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1076 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 8/1084 variables, 4/520 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 2/522 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:44:07] [INFO ] Deduced a trap composed of 3 places in 854 ms of which 7 ms to minimize.
[2024-06-01 08:44:08] [INFO ] Deduced a trap composed of 3 places in 872 ms of which 7 ms to minimize.
[2024-06-01 08:44:09] [INFO ] Deduced a trap composed of 35 places in 749 ms of which 7 ms to minimize.
[2024-06-01 08:44:10] [INFO ] Deduced a trap composed of 43 places in 727 ms of which 7 ms to minimize.
[2024-06-01 08:44:10] [INFO ] Deduced a trap composed of 21 places in 681 ms of which 7 ms to minimize.
[2024-06-01 08:44:11] [INFO ] Deduced a trap composed of 23 places in 339 ms of which 4 ms to minimize.
[2024-06-01 08:44:11] [INFO ] Deduced a trap composed of 35 places in 245 ms of which 3 ms to minimize.
[2024-06-01 08:44:11] [INFO ] Deduced a trap composed of 52 places in 176 ms of which 2 ms to minimize.
[2024-06-01 08:44:11] [INFO ] Deduced a trap composed of 50 places in 168 ms of which 3 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1084 variables, 9/531 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1084 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 252/1336 variables, 168/699 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1336 variables, 202/901 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1336 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 0/1336 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1336/1336 variables, and 901 constraints, problems are : Problem set: 0 solved, 3 unsolved in 8326 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 493/493 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 13/13 constraints]
After SMT, in 9644ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1187 ms.
Support contains 8 out of 493 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 493/493 places, 2922/2922 transitions.
Applied a total of 0 rules in 113 ms. Remains 493 /493 variables (removed 0) and now considering 2922/2922 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 493/493 places, 2922/2922 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 493/493 places, 2922/2922 transitions.
Applied a total of 0 rules in 108 ms. Remains 493 /493 variables (removed 0) and now considering 2922/2922 (removed 0) transitions.
[2024-06-01 08:44:14] [INFO ] Flow matrix only has 843 transitions (discarded 2079 similar events)
[2024-06-01 08:44:14] [INFO ] Invariant cache hit.
[2024-06-01 08:44:15] [INFO ] Implicit Places using invariants in 974 ms returned []
[2024-06-01 08:44:15] [INFO ] Flow matrix only has 843 transitions (discarded 2079 similar events)
[2024-06-01 08:44:15] [INFO ] Invariant cache hit.
[2024-06-01 08:44:15] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-06-01 08:44:20] [INFO ] Implicit Places using invariants and state equation in 5654 ms returned []
Implicit Place search using SMT with State Equation took 6633 ms to find 0 implicit places.
[2024-06-01 08:44:21] [INFO ] Redundant transitions in 342 ms returned []
Running 2913 sub problems to find dead transitions.
[2024-06-01 08:44:21] [INFO ] Flow matrix only has 843 transitions (discarded 2079 similar events)
[2024-06-01 08:44:21] [INFO ] Invariant cache hit.
[2024-06-01 08:44:21] [INFO ] State equation strengthened by 364 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.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 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/493 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2913 unsolved
SMT process timed out in 32505ms, After SMT, problems are : Problem set: 0 solved, 2913 unsolved
Search for dead transitions found 0 dead transitions in 32572ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39686 ms. Remains : 493/493 places, 2922/2922 transitions.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2024-06-01 08:44:54] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 08:44:54] [INFO ] Flatten gal took : 206 ms
FORMULA EisenbergMcGuire-PT-09-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 08:44:54] [INFO ] Flatten gal took : 217 ms
[2024-06-01 08:44:54] [INFO ] Input system was already deterministic with 3366 transitions.
Support contains 120 out of 833 places (down from 131) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 833/833 places, 3366/3366 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 833 transition count 3358
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 825 transition count 3358
Performed 244 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 244 Pre rules applied. Total rules applied 16 place count 825 transition count 3114
Deduced a syphon composed of 244 places in 3 ms
Reduce places removed 244 places and 0 transitions.
Iterating global reduction 2 with 488 rules applied. Total rules applied 504 place count 581 transition count 3114
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 515 place count 570 transition count 3015
Iterating global reduction 2 with 11 rules applied. Total rules applied 526 place count 570 transition count 3015
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 670 place count 498 transition count 2943
Applied a total of 670 rules in 305 ms. Remains 498 /833 variables (removed 335) and now considering 2943/3366 (removed 423) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 308 ms. Remains : 498/833 places, 2943/3366 transitions.
[2024-06-01 08:44:55] [INFO ] Flatten gal took : 86 ms
[2024-06-01 08:44:55] [INFO ] Flatten gal took : 99 ms
[2024-06-01 08:44:55] [INFO ] Input system was already deterministic with 2943 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 833/833 places, 3366/3366 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 833 transition count 3357
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 824 transition count 3357
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 18 place count 824 transition count 3107
Deduced a syphon composed of 250 places in 3 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 518 place count 574 transition count 3107
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 531 place count 561 transition count 2990
Iterating global reduction 2 with 13 rules applied. Total rules applied 544 place count 561 transition count 2990
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 3 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 686 place count 490 transition count 2919
Applied a total of 686 rules in 228 ms. Remains 490 /833 variables (removed 343) and now considering 2919/3366 (removed 447) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 230 ms. Remains : 490/833 places, 2919/3366 transitions.
[2024-06-01 08:44:55] [INFO ] Flatten gal took : 82 ms
[2024-06-01 08:44:56] [INFO ] Flatten gal took : 96 ms
[2024-06-01 08:44:56] [INFO ] Input system was already deterministic with 2919 transitions.
Starting structural reductions in LTL mode, iteration 0 : 833/833 places, 3366/3366 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 820 transition count 3249
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 820 transition count 3249
Applied a total of 26 rules in 42 ms. Remains 820 /833 variables (removed 13) and now considering 3249/3366 (removed 117) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 820/833 places, 3249/3366 transitions.
[2024-06-01 08:44:56] [INFO ] Flatten gal took : 87 ms
[2024-06-01 08:44:56] [INFO ] Flatten gal took : 99 ms
[2024-06-01 08:44:56] [INFO ] Input system was already deterministic with 3249 transitions.
Starting structural reductions in LTL mode, iteration 0 : 833/833 places, 3366/3366 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 819 transition count 3240
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 819 transition count 3240
Applied a total of 28 rules in 43 ms. Remains 819 /833 variables (removed 14) and now considering 3240/3366 (removed 126) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 819/833 places, 3240/3366 transitions.
[2024-06-01 08:44:56] [INFO ] Flatten gal took : 87 ms
[2024-06-01 08:44:56] [INFO ] Flatten gal took : 100 ms
[2024-06-01 08:44:57] [INFO ] Input system was already deterministic with 3240 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 833/833 places, 3366/3366 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 833 transition count 3358
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 825 transition count 3357
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 824 transition count 3357
Performed 246 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 246 Pre rules applied. Total rules applied 18 place count 824 transition count 3111
Deduced a syphon composed of 246 places in 4 ms
Reduce places removed 246 places and 0 transitions.
Iterating global reduction 3 with 492 rules applied. Total rules applied 510 place count 578 transition count 3111
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 524 place count 564 transition count 2985
Iterating global reduction 3 with 14 rules applied. Total rules applied 538 place count 564 transition count 2985
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 3 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 680 place count 493 transition count 2914
Applied a total of 680 rules in 234 ms. Remains 493 /833 variables (removed 340) and now considering 2914/3366 (removed 452) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 236 ms. Remains : 493/833 places, 2914/3366 transitions.
[2024-06-01 08:44:57] [INFO ] Flatten gal took : 77 ms
[2024-06-01 08:44:57] [INFO ] Flatten gal took : 89 ms
[2024-06-01 08:44:57] [INFO ] Input system was already deterministic with 2914 transitions.
Starting structural reductions in LTL mode, iteration 0 : 833/833 places, 3366/3366 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 820 transition count 3249
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 820 transition count 3249
Applied a total of 26 rules in 44 ms. Remains 820 /833 variables (removed 13) and now considering 3249/3366 (removed 117) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 820/833 places, 3249/3366 transitions.
[2024-06-01 08:44:57] [INFO ] Flatten gal took : 86 ms
[2024-06-01 08:44:57] [INFO ] Flatten gal took : 99 ms
[2024-06-01 08:44:58] [INFO ] Input system was already deterministic with 3249 transitions.
Starting structural reductions in LTL mode, iteration 0 : 833/833 places, 3366/3366 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 821 transition count 3258
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 821 transition count 3258
Applied a total of 24 rules in 43 ms. Remains 821 /833 variables (removed 12) and now considering 3258/3366 (removed 108) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 821/833 places, 3258/3366 transitions.
[2024-06-01 08:44:58] [INFO ] Flatten gal took : 82 ms
[2024-06-01 08:44:58] [INFO ] Flatten gal took : 92 ms
[2024-06-01 08:44:58] [INFO ] Input system was already deterministic with 3258 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 833/833 places, 3366/3366 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 833 transition count 3357
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 824 transition count 3357
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 18 place count 824 transition count 3107
Deduced a syphon composed of 250 places in 5 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 518 place count 574 transition count 3107
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 532 place count 560 transition count 2981
Iterating global reduction 2 with 14 rules applied. Total rules applied 546 place count 560 transition count 2981
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 4 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 688 place count 489 transition count 2910
Applied a total of 688 rules in 299 ms. Remains 489 /833 variables (removed 344) and now considering 2910/3366 (removed 456) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 300 ms. Remains : 489/833 places, 2910/3366 transitions.
[2024-06-01 08:44:58] [INFO ] Flatten gal took : 123 ms
[2024-06-01 08:44:59] [INFO ] Flatten gal took : 146 ms
[2024-06-01 08:44:59] [INFO ] Input system was already deterministic with 2910 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 833/833 places, 3366/3366 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 833 transition count 3357
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 824 transition count 3357
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 824 transition count 3105
Deduced a syphon composed of 252 places in 3 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 572 transition count 3105
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 535 place count 559 transition count 2988
Iterating global reduction 2 with 13 rules applied. Total rules applied 548 place count 559 transition count 2988
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 692 place count 487 transition count 2916
Applied a total of 692 rules in 220 ms. Remains 487 /833 variables (removed 346) and now considering 2916/3366 (removed 450) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 222 ms. Remains : 487/833 places, 2916/3366 transitions.
[2024-06-01 08:44:59] [INFO ] Flatten gal took : 76 ms
[2024-06-01 08:44:59] [INFO ] Flatten gal took : 91 ms
[2024-06-01 08:44:59] [INFO ] Input system was already deterministic with 2916 transitions.
Starting structural reductions in LTL mode, iteration 0 : 833/833 places, 3366/3366 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 820 transition count 3249
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 820 transition count 3249
Applied a total of 26 rules in 77 ms. Remains 820 /833 variables (removed 13) and now considering 3249/3366 (removed 117) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78 ms. Remains : 820/833 places, 3249/3366 transitions.
[2024-06-01 08:45:00] [INFO ] Flatten gal took : 131 ms
[2024-06-01 08:45:00] [INFO ] Flatten gal took : 151 ms
[2024-06-01 08:45:00] [INFO ] Input system was already deterministic with 3249 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 833/833 places, 3366/3366 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 833 transition count 3357
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 824 transition count 3357
Performed 246 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 246 Pre rules applied. Total rules applied 18 place count 824 transition count 3111
Deduced a syphon composed of 246 places in 4 ms
Reduce places removed 246 places and 0 transitions.
Iterating global reduction 2 with 492 rules applied. Total rules applied 510 place count 578 transition count 3111
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 522 place count 566 transition count 3003
Iterating global reduction 2 with 12 rules applied. Total rules applied 534 place count 566 transition count 3003
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 3 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 676 place count 495 transition count 2932
Applied a total of 676 rules in 242 ms. Remains 495 /833 variables (removed 338) and now considering 2932/3366 (removed 434) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 243 ms. Remains : 495/833 places, 2932/3366 transitions.
[2024-06-01 08:45:00] [INFO ] Flatten gal took : 80 ms
[2024-06-01 08:45:00] [INFO ] Flatten gal took : 97 ms
[2024-06-01 08:45:01] [INFO ] Input system was already deterministic with 2932 transitions.
Starting structural reductions in LTL mode, iteration 0 : 833/833 places, 3366/3366 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 821 transition count 3258
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 821 transition count 3258
Applied a total of 24 rules in 43 ms. Remains 821 /833 variables (removed 12) and now considering 3258/3366 (removed 108) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 821/833 places, 3258/3366 transitions.
[2024-06-01 08:45:01] [INFO ] Flatten gal took : 85 ms
[2024-06-01 08:45:01] [INFO ] Flatten gal took : 101 ms
[2024-06-01 08:45:01] [INFO ] Input system was already deterministic with 3258 transitions.
Starting structural reductions in LTL mode, iteration 0 : 833/833 places, 3366/3366 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 819 transition count 3240
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 819 transition count 3240
Applied a total of 28 rules in 41 ms. Remains 819 /833 variables (removed 14) and now considering 3240/3366 (removed 126) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 819/833 places, 3240/3366 transitions.
[2024-06-01 08:45:01] [INFO ] Flatten gal took : 121 ms
[2024-06-01 08:45:01] [INFO ] Flatten gal took : 91 ms
[2024-06-01 08:45:01] [INFO ] Input system was already deterministic with 3240 transitions.
Starting structural reductions in LTL mode, iteration 0 : 833/833 places, 3366/3366 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 820 transition count 3249
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 820 transition count 3249
Applied a total of 26 rules in 48 ms. Remains 820 /833 variables (removed 13) and now considering 3249/3366 (removed 117) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48 ms. Remains : 820/833 places, 3249/3366 transitions.
[2024-06-01 08:45:02] [INFO ] Flatten gal took : 93 ms
[2024-06-01 08:45:02] [INFO ] Flatten gal took : 109 ms
[2024-06-01 08:45:02] [INFO ] Input system was already deterministic with 3249 transitions.
[2024-06-01 08:45:02] [INFO ] Flatten gal took : 94 ms
[2024-06-01 08:45:02] [INFO ] Flatten gal took : 97 ms
[2024-06-01 08:45:02] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 6 ms.
[2024-06-01 08:45:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 833 places, 3366 transitions and 16704 arcs took 26 ms.
Total runtime 184066 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
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="EisenbergMcGuire-PT-09"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is EisenbergMcGuire-PT-09, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r492-smll-171636266400193"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-09.tgz
mv EisenbergMcGuire-PT-09 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;