About the Execution of ITS-Tools for PolyORBLF-COL-S04J04T08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 387953.00 | 0.00 | 0.00 | F??FF?TTT??F?FTT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446400129.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBLF-COL-S04J04T08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446400129
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.4K Apr 11 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 11 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 16:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 16:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 11 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S04J04T08-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716908018223
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J04T08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202405141337
[2024-05-28 14:53:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 14:53:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 14:53:39] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 14:53:40] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 14:53:40] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 919 ms
[2024-05-28 14:53:40] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 712 PT places and 4080.0 transition bindings in 37 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 30 ms.
[2024-05-28 14:53:40] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2024-05-28 14:53:40] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (14 resets) in 2220 ms. (18 steps per ms) remains 50/75 properties
BEST_FIRST walk for 4001 steps (8 resets) in 74 ms. (53 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (8 resets) in 59 ms. (66 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (8 resets) in 127 ms. (31 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4000 steps (8 resets) in 32 ms. (121 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (8 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4000 steps (8 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 49/50 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (8 resets) in 30 ms. (129 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 50 ms. (78 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 74 ms. (53 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 55 ms. (71 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 50 ms. (78 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
[2024-05-28 14:53:42] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 14:53:42] [INFO ] Computed 26 invariants in 9 ms
[2024-05-28 14:53:42] [INFO ] State equation strengthened by 8 read => feed constraints.
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp40 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 46 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp74 is UNSAT
At refinement iteration 3 (OVERLAPS) 20/68 variables, 9/11 constraints. Problems are: Problem set: 30 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 3/14 constraints. Problems are: Problem set: 30 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/14 constraints. Problems are: Problem set: 30 solved, 19 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp71 is UNSAT
At refinement iteration 6 (OVERLAPS) 11/79 variables, 11/25 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/25 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 64/143 variables, 79/104 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 8/112 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/112 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/145 variables, 2/114 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/145 variables, 1/115 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 47 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 47 solved, 2 unsolved in 777 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 47 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/46 variables, 5/5 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/5 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/51 variables, 4/9 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 47 solved, 2 unsolved
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp49 is UNSAT
After SMT solving in domain Int declared 73/145 variables, and 21 constraints, problems are : Problem set: 49 solved, 0 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 9/11 constraints, Generalized P Invariants (flows): 12/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 0/49 constraints, Known Traps: 0/0 constraints]
After SMT, in 974ms problems are : Problem set: 49 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 49 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-COL-S04J04T08-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 14:53:43] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2024-05-28 14:53:43] [INFO ] Flatten gal took : 49 ms
[2024-05-28 14:53:43] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA PolyORBLF-COL-S04J04T08-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T08-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T08-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T08-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T08-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T08-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T08-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T08-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 14:53:43] [INFO ] Flatten gal took : 10 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-28 14:53:44] [INFO ] Unfolded HLPN to a Petri net with 712 places and 4012 transitions 27744 arcs in 113 ms.
[2024-05-28 14:53:44] [INFO ] Unfolded 7 HLPN properties in 1 ms.
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
Support contains 349 out of 712 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 712/712 places, 1844/1844 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 708 transition count 1844
Applied a total of 4 rules in 81 ms. Remains 708 /712 variables (removed 4) and now considering 1844/1844 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-28 14:53:44] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 708 cols
[2024-05-28 14:53:44] [INFO ] Computed 50 invariants in 104 ms
[2024-05-28 14:53:44] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-05-28 14:54:09] [INFO ] Deduced a trap composed of 75 places in 173 ms of which 30 ms to minimize.
[2024-05-28 14:54:09] [INFO ] Deduced a trap composed of 75 places in 173 ms of which 2 ms to minimize.
[2024-05-28 14:54:09] [INFO ] Deduced a trap composed of 75 places in 149 ms of which 2 ms to minimize.
[2024-05-28 14:54:10] [INFO ] Deduced a trap composed of 75 places in 189 ms of which 2 ms to minimize.
[2024-05-28 14:54:10] [INFO ] Deduced a trap composed of 75 places in 80 ms of which 0 ms to minimize.
[2024-05-28 14:54:10] [INFO ] Deduced a trap composed of 75 places in 359 ms of which 1 ms to minimize.
[2024-05-28 14:54:10] [INFO ] Deduced a trap composed of 75 places in 68 ms of which 1 ms to minimize.
[2024-05-28 14:54:11] [INFO ] Deduced a trap composed of 217 places in 576 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 704/2520 variables, and 53 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20063 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 35/38 constraints, State Equation: 0/708 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1840/1840 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/704 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-05-28 14:54:16] [INFO ] Deduced a trap composed of 75 places in 80 ms of which 3 ms to minimize.
[2024-05-28 14:54:17] [INFO ] Deduced a trap composed of 368 places in 334 ms of which 5 ms to minimize.
[2024-05-28 14:54:26] [INFO ] Deduced a trap composed of 429 places in 448 ms of which 6 ms to minimize.
[2024-05-28 14:54:27] [INFO ] Deduced a trap composed of 433 places in 418 ms of which 5 ms to minimize.
[2024-05-28 14:54:27] [INFO ] Deduced a trap composed of 433 places in 357 ms of which 4 ms to minimize.
[2024-05-28 14:54:27] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 704/2520 variables, and 59 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 35/38 constraints, State Equation: 0/708 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1840 constraints, Known Traps: 14/14 constraints]
After SMT, in 49336ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 49417ms
[2024-05-28 14:54:33] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-05-28 14:54:33] [INFO ] Invariant cache hit.
[2024-05-28 14:54:34] [INFO ] Implicit Places using invariants in 539 ms returned []
[2024-05-28 14:54:34] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-05-28 14:54:34] [INFO ] Invariant cache hit.
[2024-05-28 14:54:35] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 14:54:43] [INFO ] Implicit Places using invariants and state equation in 9307 ms returned []
Implicit Place search using SMT with State Equation took 9855 ms to find 0 implicit places.
Running 1840 sub problems to find dead transitions.
[2024-05-28 14:54:43] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-05-28 14:54:43] [INFO ] Invariant cache hit.
[2024-05-28 14:54:43] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-05-28 14:55:11] [INFO ] Deduced a trap composed of 75 places in 85 ms of which 2 ms to minimize.
[2024-05-28 14:55:14] [INFO ] Deduced a trap composed of 75 places in 75 ms of which 1 ms to minimize.
[2024-05-28 14:55:14] [INFO ] Deduced a trap composed of 75 places in 60 ms of which 1 ms to minimize.
[2024-05-28 14:55:15] [INFO ] Deduced a trap composed of 75 places in 63 ms of which 1 ms to minimize.
[2024-05-28 14:55:15] [INFO ] Deduced a trap composed of 75 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:55:15] [INFO ] Deduced a trap composed of 75 places in 67 ms of which 1 ms to minimize.
[2024-05-28 14:55:15] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 1 ms to minimize.
[2024-05-28 14:55:17] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 2 ms to minimize.
[2024-05-28 14:55:20] [INFO ] Deduced a trap composed of 395 places in 432 ms of which 4 ms to minimize.
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 704/2520 variables, and 54 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 35/38 constraints, State Equation: 0/708 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1840/1840 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/704 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-05-28 14:55:26] [INFO ] Deduced a trap composed of 156 places in 407 ms of which 4 ms to minimize.
[2024-05-28 14:55:26] [INFO ] Deduced a trap composed of 212 places in 470 ms of which 5 ms to minimize.
[2024-05-28 14:55:27] [INFO ] Deduced a trap composed of 219 places in 394 ms of which 4 ms to minimize.
[2024-05-28 14:55:27] [INFO ] Deduced a trap composed of 212 places in 378 ms of which 4 ms to minimize.
[2024-05-28 14:55:28] [INFO ] Deduced a trap composed of 214 places in 362 ms of which 3 ms to minimize.
[2024-05-28 14:55:28] [INFO ] Deduced a trap composed of 213 places in 364 ms of which 3 ms to minimize.
[2024-05-28 14:55:30] [INFO ] Deduced a trap composed of 360 places in 440 ms of which 5 ms to minimize.
[2024-05-28 14:55:41] [INFO ] Deduced a trap composed of 351 places in 445 ms of which 3 ms to minimize.
[2024-05-28 14:55:41] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 704/2520 variables, and 63 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 35/38 constraints, State Equation: 0/708 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1840 constraints, Known Traps: 18/18 constraints]
After SMT, in 70249ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 70300ms
Starting structural reductions in LTL mode, iteration 1 : 708/712 places, 1844/1844 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129701 ms. Remains : 708/712 places, 1844/1844 transitions.
Support contains 349 out of 708 places after structural reductions.
[2024-05-28 14:55:54] [INFO ] Flatten gal took : 191 ms
[2024-05-28 14:55:54] [INFO ] Flatten gal took : 122 ms
[2024-05-28 14:55:54] [INFO ] Input system was already deterministic with 1844 transitions.
RANDOM walk for 40000 steps (9 resets) in 986 ms. (40 steps per ms) remains 19/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 61 ms. (64 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 61 ms. (64 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 19/19 properties
[2024-05-28 14:55:55] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-05-28 14:55:55] [INFO ] Invariant cache hit.
[2024-05-28 14:55:55] [INFO ] State equation strengthened by 160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 1 (OVERLAPS) 82/297 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 16 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 1/6 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 12/309 variables, 4/10 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 15 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp29 is UNSAT
At refinement iteration 6 (OVERLAPS) 383/692 variables, 28/38 constraints. Problems are: Problem set: 15 solved, 4 unsolved
[2024-05-28 14:55:56] [INFO ] Deduced a trap composed of 75 places in 194 ms of which 3 ms to minimize.
[2024-05-28 14:55:56] [INFO ] Deduced a trap composed of 76 places in 241 ms of which 2 ms to minimize.
[2024-05-28 14:55:56] [INFO ] Deduced a trap composed of 76 places in 193 ms of which 5 ms to minimize.
[2024-05-28 14:55:56] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 1 ms to minimize.
[2024-05-28 14:55:56] [INFO ] Deduced a trap composed of 75 places in 111 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/692 variables, 5/43 constraints. Problems are: Problem set: 15 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/692 variables, 0/43 constraints. Problems are: Problem set: 15 solved, 4 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp28 is UNSAT
At refinement iteration 9 (OVERLAPS) 2/694 variables, 2/45 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/694 variables, 0/45 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 12/706 variables, 9/54 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/706 variables, 0/54 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1812/2518 variables, 706/760 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2518 variables, 160/920 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2518 variables, 0/920 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/2520 variables, 2/922 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2520 variables, 1/923 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2520 variables, 0/923 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/2520 variables, 0/923 constraints. Problems are: Problem set: 17 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2520/2520 variables, and 923 constraints, problems are : Problem set: 17 solved, 2 unsolved in 4459 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 708/708 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 17 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 16/66 variables, 1/1 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 617/683 variables, 28/29 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/683 variables, 5/34 constraints. Problems are: Problem set: 17 solved, 2 unsolved
[2024-05-28 14:56:00] [INFO ] Deduced a trap composed of 76 places in 177 ms of which 2 ms to minimize.
[2024-05-28 14:56:00] [INFO ] Deduced a trap composed of 76 places in 80 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/683 variables, 2/36 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/683 variables, 0/36 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 10/693 variables, 10/46 constraints. Problems are: Problem set: 17 solved, 2 unsolved
[2024-05-28 14:56:00] [INFO ] Deduced a trap composed of 75 places in 108 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/693 variables, 1/47 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/693 variables, 0/47 constraints. Problems are: Problem set: 17 solved, 2 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 10 (OVERLAPS) 13/706 variables, 10/57 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/706 variables, 0/57 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1812/2518 variables, 706/763 constraints. Problems are: Problem set: 18 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2518/2520 variables, and 923 constraints, problems are : Problem set: 18 solved, 1 unsolved in 2625 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 706/708 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 0/19 constraints, Known Traps: 8/8 constraints]
After SMT, in 7198ms problems are : Problem set: 18 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 9 out of 708 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 708/708 places, 1844/1844 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 708 transition count 1772
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 636 transition count 1772
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 144 place count 636 transition count 1692
Deduced a syphon composed of 80 places in 6 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 304 place count 556 transition count 1692
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 16 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 448 place count 484 transition count 1620
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 464 place count 484 transition count 1604
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 480 place count 468 transition count 1604
Applied a total of 480 rules in 521 ms. Remains 468 /708 variables (removed 240) and now considering 1604/1844 (removed 240) transitions.
Running 1600 sub problems to find dead transitions.
[2024-05-28 14:56:03] [INFO ] Flow matrix only has 1572 transitions (discarded 32 similar events)
// Phase 1: matrix 1572 rows 468 cols
[2024-05-28 14:56:03] [INFO ] Computed 50 invariants in 62 ms
[2024-05-28 14:56:03] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 14:56:27] [INFO ] Deduced a trap composed of 45 places in 148 ms of which 2 ms to minimize.
[2024-05-28 14:56:27] [INFO ] Deduced a trap composed of 45 places in 127 ms of which 1 ms to minimize.
[2024-05-28 14:56:27] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 1 ms to minimize.
[2024-05-28 14:56:27] [INFO ] Deduced a trap composed of 45 places in 267 ms of which 1 ms to minimize.
[2024-05-28 14:56:27] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 1 ms to minimize.
[2024-05-28 14:56:27] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:56:27] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 2 ms to minimize.
[2024-05-28 14:56:28] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
[2024-05-28 14:56:28] [INFO ] Deduced a trap composed of 199 places in 627 ms of which 19 ms to minimize.
[2024-05-28 14:56:29] [INFO ] Deduced a trap composed of 193 places in 527 ms of which 3 ms to minimize.
[2024-05-28 14:56:31] [INFO ] Deduced a trap composed of 33 places in 235 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/2040 variables, and 57 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 32/35 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 14:56:50] [INFO ] Deduced a trap composed of 37 places in 216 ms of which 2 ms to minimize.
[2024-05-28 14:56:51] [INFO ] Deduced a trap composed of 180 places in 412 ms of which 2 ms to minimize.
[2024-05-28 14:56:51] [INFO ] Deduced a trap composed of 170 places in 384 ms of which 3 ms to minimize.
[2024-05-28 14:56:52] [INFO ] Deduced a trap composed of 158 places in 386 ms of which 3 ms to minimize.
[2024-05-28 14:56:52] [INFO ] Deduced a trap composed of 167 places in 349 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/2040 variables, and 62 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 32/35 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 16/16 constraints]
After SMT, in 52330ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 52396ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52924 ms. Remains : 468/708 places, 1604/1844 transitions.
RANDOM walk for 35900 steps (8 resets) in 577 ms. (62 steps per ms) remains 0/1 properties
Successfully simplified 18 atomic propositions for a total of 7 simplifications.
[2024-05-28 14:56:55] [INFO ] Flatten gal took : 108 ms
[2024-05-28 14:56:55] [INFO ] Flatten gal took : 110 ms
[2024-05-28 14:56:56] [INFO ] Input system was already deterministic with 1844 transitions.
Support contains 155 out of 708 places (down from 224) after GAL structural reductions.
FORMULA PolyORBLF-COL-S04J04T08-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 708/708 places, 1844/1844 transitions.
Applied a total of 0 rules in 27 ms. Remains 708 /708 variables (removed 0) and now considering 1844/1844 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-28 14:56:56] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 708 cols
[2024-05-28 14:56:56] [INFO ] Computed 50 invariants in 55 ms
[2024-05-28 14:56:56] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-05-28 14:57:20] [INFO ] Deduced a trap composed of 75 places in 156 ms of which 6 ms to minimize.
[2024-05-28 14:57:21] [INFO ] Deduced a trap composed of 75 places in 90 ms of which 2 ms to minimize.
[2024-05-28 14:57:21] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 2 ms to minimize.
[2024-05-28 14:57:21] [INFO ] Deduced a trap composed of 75 places in 107 ms of which 2 ms to minimize.
[2024-05-28 14:57:21] [INFO ] Deduced a trap composed of 75 places in 65 ms of which 1 ms to minimize.
[2024-05-28 14:57:21] [INFO ] Deduced a trap composed of 75 places in 67 ms of which 1 ms to minimize.
[2024-05-28 14:57:21] [INFO ] Deduced a trap composed of 75 places in 77 ms of which 1 ms to minimize.
[2024-05-28 14:57:22] [INFO ] Deduced a trap composed of 217 places in 447 ms of which 6 ms to minimize.
[2024-05-28 14:57:24] [INFO ] Deduced a trap composed of 75 places in 74 ms of which 1 ms to minimize.
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 704/2520 variables, and 54 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 35/38 constraints, State Equation: 0/708 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1840/1840 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/704 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-05-28 14:57:30] [INFO ] Deduced a trap composed of 360 places in 494 ms of which 19 ms to minimize.
[2024-05-28 14:57:40] [INFO ] Deduced a trap composed of 412 places in 456 ms of which 5 ms to minimize.
[2024-05-28 14:57:40] [INFO ] Deduced a trap composed of 370 places in 525 ms of which 18 ms to minimize.
[2024-05-28 14:57:41] [INFO ] Deduced a trap composed of 428 places in 373 ms of which 3 ms to minimize.
[2024-05-28 14:57:41] [INFO ] Deduced a trap composed of 461 places in 381 ms of which 4 ms to minimize.
[2024-05-28 14:57:41] [INFO ] Deduced a trap composed of 5 places in 345 ms of which 3 ms to minimize.
[2024-05-28 14:57:42] [INFO ] Deduced a trap composed of 381 places in 332 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 704/2520 variables, and 61 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20062 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 35/38 constraints, State Equation: 0/708 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1840 constraints, Known Traps: 16/16 constraints]
After SMT, in 49386ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 49415ms
[2024-05-28 14:57:45] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-05-28 14:57:45] [INFO ] Invariant cache hit.
[2024-05-28 14:57:46] [INFO ] Implicit Places using invariants in 843 ms returned [548, 549, 550, 551, 552, 553, 554, 555]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 849 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 700/708 places, 1844/1844 transitions.
Applied a total of 0 rules in 20 ms. Remains 700 /700 variables (removed 0) and now considering 1844/1844 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50322 ms. Remains : 700/708 places, 1844/1844 transitions.
[2024-05-28 14:57:46] [INFO ] Flatten gal took : 96 ms
[2024-05-28 14:57:46] [INFO ] Flatten gal took : 107 ms
[2024-05-28 14:57:46] [INFO ] Input system was already deterministic with 1844 transitions.
[2024-05-28 14:57:47] [INFO ] Flatten gal took : 95 ms
[2024-05-28 14:57:47] [INFO ] Flatten gal took : 84 ms
[2024-05-28 14:57:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality4460902702367160328.gal : 34 ms
[2024-05-28 14:57:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality9411067499783931741.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4460902702367160328.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9411067499783931741.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 14:58:17] [INFO ] Flatten gal took : 101 ms
[2024-05-28 14:58:17] [INFO ] Applying decomposition
[2024-05-28 14:58:17] [INFO ] Flatten gal took : 98 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9943863272145948780.txt' '-o' '/tmp/graph9943863272145948780.bin' '-w' '/tmp/graph9943863272145948780.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9943863272145948780.bin' '-l' '-1' '-v' '-w' '/tmp/graph9943863272145948780.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:58:17] [INFO ] Decomposing Gal with order
[2024-05-28 14:58:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:58:18] [INFO ] Removed a total of 1200 redundant transitions.
[2024-05-28 14:58:18] [INFO ] Flatten gal took : 329 ms
[2024-05-28 14:58:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 350 labels/synchronizations in 72 ms.
[2024-05-28 14:58:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality17833854957854085472.gal : 22 ms
[2024-05-28 14:58:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality14353812299199809413.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17833854957854085472.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14353812299199809413.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 708/708 places, 1844/1844 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 708 transition count 1772
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 636 transition count 1772
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 144 place count 636 transition count 1724
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 240 place count 588 transition count 1724
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 400 place count 508 transition count 1644
Applied a total of 400 rules in 89 ms. Remains 508 /708 variables (removed 200) and now considering 1644/1844 (removed 200) transitions.
Running 1640 sub problems to find dead transitions.
[2024-05-28 14:58:49] [INFO ] Flow matrix only has 1612 transitions (discarded 32 similar events)
// Phase 1: matrix 1612 rows 508 cols
[2024-05-28 14:58:49] [INFO ] Computed 50 invariants in 41 ms
[2024-05-28 14:58:49] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/504 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/504 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-28 14:59:11] [INFO ] Deduced a trap composed of 50 places in 239 ms of which 3 ms to minimize.
[2024-05-28 14:59:11] [INFO ] Deduced a trap composed of 33 places in 241 ms of which 2 ms to minimize.
[2024-05-28 14:59:12] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:59:12] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 0 ms to minimize.
[2024-05-28 14:59:12] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2024-05-28 14:59:12] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 0 ms to minimize.
[2024-05-28 14:59:12] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2024-05-28 14:59:12] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 0 ms to minimize.
[2024-05-28 14:59:13] [INFO ] Deduced a trap composed of 237 places in 463 ms of which 4 ms to minimize.
[2024-05-28 14:59:14] [INFO ] Deduced a trap composed of 247 places in 398 ms of which 3 ms to minimize.
[2024-05-28 14:59:14] [INFO ] Deduced a trap composed of 238 places in 424 ms of which 2 ms to minimize.
[2024-05-28 14:59:14] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 1 ms to minimize.
[2024-05-28 14:59:16] [INFO ] Deduced a trap composed of 40 places in 272 ms of which 3 ms to minimize.
[2024-05-28 14:59:16] [INFO ] Deduced a trap composed of 73 places in 311 ms of which 3 ms to minimize.
[2024-05-28 14:59:18] [INFO ] Deduced a trap composed of 202 places in 358 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 504/2120 variables, and 61 constraints, problems are : Problem set: 0 solved, 1640 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/508 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1640/1640 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1640 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/504 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/504 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/504 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-28 14:59:28] [INFO ] Deduced a trap composed of 38 places in 188 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/2120 variables, and 62 constraints, problems are : Problem set: 0 solved, 1640 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/508 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1640 constraints, Known Traps: 16/16 constraints]
After SMT, in 49959ms problems are : Problem set: 0 solved, 1640 unsolved
Search for dead transitions found 0 dead transitions in 49981ms
[2024-05-28 14:59:39] [INFO ] Flow matrix only has 1612 transitions (discarded 32 similar events)
[2024-05-28 14:59:39] [INFO ] Invariant cache hit.
[2024-05-28 14:59:39] [INFO ] Implicit Places using invariants in 759 ms returned [444, 445, 446, 447, 448, 449, 450, 451]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 766 ms to find 8 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 500/708 places, 1644/1844 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 492 transition count 1636
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 492 transition count 1636
Applied a total of 16 rules in 117 ms. Remains 492 /500 variables (removed 8) and now considering 1636/1644 (removed 8) transitions.
[2024-05-28 14:59:39] [INFO ] Flow matrix only has 1604 transitions (discarded 32 similar events)
// Phase 1: matrix 1604 rows 492 cols
[2024-05-28 14:59:40] [INFO ] Computed 42 invariants in 49 ms
[2024-05-28 14:59:40] [INFO ] Implicit Places using invariants in 841 ms returned []
[2024-05-28 14:59:40] [INFO ] Flow matrix only has 1604 transitions (discarded 32 similar events)
[2024-05-28 14:59:40] [INFO ] Invariant cache hit.
[2024-05-28 14:59:41] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 14:59:49] [INFO ] Implicit Places using invariants and state equation in 8488 ms returned []
Implicit Place search using SMT with State Equation took 9334 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 492/708 places, 1636/1844 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 60292 ms. Remains : 492/708 places, 1636/1844 transitions.
[2024-05-28 14:59:49] [INFO ] Flatten gal took : 84 ms
[2024-05-28 14:59:49] [INFO ] Flatten gal took : 76 ms
[2024-05-28 14:59:49] [INFO ] Input system was already deterministic with 1636 transitions.
[2024-05-28 14:59:49] [INFO ] Flatten gal took : 65 ms
[2024-05-28 14:59:49] [INFO ] Flatten gal took : 67 ms
[2024-05-28 14:59:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality736433830476459655.gal : 8 ms
[2024-05-28 14:59:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality9721095140173208716.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality736433830476459655.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9721095140173208716.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
BK_STOP 1716908406176
--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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="PolyORBLF-COL-S04J04T08"
export BK_EXAMINATION="CTLCardinality"
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 PolyORBLF-COL-S04J04T08, 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 r290-tajo-171654446400129"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S04J04T08.tgz
mv PolyORBLF-COL-S04J04T08 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 ;