Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r333-tall-171679078700570.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is SemanticWebServices-PT-S256P06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r333-tall-171679078700570
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 02:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Apr 12 02:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 02:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 02:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 16M 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 SemanticWebServices-PT-S256P06-CTLFireability-2024-00
FORMULA_NAME SemanticWebServices-PT-S256P06-CTLFireability-2024-01
FORMULA_NAME SemanticWebServices-PT-S256P06-CTLFireability-2024-02
FORMULA_NAME SemanticWebServices-PT-S256P06-CTLFireability-2024-03
FORMULA_NAME SemanticWebServices-PT-S256P06-CTLFireability-2024-04
FORMULA_NAME SemanticWebServices-PT-S256P06-CTLFireability-2024-05
FORMULA_NAME SemanticWebServices-PT-S256P06-CTLFireability-2024-06
FORMULA_NAME SemanticWebServices-PT-S256P06-CTLFireability-2024-07
FORMULA_NAME SemanticWebServices-PT-S256P06-CTLFireability-2024-08
FORMULA_NAME SemanticWebServices-PT-S256P06-CTLFireability-2024-09
FORMULA_NAME SemanticWebServices-PT-S256P06-CTLFireability-2024-10
FORMULA_NAME SemanticWebServices-PT-S256P06-CTLFireability-2024-11
FORMULA_NAME SemanticWebServices-PT-S256P06-CTLFireability-2023-12
FORMULA_NAME SemanticWebServices-PT-S256P06-CTLFireability-2023-13
FORMULA_NAME SemanticWebServices-PT-S256P06-CTLFireability-2023-14
FORMULA_NAME SemanticWebServices-PT-S256P06-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716873826267

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SemanticWebServices-PT-S256P06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 05:23:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 05:23:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 05:23:48] [INFO ] Load time of PNML (sax parser for PT used): 715 ms
[2024-05-28 05:23:48] [INFO ] Transformed 439 places.
[2024-05-28 05:23:48] [INFO ] Transformed 14102 transitions.
[2024-05-28 05:23:48] [INFO ] Parsed PT model containing 439 places and 14102 transitions and 130267 arcs in 950 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
Deduced a syphon composed of 65 places in 33 ms
Reduce places removed 65 places and 7242 transitions.
Ensure Unique test removed 2131 transitions
Reduce redundant transitions removed 2131 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA SemanticWebServices-PT-S256P06-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S256P06-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S256P06-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S256P06-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S256P06-CTLFireability-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S256P06-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 74 out of 374 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 374/374 places, 4729/4729 transitions.
Ensure Unique test removed 13 places
Reduce places removed 101 places and 0 transitions.
Ensure Unique test removed 1404 transitions
Reduce isomorphic transitions removed 1404 transitions.
Iterating post reduction 0 with 1505 rules applied. Total rules applied 1505 place count 273 transition count 3325
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 1542 place count 236 transition count 2909
Iterating global reduction 1 with 37 rules applied. Total rules applied 1579 place count 236 transition count 2909
Ensure Unique test removed 756 transitions
Reduce isomorphic transitions removed 756 transitions.
Iterating post reduction 1 with 756 rules applied. Total rules applied 2335 place count 236 transition count 2153
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 2342 place count 229 transition count 2146
Iterating global reduction 2 with 7 rules applied. Total rules applied 2349 place count 229 transition count 2146
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 2356 place count 229 transition count 2139
Drop transitions (Redundant composition of simpler transitions.) removed 306 transitions
Redundant transition composition rules discarded 306 transitions
Iterating global reduction 3 with 306 rules applied. Total rules applied 2662 place count 229 transition count 1833
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 3 with 70 rules applied. Total rules applied 2732 place count 209 transition count 1783
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 2735 place count 206 transition count 1769
Iterating global reduction 4 with 3 rules applied. Total rules applied 2738 place count 206 transition count 1769
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 2755 place count 206 transition count 1752
Drop transitions (Redundant composition of simpler transitions.) removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 5 with 70 rules applied. Total rules applied 2825 place count 206 transition count 1682
Applied a total of 2825 rules in 115 ms. Remains 206 /374 variables (removed 168) and now considering 1682/4729 (removed 3047) transitions.
Running 1448 sub problems to find dead transitions.
[2024-05-28 05:23:48] [INFO ] Flow matrix only has 452 transitions (discarded 1230 similar events)
Normalized transition count is 451 out of 452 initially.
// Phase 1: matrix 451 rows 206 cols
[2024-05-28 05:23:48] [INFO ] Computed 2 invariants in 25 ms
[2024-05-28 05:23:48] [INFO ] State equation strengthened by 213 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1448 unsolved
At refinement iteration 2 (OVERLAPS) 2/201 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1448 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 2.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s38 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 2.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.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 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 2.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.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)
(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 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 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 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1448 unsolved
SMT process timed out in 21124ms, After SMT, problems are : Problem set: 0 solved, 1448 unsolved
Search for dead transitions found 0 dead transitions in 21166ms
[2024-05-28 05:24:09] [INFO ] Flow matrix only has 452 transitions (discarded 1230 similar events)
[2024-05-28 05:24:09] [INFO ] Invariant cache hit.
[2024-05-28 05:24:09] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-28 05:24:10] [INFO ] Flow matrix only has 452 transitions (discarded 1230 similar events)
[2024-05-28 05:24:10] [INFO ] Invariant cache hit.
[2024-05-28 05:24:10] [INFO ] State equation strengthened by 213 read => feed constraints.
[2024-05-28 05:24:10] [INFO ] Implicit Places using invariants and state equation in 687 ms returned []
Implicit Place search using SMT with State Equation took 867 ms to find 0 implicit places.
Running 1448 sub problems to find dead transitions.
[2024-05-28 05:24:10] [INFO ] Flow matrix only has 452 transitions (discarded 1230 similar events)
[2024-05-28 05:24:10] [INFO ] Invariant cache hit.
[2024-05-28 05:24:10] [INFO ] State equation strengthened by 213 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1448 unsolved
At refinement iteration 2 (OVERLAPS) 2/201 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1448 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1448 unsolved
At refinement iteration 4 (OVERLAPS) 448/649 variables, 201/203 constraints. Problems are: Problem set: 0 solved, 1448 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/649 variables, 212/415 constraints. Problems are: Problem set: 0 solved, 1448 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 (/ 7.0 4.0))
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s38 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 (/ 7.0 8.0))
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 2.0)
(s48 (/ 7.0 8.0))
(s49 1.0)
(s50 1.0)
(s51 (/ 7.0 8.0))
(s52 1.0)
(s53 1.0)
(s55 1.0)
(s56 1.0)
(s57 (/ 7.0 8.0))
(s58 (/ 15.0 8.0))
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 3.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 (/ 7.0 8.0))
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 3.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 (/ 7.0 8.0))
(s94 1.0)
(s95 2.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 (/ 7.0 8.0))
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 (/ 7.0 8.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)
(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 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 (/ 7.0 2.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 (/ 9.0 8.0))
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 649/658 variables, and 415 constraints, problems are : Problem set: 0 solved, 1448 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 201/206 constraints, ReadFeed: 212/213 constraints, PredecessorRefiner: 1448/1448 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1448 unsolved
At refinement iteration 2 (OVERLAPS) 2/201 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1448 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1448 unsolved
At refinement iteration 4 (OVERLAPS) 448/649 variables, 201/203 constraints. Problems are: Problem set: 0 solved, 1448 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/649 variables, 212/415 constraints. Problems are: Problem set: 0 solved, 1448 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/649 variables, 1386/1801 constraints. Problems are: Problem set: 0 solved, 1448 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 649/658 variables, and 1801 constraints, problems are : Problem set: 0 solved, 1448 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 201/206 constraints, ReadFeed: 212/213 constraints, PredecessorRefiner: 1386/1448 constraints, Known Traps: 0/0 constraints]
After SMT, in 60880ms problems are : Problem set: 0 solved, 1448 unsolved
Search for dead transitions found 0 dead transitions in 60894ms
Starting structural reductions in LTL mode, iteration 1 : 206/374 places, 1682/4729 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83097 ms. Remains : 206/374 places, 1682/4729 transitions.
Support contains 74 out of 206 places after structural reductions.
[2024-05-28 05:25:11] [INFO ] Flatten gal took : 119 ms
[2024-05-28 05:25:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SemanticWebServices-PT-S256P06-CTLFireability-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 05:25:12] [INFO ] Flatten gal took : 83 ms
[2024-05-28 05:25:12] [INFO ] Input system was already deterministic with 1682 transitions.
Support contains 60 out of 206 places (down from 74) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2169 ms. (18 steps per ms) remains 1/17 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 1/1 properties
[2024-05-28 05:25:13] [INFO ] Flow matrix only has 452 transitions (discarded 1230 similar events)
[2024-05-28 05:25:13] [INFO ] Invariant cache hit.
[2024-05-28 05:25:13] [INFO ] State equation strengthened by 213 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/44 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 122/166 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 129/295 variables, 48/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 17/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/297 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/297 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 54/351 variables, 18/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/351 variables, 6/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/351 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 76/427 variables, 15/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/427 variables, 9/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/427 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 72/499 variables, 17/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/499 variables, 39/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/499 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 28/527 variables, 13/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/527 variables, 8/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/527 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 6/533 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/533 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/533 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 46/579 variables, 121/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/579 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 38/617 variables, 38/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/617 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/617 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 617/658 variables, and 390 constraints, problems are : Problem set: 0 solved, 1 unsolved in 345 ms.
Refiners :[Generalized P Invariants (flows): 1/2 constraints, State Equation: 186/206 constraints, ReadFeed: 203/213 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/44 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 122/166 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 129/295 variables, 48/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 17/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/297 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/297 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 54/351 variables, 18/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/351 variables, 6/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/351 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 76/427 variables, 15/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/427 variables, 9/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/427 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 72/499 variables, 17/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/499 variables, 39/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/499 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 28/527 variables, 13/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/527 variables, 8/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/527 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 6/533 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/533 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/533 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 46/579 variables, 121/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/579 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 38/617 variables, 38/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/617 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/617 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/617 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 617/658 variables, and 391 constraints, problems are : Problem set: 0 solved, 1 unsolved in 430 ms.
Refiners :[Generalized P Invariants (flows): 1/2 constraints, State Equation: 186/206 constraints, ReadFeed: 203/213 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 858ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 119 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=39 )
Parikh walk visited 1 properties in 15 ms.
[2024-05-28 05:25:14] [INFO ] Flatten gal took : 52 ms
[2024-05-28 05:25:14] [INFO ] Flatten gal took : 55 ms
[2024-05-28 05:25:14] [INFO ] Input system was already deterministic with 1682 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 206/206 places, 1682/1682 transitions.
Graph (complete) has 2071 edges and 206 vertex of which 196 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.13 ms
Discarding 10 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 195 transition count 1673
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 23 place count 178 transition count 1385
Iterating global reduction 1 with 17 rules applied. Total rules applied 40 place count 178 transition count 1385
Ensure Unique test removed 285 transitions
Reduce isomorphic transitions removed 285 transitions.
Iterating post reduction 1 with 285 rules applied. Total rules applied 325 place count 178 transition count 1100
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 328 place count 175 transition count 1091
Iterating global reduction 2 with 3 rules applied. Total rules applied 331 place count 175 transition count 1091
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 337 place count 175 transition count 1085
Drop transitions (Redundant composition of simpler transitions.) removed 104 transitions
Redundant transition composition rules discarded 104 transitions
Iterating global reduction 3 with 104 rules applied. Total rules applied 441 place count 175 transition count 981
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Graph (complete) has 1527 edges and 170 vertex of which 169 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 3 with 29 rules applied. Total rules applied 470 place count 169 transition count 957
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 473 place count 166 transition count 931
Iterating global reduction 4 with 3 rules applied. Total rules applied 476 place count 166 transition count 931
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 480 place count 166 transition count 927
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 481 place count 166 transition count 926
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 482 place count 165 transition count 926
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 483 place count 165 transition count 925
Applied a total of 483 rules in 236 ms. Remains 165 /206 variables (removed 41) and now considering 925/1682 (removed 757) transitions.
Running 729 sub problems to find dead transitions.
[2024-05-28 05:25:14] [INFO ] Flow matrix only has 356 transitions (discarded 569 similar events)
Normalized transition count is 355 out of 356 initially.
// Phase 1: matrix 355 rows 165 cols
[2024-05-28 05:25:14] [INFO ] Computed 1 invariants in 3 ms
[2024-05-28 05:25:14] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 729 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 729 unsolved
At refinement iteration 2 (OVERLAPS) 351/511 variables, 160/161 constraints. Problems are: Problem set: 0 solved, 729 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 160/321 constraints. Problems are: Problem set: 0 solved, 729 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 729 unsolved
At refinement iteration 5 (OVERLAPS) 7/518 variables, 4/325 constraints. Problems are: Problem set: 0 solved, 729 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 729 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 518/521 variables, and 325 constraints, problems are : Problem set: 0 solved, 729 unsolved in 20017 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/165 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 729/729 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 729 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 729 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 729 unsolved
At refinement iteration 2 (OVERLAPS) 351/511 variables, 160/161 constraints. Problems are: Problem set: 0 solved, 729 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 160/321 constraints. Problems are: Problem set: 0 solved, 729 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 621/942 constraints. Problems are: Problem set: 0 solved, 729 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 0/942 constraints. Problems are: Problem set: 0 solved, 729 unsolved
At refinement iteration 6 (OVERLAPS) 7/518 variables, 4/946 constraints. Problems are: Problem set: 0 solved, 729 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/518 variables, 107/1053 constraints. Problems are: Problem set: 0 solved, 729 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 518/521 variables, and 1053 constraints, problems are : Problem set: 0 solved, 729 unsolved in 20022 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/165 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 728/729 constraints, Known Traps: 0/0 constraints]
After SMT, in 40347ms problems are : Problem set: 0 solved, 729 unsolved
Search for dead transitions found 0 dead transitions in 40356ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 40594 ms. Remains : 165/206 places, 925/1682 transitions.
[2024-05-28 05:25:54] [INFO ] Flatten gal took : 24 ms
[2024-05-28 05:25:54] [INFO ] Flatten gal took : 26 ms
[2024-05-28 05:25:54] [INFO ] Input system was already deterministic with 925 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 206/206 places, 1682/1682 transitions.
Graph (complete) has 2071 edges and 206 vertex of which 197 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Discarding 9 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 196 transition count 1666
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 30 place count 179 transition count 1384
Iterating global reduction 1 with 17 rules applied. Total rules applied 47 place count 179 transition count 1384
Ensure Unique test removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Iterating post reduction 1 with 108 rules applied. Total rules applied 155 place count 179 transition count 1276
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 157 place count 177 transition count 1267
Iterating global reduction 2 with 2 rules applied. Total rules applied 159 place count 177 transition count 1267
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 164 place count 177 transition count 1262
Drop transitions (Redundant composition of simpler transitions.) removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 3 with 70 rules applied. Total rules applied 234 place count 177 transition count 1192
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Graph (complete) has 1574 edges and 171 vertex of which 170 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 3 with 33 rules applied. Total rules applied 267 place count 170 transition count 1165
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 270 place count 167 transition count 1139
Iterating global reduction 4 with 3 rules applied. Total rules applied 273 place count 167 transition count 1139
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 277 place count 167 transition count 1135
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 278 place count 167 transition count 1134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 279 place count 166 transition count 1134
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 280 place count 166 transition count 1133
Applied a total of 280 rules in 223 ms. Remains 166 /206 variables (removed 40) and now considering 1133/1682 (removed 549) transitions.
Running 943 sub problems to find dead transitions.
[2024-05-28 05:25:55] [INFO ] Flow matrix only has 359 transitions (discarded 774 similar events)
Normalized transition count is 358 out of 359 initially.
// Phase 1: matrix 358 rows 166 cols
[2024-05-28 05:25:55] [INFO ] Computed 1 invariants in 3 ms
[2024-05-28 05:25:55] [INFO ] State equation strengthened by 169 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 943 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 943 unsolved
At refinement iteration 2 (OVERLAPS) 355/517 variables, 162/163 constraints. Problems are: Problem set: 0 solved, 943 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/517 variables, 169/332 constraints. Problems are: Problem set: 0 solved, 943 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/517 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 943 unsolved
At refinement iteration 5 (OVERLAPS) 3/520 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 943 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/525 variables, and 334 constraints, problems are : Problem set: 0 solved, 943 unsolved in 20022 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/166 constraints, ReadFeed: 169/169 constraints, PredecessorRefiner: 943/943 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 943 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 943 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 943 unsolved
At refinement iteration 2 (OVERLAPS) 355/517 variables, 162/163 constraints. Problems are: Problem set: 0 solved, 943 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/517 variables, 169/332 constraints. Problems are: Problem set: 0 solved, 943 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/517 variables, 930/1262 constraints. Problems are: Problem set: 0 solved, 943 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/517 variables, 0/1262 constraints. Problems are: Problem set: 0 solved, 943 unsolved
At refinement iteration 6 (OVERLAPS) 3/520 variables, 2/1264 constraints. Problems are: Problem set: 0 solved, 943 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/525 variables, and 1276 constraints, problems are : Problem set: 0 solved, 943 unsolved in 20027 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/166 constraints, ReadFeed: 169/169 constraints, PredecessorRefiner: 942/943 constraints, Known Traps: 0/0 constraints]
After SMT, in 40604ms problems are : Problem set: 0 solved, 943 unsolved
Search for dead transitions found 0 dead transitions in 40613ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 40838 ms. Remains : 166/206 places, 1133/1682 transitions.
[2024-05-28 05:26:35] [INFO ] Flatten gal took : 29 ms
[2024-05-28 05:26:35] [INFO ] Flatten gal took : 33 ms
[2024-05-28 05:26:35] [INFO ] Input system was already deterministic with 1133 transitions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 1682/1682 transitions.
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 201 transition count 1669
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 36 place count 183 transition count 1323
Iterating global reduction 1 with 18 rules applied. Total rules applied 54 place count 183 transition count 1323
Ensure Unique test removed 296 transitions
Reduce isomorphic transitions removed 296 transitions.
Iterating post reduction 1 with 296 rules applied. Total rules applied 350 place count 183 transition count 1027
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 352 place count 181 transition count 1019
Iterating global reduction 2 with 2 rules applied. Total rules applied 354 place count 181 transition count 1019
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 359 place count 181 transition count 1014
Drop transitions (Redundant composition of simpler transitions.) removed 64 transitions
Redundant transition composition rules discarded 64 transitions
Iterating global reduction 3 with 64 rules applied. Total rules applied 423 place count 181 transition count 950
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 454 place count 176 transition count 924
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 456 place count 174 transition count 899
Iterating global reduction 4 with 2 rules applied. Total rules applied 458 place count 174 transition count 899
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 461 place count 174 transition count 896
Applied a total of 461 rules in 19 ms. Remains 174 /206 variables (removed 32) and now considering 896/1682 (removed 786) transitions.
Running 701 sub problems to find dead transitions.
[2024-05-28 05:26:35] [INFO ] Flow matrix only has 361 transitions (discarded 535 similar events)
Normalized transition count is 360 out of 361 initially.
// Phase 1: matrix 360 rows 174 cols
[2024-05-28 05:26:35] [INFO ] Computed 2 invariants in 1 ms
[2024-05-28 05:26:35] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 2 (OVERLAPS) 2/174 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 4 (OVERLAPS) 360/534 variables, 174/176 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 161/337 constraints. Problems are: Problem set: 0 solved, 701 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 7 (OVERLAPS) 0/534 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 701 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/535 variables, and 337 constraints, problems are : Problem set: 0 solved, 701 unsolved in 20014 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 174/174 constraints, ReadFeed: 161/161 constraints, PredecessorRefiner: 701/701 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 701 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 2 (OVERLAPS) 2/174 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 4 (OVERLAPS) 360/534 variables, 174/176 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 161/337 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 701/1038 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 701 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 1038 constraints, problems are : Problem set: 0 solved, 701 unsolved in 20021 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 174/174 constraints, ReadFeed: 161/161 constraints, PredecessorRefiner: 701/701 constraints, Known Traps: 0/0 constraints]
After SMT, in 40238ms problems are : Problem set: 0 solved, 701 unsolved
Search for dead transitions found 0 dead transitions in 40245ms
Finished structural reductions in LTL mode , in 1 iterations and 40265 ms. Remains : 174/206 places, 896/1682 transitions.
[2024-05-28 05:27:16] [INFO ] Flatten gal took : 28 ms
[2024-05-28 05:27:16] [INFO ] Flatten gal took : 22 ms
[2024-05-28 05:27:16] [INFO ] Input system was already deterministic with 896 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 206/206 places, 1682/1682 transitions.
Graph (complete) has 2071 edges and 206 vertex of which 195 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 ms
Discarding 11 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 194 transition count 1665
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 30 place count 178 transition count 1428
Iterating global reduction 1 with 16 rules applied. Total rules applied 46 place count 178 transition count 1428
Ensure Unique test removed 300 transitions
Reduce isomorphic transitions removed 300 transitions.
Iterating post reduction 1 with 300 rules applied. Total rules applied 346 place count 178 transition count 1128
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 349 place count 175 transition count 1119
Iterating global reduction 2 with 3 rules applied. Total rules applied 352 place count 175 transition count 1119
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 358 place count 175 transition count 1113
Drop transitions (Redundant composition of simpler transitions.) removed 80 transitions
Redundant transition composition rules discarded 80 transitions
Iterating global reduction 3 with 80 rules applied. Total rules applied 438 place count 175 transition count 1033
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1555 edges and 171 vertex of which 170 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 3 with 13 rules applied. Total rules applied 451 place count 170 transition count 1024
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 452 place count 169 transition count 1023
Iterating global reduction 4 with 1 rules applied. Total rules applied 453 place count 169 transition count 1023
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 454 place count 169 transition count 1022
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 455 place count 169 transition count 1021
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 456 place count 168 transition count 1021
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 457 place count 168 transition count 1020
Applied a total of 457 rules in 111 ms. Remains 168 /206 variables (removed 38) and now considering 1020/1682 (removed 662) transitions.
Running 821 sub problems to find dead transitions.
[2024-05-28 05:27:16] [INFO ] Flow matrix only has 357 transitions (discarded 663 similar events)
Normalized transition count is 356 out of 357 initially.
// Phase 1: matrix 356 rows 168 cols
[2024-05-28 05:27:16] [INFO ] Computed 1 invariants in 2 ms
[2024-05-28 05:27:16] [INFO ] State equation strengthened by 158 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 821 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 821 unsolved
At refinement iteration 2 (OVERLAPS) 352/516 variables, 164/165 constraints. Problems are: Problem set: 0 solved, 821 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/516 variables, 158/323 constraints. Problems are: Problem set: 0 solved, 821 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/516 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 821 unsolved
At refinement iteration 5 (OVERLAPS) 6/522 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 821 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 821 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 522/525 variables, and 326 constraints, problems are : Problem set: 0 solved, 821 unsolved in 20035 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/168 constraints, ReadFeed: 158/158 constraints, PredecessorRefiner: 821/821 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 821 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 821 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 821 unsolved
At refinement iteration 2 (OVERLAPS) 352/516 variables, 164/165 constraints. Problems are: Problem set: 0 solved, 821 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/516 variables, 158/323 constraints. Problems are: Problem set: 0 solved, 821 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/516 variables, 767/1090 constraints. Problems are: Problem set: 0 solved, 821 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/516 variables, 0/1090 constraints. Problems are: Problem set: 0 solved, 821 unsolved
At refinement iteration 6 (OVERLAPS) 6/522 variables, 3/1093 constraints. Problems are: Problem set: 0 solved, 821 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 53/1146 constraints. Problems are: Problem set: 0 solved, 821 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 522/525 variables, and 1146 constraints, problems are : Problem set: 0 solved, 821 unsolved in 20028 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/168 constraints, ReadFeed: 158/158 constraints, PredecessorRefiner: 820/821 constraints, Known Traps: 0/0 constraints]
After SMT, in 40303ms problems are : Problem set: 0 solved, 821 unsolved
Search for dead transitions found 0 dead transitions in 40310ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 40423 ms. Remains : 168/206 places, 1020/1682 transitions.
[2024-05-28 05:27:56] [INFO ] Flatten gal took : 23 ms
[2024-05-28 05:27:56] [INFO ] Flatten gal took : 35 ms
[2024-05-28 05:27:56] [INFO ] Input system was already deterministic with 1020 transitions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 1682/1682 transitions.
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 201 transition count 1669
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 35 place count 184 transition count 1389
Iterating global reduction 1 with 17 rules applied. Total rules applied 52 place count 184 transition count 1389
Ensure Unique test removed 294 transitions
Reduce isomorphic transitions removed 294 transitions.
Iterating post reduction 1 with 294 rules applied. Total rules applied 346 place count 184 transition count 1095
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 348 place count 182 transition count 1087
Iterating global reduction 2 with 2 rules applied. Total rules applied 350 place count 182 transition count 1087
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 355 place count 182 transition count 1082
Drop transitions (Redundant composition of simpler transitions.) removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 3 with 62 rules applied. Total rules applied 417 place count 182 transition count 1020
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 425 place count 180 transition count 1014
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 427 place count 178 transition count 989
Iterating global reduction 4 with 2 rules applied. Total rules applied 429 place count 178 transition count 989
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 432 place count 178 transition count 986
Applied a total of 432 rules in 18 ms. Remains 178 /206 variables (removed 28) and now considering 986/1682 (removed 696) transitions.
Running 781 sub problems to find dead transitions.
[2024-05-28 05:27:56] [INFO ] Flow matrix only has 375 transitions (discarded 611 similar events)
Normalized transition count is 374 out of 375 initially.
// Phase 1: matrix 374 rows 178 cols
[2024-05-28 05:27:56] [INFO ] Computed 2 invariants in 4 ms
[2024-05-28 05:27:56] [INFO ] State equation strengthened by 165 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 2 (OVERLAPS) 2/175 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 4 (OVERLAPS) 371/546 variables, 175/177 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/546 variables, 165/342 constraints. Problems are: Problem set: 0 solved, 781 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 6 (INCLUDED_ONLY) 0/546 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 781 unsolved
SMT process timed out in 20280ms, After SMT, problems are : Problem set: 0 solved, 781 unsolved
Search for dead transitions found 0 dead transitions in 20288ms
Finished structural reductions in LTL mode , in 1 iterations and 20308 ms. Remains : 178/206 places, 986/1682 transitions.
[2024-05-28 05:28:17] [INFO ] Flatten gal took : 21 ms
[2024-05-28 05:28:17] [INFO ] Flatten gal took : 23 ms
[2024-05-28 05:28:17] [INFO ] Input system was already deterministic with 986 transitions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 1682/1682 transitions.
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 201 transition count 1669
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 37 place count 182 transition count 1320
Iterating global reduction 1 with 19 rules applied. Total rules applied 56 place count 182 transition count 1320
Ensure Unique test removed 305 transitions
Reduce isomorphic transitions removed 305 transitions.
Iterating post reduction 1 with 305 rules applied. Total rules applied 361 place count 182 transition count 1015
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 363 place count 180 transition count 1007
Iterating global reduction 2 with 2 rules applied. Total rules applied 365 place count 180 transition count 1007
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 370 place count 180 transition count 1002
Drop transitions (Redundant composition of simpler transitions.) removed 64 transitions
Redundant transition composition rules discarded 64 transitions
Iterating global reduction 3 with 64 rules applied. Total rules applied 434 place count 180 transition count 938
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 465 place count 175 transition count 912
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 467 place count 173 transition count 887
Iterating global reduction 4 with 2 rules applied. Total rules applied 469 place count 173 transition count 887
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 472 place count 173 transition count 884
Applied a total of 472 rules in 15 ms. Remains 173 /206 variables (removed 33) and now considering 884/1682 (removed 798) transitions.
Running 698 sub problems to find dead transitions.
[2024-05-28 05:28:17] [INFO ] Flow matrix only has 352 transitions (discarded 532 similar events)
Normalized transition count is 351 out of 352 initially.
// Phase 1: matrix 351 rows 173 cols
[2024-05-28 05:28:17] [INFO ] Computed 2 invariants in 3 ms
[2024-05-28 05:28:17] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 2 (OVERLAPS) 2/173 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 4 (OVERLAPS) 351/524 variables, 173/175 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 161/336 constraints. Problems are: Problem set: 0 solved, 698 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 7 (OVERLAPS) 0/524 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 698 unsolved
No progress, stopping.
After SMT solving in domain Real declared 524/525 variables, and 336 constraints, problems are : Problem set: 0 solved, 698 unsolved in 20022 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 173/173 constraints, ReadFeed: 161/161 constraints, PredecessorRefiner: 698/698 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 698 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 2 (OVERLAPS) 2/173 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 4 (OVERLAPS) 351/524 variables, 173/175 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 161/336 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 698/1034 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 524/525 variables, and 1034 constraints, problems are : Problem set: 0 solved, 698 unsolved in 20018 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 173/173 constraints, ReadFeed: 161/161 constraints, PredecessorRefiner: 698/698 constraints, Known Traps: 0/0 constraints]
After SMT, in 40245ms problems are : Problem set: 0 solved, 698 unsolved
Search for dead transitions found 0 dead transitions in 40253ms
Finished structural reductions in LTL mode , in 1 iterations and 40269 ms. Remains : 173/206 places, 884/1682 transitions.
[2024-05-28 05:28:57] [INFO ] Flatten gal took : 19 ms
[2024-05-28 05:28:57] [INFO ] Flatten gal took : 20 ms
[2024-05-28 05:28:57] [INFO ] Input system was already deterministic with 884 transitions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 1682/1682 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 202 transition count 1670
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 34 place count 184 transition count 1386
Iterating global reduction 1 with 18 rules applied. Total rules applied 52 place count 184 transition count 1386
Ensure Unique test removed 304 transitions
Reduce isomorphic transitions removed 304 transitions.
Iterating post reduction 1 with 304 rules applied. Total rules applied 356 place count 184 transition count 1082
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 358 place count 182 transition count 1074
Iterating global reduction 2 with 2 rules applied. Total rules applied 360 place count 182 transition count 1074
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 365 place count 182 transition count 1069
Drop transitions (Redundant composition of simpler transitions.) removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 3 with 62 rules applied. Total rules applied 427 place count 182 transition count 1007
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 458 place count 177 transition count 981
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 460 place count 175 transition count 956
Iterating global reduction 4 with 2 rules applied. Total rules applied 462 place count 175 transition count 956
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 465 place count 175 transition count 953
Applied a total of 465 rules in 17 ms. Remains 175 /206 variables (removed 31) and now considering 953/1682 (removed 729) transitions.
Running 765 sub problems to find dead transitions.
[2024-05-28 05:28:57] [INFO ] Flow matrix only has 355 transitions (discarded 598 similar events)
Normalized transition count is 354 out of 355 initially.
// Phase 1: matrix 354 rows 175 cols
[2024-05-28 05:28:57] [INFO ] Computed 2 invariants in 1 ms
[2024-05-28 05:28:57] [INFO ] State equation strengthened by 162 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 765 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 765 unsolved
At refinement iteration 2 (OVERLAPS) 2/174 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 765 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 765 unsolved
At refinement iteration 4 (OVERLAPS) 353/527 variables, 174/176 constraints. Problems are: Problem set: 0 solved, 765 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 162/338 constraints. Problems are: Problem set: 0 solved, 765 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 765 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 527/530 variables, and 338 constraints, problems are : Problem set: 0 solved, 765 unsolved in 20022 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 174/175 constraints, ReadFeed: 162/162 constraints, PredecessorRefiner: 765/765 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 765 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 765 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 765 unsolved
At refinement iteration 2 (OVERLAPS) 2/174 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 765 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 765 unsolved
At refinement iteration 4 (OVERLAPS) 353/527 variables, 174/176 constraints. Problems are: Problem set: 0 solved, 765 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 162/338 constraints. Problems are: Problem set: 0 solved, 765 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 765/1103 constraints. Problems are: Problem set: 0 solved, 765 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/527 variables, 0/1103 constraints. Problems are: Problem set: 0 solved, 765 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 527/530 variables, and 1103 constraints, problems are : Problem set: 0 solved, 765 unsolved in 20020 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 174/175 constraints, ReadFeed: 162/162 constraints, PredecessorRefiner: 765/765 constraints, Known Traps: 0/0 constraints]
After SMT, in 40291ms problems are : Problem set: 0 solved, 765 unsolved
Search for dead transitions found 0 dead transitions in 40309ms
Finished structural reductions in LTL mode , in 1 iterations and 40328 ms. Remains : 175/206 places, 953/1682 transitions.
[2024-05-28 05:29:37] [INFO ] Flatten gal took : 19 ms
[2024-05-28 05:29:37] [INFO ] Flatten gal took : 25 ms
[2024-05-28 05:29:38] [INFO ] Input system was already deterministic with 953 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 206/206 places, 1682/1682 transitions.
Graph (complete) has 2071 edges and 206 vertex of which 195 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 194 transition count 1665
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 29 place count 179 transition count 1386
Iterating global reduction 1 with 15 rules applied. Total rules applied 44 place count 179 transition count 1386
Ensure Unique test removed 258 transitions
Reduce isomorphic transitions removed 258 transitions.
Iterating post reduction 1 with 258 rules applied. Total rules applied 302 place count 179 transition count 1128
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 305 place count 176 transition count 1117
Iterating global reduction 2 with 3 rules applied. Total rules applied 308 place count 176 transition count 1117
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 315 place count 176 transition count 1110
Drop transitions (Redundant composition of simpler transitions.) removed 92 transitions
Redundant transition composition rules discarded 92 transitions
Iterating global reduction 3 with 92 rules applied. Total rules applied 407 place count 176 transition count 1018
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Graph (complete) has 1569 edges and 171 vertex of which 170 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 3 with 36 rules applied. Total rules applied 443 place count 170 transition count 987
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 445 place count 168 transition count 985
Iterating global reduction 4 with 2 rules applied. Total rules applied 447 place count 168 transition count 985
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 449 place count 168 transition count 983
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 450 place count 168 transition count 982
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 451 place count 167 transition count 982
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 452 place count 167 transition count 981
Applied a total of 452 rules in 104 ms. Remains 167 /206 variables (removed 39) and now considering 981/1682 (removed 701) transitions.
Running 783 sub problems to find dead transitions.
[2024-05-28 05:29:38] [INFO ] Flow matrix only has 365 transitions (discarded 616 similar events)
Normalized transition count is 364 out of 365 initially.
// Phase 1: matrix 364 rows 167 cols
[2024-05-28 05:29:38] [INFO ] Computed 1 invariants in 1 ms
[2024-05-28 05:29:38] [INFO ] State equation strengthened by 167 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 2 (OVERLAPS) 360/523 variables, 163/164 constraints. Problems are: Problem set: 0 solved, 783 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/523 variables, 167/331 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/523 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 5 (OVERLAPS) 6/529 variables, 3/334 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/529 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 783 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 529/532 variables, and 334 constraints, problems are : Problem set: 0 solved, 783 unsolved in 20021 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 166/167 constraints, ReadFeed: 167/167 constraints, PredecessorRefiner: 783/783 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 783 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 2 (OVERLAPS) 360/523 variables, 163/164 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/523 variables, 167/331 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/523 variables, 689/1020 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/523 variables, 0/1020 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 6 (OVERLAPS) 6/529 variables, 3/1023 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/529 variables, 93/1116 constraints. Problems are: Problem set: 0 solved, 783 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 529/532 variables, and 1116 constraints, problems are : Problem set: 0 solved, 783 unsolved in 20016 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 166/167 constraints, ReadFeed: 167/167 constraints, PredecessorRefiner: 782/783 constraints, Known Traps: 0/0 constraints]
After SMT, in 40316ms problems are : Problem set: 0 solved, 783 unsolved
Search for dead transitions found 0 dead transitions in 40332ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 40438 ms. Remains : 167/206 places, 981/1682 transitions.
[2024-05-28 05:30:18] [INFO ] Flatten gal took : 19 ms
[2024-05-28 05:30:18] [INFO ] Flatten gal took : 21 ms
[2024-05-28 05:30:18] [INFO ] Input system was already deterministic with 981 transitions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 1682/1682 transitions.
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 201 transition count 1669
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 35 place count 184 transition count 1396
Iterating global reduction 1 with 17 rules applied. Total rules applied 52 place count 184 transition count 1396
Ensure Unique test removed 296 transitions
Reduce isomorphic transitions removed 296 transitions.
Iterating post reduction 1 with 296 rules applied. Total rules applied 348 place count 184 transition count 1100
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 350 place count 182 transition count 1088
Iterating global reduction 2 with 2 rules applied. Total rules applied 352 place count 182 transition count 1088
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 357 place count 182 transition count 1083
Drop transitions (Redundant composition of simpler transitions.) removed 72 transitions
Redundant transition composition rules discarded 72 transitions
Iterating global reduction 3 with 72 rules applied. Total rules applied 429 place count 182 transition count 1011
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 460 place count 177 transition count 985
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 462 place count 175 transition count 960
Iterating global reduction 4 with 2 rules applied. Total rules applied 464 place count 175 transition count 960
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 467 place count 175 transition count 957
Applied a total of 467 rules in 16 ms. Remains 175 /206 variables (removed 31) and now considering 957/1682 (removed 725) transitions.
Running 766 sub problems to find dead transitions.
[2024-05-28 05:30:18] [INFO ] Flow matrix only has 360 transitions (discarded 597 similar events)
Normalized transition count is 359 out of 360 initially.
// Phase 1: matrix 359 rows 175 cols
[2024-05-28 05:30:18] [INFO ] Computed 2 invariants in 1 ms
[2024-05-28 05:30:18] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 766 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 766 unsolved
At refinement iteration 2 (OVERLAPS) 2/175 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 766 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 766 unsolved
At refinement iteration 4 (OVERLAPS) 359/534 variables, 175/177 constraints. Problems are: Problem set: 0 solved, 766 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 164/341 constraints. Problems are: Problem set: 0 solved, 766 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 766 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 534/535 variables, and 341 constraints, problems are : Problem set: 0 solved, 766 unsolved in 20020 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 175/175 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 766/766 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 766 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 766 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 766 unsolved
At refinement iteration 2 (OVERLAPS) 2/175 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 766 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 766 unsolved
At refinement iteration 4 (OVERLAPS) 359/534 variables, 175/177 constraints. Problems are: Problem set: 0 solved, 766 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 164/341 constraints. Problems are: Problem set: 0 solved, 766 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 766/1107 constraints. Problems are: Problem set: 0 solved, 766 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 0/1107 constraints. Problems are: Problem set: 0 solved, 766 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 1107 constraints, problems are : Problem set: 0 solved, 766 unsolved in 20019 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 175/175 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 766/766 constraints, Known Traps: 0/0 constraints]
After SMT, in 40266ms problems are : Problem set: 0 solved, 766 unsolved
Search for dead transitions found 0 dead transitions in 40282ms
Finished structural reductions in LTL mode , in 1 iterations and 40300 ms. Remains : 175/206 places, 957/1682 transitions.
[2024-05-28 05:30:58] [INFO ] Flatten gal took : 19 ms
[2024-05-28 05:30:58] [INFO ] Flatten gal took : 20 ms
[2024-05-28 05:30:58] [INFO ] Input system was already deterministic with 957 transitions.
[2024-05-28 05:30:58] [INFO ] Flatten gal took : 35 ms
[2024-05-28 05:30:58] [INFO ] Flatten gal took : 36 ms
[2024-05-28 05:30:58] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2024-05-28 05:30:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 206 places, 1682 transitions and 12088 arcs took 16 ms.
Total runtime 431662 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SemanticWebServices-PT-S256P06

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 206
TRANSITIONS: 1682
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.045s, Sys 0.016s]


SAVING FILE /home/mcc/execution/412/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: 643
MODEL NAME: /home/mcc/execution/412/model
206 places, 1682 transitions.
Enabling coverability test.

CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716874261363

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is SemanticWebServices-PT-S256P06, 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 r333-tall-171679078700570"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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