About the Execution of LTSMin+red for PolyORBLF-COL-S06J06T06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
9402.147 | 865875.00 | 1054490.00 | 237.30 | ?FT????????????T | 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.r516-tajo-171654446600202.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-S06J06T06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446600202
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.5K Apr 11 17:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Apr 11 17:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 11 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 11 17:16 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 3.8K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 17:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 11 17:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 11 17:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-COL-S06J06T06-CTLFireability-2024-00
FORMULA_NAME PolyORBLF-COL-S06J06T06-CTLFireability-2024-01
FORMULA_NAME PolyORBLF-COL-S06J06T06-CTLFireability-2024-02
FORMULA_NAME PolyORBLF-COL-S06J06T06-CTLFireability-2024-03
FORMULA_NAME PolyORBLF-COL-S06J06T06-CTLFireability-2024-04
FORMULA_NAME PolyORBLF-COL-S06J06T06-CTLFireability-2024-05
FORMULA_NAME PolyORBLF-COL-S06J06T06-CTLFireability-2024-06
FORMULA_NAME PolyORBLF-COL-S06J06T06-CTLFireability-2024-07
FORMULA_NAME PolyORBLF-COL-S06J06T06-CTLFireability-2024-08
FORMULA_NAME PolyORBLF-COL-S06J06T06-CTLFireability-2024-09
FORMULA_NAME PolyORBLF-COL-S06J06T06-CTLFireability-2024-10
FORMULA_NAME PolyORBLF-COL-S06J06T06-CTLFireability-2024-11
FORMULA_NAME PolyORBLF-COL-S06J06T06-CTLFireability-2024-12
FORMULA_NAME PolyORBLF-COL-S06J06T06-CTLFireability-2024-13
FORMULA_NAME PolyORBLF-COL-S06J06T06-CTLFireability-2024-14
FORMULA_NAME PolyORBLF-COL-S06J06T06-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717251406195
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-S06J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:16:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 14:16:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:16: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-06-01 14:16:47] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 14:16:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 614 ms
[2024-06-01 14:16:48] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 700 PT places and 10800.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
[2024-06-01 14:16:48] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-06-01 14:16:48] [INFO ] Skeletonized 14 HLPN properties in 2 ms. Removed 2 properties that had guard overlaps.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40004 steps (3799 resets) in 1606 ms. (24 steps per ms) remains 4/43 properties
BEST_FIRST walk for 40002 steps (89 resets) in 166 ms. (239 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40001 steps (87 resets) in 284 ms. (140 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (40 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
[2024-06-01 14:16:49] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 14:16:49] [INFO ] Computed 26 invariants in 15 ms
[2024-06-01 14:16:49] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/48 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/53 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp37 is UNSAT
After SMT solving in domain Real declared 76/145 variables, and 22 constraints, problems are : Problem set: 2 solved, 0 unsolved in 183 ms.
Refiners :[Positive P Invariants (semi-flows): 9/11 constraints, Generalized P Invariants (flows): 13/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 230ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
[2024-06-01 14:16:49] [INFO ] Flatten gal took : 28 ms
[2024-06-01 14:16:49] [INFO ] Flatten gal took : 8 ms
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-06-01 14:16:49] [INFO ] Unfolded HLPN to a Petri net with 700 places and 10740 transitions 89778 arcs in 176 ms.
[2024-06-01 14:16:49] [INFO ] Unfolded 16 HLPN properties in 3 ms.
[2024-06-01 14:16:49] [INFO ] Reduced 90 identical enabling conditions.
[2024-06-01 14:16:49] [INFO ] Reduced 90 identical enabling conditions.
[2024-06-01 14:16:49] [INFO ] Reduced 7020 identical enabling conditions.
[2024-06-01 14:16:49] [INFO ] Reduced 90 identical enabling conditions.
[2024-06-01 14:16:49] [INFO ] Reduced 7020 identical enabling conditions.
Ensure Unique test removed 8070 transitions
Reduce redundant transitions removed 8070 transitions.
Support contains 557 out of 700 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 700/700 places, 2670/2670 transitions.
Applied a total of 0 rules in 59 ms. Remains 700 /700 variables (removed 0) and now considering 2670/2670 (removed 0) transitions.
Running 2664 sub problems to find dead transitions.
[2024-06-01 14:16:49] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
// Phase 1: matrix 2634 rows 700 cols
[2024-06-01 14:16:50] [INFO ] Computed 58 invariants in 213 ms
[2024-06-01 14:16:50] [INFO ] State equation strengthened by 168 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/688 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
SMT process timed out in 41943ms, After SMT, problems are : Problem set: 0 solved, 2664 unsolved
Search for dead transitions found 0 dead transitions in 41992ms
[2024-06-01 14:17:31] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
[2024-06-01 14:17:31] [INFO ] Invariant cache hit.
[2024-06-01 14:17:32] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-06-01 14:17:32] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
[2024-06-01 14:17:32] [INFO ] Invariant cache hit.
[2024-06-01 14:17:33] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 14:17:37] [INFO ] Implicit Places using invariants and state equation in 5336 ms returned []
Implicit Place search using SMT with State Equation took 5619 ms to find 0 implicit places.
Running 2664 sub problems to find dead transitions.
[2024-06-01 14:17:37] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
[2024-06-01 14:17:37] [INFO ] Invariant cache hit.
[2024-06-01 14:17:37] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
[2024-06-01 14:18:26] [INFO ] Deduced a trap composed of 95 places in 206 ms of which 29 ms to minimize.
[2024-06-01 14:18:26] [INFO ] Deduced a trap composed of 94 places in 243 ms of which 2 ms to minimize.
[2024-06-01 14:18:27] [INFO ] Deduced a trap composed of 94 places in 384 ms of which 2 ms to minimize.
[2024-06-01 14:18:27] [INFO ] Deduced a trap composed of 94 places in 101 ms of which 2 ms to minimize.
[2024-06-01 14:18:27] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 1 ms to minimize.
[2024-06-01 14:18:28] [INFO ] Deduced a trap composed of 402 places in 553 ms of which 6 ms to minimize.
[2024-06-01 14:18:28] [INFO ] Deduced a trap composed of 160 places in 530 ms of which 5 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 688/3334 variables, and 53 constraints, problems are : Problem set: 0 solved, 2664 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 16/24 constraints, Generalized P Invariants (flows): 30/34 constraints, State Equation: 0/700 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2664/1410 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2664 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/688 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
[2024-06-01 14:18:34] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 2 ms to minimize.
[2024-06-01 14:18:36] [INFO ] Deduced a trap composed of 335 places in 634 ms of which 5 ms to minimize.
[2024-06-01 14:18:40] [INFO ] Deduced a trap composed of 410 places in 755 ms of which 5 ms to minimize.
[2024-06-01 14:18:40] [INFO ] Deduced a trap composed of 376 places in 735 ms of which 5 ms to minimize.
[2024-06-01 14:18:41] [INFO ] Deduced a trap composed of 15 places in 599 ms of which 4 ms to minimize.
[2024-06-01 14:18:42] [INFO ] Deduced a trap composed of 431 places in 702 ms of which 4 ms to minimize.
[2024-06-01 14:18:42] [INFO ] Deduced a trap composed of 364 places in 697 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 688/3334 variables, and 60 constraints, problems are : Problem set: 0 solved, 2664 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 16/24 constraints, Generalized P Invariants (flows): 30/34 constraints, State Equation: 0/700 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1410 constraints, Known Traps: 14/14 constraints]
After SMT, in 83200ms problems are : Problem set: 0 solved, 2664 unsolved
Search for dead transitions found 0 dead transitions in 83249ms
Finished structural reductions in LTL mode , in 1 iterations and 130969 ms. Remains : 700/700 places, 2670/2670 transitions.
Support contains 557 out of 700 places after structural reductions.
[2024-06-01 14:19:01] [INFO ] Flatten gal took : 451 ms
[2024-06-01 14:19:02] [INFO ] Flatten gal took : 220 ms
[2024-06-01 14:19:02] [INFO ] Input system was already deterministic with 2670 transitions.
Reduction of identical properties reduced properties to check from 58 to 56
RANDOM walk for 40000 steps (251 resets) in 2451 ms. (16 steps per ms) remains 5/56 properties
BEST_FIRST walk for 40002 steps (111 resets) in 460 ms. (86 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (106 resets) in 589 ms. (67 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (136 resets) in 669 ms. (59 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (27 resets) in 277 ms. (143 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1176 resets) in 390 ms. (102 steps per ms) remains 5/5 properties
[2024-06-01 14:19:04] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
[2024-06-01 14:19:04] [INFO ] Invariant cache hit.
[2024-06-01 14:19:04] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp55 is UNSAT
At refinement iteration 2 (OVERLAPS) 274/428 variables, 15/16 constraints. Problems are: Problem set: 2 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 16/444 variables, 6/22 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 0/22 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp49 is UNSAT
After SMT solving in domain Real declared 696/3334 variables, and 55 constraints, problems are : Problem set: 5 solved, 0 unsolved in 754 ms.
Refiners :[Positive P Invariants (semi-flows): 21/24 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 0/700 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 926ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-COL-S06J06T06-CTLFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:19:05] [INFO ] Flatten gal took : 208 ms
[2024-06-01 14:19:06] [INFO ] Flatten gal took : 177 ms
[2024-06-01 14:19:06] [INFO ] Input system was already deterministic with 2670 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 700/700 places, 2670/2670 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 694 transition count 2670
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 688 transition count 2664
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 688 transition count 2664
Applied a total of 18 rules in 78 ms. Remains 688 /700 variables (removed 12) and now considering 2664/2670 (removed 6) transitions.
Running 2658 sub problems to find dead transitions.
[2024-06-01 14:19:07] [INFO ] Flow matrix only has 2628 transitions (discarded 36 similar events)
// Phase 1: matrix 2628 rows 688 cols
[2024-06-01 14:19:07] [INFO ] Computed 52 invariants in 147 ms
[2024-06-01 14:19:07] [INFO ] State equation strengthened by 168 read => feed constraints.
(s26 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
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 0.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2658 unsolved
SMT process timed out in 41820ms, After SMT, problems are : Problem set: 0 solved, 2658 unsolved
Search for dead transitions found 0 dead transitions in 41847ms
Finished structural reductions in LTL mode , in 1 iterations and 41935 ms. Remains : 688/700 places, 2664/2670 transitions.
[2024-06-01 14:19:49] [INFO ] Flatten gal took : 105 ms
[2024-06-01 14:19:49] [INFO ] Flatten gal took : 123 ms
[2024-06-01 14:19:49] [INFO ] Input system was already deterministic with 2664 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 700/700 places, 2670/2670 transitions.
Ensure Unique test removed 6 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 694 transition count 2616
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 640 transition count 2616
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 108 place count 640 transition count 2532
Deduced a syphon composed of 84 places in 2 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 276 place count 556 transition count 2532
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 420 place count 484 transition count 2460
Applied a total of 420 rules in 297 ms. Remains 484 /700 variables (removed 216) and now considering 2460/2670 (removed 210) transitions.
Running 2454 sub problems to find dead transitions.
[2024-06-01 14:19:49] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
// Phase 1: matrix 2424 rows 484 cols
[2024-06-01 14:19:49] [INFO ] Computed 52 invariants in 37 ms
[2024-06-01 14:19:49] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-06-01 14:20:25] [INFO ] Deduced a trap composed of 59 places in 162 ms of which 2 ms to minimize.
[2024-06-01 14:20:25] [INFO ] Deduced a trap composed of 58 places in 134 ms of which 2 ms to minimize.
[2024-06-01 14:20:25] [INFO ] Deduced a trap composed of 58 places in 108 ms of which 2 ms to minimize.
[2024-06-01 14:20:25] [INFO ] Deduced a trap composed of 58 places in 118 ms of which 1 ms to minimize.
[2024-06-01 14:20:25] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:20:26] [INFO ] Deduced a trap composed of 240 places in 426 ms of which 3 ms to minimize.
[2024-06-01 14:20:26] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/2908 variables, and 53 constraints, problems are : Problem set: 0 solved, 2454 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 32/35 constraints, State Equation: 0/484 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2454/1200 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2454 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-06-01 14:20:32] [INFO ] Deduced a trap composed of 240 places in 568 ms of which 3 ms to minimize.
[2024-06-01 14:20:33] [INFO ] Deduced a trap composed of 15 places in 573 ms of which 3 ms to minimize.
[2024-06-01 14:20:34] [INFO ] Deduced a trap composed of 217 places in 577 ms of which 3 ms to minimize.
[2024-06-01 14:20:34] [INFO ] Deduced a trap composed of 201 places in 609 ms of which 2 ms to minimize.
[2024-06-01 14:20:36] [INFO ] Deduced a trap composed of 53 places in 401 ms of which 2 ms to minimize.
[2024-06-01 14:20:39] [INFO ] Deduced a trap composed of 216 places in 489 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/2908 variables, and 59 constraints, problems are : Problem set: 0 solved, 2454 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 32/35 constraints, State Equation: 0/484 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1200 constraints, Known Traps: 13/13 constraints]
After SMT, in 60045ms problems are : Problem set: 0 solved, 2454 unsolved
Search for dead transitions found 0 dead transitions in 60075ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 60379 ms. Remains : 484/700 places, 2460/2670 transitions.
[2024-06-01 14:20:49] [INFO ] Flatten gal took : 131 ms
[2024-06-01 14:20:50] [INFO ] Flatten gal took : 143 ms
[2024-06-01 14:20:50] [INFO ] Input system was already deterministic with 2460 transitions.
RANDOM walk for 1592 steps (22 resets) in 18 ms. (83 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-COL-S06J06T06-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 700/700 places, 2670/2670 transitions.
Ensure Unique test removed 6 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 694 transition count 2616
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 640 transition count 2616
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 108 place count 640 transition count 2568
Deduced a syphon composed of 48 places in 4 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 204 place count 592 transition count 2568
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 348 place count 520 transition count 2496
Applied a total of 348 rules in 135 ms. Remains 520 /700 variables (removed 180) and now considering 2496/2670 (removed 174) transitions.
Running 2490 sub problems to find dead transitions.
[2024-06-01 14:20:50] [INFO ] Flow matrix only has 2460 transitions (discarded 36 similar events)
// Phase 1: matrix 2460 rows 520 cols
[2024-06-01 14:20:50] [INFO ] Computed 52 invariants in 45 ms
[2024-06-01 14:20:50] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2490 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 28/46 constraints. Problems are: Problem set: 0 solved, 2490 unsolved
[2024-06-01 14:21:33] [INFO ] Deduced a trap composed of 64 places in 109 ms of which 2 ms to minimize.
[2024-06-01 14:21:33] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:21:33] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:21:33] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 2 ms to minimize.
[2024-06-01 14:21:33] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 1 ms to minimize.
[2024-06-01 14:21:35] [INFO ] Deduced a trap composed of 243 places in 544 ms of which 5 ms to minimize.
[2024-06-01 14:21:35] [INFO ] Deduced a trap composed of 236 places in 498 ms of which 4 ms to minimize.
[2024-06-01 14:21:36] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/2980 variables, and 54 constraints, problems are : Problem set: 0 solved, 2490 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 28/32 constraints, State Equation: 0/520 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2490/1236 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2490 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2490 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 28/46 constraints. Problems are: Problem set: 0 solved, 2490 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 2490 unsolved
[2024-06-01 14:21:40] [INFO ] Deduced a trap composed of 15 places in 191 ms of which 2 ms to minimize.
[2024-06-01 14:21:43] [INFO ] Deduced a trap composed of 42 places in 360 ms of which 2 ms to minimize.
[2024-06-01 14:21:45] [INFO ] Deduced a trap composed of 50 places in 538 ms of which 4 ms to minimize.
[2024-06-01 14:21:46] [INFO ] Deduced a trap composed of 216 places in 621 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/2980 variables, and 58 constraints, problems are : Problem set: 0 solved, 2490 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 28/32 constraints, State Equation: 0/520 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1236 constraints, Known Traps: 12/12 constraints]
After SMT, in 66686ms problems are : Problem set: 0 solved, 2490 unsolved
Search for dead transitions found 0 dead transitions in 66723ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 66866 ms. Remains : 520/700 places, 2496/2670 transitions.
[2024-06-01 14:21:57] [INFO ] Flatten gal took : 100 ms
[2024-06-01 14:21:57] [INFO ] Flatten gal took : 107 ms
[2024-06-01 14:21:57] [INFO ] Input system was already deterministic with 2496 transitions.
RANDOM walk for 171 steps (3 resets) in 6 ms. (24 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-COL-S06J06T06-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 700/700 places, 2670/2670 transitions.
Ensure Unique test removed 6 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 694 transition count 2634
Reduce places removed 36 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 48 rules applied. Total rules applied 84 place count 658 transition count 2622
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 96 place count 646 transition count 2622
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 96 place count 646 transition count 2538
Deduced a syphon composed of 84 places in 6 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 264 place count 562 transition count 2538
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 5 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 336 place count 526 transition count 2502
Applied a total of 336 rules in 191 ms. Remains 526 /700 variables (removed 174) and now considering 2502/2670 (removed 168) transitions.
Running 2496 sub problems to find dead transitions.
[2024-06-01 14:21:57] [INFO ] Flow matrix only has 2466 transitions (discarded 36 similar events)
// Phase 1: matrix 2466 rows 526 cols
[2024-06-01 14:21:58] [INFO ] Computed 52 invariants in 76 ms
[2024-06-01 14:21:58] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 2496 unsolved
[2024-06-01 14:22:36] [INFO ] Deduced a trap composed of 65 places in 99 ms of which 3 ms to minimize.
[2024-06-01 14:22:36] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 1 ms to minimize.
[2024-06-01 14:22:36] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:22:37] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:22:37] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
[2024-06-01 14:22:37] [INFO ] Deduced a trap composed of 245 places in 431 ms of which 3 ms to minimize.
[2024-06-01 14:22:38] [INFO ] Deduced a trap composed of 220 places in 382 ms of which 3 ms to minimize.
[2024-06-01 14:22:38] [INFO ] Deduced a trap composed of 232 places in 487 ms of which 3 ms to minimize.
[2024-06-01 14:22:39] [INFO ] Deduced a trap composed of 214 places in 517 ms of which 3 ms to minimize.
SMT process timed out in 41342ms, After SMT, problems are : Problem set: 0 solved, 2496 unsolved
Search for dead transitions found 0 dead transitions in 41372ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41570 ms. Remains : 526/700 places, 2502/2670 transitions.
[2024-06-01 14:22:39] [INFO ] Flatten gal took : 116 ms
[2024-06-01 14:22:39] [INFO ] Flatten gal took : 109 ms
[2024-06-01 14:22:39] [INFO ] Input system was already deterministic with 2502 transitions.
Starting structural reductions in LTL mode, iteration 0 : 700/700 places, 2670/2670 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 694 transition count 2664
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 694 transition count 2664
Applied a total of 12 rules in 33 ms. Remains 694 /700 variables (removed 6) and now considering 2664/2670 (removed 6) transitions.
Running 2658 sub problems to find dead transitions.
[2024-06-01 14:22:40] [INFO ] Flow matrix only has 2628 transitions (discarded 36 similar events)
// Phase 1: matrix 2628 rows 694 cols
[2024-06-01 14:22:40] [INFO ] Computed 58 invariants in 98 ms
[2024-06-01 14:22:40] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2658 unsolved
SMT process timed out in 41050ms, After SMT, problems are : Problem set: 0 solved, 2658 unsolved
Search for dead transitions found 0 dead transitions in 41075ms
Finished structural reductions in LTL mode , in 1 iterations and 41114 ms. Remains : 694/700 places, 2664/2670 transitions.
[2024-06-01 14:23:21] [INFO ] Flatten gal took : 115 ms
[2024-06-01 14:23:21] [INFO ] Flatten gal took : 136 ms
[2024-06-01 14:23:21] [INFO ] Input system was already deterministic with 2664 transitions.
Starting structural reductions in LTL mode, iteration 0 : 700/700 places, 2670/2670 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 694 transition count 2670
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 688 transition count 2664
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 688 transition count 2664
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 682 transition count 2658
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 682 transition count 2658
Applied a total of 30 rules in 76 ms. Remains 682 /700 variables (removed 18) and now considering 2658/2670 (removed 12) transitions.
Running 2652 sub problems to find dead transitions.
[2024-06-01 14:23:21] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
// Phase 1: matrix 2622 rows 682 cols
[2024-06-01 14:23:21] [INFO ] Computed 52 invariants in 56 ms
[2024-06-01 14:23:21] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/676 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
SMT process timed out in 40990ms, After SMT, problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 41017ms
Finished structural reductions in LTL mode , in 1 iterations and 41100 ms. Remains : 682/700 places, 2658/2670 transitions.
[2024-06-01 14:24:02] [INFO ] Flatten gal took : 106 ms
[2024-06-01 14:24:03] [INFO ] Flatten gal took : 123 ms
[2024-06-01 14:24:03] [INFO ] Input system was already deterministic with 2658 transitions.
Starting structural reductions in LTL mode, iteration 0 : 700/700 places, 2670/2670 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 694 transition count 2670
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 688 transition count 2664
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 688 transition count 2664
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 682 transition count 2658
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 682 transition count 2658
Applied a total of 30 rules in 71 ms. Remains 682 /700 variables (removed 18) and now considering 2658/2670 (removed 12) transitions.
Running 2652 sub problems to find dead transitions.
[2024-06-01 14:24:03] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-06-01 14:24:03] [INFO ] Invariant cache hit.
[2024-06-01 14:24:03] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/676 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
SMT process timed out in 39405ms, After SMT, problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 39430ms
Finished structural reductions in LTL mode , in 1 iterations and 39506 ms. Remains : 682/700 places, 2658/2670 transitions.
[2024-06-01 14:24:42] [INFO ] Flatten gal took : 98 ms
[2024-06-01 14:24:42] [INFO ] Flatten gal took : 103 ms
[2024-06-01 14:24:43] [INFO ] Input system was already deterministic with 2658 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 700/700 places, 2670/2670 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 694 transition count 2646
Reduce places removed 24 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 36 rules applied. Total rules applied 60 place count 670 transition count 2634
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 72 place count 658 transition count 2634
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 72 place count 658 transition count 2544
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 252 place count 568 transition count 2544
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 360 place count 514 transition count 2490
Applied a total of 360 rules in 126 ms. Remains 514 /700 variables (removed 186) and now considering 2490/2670 (removed 180) transitions.
Running 2484 sub problems to find dead transitions.
[2024-06-01 14:24:43] [INFO ] Flow matrix only has 2454 transitions (discarded 36 similar events)
// Phase 1: matrix 2454 rows 514 cols
[2024-06-01 14:24:43] [INFO ] Computed 52 invariants in 34 ms
[2024-06-01 14:24:43] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2484 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 2484 unsolved
[2024-06-01 14:25:19] [INFO ] Deduced a trap composed of 63 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:25:19] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 0 ms to minimize.
[2024-06-01 14:25:19] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 2 ms to minimize.
[2024-06-01 14:25:19] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 1 ms to minimize.
[2024-06-01 14:25:19] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:25:20] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 4.0)
(s1 6.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.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 9.0)
(s141 0.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.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 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 1.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 1.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 1.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 1.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 1.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 1.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.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 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 1.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/2968 variables, and 52 constraints, problems are : Problem set: 0 solved, 2484 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 17/21 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/514 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2484/1230 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2484 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2484 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 2484 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 2484 unsolved
[2024-06-01 14:25:26] [INFO ] Deduced a trap composed of 43 places in 126 ms of which 1 ms to minimize.
[2024-06-01 14:25:26] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 2 ms to minimize.
[2024-06-01 14:25:26] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 13 ms to minimize.
[2024-06-01 14:25:29] [INFO ] Deduced a trap composed of 246 places in 352 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/2968 variables, and 56 constraints, problems are : Problem set: 0 solved, 2484 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 17/21 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/514 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1230 constraints, Known Traps: 10/10 constraints]
After SMT, in 59811ms problems are : Problem set: 0 solved, 2484 unsolved
Search for dead transitions found 0 dead transitions in 59834ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 59977 ms. Remains : 514/700 places, 2490/2670 transitions.
[2024-06-01 14:25:43] [INFO ] Flatten gal took : 96 ms
[2024-06-01 14:25:43] [INFO ] Flatten gal took : 104 ms
[2024-06-01 14:25:43] [INFO ] Input system was already deterministic with 2490 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 700/700 places, 2670/2670 transitions.
Ensure Unique test removed 6 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 694 transition count 2640
Reduce places removed 30 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 36 rules applied. Total rules applied 66 place count 664 transition count 2634
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 658 transition count 2634
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 72 place count 658 transition count 2544
Deduced a syphon composed of 90 places in 2 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 252 place count 568 transition count 2544
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 258 place count 562 transition count 2538
Iterating global reduction 3 with 6 rules applied. Total rules applied 264 place count 562 transition count 2538
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 324 place count 532 transition count 2508
Applied a total of 324 rules in 232 ms. Remains 532 /700 variables (removed 168) and now considering 2508/2670 (removed 162) transitions.
Running 2502 sub problems to find dead transitions.
[2024-06-01 14:25:43] [INFO ] Flow matrix only has 2472 transitions (discarded 36 similar events)
// Phase 1: matrix 2472 rows 532 cols
[2024-06-01 14:25:43] [INFO ] Computed 52 invariants in 34 ms
[2024-06-01 14:25:43] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 28/46 constraints. Problems are: Problem set: 0 solved, 2502 unsolved
[2024-06-01 14:26:21] [INFO ] Deduced a trap composed of 66 places in 100 ms of which 2 ms to minimize.
[2024-06-01 14:26:21] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:26:21] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 0 ms to minimize.
[2024-06-01 14:26:21] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:26:21] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:26:22] [INFO ] Deduced a trap composed of 244 places in 399 ms of which 4 ms to minimize.
[2024-06-01 14:26:22] [INFO ] Deduced a trap composed of 211 places in 393 ms of which 3 ms to minimize.
[2024-06-01 14:26:23] [INFO ] Deduced a trap composed of 243 places in 418 ms of which 2 ms to minimize.
[2024-06-01 14:26:24] [INFO ] Deduced a trap composed of 254 places in 474 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/3004 variables, and 55 constraints, problems are : Problem set: 0 solved, 2502 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 28/32 constraints, State Equation: 0/532 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2502/1248 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 28/46 constraints. Problems are: Problem set: 0 solved, 2502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 2502 unsolved
[2024-06-01 14:26:28] [INFO ] Deduced a trap composed of 66 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:26:29] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 1 ms to minimize.
[2024-06-01 14:26:31] [INFO ] Deduced a trap composed of 29 places in 288 ms of which 2 ms to minimize.
[2024-06-01 14:26:32] [INFO ] Deduced a trap composed of 97 places in 301 ms of which 3 ms to minimize.
[2024-06-01 14:26:33] [INFO ] Deduced a trap composed of 264 places in 291 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/3004 variables, and 60 constraints, problems are : Problem set: 0 solved, 2502 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 28/32 constraints, State Equation: 0/532 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1248 constraints, Known Traps: 14/14 constraints]
After SMT, in 60445ms problems are : Problem set: 0 solved, 2502 unsolved
Search for dead transitions found 0 dead transitions in 60475ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 60726 ms. Remains : 532/700 places, 2508/2670 transitions.
[2024-06-01 14:26:44] [INFO ] Flatten gal took : 94 ms
[2024-06-01 14:26:44] [INFO ] Flatten gal took : 99 ms
[2024-06-01 14:26:44] [INFO ] Input system was already deterministic with 2508 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 700/700 places, 2670/2670 transitions.
Ensure Unique test removed 6 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 694 transition count 2640
Reduce places removed 30 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 36 rules applied. Total rules applied 66 place count 664 transition count 2634
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 658 transition count 2634
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 72 place count 658 transition count 2586
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 168 place count 610 transition count 2586
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 204 place count 592 transition count 2568
Applied a total of 204 rules in 162 ms. Remains 592 /700 variables (removed 108) and now considering 2568/2670 (removed 102) transitions.
Running 2562 sub problems to find dead transitions.
[2024-06-01 14:26:44] [INFO ] Flow matrix only has 2532 transitions (discarded 36 similar events)
// Phase 1: matrix 2532 rows 592 cols
[2024-06-01 14:26:44] [INFO ] Computed 52 invariants in 86 ms
[2024-06-01 14:26:44] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2562 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/3124 variables, and 46 constraints, problems are : Problem set: 0 solved, 2562 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 18/22 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/592 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1308/1308 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2562 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2562 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/46 constraints. Problems are: Problem set: 0 solved, 2562 unsolved
[2024-06-01 14:27:26] [INFO ] Deduced a trap composed of 76 places in 197 ms of which 18 ms to minimize.
[2024-06-01 14:27:26] [INFO ] Deduced a trap composed of 76 places in 140 ms of which 2 ms to minimize.
[2024-06-01 14:27:26] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 1 ms to minimize.
[2024-06-01 14:27:26] [INFO ] Deduced a trap composed of 76 places in 67 ms of which 0 ms to minimize.
[2024-06-01 14:27:26] [INFO ] Deduced a trap composed of 76 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:27:27] [INFO ] Deduced a trap composed of 96 places in 447 ms of which 3 ms to minimize.
[2024-06-01 14:27:27] [INFO ] Deduced a trap composed of 127 places in 429 ms of which 4 ms to minimize.
[2024-06-01 14:27:28] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 1 ms to minimize.
[2024-06-01 14:27:29] [INFO ] Deduced a trap composed of 253 places in 468 ms of which 3 ms to minimize.
[2024-06-01 14:27:31] [INFO ] Deduced a trap composed of 347 places in 500 ms of which 3 ms to minimize.
[2024-06-01 14:27:33] [INFO ] Deduced a trap composed of 41 places in 390 ms of which 2 ms to minimize.
[2024-06-01 14:27:36] [INFO ] Deduced a trap composed of 288 places in 401 ms of which 3 ms to minimize.
[2024-06-01 14:27:38] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/3124 variables, and 59 constraints, problems are : Problem set: 0 solved, 2562 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 18/22 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/592 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1308 constraints, Known Traps: 13/13 constraints]
After SMT, in 59587ms problems are : Problem set: 0 solved, 2562 unsolved
Search for dead transitions found 0 dead transitions in 59616ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 59785 ms. Remains : 592/700 places, 2568/2670 transitions.
[2024-06-01 14:27:44] [INFO ] Flatten gal took : 92 ms
[2024-06-01 14:27:44] [INFO ] Flatten gal took : 98 ms
[2024-06-01 14:27:44] [INFO ] Input system was already deterministic with 2568 transitions.
Starting structural reductions in LTL mode, iteration 0 : 700/700 places, 2670/2670 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 694 transition count 2670
Applied a total of 6 rules in 19 ms. Remains 694 /700 variables (removed 6) and now considering 2670/2670 (removed 0) transitions.
Running 2664 sub problems to find dead transitions.
[2024-06-01 14:27:44] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
// Phase 1: matrix 2634 rows 694 cols
[2024-06-01 14:27:45] [INFO ] Computed 52 invariants in 105 ms
[2024-06-01 14:27:45] [INFO ] State equation strengthened by 168 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 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 1.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 1.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 1.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 1.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 1.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 10.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 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.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 1.0)
(s203 1.0)
(s204 1.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 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 1.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 1.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 1.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 1.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 1.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 1.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 1.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 0.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 0.0)
(s292 0.0)
(s293 0.0)
(s294 1.0)
(s295 0.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 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
SMT process timed out in 39773ms, After SMT, problems are : Problem set: 0 solved, 2664 unsolved
Search for dead transitions found 0 dead transitions in 39798ms
Finished structural reductions in LTL mode , in 1 iterations and 39822 ms. Remains : 694/700 places, 2670/2670 transitions.
[2024-06-01 14:28:24] [INFO ] Flatten gal took : 97 ms
[2024-06-01 14:28:24] [INFO ] Flatten gal took : 173 ms
[2024-06-01 14:28:25] [INFO ] Input system was already deterministic with 2670 transitions.
Starting structural reductions in LTL mode, iteration 0 : 700/700 places, 2670/2670 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 694 transition count 2670
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 688 transition count 2664
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 688 transition count 2664
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 682 transition count 2658
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 682 transition count 2658
Applied a total of 30 rules in 84 ms. Remains 682 /700 variables (removed 18) and now considering 2658/2670 (removed 12) transitions.
Running 2652 sub problems to find dead transitions.
[2024-06-01 14:28:25] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
// Phase 1: matrix 2622 rows 682 cols
[2024-06-01 14:28:25] [INFO ] Computed 52 invariants in 88 ms
[2024-06-01 14:28:25] [INFO ] State equation strengthened by 168 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/676 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
SMT process timed out in 40301ms, After SMT, problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 40334ms
Finished structural reductions in LTL mode , in 1 iterations and 40431 ms. Remains : 682/700 places, 2658/2670 transitions.
[2024-06-01 14:29:05] [INFO ] Flatten gal took : 101 ms
[2024-06-01 14:29:05] [INFO ] Flatten gal took : 109 ms
[2024-06-01 14:29:06] [INFO ] Input system was already deterministic with 2658 transitions.
Starting structural reductions in LTL mode, iteration 0 : 700/700 places, 2670/2670 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 694 transition count 2670
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 688 transition count 2664
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 688 transition count 2664
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 682 transition count 2658
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 682 transition count 2658
Applied a total of 30 rules in 44 ms. Remains 682 /700 variables (removed 18) and now considering 2658/2670 (removed 12) transitions.
Running 2652 sub problems to find dead transitions.
[2024-06-01 14:29:06] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-06-01 14:29:06] [INFO ] Invariant cache hit.
[2024-06-01 14:29:06] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/676 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
SMT process timed out in 40121ms, After SMT, problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 40145ms
Finished structural reductions in LTL mode , in 1 iterations and 40194 ms. Remains : 682/700 places, 2658/2670 transitions.
[2024-06-01 14:29:46] [INFO ] Flatten gal took : 102 ms
[2024-06-01 14:29:46] [INFO ] Flatten gal took : 112 ms
[2024-06-01 14:29:46] [INFO ] Input system was already deterministic with 2658 transitions.
Starting structural reductions in LTL mode, iteration 0 : 700/700 places, 2670/2670 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 694 transition count 2670
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 688 transition count 2664
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 688 transition count 2664
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 682 transition count 2658
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 682 transition count 2658
Applied a total of 30 rules in 48 ms. Remains 682 /700 variables (removed 18) and now considering 2658/2670 (removed 12) transitions.
Running 2652 sub problems to find dead transitions.
[2024-06-01 14:29:46] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-06-01 14:29:46] [INFO ] Invariant cache hit.
[2024-06-01 14:29:46] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/676 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
SMT process timed out in 40810ms, After SMT, problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 40835ms
Finished structural reductions in LTL mode , in 1 iterations and 40888 ms. Remains : 682/700 places, 2658/2670 transitions.
[2024-06-01 14:30:27] [INFO ] Flatten gal took : 102 ms
[2024-06-01 14:30:27] [INFO ] Flatten gal took : 114 ms
[2024-06-01 14:30:27] [INFO ] Input system was already deterministic with 2658 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 700/700 places, 2670/2670 transitions.
Ensure Unique test removed 6 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 694 transition count 2640
Reduce places removed 30 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 36 rules applied. Total rules applied 66 place count 664 transition count 2634
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 658 transition count 2634
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 72 place count 658 transition count 2538
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 264 place count 562 transition count 2538
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 270 place count 556 transition count 2532
Iterating global reduction 3 with 6 rules applied. Total rules applied 276 place count 556 transition count 2532
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 372 place count 508 transition count 2484
Applied a total of 372 rules in 149 ms. Remains 508 /700 variables (removed 192) and now considering 2484/2670 (removed 186) transitions.
Running 2478 sub problems to find dead transitions.
[2024-06-01 14:30:28] [INFO ] Flow matrix only has 2448 transitions (discarded 36 similar events)
// Phase 1: matrix 2448 rows 508 cols
[2024-06-01 14:30:28] [INFO ] Computed 52 invariants in 36 ms
[2024-06-01 14:30:28] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2478 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 26/46 constraints. Problems are: Problem set: 0 solved, 2478 unsolved
[2024-06-01 14:31:05] [INFO ] Deduced a trap composed of 62 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:31:05] [INFO ] Deduced a trap composed of 62 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:31:05] [INFO ] Deduced a trap composed of 62 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:31:05] [INFO ] Deduced a trap composed of 62 places in 96 ms of which 1 ms to minimize.
[2024-06-01 14:31:06] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 0 ms to minimize.
[2024-06-01 14:31:06] [INFO ] Deduced a trap composed of 62 places in 58 ms of which 0 ms to minimize.
[2024-06-01 14:31:07] [INFO ] Deduced a trap composed of 71 places in 349 ms of which 3 ms to minimize.
[2024-06-01 14:31:09] [INFO ] Deduced a trap composed of 240 places in 397 ms of which 3 ms to minimize.
SMT process timed out in 41256ms, After SMT, problems are : Problem set: 0 solved, 2478 unsolved
Search for dead transitions found 0 dead transitions in 41283ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41438 ms. Remains : 508/700 places, 2484/2670 transitions.
[2024-06-01 14:31:09] [INFO ] Flatten gal took : 88 ms
[2024-06-01 14:31:09] [INFO ] Flatten gal took : 94 ms
[2024-06-01 14:31:10] [INFO ] Input system was already deterministic with 2484 transitions.
[2024-06-01 14:31:10] [INFO ] Flatten gal took : 194 ms
[2024-06-01 14:31:10] [INFO ] Flatten gal took : 138 ms
[2024-06-01 14:31:11] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 73 ms.
[2024-06-01 14:31:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 700 places, 2670 transitions and 15888 arcs took 50 ms.
Total runtime 863982 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : PolyORBLF-COL-S06J06T06-CTLFireability-2024-00
Could not compute solution for formula : PolyORBLF-COL-S06J06T06-CTLFireability-2024-03
Could not compute solution for formula : PolyORBLF-COL-S06J06T06-CTLFireability-2024-04
Could not compute solution for formula : PolyORBLF-COL-S06J06T06-CTLFireability-2024-05
Could not compute solution for formula : PolyORBLF-COL-S06J06T06-CTLFireability-2024-06
Could not compute solution for formula : PolyORBLF-COL-S06J06T06-CTLFireability-2024-07
Could not compute solution for formula : PolyORBLF-COL-S06J06T06-CTLFireability-2024-08
Could not compute solution for formula : PolyORBLF-COL-S06J06T06-CTLFireability-2024-09
Could not compute solution for formula : PolyORBLF-COL-S06J06T06-CTLFireability-2024-10
Could not compute solution for formula : PolyORBLF-COL-S06J06T06-CTLFireability-2024-11
Could not compute solution for formula : PolyORBLF-COL-S06J06T06-CTLFireability-2024-12
Could not compute solution for formula : PolyORBLF-COL-S06J06T06-CTLFireability-2024-13
Could not compute solution for formula : PolyORBLF-COL-S06J06T06-CTLFireability-2024-14
BK_STOP 1717252272070
--------------------
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-S06J06T06-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/978/ctl_0_
ctl formula name PolyORBLF-COL-S06J06T06-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/978/ctl_1_
ctl formula name PolyORBLF-COL-S06J06T06-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/978/ctl_2_
ctl formula name PolyORBLF-COL-S06J06T06-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/978/ctl_3_
ctl formula name PolyORBLF-COL-S06J06T06-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/978/ctl_4_
ctl formula name PolyORBLF-COL-S06J06T06-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/978/ctl_5_
ctl formula name PolyORBLF-COL-S06J06T06-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/978/ctl_6_
ctl formula name PolyORBLF-COL-S06J06T06-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/978/ctl_7_
ctl formula name PolyORBLF-COL-S06J06T06-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/978/ctl_8_
ctl formula name PolyORBLF-COL-S06J06T06-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/978/ctl_9_
ctl formula name PolyORBLF-COL-S06J06T06-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/978/ctl_10_
ctl formula name PolyORBLF-COL-S06J06T06-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/978/ctl_11_
ctl formula name PolyORBLF-COL-S06J06T06-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/978/ctl_12_
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-S06J06T06"
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-S06J06T06, 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-171654446600202"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S06J06T06.tgz
mv PolyORBLF-COL-S06J06T06 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 '
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 ;