About the Execution of GreatSPN+red for PolyORBLF-COL-S04J04T06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 14770.752 | 3600000.00 | 13429912.00 | 205.60 | FTT??TT?TT??FF?? | normal |
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-171654445200121.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-S04J04T06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445200121
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 8.9K Apr 11 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 11 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 11 17:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 11 17:00 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.3K 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.4K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 11 17:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 11 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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-S04J04T06-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716848985035
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 22:29:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-27 22:29:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 22:29:47] [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-27 22:29:47] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 22:29:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1172 ms
[2024-05-27 22:29:48] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 554 PT places and 3040.0 transition bindings in 48 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 31 ms.
[2024-05-27 22:29:48] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 7 ms.
[2024-05-27 22:29:48] [INFO ] Skeletonized 16 HLPN properties in 4 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (15 resets) in 2773 ms. (14 steps per ms) remains 67/97 properties
BEST_FIRST walk for 4003 steps (8 resets) in 149 ms. (26 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (8 resets) in 44 ms. (88 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (8 resets) in 27 ms. (142 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (8 resets) in 35 ms. (111 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (8 resets) in 63 ms. (62 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (8 resets) in 41 ms. (95 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (8 resets) in 49 ms. (80 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 67/67 properties
[2024-05-27 22:29:50] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-27 22:29:50] [INFO ] Computed 26 invariants in 7 ms
[2024-05-27 22:29:50] [INFO ] State equation strengthened by 8 read => feed constraints.
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp87 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 4/4 constraints. Problems are: Problem set: 13 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 2/6 constraints. Problems are: Problem set: 13 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 13 solved, 54 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp83 is UNSAT
Problem AtomicPropp84 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp94 is UNSAT
At refinement iteration 3 (OVERLAPS) 12/71 variables, 7/13 constraints. Problems are: Problem set: 49 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/13 constraints. Problems are: Problem set: 49 solved, 18 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp88 is UNSAT
Problem AtomicPropp89 is UNSAT
Problem AtomicPropp91 is UNSAT
Problem AtomicPropp93 is UNSAT
After SMT solving in domain Real declared 81/145 variables, and 26 constraints, problems are : Problem set: 67 solved, 0 unsolved in 531 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: 67/67 constraints, Known Traps: 0/0 constraints]
After SMT, in 608ms problems are : Problem set: 67 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 67 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-COL-S04J04T06-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T06-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T06-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 22:29:51] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-27 22:29:51] [INFO ] Flatten gal took : 29 ms
[2024-05-27 22:29:51] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBLF-COL-S04J04T06-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T06-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T06-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T06-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 22:29:51] [INFO ] Flatten gal took : 8 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-27 22:29:51] [INFO ] Unfolded HLPN to a Petri net with 554 places and 2998 transitions 20754 arcs in 74 ms.
[2024-05-27 22:29:51] [INFO ] Unfolded 9 HLPN properties in 1 ms.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
Support contains 365 out of 554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 554/554 places, 1372/1372 transitions.
Applied a total of 0 rules in 29 ms. Remains 554 /554 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
Running 1368 sub problems to find dead transitions.
[2024-05-27 22:29:51] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 554 cols
[2024-05-27 22:29:51] [INFO ] Computed 50 invariants in 65 ms
[2024-05-27 22:29:51] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-27 22:30:09] [INFO ] Deduced a trap composed of 75 places in 298 ms of which 24 ms to minimize.
[2024-05-27 22:30:10] [INFO ] Deduced a trap composed of 75 places in 173 ms of which 2 ms to minimize.
[2024-05-27 22:30:10] [INFO ] Deduced a trap composed of 75 places in 95 ms of which 2 ms to minimize.
[2024-05-27 22:30:12] [INFO ] Deduced a trap composed of 75 places in 2134 ms of which 27 ms to minimize.
[2024-05-27 22:30:12] [INFO ] Deduced a trap composed of 75 places in 126 ms of which 2 ms to minimize.
[2024-05-27 22:30:13] [INFO ] Deduced a trap composed of 301 places in 582 ms of which 4 ms to minimize.
[2024-05-27 22:30:14] [INFO ] Deduced a trap composed of 157 places in 432 ms of which 6 ms to minimize.
[2024-05-27 22:30:16] [INFO ] Deduced a trap composed of 75 places in 2046 ms of which 28 ms to minimize.
SMT process timed out in 24972ms, After SMT, problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 25001ms
[2024-05-27 22:30:16] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-05-27 22:30:16] [INFO ] Invariant cache hit.
[2024-05-27 22:30:16] [INFO ] Implicit Places using invariants in 418 ms returned []
[2024-05-27 22:30:16] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-05-27 22:30:16] [INFO ] Invariant cache hit.
[2024-05-27 22:30:17] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:30:20] [INFO ] Implicit Places using invariants and state equation in 4108 ms returned []
Implicit Place search using SMT with State Equation took 4533 ms to find 0 implicit places.
Running 1368 sub problems to find dead transitions.
[2024-05-27 22:30:20] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-05-27 22:30:20] [INFO ] Invariant cache hit.
[2024-05-27 22:30:20] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-27 22:30:39] [INFO ] Deduced a trap composed of 75 places in 151 ms of which 2 ms to minimize.
[2024-05-27 22:30:39] [INFO ] Deduced a trap composed of 75 places in 77 ms of which 1 ms to minimize.
[2024-05-27 22:30:39] [INFO ] Deduced a trap composed of 75 places in 74 ms of which 1 ms to minimize.
[2024-05-27 22:30:39] [INFO ] Deduced a trap composed of 75 places in 48 ms of which 1 ms to minimize.
[2024-05-27 22:30:39] [INFO ] Deduced a trap composed of 75 places in 50 ms of which 1 ms to minimize.
[2024-05-27 22:30:40] [INFO ] Deduced a trap composed of 171 places in 399 ms of which 53 ms to minimize.
[2024-05-27 22:30:41] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 1 ms to minimize.
[2024-05-27 22:30:47] [INFO ] Deduced a trap composed of 297 places in 459 ms of which 4 ms to minimize.
[2024-05-27 22:30:56] [INFO ] Deduced a trap composed of 297 places in 370 ms of which 3 ms to minimize.
SMT process timed out in 35710ms, After SMT, problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 35739ms
Finished structural reductions in LTL mode , in 1 iterations and 65331 ms. Remains : 554/554 places, 1372/1372 transitions.
Support contains 365 out of 554 places after structural reductions.
[2024-05-27 22:30:56] [INFO ] Flatten gal took : 168 ms
[2024-05-27 22:30:56] [INFO ] Flatten gal took : 128 ms
[2024-05-27 22:30:57] [INFO ] Input system was already deterministic with 1372 transitions.
RANDOM walk for 40000 steps (9 resets) in 1843 ms. (21 steps per ms) remains 40/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (9 resets) in 35 ms. (111 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 63 ms. (62 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (8 resets) in 62 ms. (63 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 75 ms. (52 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 40/40 properties
[2024-05-27 22:30:58] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-05-27 22:30:58] [INFO ] Invariant cache hit.
[2024-05-27 22:30:58] [INFO ] State equation strengthened by 120 read => feed constraints.
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp45 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 7/9 constraints. Problems are: Problem set: 4 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 36 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
At refinement iteration 3 (OVERLAPS) 81/362 variables, 12/21 constraints. Problems are: Problem set: 16 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 0/21 constraints. Problems are: Problem set: 16 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 10/372 variables, 5/26 constraints. Problems are: Problem set: 16 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/26 constraints. Problems are: Problem set: 16 solved, 24 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
After SMT solving in domain Real declared 554/1902 variables, and 50 constraints, problems are : Problem set: 40 solved, 0 unsolved in 1047 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/554 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1207ms problems are : Problem set: 40 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 40 atomic propositions for a total of 9 simplifications.
[2024-05-27 22:30:59] [INFO ] Flatten gal took : 96 ms
[2024-05-27 22:30:59] [INFO ] Flatten gal took : 98 ms
[2024-05-27 22:31:00] [INFO ] Input system was already deterministic with 1372 transitions.
Support contains 121 out of 554 places (down from 151) after GAL structural reductions.
FORMULA PolyORBLF-COL-S04J04T06-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 554/554 places, 1372/1372 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 550 transition count 1372
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 544 transition count 1366
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 544 transition count 1366
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 538 transition count 1360
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 538 transition count 1360
Applied a total of 28 rules in 96 ms. Remains 538 /554 variables (removed 16) and now considering 1360/1372 (removed 12) transitions.
Running 1356 sub problems to find dead transitions.
[2024-05-27 22:31:00] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 538 cols
[2024-05-27 22:31:00] [INFO ] Computed 46 invariants in 70 ms
[2024-05-27 22:31:00] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-27 22:31:17] [INFO ] Deduced a trap composed of 98 places in 220 ms of which 4 ms to minimize.
[2024-05-27 22:31:17] [INFO ] Deduced a trap composed of 133 places in 183 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 534/1874 variables, and 43 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 31/35 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/534 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-27 22:31:36] [INFO ] Deduced a trap composed of 15 places in 309 ms of which 3 ms to minimize.
[2024-05-27 22:31:36] [INFO ] Deduced a trap composed of 73 places in 130 ms of which 1 ms to minimize.
[2024-05-27 22:31:37] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 2 ms to minimize.
[2024-05-27 22:31:37] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 1 ms to minimize.
[2024-05-27 22:31:37] [INFO ] Deduced a trap composed of 73 places in 87 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/1874 variables, and 48 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 31/35 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 7/7 constraints]
After SMT, in 45706ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 45728ms
Finished structural reductions in LTL mode , in 1 iterations and 45830 ms. Remains : 538/554 places, 1360/1372 transitions.
[2024-05-27 22:31:45] [INFO ] Flatten gal took : 59 ms
[2024-05-27 22:31:46] [INFO ] Flatten gal took : 84 ms
[2024-05-27 22:31:46] [INFO ] Input system was already deterministic with 1360 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 554/554 places, 1372/1372 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 550 transition count 1318
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 496 transition count 1318
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 108 place count 496 transition count 1288
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 168 place count 466 transition count 1288
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
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 288 place count 406 transition count 1228
Applied a total of 288 rules in 200 ms. Remains 406 /554 variables (removed 148) and now considering 1228/1372 (removed 144) transitions.
Running 1224 sub problems to find dead transitions.
[2024-05-27 22:31:46] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
// Phase 1: matrix 1204 rows 406 cols
[2024-05-27 22:31:46] [INFO ] Computed 46 invariants in 25 ms
[2024-05-27 22:31:46] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
SMT process timed out in 25641ms, After SMT, problems are : Problem set: 0 solved, 1224 unsolved
Search for dead transitions found 0 dead transitions in 25662ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 25871 ms. Remains : 406/554 places, 1228/1372 transitions.
[2024-05-27 22:32:12] [INFO ] Flatten gal took : 81 ms
[2024-05-27 22:32:12] [INFO ] Flatten gal took : 73 ms
[2024-05-27 22:32:12] [INFO ] Input system was already deterministic with 1228 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 554/554 places, 1372/1372 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 550 transition count 1336
Reduce places removed 36 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 42 rules applied. Total rules applied 78 place count 514 transition count 1330
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 84 place count 508 transition count 1330
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 84 place count 508 transition count 1270
Deduced a syphon composed of 60 places in 7 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 204 place count 448 transition count 1270
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 14 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 324 place count 388 transition count 1210
Applied a total of 324 rules in 194 ms. Remains 388 /554 variables (removed 166) and now considering 1210/1372 (removed 162) transitions.
Running 1206 sub problems to find dead transitions.
[2024-05-27 22:32:12] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
// Phase 1: matrix 1186 rows 388 cols
[2024-05-27 22:32:12] [INFO ] Computed 46 invariants in 23 ms
[2024-05-27 22:32:12] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-05-27 22:32:26] [INFO ] Deduced a trap composed of 48 places in 171 ms of which 2 ms to minimize.
[2024-05-27 22:32:26] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 1 ms to minimize.
[2024-05-27 22:32:26] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
[2024-05-27 22:32:26] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
[2024-05-27 22:32:26] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 1 ms to minimize.
[2024-05-27 22:32:27] [INFO ] Deduced a trap composed of 164 places in 328 ms of which 3 ms to minimize.
[2024-05-27 22:32:28] [INFO ] Deduced a trap composed of 58 places in 218 ms of which 2 ms to minimize.
[2024-05-27 22:32:28] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2024-05-27 22:32:36] [INFO ] Deduced a trap composed of 132 places in 277 ms of which 3 ms to minimize.
[2024-05-27 22:32:37] [INFO ] Deduced a trap composed of 125 places in 274 ms of which 3 ms to minimize.
[2024-05-27 22:32:37] [INFO ] Deduced a trap composed of 178 places in 261 ms of which 6 ms to minimize.
[2024-05-27 22:32:37] [INFO ] Deduced a trap composed of 175 places in 281 ms of which 3 ms to minimize.
[2024-05-27 22:32:37] [INFO ] Deduced a trap composed of 160 places in 262 ms of which 3 ms to minimize.
[2024-05-27 22:32:38] [INFO ] Deduced a trap composed of 190 places in 269 ms of which 3 ms to minimize.
SMT process timed out in 25612ms, After SMT, problems are : Problem set: 0 solved, 1206 unsolved
Search for dead transitions found 0 dead transitions in 25638ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 25848 ms. Remains : 388/554 places, 1210/1372 transitions.
[2024-05-27 22:32:38] [INFO ] Flatten gal took : 54 ms
[2024-05-27 22:32:38] [INFO ] Flatten gal took : 56 ms
[2024-05-27 22:32:38] [INFO ] Input system was already deterministic with 1210 transitions.
RANDOM walk for 341 steps (0 resets) in 10 ms. (31 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-COL-S04J04T06-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 554/554 places, 1372/1372 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 550 transition count 1372
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 544 transition count 1366
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 544 transition count 1366
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 538 transition count 1360
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 538 transition count 1360
Applied a total of 28 rules in 60 ms. Remains 538 /554 variables (removed 16) and now considering 1360/1372 (removed 12) transitions.
Running 1356 sub problems to find dead transitions.
[2024-05-27 22:32:38] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 538 cols
[2024-05-27 22:32:38] [INFO ] Computed 46 invariants in 24 ms
[2024-05-27 22:32:38] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-27 22:32:53] [INFO ] Deduced a trap composed of 73 places in 162 ms of which 2 ms to minimize.
[2024-05-27 22:32:54] [INFO ] Deduced a trap composed of 73 places in 106 ms of which 4 ms to minimize.
[2024-05-27 22:32:54] [INFO ] Deduced a trap composed of 73 places in 80 ms of which 2 ms to minimize.
[2024-05-27 22:32:54] [INFO ] Deduced a trap composed of 73 places in 65 ms of which 1 ms to minimize.
[2024-05-27 22:32:54] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 1 ms to minimize.
[2024-05-27 22:32:55] [INFO ] Deduced a trap composed of 133 places in 313 ms of which 4 ms to minimize.
[2024-05-27 22:32:55] [INFO ] Deduced a trap composed of 309 places in 318 ms of which 4 ms to minimize.
[2024-05-27 22:32:57] [INFO ] Deduced a trap composed of 73 places in 64 ms of which 1 ms to minimize.
[2024-05-27 22:33:02] [INFO ] Deduced a trap composed of 296 places in 438 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 534/1874 variables, and 51 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/534 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-27 22:33:11] [INFO ] Deduced a trap composed of 310 places in 310 ms of which 4 ms to minimize.
[2024-05-27 22:33:11] [INFO ] Deduced a trap composed of 274 places in 297 ms of which 3 ms to minimize.
[2024-05-27 22:33:11] [INFO ] Deduced a trap composed of 267 places in 315 ms of which 4 ms to minimize.
[2024-05-27 22:33:13] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/1874 variables, and 55 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20057 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 13/13 constraints]
After SMT, in 45236ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 45253ms
Finished structural reductions in LTL mode , in 1 iterations and 45316 ms. Remains : 538/554 places, 1360/1372 transitions.
[2024-05-27 22:33:24] [INFO ] Flatten gal took : 80 ms
[2024-05-27 22:33:24] [INFO ] Flatten gal took : 108 ms
[2024-05-27 22:33:24] [INFO ] Input system was already deterministic with 1360 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 554/554 places, 1372/1372 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 550 transition count 1330
Reduce places removed 42 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 54 rules applied. Total rules applied 96 place count 508 transition count 1318
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 108 place count 496 transition count 1318
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 108 place count 496 transition count 1258
Deduced a syphon composed of 60 places in 15 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 228 place count 436 transition count 1258
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 336 place count 382 transition count 1204
Applied a total of 336 rules in 120 ms. Remains 382 /554 variables (removed 172) and now considering 1204/1372 (removed 168) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-27 22:33:24] [INFO ] Flow matrix only has 1180 transitions (discarded 24 similar events)
// Phase 1: matrix 1180 rows 382 cols
[2024-05-27 22:33:24] [INFO ] Computed 46 invariants in 34 ms
[2024-05-27 22:33:24] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-27 22:33:37] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 2 ms to minimize.
[2024-05-27 22:33:37] [INFO ] Deduced a trap composed of 47 places in 96 ms of which 1 ms to minimize.
[2024-05-27 22:33:38] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 1 ms to minimize.
[2024-05-27 22:33:38] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 1 ms to minimize.
[2024-05-27 22:33:38] [INFO ] Deduced a trap composed of 47 places in 100 ms of which 1 ms to minimize.
[2024-05-27 22:33:38] [INFO ] Deduced a trap composed of 151 places in 283 ms of which 2 ms to minimize.
[2024-05-27 22:33:39] [INFO ] Deduced a trap composed of 173 places in 288 ms of which 2 ms to minimize.
[2024-05-27 22:33:39] [INFO ] Deduced a trap composed of 148 places in 249 ms of which 2 ms to minimize.
[2024-05-27 22:33:39] [INFO ] Deduced a trap composed of 165 places in 291 ms of which 2 ms to minimize.
[2024-05-27 22:33:39] [INFO ] Deduced a trap composed of 47 places in 36 ms of which 0 ms to minimize.
[2024-05-27 22:33:47] [INFO ] Deduced a trap composed of 181 places in 254 ms of which 2 ms to minimize.
[2024-05-27 22:33:48] [INFO ] Deduced a trap composed of 121 places in 276 ms of which 2 ms to minimize.
[2024-05-27 22:33:48] [INFO ] Deduced a trap composed of 166 places in 229 ms of which 3 ms to minimize.
[2024-05-27 22:33:48] [INFO ] Deduced a trap composed of 121 places in 255 ms of which 3 ms to minimize.
[2024-05-27 22:33:48] [INFO ] Deduced a trap composed of 167 places in 259 ms of which 2 ms to minimize.
[2024-05-27 22:33:49] [INFO ] Deduced a trap composed of 172 places in 228 ms of which 2 ms to minimize.
[2024-05-27 22:33:49] [INFO ] Deduced a trap composed of 162 places in 270 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1562 variables, and 59 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-27 22:33:51] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 2 ms to minimize.
[2024-05-27 22:33:59] [INFO ] Deduced a trap composed of 29 places in 156 ms of which 2 ms to minimize.
[2024-05-27 22:33:59] [INFO ] Deduced a trap composed of 131 places in 209 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/1562 variables, and 62 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 20/20 constraints]
After SMT, in 45438ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 45464ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 45587 ms. Remains : 382/554 places, 1204/1372 transitions.
[2024-05-27 22:34:09] [INFO ] Flatten gal took : 48 ms
[2024-05-27 22:34:09] [INFO ] Flatten gal took : 50 ms
[2024-05-27 22:34:10] [INFO ] Input system was already deterministic with 1204 transitions.
Starting structural reductions in LTL mode, iteration 0 : 554/554 places, 1372/1372 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 550 transition count 1372
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 544 transition count 1366
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 544 transition count 1366
Applied a total of 16 rules in 19 ms. Remains 544 /554 variables (removed 10) and now considering 1366/1372 (removed 6) transitions.
Running 1362 sub problems to find dead transitions.
[2024-05-27 22:34:10] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
// Phase 1: matrix 1342 rows 544 cols
[2024-05-27 22:34:10] [INFO ] Computed 46 invariants in 33 ms
[2024-05-27 22:34:10] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-05-27 22:34:27] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 1 ms to minimize.
[2024-05-27 22:34:27] [INFO ] Deduced a trap composed of 74 places in 68 ms of which 1 ms to minimize.
[2024-05-27 22:34:27] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 1 ms to minimize.
[2024-05-27 22:34:27] [INFO ] Deduced a trap composed of 74 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:34:27] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
[2024-05-27 22:34:28] [INFO ] Deduced a trap composed of 299 places in 332 ms of which 4 ms to minimize.
[2024-05-27 22:34:28] [INFO ] Deduced a trap composed of 121 places in 321 ms of which 4 ms to minimize.
[2024-05-27 22:34:28] [INFO ] Deduced a trap composed of 164 places in 322 ms of which 3 ms to minimize.
[2024-05-27 22:34:29] [INFO ] Deduced a trap composed of 161 places in 322 ms of which 3 ms to minimize.
[2024-05-27 22:34:29] [INFO ] Deduced a trap composed of 313 places in 328 ms of which 4 ms to minimize.
[2024-05-27 22:34:31] [INFO ] Deduced a trap composed of 289 places in 369 ms of which 4 ms to minimize.
[2024-05-27 22:34:31] [INFO ] Deduced a trap composed of 74 places in 62 ms of which 1 ms to minimize.
[2024-05-27 22:34:33] [INFO ] Deduced a trap composed of 143 places in 277 ms of which 3 ms to minimize.
[2024-05-27 22:34:36] [INFO ] Deduced a trap composed of 15 places in 382 ms of which 5 ms to minimize.
SMT process timed out in 26152ms, After SMT, problems are : Problem set: 0 solved, 1362 unsolved
Search for dead transitions found 0 dead transitions in 26171ms
Finished structural reductions in LTL mode , in 1 iterations and 26194 ms. Remains : 544/554 places, 1366/1372 transitions.
[2024-05-27 22:34:36] [INFO ] Flatten gal took : 54 ms
[2024-05-27 22:34:36] [INFO ] Flatten gal took : 99 ms
[2024-05-27 22:34:36] [INFO ] Input system was already deterministic with 1366 transitions.
Starting structural reductions in LTL mode, iteration 0 : 554/554 places, 1372/1372 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 550 transition count 1372
Applied a total of 4 rules in 12 ms. Remains 550 /554 variables (removed 4) and now considering 1372/1372 (removed 0) transitions.
Running 1368 sub problems to find dead transitions.
[2024-05-27 22:34:36] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 550 cols
[2024-05-27 22:34:36] [INFO ] Computed 46 invariants in 34 ms
[2024-05-27 22:34:36] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-27 22:34:55] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 2 ms to minimize.
[2024-05-27 22:34:55] [INFO ] Deduced a trap composed of 75 places in 100 ms of which 2 ms to minimize.
[2024-05-27 22:34:55] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 1 ms to minimize.
[2024-05-27 22:34:55] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 1 ms to minimize.
[2024-05-27 22:34:55] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 1 ms to minimize.
[2024-05-27 22:34:56] [INFO ] Deduced a trap composed of 313 places in 348 ms of which 4 ms to minimize.
[2024-05-27 22:34:57] [INFO ] Deduced a trap composed of 167 places in 293 ms of which 3 ms to minimize.
[2024-05-27 22:34:58] [INFO ] Deduced a trap composed of 39 places in 231 ms of which 2 ms to minimize.
[2024-05-27 22:34:59] [INFO ] Deduced a trap composed of 319 places in 509 ms of which 32 ms to minimize.
[2024-05-27 22:34:59] [INFO ] Deduced a trap composed of 320 places in 465 ms of which 6 ms to minimize.
[2024-05-27 22:35:00] [INFO ] Deduced a trap composed of 317 places in 461 ms of which 21 ms to minimize.
[2024-05-27 22:35:00] [INFO ] Deduced a trap composed of 323 places in 463 ms of which 6 ms to minimize.
[2024-05-27 22:35:01] [INFO ] Deduced a trap composed of 311 places in 435 ms of which 7 ms to minimize.
[2024-05-27 22:35:01] [INFO ] Deduced a trap composed of 322 places in 426 ms of which 6 ms to minimize.
[2024-05-27 22:35:02] [INFO ] Deduced a trap composed of 313 places in 428 ms of which 7 ms to minimize.
[2024-05-27 22:35:02] [INFO ] Deduced a trap composed of 307 places in 409 ms of which 4 ms to minimize.
SMT process timed out in 26039ms, After SMT, problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 26059ms
Finished structural reductions in LTL mode , in 1 iterations and 26075 ms. Remains : 550/554 places, 1372/1372 transitions.
[2024-05-27 22:35:02] [INFO ] Flatten gal took : 87 ms
[2024-05-27 22:35:02] [INFO ] Flatten gal took : 92 ms
[2024-05-27 22:35:03] [INFO ] Input system was already deterministic with 1372 transitions.
Starting structural reductions in LTL mode, iteration 0 : 554/554 places, 1372/1372 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 550 transition count 1372
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 544 transition count 1366
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 544 transition count 1366
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 538 transition count 1360
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 538 transition count 1360
Applied a total of 28 rules in 35 ms. Remains 538 /554 variables (removed 16) and now considering 1360/1372 (removed 12) transitions.
Running 1356 sub problems to find dead transitions.
[2024-05-27 22:35:03] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 538 cols
[2024-05-27 22:35:03] [INFO ] Computed 46 invariants in 50 ms
[2024-05-27 22:35:03] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-27 22:35:20] [INFO ] Deduced a trap composed of 73 places in 105 ms of which 2 ms to minimize.
[2024-05-27 22:35:20] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 1 ms to minimize.
[2024-05-27 22:35:20] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 1 ms to minimize.
[2024-05-27 22:35:20] [INFO ] Deduced a trap composed of 73 places in 79 ms of which 1 ms to minimize.
[2024-05-27 22:35:20] [INFO ] Deduced a trap composed of 73 places in 77 ms of which 1 ms to minimize.
[2024-05-27 22:35:21] [INFO ] Deduced a trap composed of 133 places in 313 ms of which 4 ms to minimize.
[2024-05-27 22:35:22] [INFO ] Deduced a trap composed of 309 places in 383 ms of which 4 ms to minimize.
[2024-05-27 22:35:23] [INFO ] Deduced a trap composed of 73 places in 77 ms of which 1 ms to minimize.
[2024-05-27 22:35:28] [INFO ] Deduced a trap composed of 296 places in 367 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 534/1874 variables, and 51 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/534 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-27 22:35:36] [INFO ] Deduced a trap composed of 310 places in 350 ms of which 4 ms to minimize.
[2024-05-27 22:35:37] [INFO ] Deduced a trap composed of 274 places in 301 ms of which 4 ms to minimize.
[2024-05-27 22:35:37] [INFO ] Deduced a trap composed of 267 places in 295 ms of which 3 ms to minimize.
[2024-05-27 22:35:39] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 2 ms to minimize.
[2024-05-27 22:35:47] [INFO ] Deduced a trap composed of 282 places in 328 ms of which 4 ms to minimize.
[2024-05-27 22:35:47] [INFO ] Deduced a trap composed of 279 places in 301 ms of which 4 ms to minimize.
[2024-05-27 22:35:47] [INFO ] Deduced a trap composed of 297 places in 312 ms of which 4 ms to minimize.
[2024-05-27 22:35:48] [INFO ] Deduced a trap composed of 274 places in 315 ms of which 4 ms to minimize.
[2024-05-27 22:35:49] [INFO ] Deduced a trap composed of 59 places in 210 ms of which 2 ms to minimize.
SMT process timed out in 46058ms, After SMT, problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 46078ms
Finished structural reductions in LTL mode , in 1 iterations and 46117 ms. Remains : 538/554 places, 1360/1372 transitions.
[2024-05-27 22:35:49] [INFO ] Flatten gal took : 91 ms
[2024-05-27 22:35:49] [INFO ] Flatten gal took : 70 ms
[2024-05-27 22:35:49] [INFO ] Input system was already deterministic with 1360 transitions.
[2024-05-27 22:35:49] [INFO ] Flatten gal took : 64 ms
[2024-05-27 22:35:49] [INFO ] Flatten gal took : 64 ms
[2024-05-27 22:35:49] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-27 22:35:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 554 places, 1372 transitions and 6996 arcs took 16 ms.
Total runtime 362717 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running PolyORBLF-COL-S04J04T06
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 554
TRANSITIONS: 1372
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.046s, Sys 0.001s]
SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.006s, Sys 0.000s]
----------------------------------------------------------------------
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: 1005
MODEL NAME: /home/mcc/execution/415/model
554 places, 1372 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 CTLCardinality -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-S04J04T06"
export BK_EXAMINATION="CTLCardinality"
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-S04J04T06, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r289-tajo-171654445200121"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S04J04T06.tgz
mv PolyORBLF-COL-S04J04T06 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;