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.r516-tajo-171654446400138.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 ltsminxred
Input is PolyORBLF-COL-S04J04T10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446400138
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 10K Apr 11 17:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 11 17:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 17:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 11 17:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 17:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 11 17:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 11 17:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 11 17:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-COL-S04J04T10-CTLFireability-2024-00
FORMULA_NAME PolyORBLF-COL-S04J04T10-CTLFireability-2024-01
FORMULA_NAME PolyORBLF-COL-S04J04T10-CTLFireability-2024-02
FORMULA_NAME PolyORBLF-COL-S04J04T10-CTLFireability-2024-03
FORMULA_NAME PolyORBLF-COL-S04J04T10-CTLFireability-2024-04
FORMULA_NAME PolyORBLF-COL-S04J04T10-CTLFireability-2024-05
FORMULA_NAME PolyORBLF-COL-S04J04T10-CTLFireability-2024-06
FORMULA_NAME PolyORBLF-COL-S04J04T10-CTLFireability-2024-07
FORMULA_NAME PolyORBLF-COL-S04J04T10-CTLFireability-2024-08
FORMULA_NAME PolyORBLF-COL-S04J04T10-CTLFireability-2024-09
FORMULA_NAME PolyORBLF-COL-S04J04T10-CTLFireability-2024-10
FORMULA_NAME PolyORBLF-COL-S04J04T10-CTLFireability-2024-11
FORMULA_NAME PolyORBLF-COL-S04J04T10-CTLFireability-2024-12
FORMULA_NAME PolyORBLF-COL-S04J04T10-CTLFireability-2024-13
FORMULA_NAME PolyORBLF-COL-S04J04T10-CTLFireability-2024-14
FORMULA_NAME PolyORBLF-COL-S04J04T10-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717250071360

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J04T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:54:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 13:54:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:54:32] [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-06-01 13:54:33] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 13:54:33] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 570 ms
[2024-06-01 13:54:33] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 870 PT places and 5136.0 transition bindings in 29 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
[2024-06-01 13:54:33] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-06-01 13:54:33] [INFO ] Skeletonized 13 HLPN properties in 3 ms. Removed 3 properties that had guard overlaps.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (14 resets) in 2113 ms. (18 steps per ms) remains 10/57 properties
BEST_FIRST walk for 40001 steps (8 resets) in 337 ms. (118 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (13 resets) in 229 ms. (173 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (9 resets) in 260 ms. (153 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (12 resets) in 303 ms. (131 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (13 resets) in 264 ms. (150 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 233 ms. (170 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 168 ms. (236 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 187 ms. (212 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (10 resets) in 124 ms. (320 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 174 ms. (228 steps per ms) remains 10/10 properties
[2024-06-01 13:54:35] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 13:54:35] [INFO ] Computed 26 invariants in 8 ms
[2024-06-01 13:54:35] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp9 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem AtomicPropp52 is UNSAT
At refinement iteration 3 (OVERLAPS) 27/68 variables, 8/12 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 2/14 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-06-01 13:54:36] [INFO ] Deduced a trap composed of 3 places in 169 ms of which 35 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 1/15 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1/69 variables, 1/16 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp56 is UNSAT
After SMT solving in domain Real declared 81/145 variables, and 27 constraints, problems are : Problem set: 10 solved, 0 unsolved in 873 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: 10/10 constraints, Known Traps: 1/1 constraints]
After SMT, in 967ms problems are : Problem set: 10 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 10 atomic propositions for a total of 12 simplifications.
FORMULA PolyORBLF-COL-S04J04T10-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:54:36] [INFO ] Flatten gal took : 58 ms
[2024-06-01 13:54:36] [INFO ] Flatten gal took : 7 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-06-01 13:54:36] [INFO ] Unfolded HLPN to a Petri net with 870 places and 5034 transitions 34774 arcs in 158 ms.
[2024-06-01 13:54:36] [INFO ] Unfolded 15 HLPN properties in 3 ms.
[2024-06-01 13:54:36] [INFO ] Reduced 440 identical enabling conditions.
[2024-06-01 13:54:36] [INFO ] Reduced 2210 identical enabling conditions.
[2024-06-01 13:54:36] [INFO ] Reduced 60 identical enabling conditions.
[2024-06-01 13:54:36] [INFO ] Reduced 60 identical enabling conditions.
[2024-06-01 13:54:36] [INFO ] Reduced 2210 identical enabling conditions.
Ensure Unique test removed 2710 transitions
Reduce redundant transitions removed 2710 transitions.
Support contains 838 out of 870 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Applied a total of 0 rules in 43 ms. Remains 870 /870 variables (removed 0) and now considering 2324/2324 (removed 0) transitions.
Running 2320 sub problems to find dead transitions.
[2024-06-01 13:54:36] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
// Phase 1: matrix 2284 rows 870 cols
[2024-06-01 13:54:36] [INFO ] Computed 58 invariants in 94 ms
[2024-06-01 13:54:36] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/862 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2320 unsolved
SMT process timed out in 34393ms, After SMT, problems are : Problem set: 0 solved, 2320 unsolved
Search for dead transitions found 0 dead transitions in 34431ms
[2024-06-01 13:55:11] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-06-01 13:55:11] [INFO ] Invariant cache hit.
[2024-06-01 13:55:11] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-06-01 13:55:11] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-06-01 13:55:11] [INFO ] Invariant cache hit.
[2024-06-01 13:55:12] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 13:55:14] [INFO ] Implicit Places using invariants and state equation in 3439 ms returned []
Implicit Place search using SMT with State Equation took 3585 ms to find 0 implicit places.
Running 2320 sub problems to find dead transitions.
[2024-06-01 13:55:14] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-06-01 13:55:14] [INFO ] Invariant cache hit.
[2024-06-01 13:55:14] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/862 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/862 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 2320 unsolved
[2024-06-01 13:55:53] [INFO ] Deduced a trap composed of 75 places in 139 ms of which 3 ms to minimize.
[2024-06-01 13:55:53] [INFO ] Deduced a trap composed of 75 places in 78 ms of which 2 ms to minimize.
[2024-06-01 13:55:53] [INFO ] Deduced a trap composed of 75 places in 85 ms of which 2 ms to minimize.
[2024-06-01 13:55:53] [INFO ] Deduced a trap composed of 75 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:55:53] [INFO ] Deduced a trap composed of 75 places in 176 ms of which 1 ms to minimize.
[2024-06-01 13:55:53] [INFO ] Deduced a trap composed of 75 places in 120 ms of which 1 ms to minimize.
[2024-06-01 13:55:54] [INFO ] Deduced a trap composed of 75 places in 83 ms of which 1 ms to minimize.
[2024-06-01 13:55:54] [INFO ] Deduced a trap composed of 75 places in 71 ms of which 2 ms to minimize.
[2024-06-01 13:55:54] [INFO ] Deduced a trap composed of 75 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:55:56] [INFO ] Deduced a trap composed of 261 places in 665 ms of which 7 ms to minimize.
[2024-06-01 13:55:56] [INFO ] Deduced a trap composed of 263 places in 635 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 862/3154 variables, and 61 constraints, problems are : Problem set: 0 solved, 2320 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 12/16 constraints, Generalized P Invariants (flows): 38/42 constraints, State Equation: 0/870 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2320/2320 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/862 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/862 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 2320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/862 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 2320 unsolved
[2024-06-01 13:56:00] [INFO ] Deduced a trap composed of 75 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:56:03] [INFO ] Deduced a trap composed of 405 places in 572 ms of which 6 ms to minimize.
[2024-06-01 13:56:05] [INFO ] Deduced a trap composed of 79 places in 424 ms of which 4 ms to minimize.
[2024-06-01 13:56:21] [INFO ] Deduced a trap composed of 23 places in 287 ms of which 4 ms to minimize.
[2024-06-01 13:56:22] [INFO ] Deduced a trap composed of 480 places in 560 ms of which 6 ms to minimize.
[2024-06-01 13:56:23] [INFO ] Deduced a trap composed of 536 places in 523 ms of which 5 ms to minimize.
[2024-06-01 13:56:23] [INFO ] Deduced a trap composed of 513 places in 447 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 862/3154 variables, and 68 constraints, problems are : Problem set: 0 solved, 2320 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 12/16 constraints, Generalized P Invariants (flows): 38/42 constraints, State Equation: 0/870 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2320 constraints, Known Traps: 18/18 constraints]
After SMT, in 73159ms problems are : Problem set: 0 solved, 2320 unsolved
Search for dead transitions found 0 dead transitions in 73181ms
Finished structural reductions in LTL mode , in 1 iterations and 111313 ms. Remains : 870/870 places, 2324/2324 transitions.
Support contains 838 out of 870 places after structural reductions.
[2024-06-01 13:56:28] [INFO ] Flatten gal took : 269 ms
[2024-06-01 13:56:29] [INFO ] Flatten gal took : 222 ms
[2024-06-01 13:56:29] [INFO ] Input system was already deterministic with 2324 transitions.
Reduction of identical properties reduced properties to check from 75 to 72
RANDOM walk for 40002 steps (10 resets) in 2468 ms. (16 steps per ms) remains 12/72 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1364 ms. (29 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (9 resets) in 656 ms. (60 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (9 resets) in 629 ms. (63 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 745 ms. (53 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 765 ms. (52 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 901 ms. (44 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 613 ms. (65 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1049 ms. (38 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 987 ms. (40 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1748 ms. (22 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1077 ms. (37 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 831 ms. (48 steps per ms) remains 11/11 properties
[2024-06-01 13:56:34] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-06-01 13:56:34] [INFO ] Invariant cache hit.
[2024-06-01 13:56:34] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/496 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp9 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/496 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 146/642 variables, 9/14 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/642 variables, 2/16 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 12/654 variables, 4/20 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/654 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
After SMT solving in domain Real declared 870/3154 variables, and 58 constraints, problems are : Problem set: 11 solved, 0 unsolved in 2074 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/870 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 11/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 4726ms problems are : Problem set: 11 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 11 atomic propositions for a total of 15 simplifications.
FORMULA PolyORBLF-COL-S04J04T10-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T10-CTLFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:56:39] [INFO ] Flatten gal took : 187 ms
[2024-06-01 13:56:40] [INFO ] Flatten gal took : 136 ms
[2024-06-01 13:56:40] [INFO ] Input system was already deterministic with 2324 transitions.
Support contains 730 out of 870 places (down from 771) after GAL structural reductions.
FORMULA PolyORBLF-COL-S04J04T10-CTLFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 866 transition count 2324
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 856 transition count 2314
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 856 transition count 2314
Applied a total of 24 rules in 80 ms. Remains 856 /870 variables (removed 14) and now considering 2314/2324 (removed 10) transitions.
Running 2310 sub problems to find dead transitions.
[2024-06-01 13:56:40] [INFO ] Flow matrix only has 2274 transitions (discarded 40 similar events)
// Phase 1: matrix 2274 rows 856 cols
[2024-06-01 13:56:40] [INFO ] Computed 54 invariants in 115 ms
[2024-06-01 13:56:40] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/852 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2310 unsolved
SMT process timed out in 34227ms, After SMT, problems are : Problem set: 0 solved, 2310 unsolved
Search for dead transitions found 0 dead transitions in 34251ms
Finished structural reductions in LTL mode , in 1 iterations and 34337 ms. Remains : 856/870 places, 2314/2324 transitions.
[2024-06-01 13:57:14] [INFO ] Flatten gal took : 87 ms
[2024-06-01 13:57:15] [INFO ] Flatten gal took : 95 ms
[2024-06-01 13:57:15] [INFO ] Input system was already deterministic with 2314 transitions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 866 transition count 2324
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 856 transition count 2314
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 856 transition count 2314
Applied a total of 24 rules in 51 ms. Remains 856 /870 variables (removed 14) and now considering 2314/2324 (removed 10) transitions.
Running 2310 sub problems to find dead transitions.
[2024-06-01 13:57:15] [INFO ] Flow matrix only has 2274 transitions (discarded 40 similar events)
[2024-06-01 13:57:15] [INFO ] Invariant cache hit.
[2024-06-01 13:57:15] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/852 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2310 unsolved
SMT process timed out in 33270ms, After SMT, problems are : Problem set: 0 solved, 2310 unsolved
Search for dead transitions found 0 dead transitions in 33371ms
Finished structural reductions in LTL mode , in 1 iterations and 33428 ms. Remains : 856/870 places, 2314/2324 transitions.
[2024-06-01 13:57:48] [INFO ] Flatten gal took : 73 ms
[2024-06-01 13:57:48] [INFO ] Flatten gal took : 78 ms
[2024-06-01 13:57:49] [INFO ] Input system was already deterministic with 2314 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 866 transition count 2294
Reduce places removed 30 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 40 rules applied. Total rules applied 70 place count 836 transition count 2284
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 80 place count 826 transition count 2284
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 80 place count 826 transition count 2224
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 200 place count 766 transition count 2224
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 360 place count 686 transition count 2144
Applied a total of 360 rules in 197 ms. Remains 686 /870 variables (removed 184) and now considering 2144/2324 (removed 180) transitions.
Running 2140 sub problems to find dead transitions.
[2024-06-01 13:57:49] [INFO ] Flow matrix only has 2104 transitions (discarded 40 similar events)
// Phase 1: matrix 2104 rows 686 cols
[2024-06-01 13:57:49] [INFO ] Computed 54 invariants in 35 ms
[2024-06-01 13:57:49] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/682 variables, 37/49 constraints. Problems are: Problem set: 0 solved, 2140 unsolved
[2024-06-01 13:58:21] [INFO ] Deduced a trap composed of 59 places in 144 ms of which 4 ms to minimize.
[2024-06-01 13:58:21] [INFO ] Deduced a trap composed of 57 places in 111 ms of which 2 ms to minimize.
[2024-06-01 13:58:21] [INFO ] Deduced a trap composed of 57 places in 97 ms of which 1 ms to minimize.
[2024-06-01 13:58:21] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:58:21] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:58:21] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:58:21] [INFO ] Deduced a trap composed of 57 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:58:21] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:58:21] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 682/2790 variables, and 58 constraints, problems are : Problem set: 0 solved, 2140 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 37/40 constraints, State Equation: 0/686 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2140/2140 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/682 variables, 37/49 constraints. Problems are: Problem set: 0 solved, 2140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/682 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 2140 unsolved
[2024-06-01 13:58:24] [INFO ] Deduced a trap composed of 57 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:58:25] [INFO ] Deduced a trap composed of 389 places in 366 ms of which 3 ms to minimize.
[2024-06-01 13:58:25] [INFO ] Deduced a trap composed of 379 places in 521 ms of which 5 ms to minimize.
[2024-06-01 13:58:26] [INFO ] Deduced a trap composed of 391 places in 482 ms of which 4 ms to minimize.
[2024-06-01 13:58:26] [INFO ] Deduced a trap composed of 379 places in 430 ms of which 4 ms to minimize.
[2024-06-01 13:58:27] [INFO ] Deduced a trap composed of 366 places in 461 ms of which 5 ms to minimize.
[2024-06-01 13:58:27] [INFO ] Deduced a trap composed of 44 places in 652 ms of which 4 ms to minimize.
[2024-06-01 13:58:28] [INFO ] Deduced a trap composed of 351 places in 430 ms of which 4 ms to minimize.
[2024-06-01 13:58:28] [INFO ] Deduced a trap composed of 386 places in 412 ms of which 3 ms to minimize.
[2024-06-01 13:58:29] [INFO ] Deduced a trap composed of 398 places in 382 ms of which 4 ms to minimize.
[2024-06-01 13:58:29] [INFO ] Deduced a trap composed of 384 places in 374 ms of which 3 ms to minimize.
[2024-06-01 13:58:30] [INFO ] Deduced a trap composed of 390 places in 370 ms of which 5 ms to minimize.
[2024-06-01 13:58:30] [INFO ] Deduced a trap composed of 350 places in 384 ms of which 4 ms to minimize.
[2024-06-01 13:58:30] [INFO ] Deduced a trap composed of 383 places in 360 ms of which 4 ms to minimize.
[2024-06-01 13:58:31] [INFO ] Deduced a trap composed of 361 places in 350 ms of which 3 ms to minimize.
[2024-06-01 13:58:35] [INFO ] Deduced a trap composed of 189 places in 423 ms of which 4 ms to minimize.
[2024-06-01 13:58:35] [INFO ] Deduced a trap composed of 87 places in 387 ms of which 4 ms to minimize.
[2024-06-01 13:58:37] [INFO ] Deduced a trap composed of 39 places in 403 ms of which 4 ms to minimize.
[2024-06-01 13:58:39] [INFO ] Deduced a trap composed of 437 places in 437 ms of which 5 ms to minimize.
[2024-06-01 13:58:40] [INFO ] Deduced a trap composed of 404 places in 402 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/682 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 2140 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 682/2790 variables, and 78 constraints, problems are : Problem set: 0 solved, 2140 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 37/40 constraints, State Equation: 0/686 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2140 constraints, Known Traps: 29/29 constraints]
After SMT, in 52943ms problems are : Problem set: 0 solved, 2140 unsolved
Search for dead transitions found 0 dead transitions in 52968ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 53170 ms. Remains : 686/870 places, 2144/2324 transitions.
[2024-06-01 13:58:42] [INFO ] Flatten gal took : 91 ms
[2024-06-01 13:58:42] [INFO ] Flatten gal took : 115 ms
[2024-06-01 13:58:42] [INFO ] Input system was already deterministic with 2144 transitions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 866 transition count 2324
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 856 transition count 2314
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 856 transition count 2314
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 846 transition count 2304
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 846 transition count 2304
Applied a total of 44 rules in 96 ms. Remains 846 /870 variables (removed 24) and now considering 2304/2324 (removed 20) transitions.
Running 2300 sub problems to find dead transitions.
[2024-06-01 13:58:42] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 846 cols
[2024-06-01 13:58:42] [INFO ] Computed 54 invariants in 43 ms
[2024-06-01 13:58:42] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/842 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
SMT process timed out in 32471ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 32504ms
Finished structural reductions in LTL mode , in 1 iterations and 32608 ms. Remains : 846/870 places, 2304/2324 transitions.
[2024-06-01 13:59:15] [INFO ] Flatten gal took : 65 ms
[2024-06-01 13:59:15] [INFO ] Flatten gal took : 72 ms
[2024-06-01 13:59:15] [INFO ] Input system was already deterministic with 2304 transitions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 866 transition count 2324
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 856 transition count 2314
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 856 transition count 2314
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 846 transition count 2304
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 846 transition count 2304
Applied a total of 44 rules in 42 ms. Remains 846 /870 variables (removed 24) and now considering 2304/2324 (removed 20) transitions.
Running 2300 sub problems to find dead transitions.
[2024-06-01 13:59:15] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 13:59:15] [INFO ] Invariant cache hit.
[2024-06-01 13:59:15] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/842 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
SMT process timed out in 34891ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 34915ms
Finished structural reductions in LTL mode , in 1 iterations and 34964 ms. Remains : 846/870 places, 2304/2324 transitions.
[2024-06-01 13:59:50] [INFO ] Flatten gal took : 70 ms
[2024-06-01 13:59:50] [INFO ] Flatten gal took : 120 ms
[2024-06-01 13:59:50] [INFO ] Input system was already deterministic with 2304 transitions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 866 transition count 2324
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 856 transition count 2314
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 856 transition count 2314
Applied a total of 24 rules in 33 ms. Remains 856 /870 variables (removed 14) and now considering 2314/2324 (removed 10) transitions.
Running 2310 sub problems to find dead transitions.
[2024-06-01 13:59:51] [INFO ] Flow matrix only has 2274 transitions (discarded 40 similar events)
// Phase 1: matrix 2274 rows 856 cols
[2024-06-01 13:59:51] [INFO ] Computed 54 invariants in 34 ms
[2024-06-01 13:59:51] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/852 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2310 unsolved
SMT process timed out in 34922ms, After SMT, problems are : Problem set: 0 solved, 2310 unsolved
Search for dead transitions found 0 dead transitions in 34953ms
Finished structural reductions in LTL mode , in 1 iterations and 34992 ms. Remains : 856/870 places, 2314/2324 transitions.
[2024-06-01 14:00:26] [INFO ] Flatten gal took : 128 ms
[2024-06-01 14:00:26] [INFO ] Flatten gal took : 115 ms
[2024-06-01 14:00:26] [INFO ] Input system was already deterministic with 2314 transitions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 866 transition count 2324
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 856 transition count 2314
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 856 transition count 2314
Applied a total of 24 rules in 38 ms. Remains 856 /870 variables (removed 14) and now considering 2314/2324 (removed 10) transitions.
Running 2310 sub problems to find dead transitions.
[2024-06-01 14:00:26] [INFO ] Flow matrix only has 2274 transitions (discarded 40 similar events)
[2024-06-01 14:00:26] [INFO ] Invariant cache hit.
[2024-06-01 14:00:26] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/852 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2310 unsolved
SMT process timed out in 33351ms, After SMT, problems are : Problem set: 0 solved, 2310 unsolved
Search for dead transitions found 0 dead transitions in 33379ms
Finished structural reductions in LTL mode , in 1 iterations and 33430 ms. Remains : 856/870 places, 2314/2324 transitions.
[2024-06-01 14:00:59] [INFO ] Flatten gal took : 68 ms
[2024-06-01 14:01:00] [INFO ] Flatten gal took : 73 ms
[2024-06-01 14:01:00] [INFO ] Input system was already deterministic with 2314 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 866 transition count 2234
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 776 transition count 2234
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 180 place count 776 transition count 2174
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 300 place count 716 transition count 2174
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 500 place count 616 transition count 2074
Applied a total of 500 rules in 214 ms. Remains 616 /870 variables (removed 254) and now considering 2074/2324 (removed 250) transitions.
Running 2070 sub problems to find dead transitions.
[2024-06-01 14:01:00] [INFO ] Flow matrix only has 2034 transitions (discarded 40 similar events)
// Phase 1: matrix 2034 rows 616 cols
[2024-06-01 14:01:00] [INFO ] Computed 54 invariants in 32 ms
[2024-06-01 14:01:00] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2070 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 2070 unsolved
[2024-06-01 14:01:32] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 2 ms to minimize.
[2024-06-01 14:01:32] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:01:32] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:01:32] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 0 ms to minimize.
[2024-06-01 14:01:32] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:01:32] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:01:32] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:01:32] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:01:32] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:01:34] [INFO ] Deduced a trap composed of 272 places in 485 ms of which 5 ms to minimize.
[2024-06-01 14:01:34] [INFO ] Deduced a trap composed of 286 places in 412 ms of which 4 ms to minimize.
[2024-06-01 14:01:35] [INFO ] Deduced a trap composed of 279 places in 492 ms of which 4 ms to minimize.
[2024-06-01 14:01:35] [INFO ] Deduced a trap composed of 298 places in 455 ms of which 4 ms to minimize.
[2024-06-01 14:01:36] [INFO ] Deduced a trap composed of 23 places in 446 ms of which 3 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 612/2650 variables, and 64 constraints, problems are : Problem set: 0 solved, 2070 unsolved in 20063 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 40/41 constraints, State Equation: 0/616 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2070/2070 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2070 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2070 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 2070 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 2070 unsolved
[2024-06-01 14:01:38] [INFO ] Deduced a trap composed of 50 places in 65 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 Int declared 612/2650 variables, and 65 constraints, problems are : Problem set: 0 solved, 2070 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 40/41 constraints, State Equation: 0/616 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2070 constraints, Known Traps: 15/15 constraints]
After SMT, in 56409ms problems are : Problem set: 0 solved, 2070 unsolved
Search for dead transitions found 0 dead transitions in 56431ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 56649 ms. Remains : 616/870 places, 2074/2324 transitions.
[2024-06-01 14:01:56] [INFO ] Flatten gal took : 71 ms
[2024-06-01 14:01:56] [INFO ] Flatten gal took : 75 ms
[2024-06-01 14:01:57] [INFO ] Input system was already deterministic with 2074 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 866 transition count 2264
Reduce places removed 60 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 70 rules applied. Total rules applied 130 place count 806 transition count 2254
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 140 place count 796 transition count 2254
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 140 place count 796 transition count 2154
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 340 place count 696 transition count 2154
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 540 place count 596 transition count 2054
Applied a total of 540 rules in 82 ms. Remains 596 /870 variables (removed 274) and now considering 2054/2324 (removed 270) transitions.
Running 2050 sub problems to find dead transitions.
[2024-06-01 14:01:57] [INFO ] Flow matrix only has 2014 transitions (discarded 40 similar events)
// Phase 1: matrix 2014 rows 596 cols
[2024-06-01 14:01:57] [INFO ] Computed 54 invariants in 24 ms
[2024-06-01 14:01:57] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2050 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 2050 unsolved
[2024-06-01 14:02:29] [INFO ] Deduced a trap composed of 48 places in 136 ms of which 3 ms to minimize.
[2024-06-01 14:02:30] [INFO ] Deduced a trap composed of 48 places in 172 ms of which 2 ms to minimize.
[2024-06-01 14:02:30] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 2 ms to minimize.
[2024-06-01 14:02:30] [INFO ] Deduced a trap composed of 49 places in 168 ms of which 2 ms to minimize.
[2024-06-01 14:02:30] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 2 ms to minimize.
[2024-06-01 14:02:30] [INFO ] Deduced a trap composed of 48 places in 118 ms of which 2 ms to minimize.
[2024-06-01 14:02:30] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:02:30] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:02:30] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:02:31] [INFO ] Deduced a trap composed of 279 places in 525 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2610 variables, and 60 constraints, problems are : Problem set: 0 solved, 2050 unsolved in 20054 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 38/39 constraints, State Equation: 0/596 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2050/2050 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2050 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2050 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 2050 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 2050 unsolved
[2024-06-01 14:02:34] [INFO ] Deduced a trap composed of 48 places in 81 ms of which 1 ms to minimize.
[2024-06-01 14:02:41] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2610 variables, and 62 constraints, problems are : Problem set: 0 solved, 2050 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 38/39 constraints, State Equation: 0/596 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2050 constraints, Known Traps: 12/12 constraints]
After SMT, in 54648ms problems are : Problem set: 0 solved, 2050 unsolved
Search for dead transitions found 0 dead transitions in 54667ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 54755 ms. Remains : 596/870 places, 2054/2324 transitions.
[2024-06-01 14:02:51] [INFO ] Flatten gal took : 64 ms
[2024-06-01 14:02:52] [INFO ] Flatten gal took : 69 ms
[2024-06-01 14:02:52] [INFO ] Input system was already deterministic with 2054 transitions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 866 transition count 2324
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 856 transition count 2314
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 856 transition count 2314
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 846 transition count 2304
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 846 transition count 2304
Applied a total of 44 rules in 78 ms. Remains 846 /870 variables (removed 24) and now considering 2304/2324 (removed 20) transitions.
Running 2300 sub problems to find dead transitions.
[2024-06-01 14:02:52] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 846 cols
[2024-06-01 14:02:52] [INFO ] Computed 54 invariants in 68 ms
[2024-06-01 14:02:52] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 10.0)
(s203 1.0)
(s204 0.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 1.0)
(s408 1.0)
(s413 0.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 0.0)
(s485 1.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 1.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/842 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
SMT process timed out in 34658ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 34687ms
Finished structural reductions in LTL mode , in 1 iterations and 34772 ms. Remains : 846/870 places, 2304/2324 transitions.
[2024-06-01 14:03:27] [INFO ] Flatten gal took : 71 ms
[2024-06-01 14:03:27] [INFO ] Flatten gal took : 76 ms
[2024-06-01 14:03:27] [INFO ] Input system was already deterministic with 2304 transitions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 866 transition count 2324
Applied a total of 4 rules in 63 ms. Remains 866 /870 variables (removed 4) and now considering 2324/2324 (removed 0) transitions.
Running 2320 sub problems to find dead transitions.
[2024-06-01 14:03:27] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
// Phase 1: matrix 2284 rows 866 cols
[2024-06-01 14:03:27] [INFO ] Computed 54 invariants in 35 ms
[2024-06-01 14:03:27] [INFO ] State equation strengthened by 200 read => feed constraints.
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PolyORBLF-COL-S04J04T10-CTLFireability-2024-00
Could not compute solution for formula : PolyORBLF-COL-S04J04T10-CTLFireability-2024-01
Could not compute solution for formula : PolyORBLF-COL-S04J04T10-CTLFireability-2024-02
Could not compute solution for formula : PolyORBLF-COL-S04J04T10-CTLFireability-2024-03
Could not compute solution for formula : PolyORBLF-COL-S04J04T10-CTLFireability-2024-04
Could not compute solution for formula : PolyORBLF-COL-S04J04T10-CTLFireability-2024-05
Could not compute solution for formula : PolyORBLF-COL-S04J04T10-CTLFireability-2024-06
Could not compute solution for formula : PolyORBLF-COL-S04J04T10-CTLFireability-2024-07
Could not compute solution for formula : PolyORBLF-COL-S04J04T10-CTLFireability-2024-08
Could not compute solution for formula : PolyORBLF-COL-S04J04T10-CTLFireability-2024-09
Could not compute solution for formula : PolyORBLF-COL-S04J04T10-CTLFireability-2024-10
Could not compute solution for formula : PolyORBLF-COL-S04J04T10-CTLFireability-2024-11
Could not compute solution for formula : PolyORBLF-COL-S04J04T10-CTLFireability-2024-12
Could not compute solution for formula : PolyORBLF-COL-S04J04T10-CTLFireability-2024-13
Could not compute solution for formula : PolyORBLF-COL-S04J04T10-CTLFireability-2024-14
Could not compute solution for formula : PolyORBLF-COL-S04J04T10-CTLFireability-2024-15

BK_STOP 1717250621116

--------------------
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
mcc2024
ctl formula name PolyORBLF-COL-S04J04T10-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/893/ctl_0_
ctl formula name PolyORBLF-COL-S04J04T10-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/893/ctl_1_
ctl formula name PolyORBLF-COL-S04J04T10-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/893/ctl_2_
ctl formula name PolyORBLF-COL-S04J04T10-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/893/ctl_3_
ctl formula name PolyORBLF-COL-S04J04T10-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/893/ctl_4_
ctl formula name PolyORBLF-COL-S04J04T10-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/893/ctl_5_
ctl formula name PolyORBLF-COL-S04J04T10-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/893/ctl_6_
ctl formula name PolyORBLF-COL-S04J04T10-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/893/ctl_7_
ctl formula name PolyORBLF-COL-S04J04T10-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/893/ctl_8_
ctl formula name PolyORBLF-COL-S04J04T10-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/893/ctl_9_
ctl formula name PolyORBLF-COL-S04J04T10-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/893/ctl_10_
ctl formula name PolyORBLF-COL-S04J04T10-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/893/ctl_11_
ctl formula name PolyORBLF-COL-S04J04T10-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/893/ctl_12_
ctl formula name PolyORBLF-COL-S04J04T10-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/893/ctl_13_
ctl formula name PolyORBLF-COL-S04J04T10-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/893/ctl_14_
ctl formula name PolyORBLF-COL-S04J04T10-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/893/ctl_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-S04J04T10"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-COL-S04J04T10, 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 r516-tajo-171654446400138"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S04J04T10.tgz
mv PolyORBLF-COL-S04J04T10 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 ;