About the Execution of ITS-Tools for PolyORBLF-COL-S06J04T04
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 162362.00 | 0.00 | 0.00 | FTF?TT???F?FF??T | 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-171654446500171.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-S06J04T04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446500171
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 7.2K Apr 11 17:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 11 17:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 11 17:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 11 17:31 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.5K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 17:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 11 17:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 17:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 11 17:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:44 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-S06J04T04-LTLCardinality-00
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-01
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-02
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-03
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-04
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-05
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-06
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-07
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-08
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-09
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716910384955
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S06J04T04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202405141337
[2024-05-28 15:33:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 15:33:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 15:33:06] [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 15:33:07] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 15:33:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1023 ms
[2024-05-28 15:33:07] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 454 PT places and 7036.0 transition bindings in 54 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 15:33:08] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-05-28 15:33:08] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 6 formulas.
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 10 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40008 steps (3906 resets) in 1395 ms. (28 steps per ms) remains 14/21 properties
BEST_FIRST walk for 40002 steps (135 resets) in 427 ms. (93 steps per ms) remains 7/14 properties
BEST_FIRST walk for 40004 steps (256 resets) in 298 ms. (133 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (2104 resets) in 130 ms. (305 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (2104 resets) in 289 ms. (137 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (142 resets) in 331 ms. (120 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (116 resets) in 223 ms. (178 steps per ms) remains 6/6 properties
[2024-05-28 15:33:09] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 15:33:09] [INFO ] Computed 26 invariants in 7 ms
[2024-05-28 15:33:09] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 1 (OVERLAPS) 38/52 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 7/59 variables, 4/10 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/60 variables, 1/11 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
At refinement iteration 7 (OVERLAPS) 21/81 variables, 15/26 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/26 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 64/145 variables, 81/107 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 8/115 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 4 solved, 2 unsolved in 394 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: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/49 variables, 6/6 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/56 variables, 4/10 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/57 variables, 1/11 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/11 constraints. Problems are: Problem set: 4 solved, 2 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 7 (OVERLAPS) 24/81 variables, 15/26 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-05-28 15:33:09] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 17 ms to minimize.
[2024-05-28 15:33:09] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 2 ms to minimize.
[2024-05-28 15:33:10] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Int declared 81/145 variables, and 29 constraints, problems are : Problem set: 6 solved, 0 unsolved in 372 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 0/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 828ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 6 atomic propositions for a total of 10 simplifications.
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 15:33:10] [INFO ] Flatten gal took : 23 ms
[2024-05-28 15:33:10] [INFO ] Flatten gal took : 9 ms
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
[2024-05-28 15:33:10] [INFO ] Unfolded HLPN to a Petri net with 454 places and 6994 transitions 59152 arcs in 168 ms.
[2024-05-28 15:33:10] [INFO ] Unfolded 7 HLPN properties in 0 ms.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Support contains 118 out of 454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 1614/1614 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 448 transition count 1614
Applied a total of 6 rules in 57 ms. Remains 448 /454 variables (removed 6) and now considering 1614/1614 (removed 0) transitions.
Running 1608 sub problems to find dead transitions.
[2024-05-28 15:33:10] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
// Phase 1: matrix 1590 rows 448 cols
[2024-05-28 15:33:10] [INFO ] Computed 44 invariants in 67 ms
[2024-05-28 15:33:10] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-05-28 15:33:37] [INFO ] Deduced a trap composed of 85 places in 189 ms of which 2 ms to minimize.
[2024-05-28 15:33:37] [INFO ] Deduced a trap composed of 85 places in 119 ms of which 1 ms to minimize.
[2024-05-28 15:33:37] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 2 ms to minimize.
[2024-05-28 15:33:38] [INFO ] Deduced a trap composed of 262 places in 425 ms of which 3 ms to minimize.
[2024-05-28 15:33:38] [INFO ] Deduced a trap composed of 101 places in 355 ms of which 5 ms to minimize.
[2024-05-28 15:33:39] [INFO ] Deduced a trap composed of 112 places in 307 ms of which 2 ms to minimize.
[2024-05-28 15:33:39] [INFO ] Deduced a trap composed of 131 places in 280 ms of which 3 ms to minimize.
[2024-05-28 15:33:39] [INFO ] Deduced a trap composed of 91 places in 361 ms of which 3 ms to minimize.
[2024-05-28 15:33:40] [INFO ] Deduced a trap composed of 129 places in 374 ms of which 3 ms to minimize.
[2024-05-28 15:33:40] [INFO ] Deduced a trap composed of 85 places in 88 ms of which 1 ms to minimize.
[2024-05-28 15:33:41] [INFO ] Deduced a trap composed of 213 places in 804 ms of which 3 ms to minimize.
[2024-05-28 15:33:42] [INFO ] Deduced a trap composed of 225 places in 264 ms of which 3 ms to minimize.
[2024-05-28 15:33:42] [INFO ] Deduced a trap composed of 238 places in 256 ms of which 2 ms to minimize.
[2024-05-28 15:33:42] [INFO ] Deduced a trap composed of 247 places in 247 ms of which 3 ms to minimize.
[2024-05-28 15:33:43] [INFO ] Deduced a trap composed of 231 places in 505 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 442/2038 variables, and 53 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 20066 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/448 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-05-28 15:33:56] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 442/2038 variables, and 54 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/448 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1608 constraints, Known Traps: 16/16 constraints]
After SMT, in 57110ms problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 57135ms
[2024-05-28 15:34:07] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
[2024-05-28 15:34:07] [INFO ] Invariant cache hit.
[2024-05-28 15:34:09] [INFO ] Implicit Places using invariants in 1820 ms returned [354, 355, 356, 357]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 1835 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 444/454 places, 1614/1614 transitions.
Applied a total of 0 rules in 22 ms. Remains 444 /444 variables (removed 0) and now considering 1614/1614 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59081 ms. Remains : 444/454 places, 1614/1614 transitions.
Support contains 118 out of 444 places after structural reductions.
[2024-05-28 15:34:09] [INFO ] Flatten gal took : 156 ms
[2024-05-28 15:34:09] [INFO ] Flatten gal took : 117 ms
[2024-05-28 15:34:10] [INFO ] Input system was already deterministic with 1614 transitions.
RANDOM walk for 40000 steps (192 resets) in 526 ms. (75 steps per ms) remains 3/17 properties
BEST_FIRST walk for 40000 steps (1140 resets) in 327 ms. (121 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (1140 resets) in 164 ms. (242 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (87 resets) in 168 ms. (236 steps per ms) remains 3/3 properties
[2024-05-28 15:34:10] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
// Phase 1: matrix 1590 rows 444 cols
[2024-05-28 15:34:10] [INFO ] Computed 40 invariants in 103 ms
[2024-05-28 15:34:10] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 1 (OVERLAPS) 121/136 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 113/249 variables, 8/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/254 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp14 is UNSAT
At refinement iteration 7 (OVERLAPS) 184/438 variables, 23/35 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/440 variables, 2/37 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 0/37 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/442 variables, 2/39 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/442 variables, 0/39 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1590/2032 variables, 442/481 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2032 variables, 112/593 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2032 variables, 0/593 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/2034 variables, 2/595 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2034 variables, 1/596 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2034 variables, 0/596 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2034 variables, 0/596 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2034/2034 variables, and 596 constraints, problems are : Problem set: 2 solved, 1 unsolved in 1420 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 444/444 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/132 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/245 variables, 8/11 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/250 variables, 1/12 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 188/438 variables, 23/35 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-28 15:34:12] [INFO ] Deduced a trap composed of 91 places in 463 ms of which 5 ms to minimize.
Problem AtomicPropp0 is UNSAT
After SMT solving in domain Int declared 438/2034 variables, and 36 constraints, problems are : Problem set: 3 solved, 0 unsolved in 712 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/444 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 2272ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 7 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 8 out of 444 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 444/444 places, 1614/1614 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 444 transition count 1578
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 408 transition count 1578
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 72 place count 408 transition count 1530
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 168 place count 360 transition count 1530
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 172 place count 356 transition count 1526
Iterating global reduction 2 with 4 rules applied. Total rules applied 176 place count 356 transition count 1526
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 272 place count 308 transition count 1478
Applied a total of 272 rules in 154 ms. Remains 308 /444 variables (removed 136) and now considering 1478/1614 (removed 136) transitions.
Running 1472 sub problems to find dead transitions.
[2024-05-28 15:34:13] [INFO ] Flow matrix only has 1454 transitions (discarded 24 similar events)
// Phase 1: matrix 1454 rows 308 cols
[2024-05-28 15:34:13] [INFO ] Computed 40 invariants in 28 ms
[2024-05-28 15:34:13] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
[2024-05-28 15:34:37] [INFO ] Deduced a trap composed of 52 places in 139 ms of which 1 ms to minimize.
[2024-05-28 15:34:37] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 18 ms to minimize.
[2024-05-28 15:34:37] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 1 ms to minimize.
[2024-05-28 15:34:37] [INFO ] Deduced a trap composed of 52 places in 58 ms of which 1 ms to minimize.
[2024-05-28 15:34:38] [INFO ] Deduced a trap composed of 134 places in 485 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 302/1762 variables, and 39 constraints, problems are : Problem set: 0 solved, 1472 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/17 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/308 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1472/1472 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
[2024-05-28 15:34:50] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 1 ms to minimize.
[2024-05-28 15:35:03] [INFO ] Deduced a trap composed of 87 places in 286 ms of which 3 ms to minimize.
[2024-05-28 15:35:03] [INFO ] Deduced a trap composed of 90 places in 297 ms of which 2 ms to minimize.
[2024-05-28 15:35:04] [INFO ] Deduced a trap composed of 101 places in 298 ms of which 2 ms to minimize.
[2024-05-28 15:35:04] [INFO ] Deduced a trap composed of 83 places in 287 ms of which 2 ms to minimize.
[2024-05-28 15:35:04] [INFO ] Deduced a trap composed of 91 places in 250 ms of which 2 ms to minimize.
[2024-05-28 15:35:04] [INFO ] Deduced a trap composed of 90 places in 268 ms of which 2 ms to minimize.
[2024-05-28 15:35:05] [INFO ] Deduced a trap composed of 77 places in 307 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 302/1762 variables, and 47 constraints, problems are : Problem set: 0 solved, 1472 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/17 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/308 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1472 constraints, Known Traps: 13/13 constraints]
After SMT, in 56479ms problems are : Problem set: 0 solved, 1472 unsolved
Search for dead transitions found 0 dead transitions in 56494ms
[2024-05-28 15:35:09] [INFO ] Flow matrix only has 1454 transitions (discarded 24 similar events)
[2024-05-28 15:35:09] [INFO ] Invariant cache hit.
[2024-05-28 15:35:10] [INFO ] Implicit Places using invariants in 352 ms returned []
[2024-05-28 15:35:10] [INFO ] Flow matrix only has 1454 transitions (discarded 24 similar events)
[2024-05-28 15:35:10] [INFO ] Invariant cache hit.
[2024-05-28 15:35:10] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 15:35:13] [INFO ] Implicit Places using invariants and state equation in 3441 ms returned []
Implicit Place search using SMT with State Equation took 3796 ms to find 0 implicit places.
[2024-05-28 15:35:13] [INFO ] Redundant transitions in 88 ms returned []
Running 1472 sub problems to find dead transitions.
[2024-05-28 15:35:13] [INFO ] Flow matrix only has 1454 transitions (discarded 24 similar events)
[2024-05-28 15:35:13] [INFO ] Invariant cache hit.
[2024-05-28 15:35:13] [INFO ] State equation strengthened by 112 read => feed constraints.
BK_STOP 1716910547317
--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-S06J04T04"
export BK_EXAMINATION="LTLCardinality"
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-S06J04T04, examination is LTLCardinality"
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-171654446500171"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S06J04T04.tgz
mv PolyORBLF-COL-S06J04T04 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;