Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445400194.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 greatspnxred
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 r289-tajo-171654445400194
=====================================================================

--------------------
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 1716856286401

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S06J06T04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 00:31:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 00:31:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 00:31:28] [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 00:31:28] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 00:31:28] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 689 ms
[2024-05-28 00:31:28] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 506 PT places and 7196.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
[2024-05-28 00:31:28] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-05-28 00:31:28] [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 40013 steps (3861 resets) in 1879 ms. (21 steps per ms) remains 10/46 properties
BEST_FIRST walk for 40002 steps (45 resets) in 293 ms. (136 steps per ms) remains 7/10 properties
BEST_FIRST walk for 40003 steps (188 resets) in 181 ms. (219 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (68 resets) in 311 ms. (128 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (76 resets) in 286 ms. (139 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (91 resets) in 188 ms. (211 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (61 resets) in 170 ms. (233 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (752 resets) in 243 ms. (163 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (200 resets) in 243 ms. (163 steps per ms) remains 7/7 properties
[2024-05-28 00:31:30] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 00:31:30] [INFO ] Computed 26 invariants in 7 ms
[2024-05-28 00:31:30] [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 00:31:30] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 8 ms to minimize.
[2024-05-28 00:31:30] [INFO ] Deduced a trap composed of 19 places in 25 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 379 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 439ms 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 00:31:30] [INFO ] Flatten gal took : 28 ms
[2024-05-28 00:31:30] [INFO ] Flatten gal took : 12 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 00:31:30] [INFO ] Unfolded HLPN to a Petri net with 506 places and 7154 transitions 59824 arcs in 145 ms.
[2024-05-28 00:31:30] [INFO ] Unfolded 16 HLPN properties in 2 ms.
[2024-05-28 00:31:30] [INFO ] Reduced 4680 identical enabling conditions.
[2024-05-28 00:31:30] [INFO ] Reduced 4680 identical enabling conditions.
[2024-05-28 00:31:30] [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 36 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 00:31:31] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
// Phase 1: matrix 1750 rows 506 cols
[2024-05-28 00:31:31] [INFO ] Computed 54 invariants in 92 ms
[2024-05-28 00:31:31] [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 00:31:59] [INFO ] Deduced a trap composed of 93 places in 142 ms of which 2 ms to minimize.
[2024-05-28 00:31:59] [INFO ] Deduced a trap composed of 94 places in 84 ms of which 1 ms to minimize.
[2024-05-28 00:31:59] [INFO ] Deduced a trap composed of 94 places in 86 ms of which 2 ms to minimize.
[2024-05-28 00:32:00] [INFO ] Deduced a trap composed of 279 places in 459 ms of which 4 ms to minimize.
[2024-05-28 00:32:01] [INFO ] Deduced a trap composed of 284 places in 414 ms of which 4 ms to minimize.
[2024-05-28 00:32:01] [INFO ] Deduced a trap composed of 133 places in 397 ms of which 3 ms to minimize.
[2024-05-28 00:32:02] [INFO ] Deduced a trap composed of 133 places in 366 ms of which 3 ms to minimize.
[2024-05-28 00:32:02] [INFO ] Deduced a trap composed of 118 places in 342 ms of which 4 ms to minimize.
[2024-05-28 00:32:02] [INFO ] Deduced a trap composed of 118 places in 372 ms of which 3 ms to minimize.
[2024-05-28 00:32:03] [INFO ] Deduced a trap composed of 241 places in 442 ms of which 5 ms to minimize.
[2024-05-28 00:32:04] [INFO ] Deduced a trap composed of 267 places in 477 ms of which 4 ms to minimize.
[2024-05-28 00:32:05] [INFO ] Deduced a trap composed of 93 places in 88 ms of which 1 ms to minimize.
[2024-05-28 00:32:06] [INFO ] Deduced a trap composed of 260 places in 436 ms of which 3 ms to minimize.
[2024-05-28 00:32:06] [INFO ] Deduced a trap composed of 278 places in 490 ms of which 3 ms to minimize.
[2024-05-28 00:32:07] [INFO ] Deduced a trap composed of 275 places in 463 ms of which 4 ms to minimize.
SMT process timed out in 36302ms, After SMT, problems are : Problem set: 0 solved, 1768 unsolved
Search for dead transitions found 0 dead transitions in 36336ms
[2024-05-28 00:32:07] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
[2024-05-28 00:32:07] [INFO ] Invariant cache hit.
[2024-05-28 00:32:07] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-28 00:32:07] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
[2024-05-28 00:32:07] [INFO ] Invariant cache hit.
[2024-05-28 00:32:08] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 00:32:09] [INFO ] Implicit Places using invariants and state equation in 2070 ms returned []
Implicit Place search using SMT with State Equation took 2253 ms to find 0 implicit places.
Running 1768 sub problems to find dead transitions.
[2024-05-28 00:32:09] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
[2024-05-28 00:32:09] [INFO ] Invariant cache hit.
[2024-05-28 00:32:09] [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 00:32:38] [INFO ] Deduced a trap composed of 94 places in 66 ms of which 1 ms to minimize.
[2024-05-28 00:32:38] [INFO ] Deduced a trap composed of 93 places in 73 ms of which 1 ms to minimize.
[2024-05-28 00:32:38] [INFO ] Deduced a trap composed of 94 places in 73 ms of which 1 ms to minimize.
[2024-05-28 00:32:39] [INFO ] Deduced a trap composed of 256 places in 331 ms of which 3 ms to minimize.
[2024-05-28 00:32:39] [INFO ] Deduced a trap composed of 107 places in 368 ms of which 3 ms to minimize.
[2024-05-28 00:32:41] [INFO ] Deduced a trap composed of 300 places in 503 ms of which 4 ms to minimize.
[2024-05-28 00:32:42] [INFO ] Deduced a trap composed of 266 places in 471 ms of which 3 ms to minimize.
[2024-05-28 00:32:42] [INFO ] Deduced a trap composed of 255 places in 442 ms of which 3 ms to minimize.
[2024-05-28 00:32:43] [INFO ] Deduced a trap composed of 94 places in 100 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 494/2256 variables, and 51 constraints, problems are : Problem set: 0 solved, 1768 unsolved in 30045 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 00:32:59] [INFO ] Deduced a trap composed of 292 places in 380 ms of which 3 ms to minimize.
[2024-05-28 00:33:07] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 3 ms to minimize.
[2024-05-28 00:33:24] [INFO ] Deduced a trap composed of 297 places in 358 ms of which 4 ms to minimize.
[2024-05-28 00:33:25] [INFO ] Deduced a trap composed of 247 places in 344 ms of which 3 ms to minimize.
[2024-05-28 00:33:25] [INFO ] Deduced a trap composed of 244 places in 379 ms of which 4 ms to minimize.
[2024-05-28 00:33:26] [INFO ] Deduced a trap composed of 216 places in 373 ms of which 3 ms to minimize.
[2024-05-28 00:33:26] [INFO ] Deduced a trap composed of 57 places in 348 ms of which 3 ms to minimize.
SMT process timed out in 76849ms, After SMT, problems are : Problem set: 0 solved, 1768 unsolved
Search for dead transitions found 0 dead transitions in 76876ms
Finished structural reductions in LTL mode , in 1 iterations and 115552 ms. Remains : 506/506 places, 1774/1774 transitions.
Support contains 462 out of 506 places after structural reductions.
[2024-05-28 00:33:26] [INFO ] Flatten gal took : 220 ms
[2024-05-28 00:33:27] [INFO ] Flatten gal took : 178 ms
[2024-05-28 00:33:27] [INFO ] Input system was already deterministic with 1774 transitions.
Reduction of identical properties reduced properties to check from 52 to 49
RANDOM walk for 40000 steps (188 resets) in 1461 ms. (27 steps per ms) remains 7/49 properties
BEST_FIRST walk for 40003 steps (127 resets) in 773 ms. (51 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (100 resets) in 548 ms. (72 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (81 resets) in 530 ms. (75 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (77 resets) in 610 ms. (65 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (70 resets) in 868 ms. (46 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (480 resets) in 586 ms. (68 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (150 resets) in 621 ms. (64 steps per ms) remains 7/7 properties
[2024-05-28 00:33:29] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
[2024-05-28 00:33:29] [INFO ] Invariant cache hit.
[2024-05-28 00:33:29] [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 1149 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 1421ms 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 00:33:31] [INFO ] Flatten gal took : 155 ms
[2024-05-28 00:33:31] [INFO ] Flatten gal took : 150 ms
[2024-05-28 00:33:32] [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 1 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 2 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 193 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 00:33:32] [INFO ] Flow matrix only has 1630 transitions (discarded 24 similar events)
// Phase 1: matrix 1630 rows 380 cols
[2024-05-28 00:33:32] [INFO ] Computed 48 invariants in 41 ms
[2024-05-28 00:33:32] [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 00:33:59] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
[2024-05-28 00:33:59] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 1 ms to minimize.
[2024-05-28 00:33:59] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 1 ms to minimize.
[2024-05-28 00:33:59] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-05-28 00:34:01] [INFO ] Deduced a trap composed of 168 places in 357 ms of which 3 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 20034 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 00:34:14] [INFO ] Deduced a trap composed of 11 places in 416 ms of which 3 ms to minimize.
[2024-05-28 00:34:15] [INFO ] Deduced a trap composed of 162 places in 402 ms of which 4 ms to minimize.
[2024-05-28 00:34:27] [INFO ] Deduced a trap composed of 123 places in 348 ms of which 2 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 Int declared 374/2010 variables, and 50 constraints, problems are : Problem set: 0 solved, 1648 unsolved in 20026 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 57851ms problems are : Problem set: 0 solved, 1648 unsolved
Search for dead transitions found 0 dead transitions in 57874ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 58075 ms. Remains : 380/506 places, 1654/1774 transitions.
[2024-05-28 00:34:30] [INFO ] Flatten gal took : 90 ms
[2024-05-28 00:34:30] [INFO ] Flatten gal took : 91 ms
[2024-05-28 00:34:30] [INFO ] Input system was already deterministic with 1654 transitions.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 1774/1774 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 500 transition count 1774
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 496 transition count 1770
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 496 transition count 1770
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 492 transition count 1766
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 492 transition count 1766
Applied a total of 22 rules in 53 ms. Remains 492 /506 variables (removed 14) and now considering 1766/1774 (removed 8) transitions.
Running 1760 sub problems to find dead transitions.
[2024-05-28 00:34:30] [INFO ] Flow matrix only has 1742 transitions (discarded 24 similar events)
// Phase 1: matrix 1742 rows 492 cols
[2024-05-28 00:34:30] [INFO ] Computed 48 invariants in 63 ms
[2024-05-28 00:34:30] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
[2024-05-28 00:35:00] [INFO ] Deduced a trap composed of 3 places in 198 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/2234 variables, and 38 constraints, problems are : Problem set: 0 solved, 1760 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 11/15 constraints, Generalized P Invariants (flows): 26/33 constraints, State Equation: 0/492 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1760/1760 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1760 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
[2024-05-28 00:35:23] [INFO ] Deduced a trap composed of 74 places in 184 ms of which 3 ms to minimize.
[2024-05-28 00:35:24] [INFO ] Deduced a trap composed of 199 places in 180 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/2234 variables, and 40 constraints, problems are : Problem set: 0 solved, 1760 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 11/15 constraints, Generalized P Invariants (flows): 26/33 constraints, State Equation: 0/492 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1760 constraints, Known Traps: 3/3 constraints]
After SMT, in 57049ms problems are : Problem set: 0 solved, 1760 unsolved
Search for dead transitions found 0 dead transitions in 57066ms
Finished structural reductions in LTL mode , in 1 iterations and 57126 ms. Remains : 492/506 places, 1766/1774 transitions.
[2024-05-28 00:35:28] [INFO ] Flatten gal took : 121 ms
[2024-05-28 00:35:28] [INFO ] Flatten gal took : 97 ms
[2024-05-28 00:35:28] [INFO ] Input system was already deterministic with 1766 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 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 500 transition count 1746
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 472 transition count 1746
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 56 place count 472 transition count 1686
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 176 place count 412 transition count 1686
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 256 place count 372 transition count 1646
Applied a total of 256 rules in 100 ms. Remains 372 /506 variables (removed 134) and now considering 1646/1774 (removed 128) transitions.
Running 1640 sub problems to find dead transitions.
[2024-05-28 00:35:28] [INFO ] Flow matrix only has 1622 transitions (discarded 24 similar events)
// Phase 1: matrix 1622 rows 372 cols
[2024-05-28 00:35:28] [INFO ] Computed 48 invariants in 40 ms
[2024-05-28 00:35:28] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-28 00:35:56] [INFO ] Deduced a trap composed of 61 places in 99 ms of which 1 ms to minimize.
[2024-05-28 00:35:56] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 1 ms to minimize.
[2024-05-28 00:35:56] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 1 ms to minimize.
[2024-05-28 00:35:57] [INFO ] Deduced a trap composed of 160 places in 487 ms of which 2 ms to minimize.
[2024-05-28 00:35:57] [INFO ] Deduced a trap composed of 61 places in 87 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/1994 variables, and 47 constraints, problems are : Problem set: 0 solved, 1640 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/372 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1640/1640 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1640 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-28 00:36:12] [INFO ] Deduced a trap composed of 160 places in 361 ms of which 3 ms to minimize.
[2024-05-28 00:36:13] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/1994 variables, and 49 constraints, problems are : Problem set: 0 solved, 1640 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 12/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/372 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1640 constraints, Known Traps: 7/7 constraints]
After SMT, in 59308ms problems are : Problem set: 0 solved, 1640 unsolved
Search for dead transitions found 0 dead transitions in 59327ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 59432 ms. Remains : 372/506 places, 1646/1774 transitions.
[2024-05-28 00:36:27] [INFO ] Flatten gal took : 64 ms
[2024-05-28 00:36:27] [INFO ] Flatten gal took : 70 ms
[2024-05-28 00:36:28] [INFO ] Input system was already deterministic with 1646 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 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 500 transition count 1742
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 468 transition count 1742
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 64 place count 468 transition count 1686
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 176 place count 412 transition count 1686
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 364 transition count 1638
Applied a total of 272 rules in 93 ms. Remains 364 /506 variables (removed 142) and now considering 1638/1774 (removed 136) transitions.
Running 1632 sub problems to find dead transitions.
[2024-05-28 00:36:28] [INFO ] Flow matrix only has 1614 transitions (discarded 24 similar events)
// Phase 1: matrix 1614 rows 364 cols
[2024-05-28 00:36:28] [INFO ] Computed 48 invariants in 26 ms
[2024-05-28 00:36:28] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 26/42 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
[2024-05-28 00:36:57] [INFO ] Deduced a trap composed of 59 places in 136 ms of which 9 ms to minimize.
[2024-05-28 00:36:57] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 1 ms to minimize.
[2024-05-28 00:36:57] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 1 ms to minimize.
[2024-05-28 00:36:58] [INFO ] Deduced a trap composed of 164 places in 687 ms of which 29 ms to minimize.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-COL-S06J06T04

IS_COLORED=1
IS_NUPN=

LOADING model.pnml ...
MODEL CLASS: SYMMETRIC NET
PLACES: 81
TRANSITIONS: 65
CONSTANTS: 0
TEMPLATE VARS: 0
COLOR CLASSES: 6
COLOR VARS: 25
ARCS: 254
LOADING TIME: 0.509

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 506
TRANSITIONS: 7154
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 59824
UNFOLDING TIME: 1.193

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.413
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 2.5
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 816
MODEL NAME: /home/mcc/execution/model
506 places, 7154 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML

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="greatspnxred"
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 greatspnxred"
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 r289-tajo-171654445400194"
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 ;