Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446600194.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-S06J06T04, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446600194
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 12K Apr 11 17:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 11 17:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 11 17:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 11 17:22 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.6K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 17:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 11 17:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 11 17:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 11 17:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K 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-S06J06T04-CTLFireability-2024-00
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLFireability-2024-01
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLFireability-2024-02
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLFireability-2024-03
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLFireability-2024-04
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLFireability-2024-05
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLFireability-2024-06
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLFireability-2024-07
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLFireability-2024-08
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLFireability-2024-09
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLFireability-2024-10
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLFireability-2024-11
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLFireability-2024-12
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLFireability-2024-13
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLFireability-2024-14
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716911267055

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S06J06T04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLFireability COL
Running Version 202405141337
[2024-05-28 15:47:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 15:47:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 15:47:48] [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:47:49] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 15:47:49] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 658 ms
[2024-05-28 15:47:49] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 506 PT places and 7196.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
[2024-05-28 15:47:49] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-05-28 15:47:49] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 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 (3791 resets) in 2099 ms. (19 steps per ms) remains 7/46 properties
BEST_FIRST walk for 40002 steps (192 resets) in 685 ms. (58 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (81 resets) in 313 ms. (127 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (71 resets) in 213 ms. (186 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (73 resets) in 159 ms. (250 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (71 resets) in 166 ms. (239 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (752 resets) in 202 ms. (197 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (181 resets) in 180 ms. (221 steps per ms) remains 7/7 properties
[2024-05-28 15:47:50] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 15:47:50] [INFO ] Computed 26 invariants in 26 ms
[2024-05-28 15:47:50] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 36/61 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 15:47:51] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 7 ms to minimize.
[2024-05-28 15:47:51] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 3/64 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp41 is UNSAT
After SMT solving in domain Real declared 81/145 variables, and 28 constraints, problems are : Problem set: 7 solved, 0 unsolved in 359 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: 7/7 constraints, Known Traps: 2/2 constraints]
After SMT, in 435ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 7 atomic propositions for a total of 14 simplifications.
[2024-05-28 15:47:51] [INFO ] Flatten gal took : 24 ms
[2024-05-28 15:47:51] [INFO ] Flatten gal took : 7 ms
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
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
[2024-05-28 15:47:51] [INFO ] Unfolded HLPN to a Petri net with 506 places and 7154 transitions 59824 arcs in 139 ms.
[2024-05-28 15:47:51] [INFO ] Unfolded 16 HLPN properties in 2 ms.
[2024-05-28 15:47:51] [INFO ] Reduced 4680 identical enabling conditions.
[2024-05-28 15:47:51] [INFO ] Reduced 4680 identical enabling conditions.
[2024-05-28 15:47:51] [INFO ] Reduced 60 identical enabling conditions.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Support contains 462 out of 506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 1774/1774 transitions.
Applied a total of 0 rules in 34 ms. Remains 506 /506 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
Running 1768 sub problems to find dead transitions.
[2024-05-28 15:47:51] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
// Phase 1: matrix 1750 rows 506 cols
[2024-05-28 15:47:51] [INFO ] Computed 54 invariants in 111 ms
[2024-05-28 15:47:51] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
[2024-05-28 15:48:19] [INFO ] Deduced a trap composed of 93 places in 194 ms of which 3 ms to minimize.
[2024-05-28 15:48:20] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 2 ms to minimize.
[2024-05-28 15:48:20] [INFO ] Deduced a trap composed of 94 places in 76 ms of which 2 ms to minimize.
[2024-05-28 15:48:20] [INFO ] Deduced a trap composed of 279 places in 444 ms of which 4 ms to minimize.
[2024-05-28 15:48:21] [INFO ] Deduced a trap composed of 284 places in 484 ms of which 4 ms to minimize.
[2024-05-28 15:48:21] [INFO ] Deduced a trap composed of 133 places in 498 ms of which 5 ms to minimize.
[2024-05-28 15:48:22] [INFO ] Deduced a trap composed of 133 places in 398 ms of which 4 ms to minimize.
[2024-05-28 15:48:22] [INFO ] Deduced a trap composed of 118 places in 398 ms of which 3 ms to minimize.
[2024-05-28 15:48:23] [INFO ] Deduced a trap composed of 118 places in 406 ms of which 4 ms to minimize.
[2024-05-28 15:48:24] [INFO ] Deduced a trap composed of 241 places in 466 ms of which 4 ms to minimize.
[2024-05-28 15:48:24] [INFO ] Deduced a trap composed of 267 places in 419 ms of which 3 ms to minimize.
[2024-05-28 15:48:25] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 1 ms to minimize.
[2024-05-28 15:48:26] [INFO ] Deduced a trap composed of 260 places in 539 ms of which 3 ms to minimize.
[2024-05-28 15:48:27] [INFO ] Deduced a trap composed of 278 places in 500 ms of which 4 ms to minimize.
[2024-05-28 15:48:27] [INFO ] Deduced a trap composed of 275 places in 495 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 494/2256 variables, and 57 constraints, problems are : Problem set: 0 solved, 1768 unsolved in 20094 ms.
Refiners :[Positive P Invariants (semi-flows): 13/17 constraints, Generalized P Invariants (flows): 29/37 constraints, State Equation: 0/506 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1768/1768 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1768 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/494 variables, 15/57 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
[2024-05-28 15:48:35] [INFO ] Deduced a trap composed of 253 places in 378 ms of which 5 ms to minimize.
[2024-05-28 15:48:35] [INFO ] Deduced a trap composed of 254 places in 390 ms of which 3 ms to minimize.
[2024-05-28 15:48:35] [INFO ] Deduced a trap composed of 260 places in 349 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 494/2256 variables, and 60 constraints, problems are : Problem set: 0 solved, 1768 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/17 constraints, Generalized P Invariants (flows): 29/37 constraints, State Equation: 0/506 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1768 constraints, Known Traps: 18/18 constraints]
After SMT, in 56083ms problems are : Problem set: 0 solved, 1768 unsolved
Search for dead transitions found 0 dead transitions in 56110ms
[2024-05-28 15:48:47] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
[2024-05-28 15:48:47] [INFO ] Invariant cache hit.
[2024-05-28 15:48:47] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-28 15:48:47] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
[2024-05-28 15:48:47] [INFO ] Invariant cache hit.
[2024-05-28 15:48:48] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 15:48:50] [INFO ] Implicit Places using invariants and state equation in 2111 ms returned []
Implicit Place search using SMT with State Equation took 2264 ms to find 0 implicit places.
Running 1768 sub problems to find dead transitions.
[2024-05-28 15:48:50] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
[2024-05-28 15:48:50] [INFO ] Invariant cache hit.
[2024-05-28 15:48:50] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
[2024-05-28 15:49:22] [INFO ] Deduced a trap composed of 94 places in 55 ms of which 2 ms to minimize.
[2024-05-28 15:49:22] [INFO ] Deduced a trap composed of 93 places in 94 ms of which 2 ms to minimize.
[2024-05-28 15:49:22] [INFO ] Deduced a trap composed of 94 places in 83 ms of which 1 ms to minimize.
[2024-05-28 15:49:22] [INFO ] Deduced a trap composed of 256 places in 402 ms of which 4 ms to minimize.
[2024-05-28 15:49:23] [INFO ] Deduced a trap composed of 107 places in 385 ms of which 5 ms to minimize.
[2024-05-28 15:49:25] [INFO ] Deduced a trap composed of 300 places in 492 ms of which 4 ms to minimize.
[2024-05-28 15:49:25] [INFO ] Deduced a trap composed of 266 places in 393 ms of which 3 ms to minimize.
[2024-05-28 15:49:25] [INFO ] Deduced a trap composed of 255 places in 359 ms of which 2 ms to minimize.
[2024-05-28 15:49:26] [INFO ] Deduced a trap composed of 94 places in 70 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 494/2256 variables, and 51 constraints, problems are : Problem set: 0 solved, 1768 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/17 constraints, Generalized P Invariants (flows): 29/37 constraints, State Equation: 0/506 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1768/1768 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1768 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/494 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
[2024-05-28 15:49:42] [INFO ] Deduced a trap composed of 292 places in 404 ms of which 3 ms to minimize.
[2024-05-28 15:49:50] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 3 ms to minimize.
[2024-05-28 15:50:05] [INFO ] Deduced a trap composed of 297 places in 275 ms of which 15 ms to minimize.
[2024-05-28 15:50:05] [INFO ] Deduced a trap composed of 247 places in 264 ms of which 3 ms to minimize.
[2024-05-28 15:50:05] [INFO ] Deduced a trap composed of 244 places in 257 ms of which 3 ms to minimize.
[2024-05-28 15:50:06] [INFO ] Deduced a trap composed of 216 places in 337 ms of which 8 ms to minimize.
[2024-05-28 15:50:06] [INFO ] Deduced a trap composed of 57 places in 485 ms of which 4 ms to minimize.
[2024-05-28 15:50:07] [INFO ] Deduced a trap composed of 273 places in 430 ms of which 3 ms to minimize.
[2024-05-28 15:50:07] [INFO ] Deduced a trap composed of 33 places in 327 ms of which 4 ms to minimize.
[2024-05-28 15:50:08] [INFO ] Deduced a trap composed of 254 places in 436 ms of which 4 ms to minimize.
[2024-05-28 15:50:09] [INFO ] Deduced a trap composed of 324 places in 419 ms of which 6 ms to minimize.
SMT process timed out in 78968ms, After SMT, problems are : Problem set: 0 solved, 1768 unsolved
Search for dead transitions found 0 dead transitions in 79016ms
Finished structural reductions in LTL mode , in 1 iterations and 137458 ms. Remains : 506/506 places, 1774/1774 transitions.
Support contains 462 out of 506 places after structural reductions.
[2024-05-28 15:50:09] [INFO ] Flatten gal took : 328 ms
[2024-05-28 15:50:10] [INFO ] Flatten gal took : 211 ms
[2024-05-28 15:50:10] [INFO ] Input system was already deterministic with 1774 transitions.
Reduction of identical properties reduced properties to check from 52 to 49
RANDOM walk for 40001 steps (142 resets) in 1151 ms. (34 steps per ms) remains 7/49 properties
BEST_FIRST walk for 40004 steps (122 resets) in 706 ms. (56 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (88 resets) in 560 ms. (71 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (78 resets) in 1058 ms. (37 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (65 resets) in 486 ms. (82 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (72 resets) in 889 ms. (44 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (480 resets) in 517 ms. (77 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (124 resets) in 644 ms. (62 steps per ms) remains 7/7 properties
[2024-05-28 15:50:12] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
[2024-05-28 15:50:12] [INFO ] Invariant cache hit.
[2024-05-28 15:50:12] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 83/270 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp47 is UNSAT
At refinement iteration 6 (OVERLAPS) 230/500 variables, 28/48 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 0/48 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 3/503 variables, 3/51 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 0/51 constraints. Problems are: Problem set: 3 solved, 4 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp28 is UNSAT
After SMT solving in domain Real declared 506/2256 variables, and 54 constraints, problems are : Problem set: 7 solved, 0 unsolved in 1176 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 0/506 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 1423ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
[2024-05-28 15:50:14] [INFO ] Flatten gal took : 161 ms
[2024-05-28 15:50:14] [INFO ] Flatten gal took : 156 ms
[2024-05-28 15:50:15] [INFO ] Input system was already deterministic with 1774 transitions.
Support contains 304 out of 506 places (down from 379) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 506/506 places, 1774/1774 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 500 transition count 1758
Reduce places removed 16 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 24 rules applied. Total rules applied 40 place count 484 transition count 1750
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 48 place count 476 transition count 1750
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 48 place count 476 transition count 1690
Deduced a syphon composed of 60 places in 29 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 168 place count 416 transition count 1690
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 6 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 240 place count 380 transition count 1654
Applied a total of 240 rules in 399 ms. Remains 380 /506 variables (removed 126) and now considering 1654/1774 (removed 120) transitions.
Running 1648 sub problems to find dead transitions.
[2024-05-28 15:50:15] [INFO ] Flow matrix only has 1630 transitions (discarded 24 similar events)
// Phase 1: matrix 1630 rows 380 cols
[2024-05-28 15:50:15] [INFO ] Computed 48 invariants in 36 ms
[2024-05-28 15:50:15] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1648 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/374 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1648 unsolved
[2024-05-28 15:50:39] [INFO ] Deduced a trap composed of 63 places in 44 ms of which 1 ms to minimize.
[2024-05-28 15:50:40] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 0 ms to minimize.
[2024-05-28 15:50:40] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 1 ms to minimize.
[2024-05-28 15:50:40] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 2 ms to minimize.
[2024-05-28 15:50:41] [INFO ] Deduced a trap composed of 168 places in 240 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 374/2010 variables, and 47 constraints, problems are : Problem set: 0 solved, 1648 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 14/19 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/380 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1648/1648 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1648 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1648 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/374 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1648 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/374 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 1648 unsolved
[2024-05-28 15:50:56] [INFO ] Deduced a trap composed of 11 places in 526 ms of which 3 ms to minimize.
[2024-05-28 15:50:56] [INFO ] Deduced a trap composed of 162 places in 415 ms of which 3 ms to minimize.
[2024-05-28 15:51:09] [INFO ] Deduced a trap composed of 123 places in 415 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/2010 variables, and 50 constraints, problems are : Problem set: 0 solved, 1648 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 14/19 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/380 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1648 constraints, Known Traps: 8/8 constraints]
After SMT, in 56402ms problems are : Problem set: 0 solved, 1648 unsolved
Search for dead transitions found 0 dead transitions in 56418ms
[2024-05-28 15:51:12] [INFO ] Flow matrix only has 1630 transitions (discarded 24 similar events)
[2024-05-28 15:51:12] [INFO ] Invariant cache hit.
[2024-05-28 15:51:12] [INFO ] Implicit Places using invariants in 483 ms returned [330, 331, 332, 333]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 508 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 376/506 places, 1654/1774 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 372 transition count 1650
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 372 transition count 1650
Applied a total of 8 rules in 78 ms. Remains 372 /376 variables (removed 4) and now considering 1650/1654 (removed 4) transitions.
[2024-05-28 15:51:12] [INFO ] Flow matrix only has 1626 transitions (discarded 24 similar events)
// Phase 1: matrix 1626 rows 372 cols
[2024-05-28 15:51:12] [INFO ] Computed 44 invariants in 67 ms
[2024-05-28 15:51:13] [INFO ] Implicit Places using invariants in 884 ms returned []
[2024-05-28 15:51:13] [INFO ] Flow matrix only has 1626 transitions (discarded 24 similar events)
[2024-05-28 15:51:13] [INFO ] Invariant cache hit.
[2024-05-28 15:51:14] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 15:51:18] [INFO ] Implicit Places using invariants and state equation in 5461 ms returned []
Implicit Place search using SMT with State Equation took 6351 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 372/506 places, 1650/1774 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 63761 ms. Remains : 372/506 places, 1650/1774 transitions.
[2024-05-28 15:51:19] [INFO ] Flatten gal took : 121 ms
[2024-05-28 15:51:19] [INFO ] Flatten gal took : 116 ms
[2024-05-28 15:51:19] [INFO ] Input system was already deterministic with 1650 transitions.
[2024-05-28 15:51:19] [INFO ] Flatten gal took : 78 ms
[2024-05-28 15:51:19] [INFO ] Flatten gal took : 76 ms
[2024-05-28 15:51:19] [INFO ] Time to serialize gal into /tmp/CTLFireability5305635340040511320.gal : 38 ms
[2024-05-28 15:51:19] [INFO ] Time to serialize properties into /tmp/CTLFireability9095111624085588765.ctl : 4 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/CTLFireability5305635340040511320.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9095111624085588765.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.

BK_STOP 1716911516557

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.jar//
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S06J06T04"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is PolyORBLF-COL-S06J06T04, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r290-tajo-171654446600194"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S06J06T04.tgz
mv PolyORBLF-COL-S06J06T04 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;