About the Execution of LTSMin+red for SemanticWebServices-PT-S256P18
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16138.268 | 960567.00 | 1864838.00 | 2282.70 | FFFFFF????T????? | normal |
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.r524-tall-171679080700604.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 ltsminxred
Input is SemanticWebServices-PT-S256P18, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r524-tall-171679080700604
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.7M
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K 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.6K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 02:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 12 02:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 02:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 12 02:42 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 9.2M 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-S256P18-LTLFireability-00
FORMULA_NAME SemanticWebServices-PT-S256P18-LTLFireability-01
FORMULA_NAME SemanticWebServices-PT-S256P18-LTLFireability-02
FORMULA_NAME SemanticWebServices-PT-S256P18-LTLFireability-03
FORMULA_NAME SemanticWebServices-PT-S256P18-LTLFireability-04
FORMULA_NAME SemanticWebServices-PT-S256P18-LTLFireability-05
FORMULA_NAME SemanticWebServices-PT-S256P18-LTLFireability-06
FORMULA_NAME SemanticWebServices-PT-S256P18-LTLFireability-07
FORMULA_NAME SemanticWebServices-PT-S256P18-LTLFireability-08
FORMULA_NAME SemanticWebServices-PT-S256P18-LTLFireability-09
FORMULA_NAME SemanticWebServices-PT-S256P18-LTLFireability-10
FORMULA_NAME SemanticWebServices-PT-S256P18-LTLFireability-11
FORMULA_NAME SemanticWebServices-PT-S256P18-LTLFireability-12
FORMULA_NAME SemanticWebServices-PT-S256P18-LTLFireability-13
FORMULA_NAME SemanticWebServices-PT-S256P18-LTLFireability-14
FORMULA_NAME SemanticWebServices-PT-S256P18-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717229865164
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SemanticWebServices-PT-S256P18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:17:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 08:17:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:17:46] [INFO ] Load time of PNML (sax parser for PT used): 558 ms
[2024-06-01 08:17:46] [INFO ] Transformed 198 places.
[2024-06-01 08:17:47] [INFO ] Transformed 9732 transitions.
[2024-06-01 08:17:47] [INFO ] Parsed PT model containing 198 places and 9732 transitions and 78799 arcs in 718 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 2 places in 15 ms
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 4246 transitions
Reduce redundant transitions removed 4246 transitions.
FORMULA SemanticWebServices-PT-S256P18-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S256P18-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 5484/5484 transitions.
Ensure Unique test removed 49 places
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 145 transition count 5484
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 62 place count 134 transition count 5458
Iterating global reduction 1 with 11 rules applied. Total rules applied 73 place count 134 transition count 5458
Ensure Unique test removed 374 transitions
Reduce isomorphic transitions removed 374 transitions.
Iterating post reduction 1 with 374 rules applied. Total rules applied 447 place count 134 transition count 5084
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 453 place count 128 transition count 5078
Iterating global reduction 2 with 6 rules applied. Total rules applied 459 place count 128 transition count 5078
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 462 place count 125 transition count 5075
Iterating global reduction 2 with 3 rules applied. Total rules applied 465 place count 125 transition count 5075
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 466 place count 124 transition count 5074
Iterating global reduction 2 with 1 rules applied. Total rules applied 467 place count 124 transition count 5074
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 468 place count 123 transition count 5073
Iterating global reduction 2 with 1 rules applied. Total rules applied 469 place count 123 transition count 5073
Drop transitions (Redundant composition of simpler transitions.) removed 2304 transitions
Redundant transition composition rules discarded 2304 transitions
Iterating global reduction 2 with 2304 rules applied. Total rules applied 2773 place count 123 transition count 2769
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 2809 place count 122 transition count 2734
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 2811 place count 120 transition count 2718
Iterating global reduction 3 with 2 rules applied. Total rules applied 2813 place count 120 transition count 2718
Ensure Unique test removed 442 transitions
Reduce isomorphic transitions removed 442 transitions.
Iterating post reduction 3 with 442 rules applied. Total rules applied 3255 place count 120 transition count 2276
Applied a total of 3255 rules in 261 ms. Remains 120 /196 variables (removed 76) and now considering 2276/5484 (removed 3208) transitions.
Running 1706 sub problems to find dead transitions.
[2024-06-01 08:17:47] [INFO ] Flow matrix only has 829 transitions (discarded 1447 similar events)
Normalized transition count is 809 out of 829 initially.
// Phase 1: matrix 809 rows 120 cols
[2024-06-01 08:17:47] [INFO ] Computed 1 invariants in 20 ms
[2024-06-01 08:17:47] [INFO ] State equation strengthened by 254 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 1 (OVERLAPS) 2/119 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (OVERLAPS) 827/946 variables, 119/120 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
SMT process timed out in 29338ms, After SMT, problems are : Problem set: 0 solved, 1706 unsolved
Search for dead transitions found 0 dead transitions in 29382ms
[2024-06-01 08:18:17] [INFO ] Flow matrix only has 829 transitions (discarded 1447 similar events)
[2024-06-01 08:18:17] [INFO ] Invariant cache hit.
[2024-06-01 08:18:17] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-01 08:18:17] [INFO ] Flow matrix only has 829 transitions (discarded 1447 similar events)
[2024-06-01 08:18:17] [INFO ] Invariant cache hit.
[2024-06-01 08:18:17] [INFO ] State equation strengthened by 254 read => feed constraints.
[2024-06-01 08:18:17] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Running 1706 sub problems to find dead transitions.
[2024-06-01 08:18:17] [INFO ] Flow matrix only has 829 transitions (discarded 1447 similar events)
[2024-06-01 08:18:17] [INFO ] Invariant cache hit.
[2024-06-01 08:18:17] [INFO ] State equation strengthened by 254 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 1 (OVERLAPS) 2/119 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 3 (OVERLAPS) 827/946 variables, 119/120 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/946 variables, 254/374 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 946/949 variables, and 374 constraints, problems are : Problem set: 0 solved, 1706 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 119/120 constraints, ReadFeed: 254/254 constraints, PredecessorRefiner: 1706/1706 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1706 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 1 (OVERLAPS) 2/119 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 3 (OVERLAPS) 827/946 variables, 119/120 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/946 variables, 254/374 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/946 variables, 96/470 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 946/949 variables, and 470 constraints, problems are : Problem set: 0 solved, 1706 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 119/120 constraints, ReadFeed: 254/254 constraints, PredecessorRefiner: 96/1706 constraints, Known Traps: 0/0 constraints]
After SMT, in 69155ms problems are : Problem set: 0 solved, 1706 unsolved
Search for dead transitions found 0 dead transitions in 69172ms
Starting structural reductions in LTL mode, iteration 1 : 120/196 places, 2276/5484 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 99336 ms. Remains : 120/196 places, 2276/5484 transitions.
Support contains 34 out of 120 places after structural reductions.
[2024-06-01 08:19:27] [INFO ] Flatten gal took : 141 ms
[2024-06-01 08:19:27] [INFO ] Flatten gal took : 102 ms
[2024-06-01 08:19:27] [INFO ] Input system was already deterministic with 2276 transitions.
RANDOM walk for 20561 steps (4 resets) in 1815 ms. (11 steps per ms) remains 0/26 properties
FORMULA SemanticWebServices-PT-S256P18-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Support contains 8 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 2276/2276 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 119 transition count 2247
Applied a total of 30 rules in 9 ms. Remains 119 /120 variables (removed 1) and now considering 2247/2276 (removed 29) transitions.
Running 1706 sub problems to find dead transitions.
[2024-06-01 08:19:28] [INFO ] Flow matrix only has 800 transitions (discarded 1447 similar events)
Normalized transition count is 780 out of 800 initially.
// Phase 1: matrix 780 rows 119 cols
[2024-06-01 08:19:28] [INFO ] Computed 1 invariants in 5 ms
[2024-06-01 08:19:28] [INFO ] State equation strengthened by 254 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 1 (OVERLAPS) 2/119 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 799/918 variables, 119/120 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
SMT process timed out in 29166ms, After SMT, problems are : Problem set: 0 solved, 1706 unsolved
Search for dead transitions found 0 dead transitions in 29189ms
[2024-06-01 08:19:57] [INFO ] Flow matrix only has 800 transitions (discarded 1447 similar events)
[2024-06-01 08:19:57] [INFO ] Invariant cache hit.
[2024-06-01 08:19:57] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-01 08:19:57] [INFO ] Flow matrix only has 800 transitions (discarded 1447 similar events)
[2024-06-01 08:19:57] [INFO ] Invariant cache hit.
[2024-06-01 08:19:57] [INFO ] State equation strengthened by 254 read => feed constraints.
[2024-06-01 08:19:58] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
Running 1706 sub problems to find dead transitions.
[2024-06-01 08:19:58] [INFO ] Flow matrix only has 800 transitions (discarded 1447 similar events)
[2024-06-01 08:19:58] [INFO ] Invariant cache hit.
[2024-06-01 08:19:58] [INFO ] State equation strengthened by 254 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 1 (OVERLAPS) 2/119 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 3 (OVERLAPS) 799/918 variables, 119/120 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/918 variables, 254/374 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 918/919 variables, and 374 constraints, problems are : Problem set: 0 solved, 1706 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 119/119 constraints, ReadFeed: 254/254 constraints, PredecessorRefiner: 1706/1706 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1706 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 1 (OVERLAPS) 2/119 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 3 (OVERLAPS) 799/918 variables, 119/120 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/918 variables, 254/374 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 918/919 variables, and 2080 constraints, problems are : Problem set: 0 solved, 1706 unsolved in 30501 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 119/119 constraints, ReadFeed: 254/254 constraints, PredecessorRefiner: 1706/1706 constraints, Known Traps: 0/0 constraints]
After SMT, in 69628ms problems are : Problem set: 0 solved, 1706 unsolved
Search for dead transitions found 0 dead transitions in 69645ms
Starting structural reductions in LTL mode, iteration 1 : 119/120 places, 2247/2276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 99395 ms. Remains : 119/120 places, 2247/2276 transitions.
Stuttering acceptance computed with spot in 353 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S256P18-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA SemanticWebServices-PT-S256P18-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S256P18-LTLFireability-00 finished in 99818 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 10 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 2276/2276 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 119 transition count 2247
Applied a total of 30 rules in 9 ms. Remains 119 /120 variables (removed 1) and now considering 2247/2276 (removed 29) transitions.
Running 1706 sub problems to find dead transitions.
[2024-06-01 08:21:08] [INFO ] Flow matrix only has 800 transitions (discarded 1447 similar events)
[2024-06-01 08:21:08] [INFO ] Invariant cache hit.
[2024-06-01 08:21:08] [INFO ] State equation strengthened by 254 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 1 (OVERLAPS) 2/119 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 3 (OVERLAPS) 799/918 variables, 119/120 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
SMT process timed out in 29261ms, After SMT, problems are : Problem set: 0 solved, 1706 unsolved
Search for dead transitions found 0 dead transitions in 29295ms
[2024-06-01 08:21:37] [INFO ] Flow matrix only has 800 transitions (discarded 1447 similar events)
[2024-06-01 08:21:37] [INFO ] Invariant cache hit.
[2024-06-01 08:21:37] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-01 08:21:37] [INFO ] Flow matrix only has 800 transitions (discarded 1447 similar events)
[2024-06-01 08:21:37] [INFO ] Invariant cache hit.
[2024-06-01 08:21:37] [INFO ] State equation strengthened by 254 read => feed constraints.
[2024-06-01 08:21:38] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
Running 1706 sub problems to find dead transitions.
[2024-06-01 08:21:38] [INFO ] Flow matrix only has 800 transitions (discarded 1447 similar events)
[2024-06-01 08:21:38] [INFO ] Invariant cache hit.
[2024-06-01 08:21:38] [INFO ] State equation strengthened by 254 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 1 (OVERLAPS) 2/119 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 3 (OVERLAPS) 799/918 variables, 119/120 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/918 variables, 254/374 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 918/919 variables, and 374 constraints, problems are : Problem set: 0 solved, 1706 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 119/119 constraints, ReadFeed: 254/254 constraints, PredecessorRefiner: 1706/1706 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1706 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 1 (OVERLAPS) 2/119 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 3 (OVERLAPS) 799/918 variables, 119/120 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/918 variables, 254/374 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 918/919 variables, and 2080 constraints, problems are : Problem set: 0 solved, 1706 unsolved in 30648 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 119/119 constraints, ReadFeed: 254/254 constraints, PredecessorRefiner: 1706/1706 constraints, Known Traps: 0/0 constraints]
After SMT, in 71114ms problems are : Problem set: 0 solved, 1706 unsolved
Search for dead transitions found 0 dead transitions in 71129ms
Starting structural reductions in LTL mode, iteration 1 : 119/120 places, 2247/2276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100997 ms. Remains : 119/120 places, 2247/2276 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S256P18-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S256P18-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S256P18-LTLFireability-03 finished in 101121 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p1)||X(p2)||p0)))'
Support contains 8 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 2276/2276 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 119 transition count 2247
Applied a total of 30 rules in 14 ms. Remains 119 /120 variables (removed 1) and now considering 2247/2276 (removed 29) transitions.
Running 1706 sub problems to find dead transitions.
[2024-06-01 08:22:49] [INFO ] Flow matrix only has 800 transitions (discarded 1447 similar events)
[2024-06-01 08:22:49] [INFO ] Invariant cache hit.
[2024-06-01 08:22:49] [INFO ] State equation strengthened by 254 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 1 (OVERLAPS) 2/119 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 799/918 variables, 119/120 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
SMT process timed out in 30242ms, After SMT, problems are : Problem set: 0 solved, 1706 unsolved
Search for dead transitions found 0 dead transitions in 30258ms
[2024-06-01 08:23:19] [INFO ] Flow matrix only has 800 transitions (discarded 1447 similar events)
[2024-06-01 08:23:19] [INFO ] Invariant cache hit.
[2024-06-01 08:23:19] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-01 08:23:19] [INFO ] Flow matrix only has 800 transitions (discarded 1447 similar events)
[2024-06-01 08:23:19] [INFO ] Invariant cache hit.
[2024-06-01 08:23:19] [INFO ] State equation strengthened by 254 read => feed constraints.
[2024-06-01 08:23:20] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
Running 1706 sub problems to find dead transitions.
[2024-06-01 08:23:20] [INFO ] Flow matrix only has 800 transitions (discarded 1447 similar events)
[2024-06-01 08:23:20] [INFO ] Invariant cache hit.
[2024-06-01 08:23:20] [INFO ] State equation strengthened by 254 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 1 (OVERLAPS) 2/119 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 3 (OVERLAPS) 799/918 variables, 119/120 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/918 variables, 254/374 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 918/919 variables, and 374 constraints, problems are : Problem set: 0 solved, 1706 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 119/119 constraints, ReadFeed: 254/254 constraints, PredecessorRefiner: 1706/1706 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1706 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 1 (OVERLAPS) 2/119 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 3 (OVERLAPS) 799/918 variables, 119/120 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/918 variables, 254/374 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 918/919 variables, and 2080 constraints, problems are : Problem set: 0 solved, 1706 unsolved in 30512 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 119/119 constraints, ReadFeed: 254/254 constraints, PredecessorRefiner: 1706/1706 constraints, Known Traps: 0/0 constraints]
After SMT, in 70040ms problems are : Problem set: 0 solved, 1706 unsolved
Search for dead transitions found 0 dead transitions in 70056ms
Starting structural reductions in LTL mode, iteration 1 : 119/120 places, 2247/2276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100865 ms. Remains : 119/120 places, 2247/2276 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S256P18-LTLFireability-04
Stuttering criterion allowed to conclude after 91 steps with 0 reset in 15 ms.
FORMULA SemanticWebServices-PT-S256P18-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S256P18-LTLFireability-04 finished in 101024 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 6 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 2276/2276 transitions.
Graph (complete) has 867 edges and 120 vertex of which 114 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.18 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 112 transition count 2271
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 112 transition count 2271
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 5 place count 110 transition count 2269
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 110 transition count 2269
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 10 place count 107 transition count 2266
Iterating global reduction 0 with 3 rules applied. Total rules applied 13 place count 107 transition count 2266
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 17 place count 103 transition count 2262
Iterating global reduction 0 with 4 rules applied. Total rules applied 21 place count 103 transition count 2262
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 25 place count 99 transition count 2258
Iterating global reduction 0 with 4 rules applied. Total rules applied 29 place count 99 transition count 2258
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 33 place count 95 transition count 2254
Iterating global reduction 0 with 4 rules applied. Total rules applied 37 place count 95 transition count 2254
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 39 place count 93 transition count 2252
Iterating global reduction 0 with 2 rules applied. Total rules applied 41 place count 93 transition count 2252
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 43 place count 91 transition count 2250
Iterating global reduction 0 with 2 rules applied. Total rules applied 45 place count 91 transition count 2250
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 47 place count 91 transition count 2248
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 91 transition count 2246
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 807 edges and 90 vertex of which 89 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 1 with 2 rules applied. Total rules applied 51 place count 89 transition count 2245
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 88 transition count 2244
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 88 transition count 2244
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 86 transition count 2242
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 86 transition count 2242
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 84 transition count 2240
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 84 transition count 2240
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 84 transition count 2239
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 83 transition count 2239
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 64 place count 82 transition count 2238
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 82 transition count 2238
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 67 place count 80 transition count 2236
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 80 transition count 2236
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 73 place count 76 transition count 2232
Iterating global reduction 3 with 4 rules applied. Total rules applied 77 place count 76 transition count 2232
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 82 place count 71 transition count 2227
Iterating global reduction 3 with 5 rules applied. Total rules applied 87 place count 71 transition count 2227
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 93 place count 65 transition count 2221
Iterating global reduction 3 with 6 rules applied. Total rules applied 99 place count 65 transition count 2221
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 105 place count 59 transition count 2215
Iterating global reduction 3 with 6 rules applied. Total rules applied 111 place count 59 transition count 2215
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 117 place count 59 transition count 2209
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 118 place count 59 transition count 2208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 119 place count 58 transition count 2208
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 120 place count 58 transition count 2207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 121 place count 57 transition count 2207
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 122 place count 57 transition count 2206
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 123 place count 56 transition count 2206
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 124 place count 56 transition count 2205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 125 place count 55 transition count 2205
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 126 place count 54 transition count 2204
Iterating global reduction 8 with 1 rules applied. Total rules applied 127 place count 54 transition count 2204
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 128 place count 53 transition count 2203
Iterating global reduction 8 with 1 rules applied. Total rules applied 129 place count 53 transition count 2203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 130 place count 53 transition count 2202
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 131 place count 53 transition count 2201
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 132 place count 52 transition count 2201
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 133 place count 52 transition count 2200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 134 place count 51 transition count 2200
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 135 place count 51 transition count 2199
Applied a total of 135 rules in 2116 ms. Remains 51 /120 variables (removed 69) and now considering 2199/2276 (removed 77) transitions.
Running 1628 sub problems to find dead transitions.
[2024-06-01 08:24:32] [INFO ] Flow matrix only has 761 transitions (discarded 1438 similar events)
Normalized transition count is 741 out of 761 initially.
// Phase 1: matrix 741 rows 51 cols
[2024-06-01 08:24:32] [INFO ] Computed 0 invariants in 3 ms
[2024-06-01 08:24:32] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 1 (OVERLAPS) 757/805 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/805 variables, 190/238 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 805/812 variables, and 238 constraints, problems are : Problem set: 0 solved, 1628 unsolved in 20028 ms.
Refiners :[State Equation: 48/51 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 1628/1628 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1628 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 1 (OVERLAPS) 757/805 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/805 variables, 190/238 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/805 variables, 17/255 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 805/812 variables, and 255 constraints, problems are : Problem set: 0 solved, 1628 unsolved in 20027 ms.
Refiners :[State Equation: 48/51 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 17/1628 constraints, Known Traps: 0/0 constraints]
After SMT, in 49796ms problems are : Problem set: 0 solved, 1628 unsolved
Search for dead transitions found 0 dead transitions in 49814ms
[2024-06-01 08:25:22] [INFO ] Flow matrix only has 761 transitions (discarded 1438 similar events)
[2024-06-01 08:25:22] [INFO ] Invariant cache hit.
[2024-06-01 08:25:22] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-06-01 08:25:22] [INFO ] Flow matrix only has 761 transitions (discarded 1438 similar events)
[2024-06-01 08:25:22] [INFO ] Invariant cache hit.
[2024-06-01 08:25:22] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-06-01 08:25:22] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
[2024-06-01 08:25:26] [INFO ] Redundant transitions in 3238 ms returned [10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 279, 280, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 311, 313, 314, 315, 316, 317, 318, 319, 320, 321, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 405, 406, 407, 408, 409, 410, 411, 412, 413, 414, 416, 417, 418, 419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 443, 444, 445, 446, 447, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 568, 569, 570, 612, 624, 625, 628, 638, 639, 640, 650, 653, 662, 663, 666, 675, 677, 678, 688, 695, 696, 697, 698, 700, 701, 702, 708, 729, 735, 736, 737, 738, 740, 741, 742, 743, 744, 745, 746, 747, 748, 749, 750, 1038, 1040, 1041, 1042, 1043, 1044, 1045, 1046, 1047, 1048, 1049, 1050, 1051, 1052, 1053, 1054, 1055, 1056, 1057, 1058, 1059, 1060, 1061, 1062, 1063, 1064, 1065, 1066, 1067, 1068, 1069, 1070, 1072, 1079, 1080, 1081, 1082, 1083, 1084, 1100, 1101, 1102, 1103, 1104, 1105, 1106, 1107, 1108, 1109, 1110, 1111, 1112, 1133, 1134, 1135, 1136, 1137, 1138, 1139, 1140, 1141, 1142, 1143, 1144, 1145, 1161, 1162, 1163, 1164, 1165, 1166, 1173, 1176, 1184, 1185, 1186, 1187, 1188, 1200, 1211, 1212, 1213, 1214, 1215, 1216, 1217, 1218, 1219, 1220, 1231, 1233, 1235, 1238, 1242, 1257, 1262, 1263, 1264, 1265, 1266, 1267, 1268, 1269, 1270, 1271, 1277, 1278, 1280, 1281, 1283, 1285, 1287, 1289, 1291, 1294, 1307, 1309, 1311, 1314, 1318, 1322, 1323, 1324, 1325, 1326, 1328, 1329, 1330, 1332, 1333, 1334, 1336, 1337, 1339, 1341, 1348, 1349, 1351, 1352, 1354, 1356, 1358, 1360, 1362, 1365, 1368, 1369, 1370, 1371, 1372, 1374, 1376, 1377, 1378, 1380, 1381, 1382, 1384, 1385, 1387, 1389, 1391, 1392, 1393, 1394, 1395, 1397, 1398]
Found 734 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 734 transitions
Redundant transitions reduction (with SMT) removed 734 transitions.
Running 1420 sub problems to find dead transitions.
[2024-06-01 08:25:26] [INFO ] Flow matrix only has 209 transitions (discarded 1256 similar events)
// Phase 1: matrix 209 rows 51 cols
[2024-06-01 08:25:26] [INFO ] Computed 0 invariants in 4 ms
[2024-06-01 08:25:26] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1420 unsolved
At refinement iteration 1 (OVERLAPS) 202/247 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 1420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 164/209 constraints. Problems are: Problem set: 0 solved, 1420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1420 unsolved
At refinement iteration 4 (OVERLAPS) 10/257 variables, 5/214 constraints. Problems are: Problem set: 0 solved, 1420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 257/260 variables, and 214 constraints, problems are : Problem set: 0 solved, 1420 unsolved in 30026 ms.
Refiners :[State Equation: 50/51 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1420/1420 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1420 unsolved
At refinement iteration 1 (OVERLAPS) 202/247 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 1420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 164/209 constraints. Problems are: Problem set: 0 solved, 1420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 135/344 constraints. Problems are: Problem set: 0 solved, 1420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1420 unsolved
At refinement iteration 5 (OVERLAPS) 10/257 variables, 5/349 constraints. Problems are: Problem set: 0 solved, 1420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 1284/1633 constraints. Problems are: Problem set: 0 solved, 1420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 257/260 variables, and 1633 constraints, problems are : Problem set: 0 solved, 1420 unsolved in 30024 ms.
Refiners :[State Equation: 50/51 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1419/1420 constraints, Known Traps: 0/0 constraints]
After SMT, in 66427ms problems are : Problem set: 0 solved, 1420 unsolved
Search for dead transitions found 0 dead transitions in 66440ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/120 places, 1465/2276 transitions.
Graph (complete) has 585 edges and 51 vertex of which 48 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 48 transition count 1462
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 7 place count 45 transition count 1386
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 45 transition count 1386
Ensure Unique test removed 203 transitions
Reduce isomorphic transitions removed 203 transitions.
Iterating post reduction 1 with 203 rules applied. Total rules applied 213 place count 45 transition count 1183
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 214 place count 44 transition count 1131
Iterating global reduction 2 with 1 rules applied. Total rules applied 215 place count 44 transition count 1131
Ensure Unique test removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Iterating post reduction 2 with 101 rules applied. Total rules applied 316 place count 44 transition count 1030
Applied a total of 316 rules in 68 ms. Remains 44 /51 variables (removed 7) and now considering 1030/1465 (removed 435) transitions.
[2024-06-01 08:26:32] [INFO ] Flow matrix only has 185 transitions (discarded 845 similar events)
// Phase 1: matrix 185 rows 44 cols
[2024-06-01 08:26:32] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 08:26:32] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-01 08:26:32] [INFO ] Flow matrix only has 185 transitions (discarded 845 similar events)
[2024-06-01 08:26:32] [INFO ] Invariant cache hit.
[2024-06-01 08:26:32] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 08:26:32] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/120 places, 1030/2276 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 122466 ms. Remains : 44/120 places, 1030/2276 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S256P18-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S256P18-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S256P18-LTLFireability-05 finished in 122587 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 7 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 2276/2276 transitions.
Graph (complete) has 867 edges and 120 vertex of which 114 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 112 transition count 2271
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 112 transition count 2271
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 5 place count 110 transition count 2269
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 110 transition count 2269
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 10 place count 107 transition count 2266
Iterating global reduction 0 with 3 rules applied. Total rules applied 13 place count 107 transition count 2266
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 17 place count 103 transition count 2262
Iterating global reduction 0 with 4 rules applied. Total rules applied 21 place count 103 transition count 2262
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 25 place count 99 transition count 2258
Iterating global reduction 0 with 4 rules applied. Total rules applied 29 place count 99 transition count 2258
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 33 place count 95 transition count 2254
Iterating global reduction 0 with 4 rules applied. Total rules applied 37 place count 95 transition count 2254
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 39 place count 93 transition count 2252
Iterating global reduction 0 with 2 rules applied. Total rules applied 41 place count 93 transition count 2252
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 43 place count 91 transition count 2250
Iterating global reduction 0 with 2 rules applied. Total rules applied 45 place count 91 transition count 2250
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 47 place count 91 transition count 2248
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 91 transition count 2246
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 807 edges and 90 vertex of which 89 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 1 with 2 rules applied. Total rules applied 51 place count 89 transition count 2245
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 88 transition count 2244
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 88 transition count 2244
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 86 transition count 2242
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 86 transition count 2242
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 84 transition count 2240
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 84 transition count 2240
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 84 transition count 2239
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 83 transition count 2239
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 64 place count 82 transition count 2238
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 82 transition count 2238
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 67 place count 80 transition count 2236
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 80 transition count 2236
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 73 place count 76 transition count 2232
Iterating global reduction 3 with 4 rules applied. Total rules applied 77 place count 76 transition count 2232
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 82 place count 71 transition count 2227
Iterating global reduction 3 with 5 rules applied. Total rules applied 87 place count 71 transition count 2227
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 93 place count 65 transition count 2221
Iterating global reduction 3 with 6 rules applied. Total rules applied 99 place count 65 transition count 2221
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 105 place count 59 transition count 2215
Iterating global reduction 3 with 6 rules applied. Total rules applied 111 place count 59 transition count 2215
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 117 place count 59 transition count 2209
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 118 place count 59 transition count 2208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 119 place count 58 transition count 2208
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 120 place count 58 transition count 2207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 121 place count 57 transition count 2207
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 122 place count 57 transition count 2206
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 123 place count 56 transition count 2206
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 124 place count 56 transition count 2205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 125 place count 55 transition count 2205
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 126 place count 54 transition count 2204
Iterating global reduction 8 with 1 rules applied. Total rules applied 127 place count 54 transition count 2204
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 128 place count 53 transition count 2203
Iterating global reduction 8 with 1 rules applied. Total rules applied 129 place count 53 transition count 2203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 130 place count 53 transition count 2202
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 131 place count 53 transition count 2201
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 132 place count 52 transition count 2201
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 133 place count 52 transition count 2200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 134 place count 51 transition count 2200
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 135 place count 51 transition count 2199
Applied a total of 135 rules in 1609 ms. Remains 51 /120 variables (removed 69) and now considering 2199/2276 (removed 77) transitions.
Running 1628 sub problems to find dead transitions.
[2024-06-01 08:26:34] [INFO ] Flow matrix only has 761 transitions (discarded 1438 similar events)
Normalized transition count is 741 out of 761 initially.
// Phase 1: matrix 741 rows 51 cols
[2024-06-01 08:26:34] [INFO ] Computed 0 invariants in 6 ms
[2024-06-01 08:26:34] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 1 (OVERLAPS) 757/805 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/805 variables, 190/238 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/805 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
SMT process timed out in 30083ms, After SMT, problems are : Problem set: 0 solved, 1628 unsolved
Search for dead transitions found 0 dead transitions in 30097ms
[2024-06-01 08:27:04] [INFO ] Flow matrix only has 761 transitions (discarded 1438 similar events)
[2024-06-01 08:27:04] [INFO ] Invariant cache hit.
[2024-06-01 08:27:04] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-01 08:27:04] [INFO ] Flow matrix only has 761 transitions (discarded 1438 similar events)
[2024-06-01 08:27:04] [INFO ] Invariant cache hit.
[2024-06-01 08:27:04] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-06-01 08:27:05] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
Could not compute solution for formula : SemanticWebServices-PT-S256P18-LTLFireability-00
Could not compute solution for formula : SemanticWebServices-PT-S256P18-LTLFireability-01
Could not compute solution for formula : SemanticWebServices-PT-S256P18-LTLFireability-02
Could not compute solution for formula : SemanticWebServices-PT-S256P18-LTLFireability-03
Could not compute solution for formula : SemanticWebServices-PT-S256P18-LTLFireability-04
Could not compute solution for formula : SemanticWebServices-PT-S256P18-LTLFireability-05
Could not compute solution for formula : SemanticWebServices-PT-S256P18-LTLFireability-06
Could not compute solution for formula : SemanticWebServices-PT-S256P18-LTLFireability-07
Could not compute solution for formula : SemanticWebServices-PT-S256P18-LTLFireability-08
Could not compute solution for formula : SemanticWebServices-PT-S256P18-LTLFireability-09
FORMULA SemanticWebServices-PT-S256P18-LTLFireability-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : SemanticWebServices-PT-S256P18-LTLFireability-11
Could not compute solution for formula : SemanticWebServices-PT-S256P18-LTLFireability-12
Could not compute solution for formula : SemanticWebServices-PT-S256P18-LTLFireability-13
Could not compute solution for formula : SemanticWebServices-PT-S256P18-LTLFireability-14
Could not compute solution for formula : SemanticWebServices-PT-S256P18-LTLFireability-15
BK_STOP 1717230825731
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name SemanticWebServices-PT-S256P18-LTLFireability-00
ltl formula formula --ltl=/tmp/759/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 198 places, 9732 transitions and 78799 arcs
pnml2lts-mc( 0/ 4): Petri net 15-ont-256-18.net analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.160 real 0.450 user 0.350 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/759/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/759/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/759/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/759/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 206 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 199, there are 9739 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 8192
pnml2lts-mc( 0/ 4): unique transitions count: 16558053
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 8195
pnml2lts-mc( 0/ 4): - cum. max stack depth: 8195
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8195 states 16568499 transitions, fanout: 2021.781
pnml2lts-mc( 0/ 4): Total exploration time 13.040 sec (8.680 sec minimum, 11.102 sec on average)
pnml2lts-mc( 0/ 4): States per second: 628, Transitions per second: 1270590
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 106.8MB, 20.0 B/state, compr.: 2.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 16.0%/100.0%
pnml2lts-mc( 0/ 4): Stored 9983 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 106.8MB (~256.0MB paged-in)
ltl formula name SemanticWebServices-PT-S256P18-LTLFireability-01
ltl formula formula --ltl=/tmp/759/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 198 places, 9732 transitions and 78799 arcs
pnml2lts-mc( 0/ 4): Petri net 15-ont-256-18.net analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.120 real 0.440 user 0.340 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/759/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/759/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/759/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/759/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 205 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 199, there are 9761 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 7193
pnml2lts-mc( 0/ 4): unique transitions count: 14537053
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 7196
pnml2lts-mc( 0/ 4): - cum. max stack depth: 7196
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7196 states 14540002 transitions, fanout: 2020.567
pnml2lts-mc( 0/ 4): Total exploration time 20.030 sec (8.140 sec minimum, 14.208 sec on average)
pnml2lts-mc( 0/ 4): States per second: 359, Transitions per second: 725911
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 101.6MB, 21.6 B/state, compr.: 2.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 14.0%/100.0%
pnml2lts-mc( 0/ 4): Stored 9983 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 101.6MB (~256.0MB paged-in)
ltl formula name SemanticWebServices-PT-S256P18-LTLFireability-02
ltl formula formula --ltl=/tmp/759/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 198 places, 9732 transitions and 78799 arcs
pnml2lts-mc( 0/ 4): Petri net 15-ont-256-18.net analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.050 real 0.440 user 0.430 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/759/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/759/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/759/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/759/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 206 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 199, there are 9742 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 7868
pnml2lts-mc( 0/ 4): unique transitions count: 15901228
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 7871
pnml2lts-mc( 0/ 4): - cum. max stack depth: 7871
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7871 states 15902561 transitions, fanout: 2020.399
pnml2lts-mc( 0/ 4): Total exploration time 22.380 sec (13.940 sec minimum, 18.052 sec on average)
pnml2lts-mc( 0/ 4): States per second: 352, Transitions per second: 710570
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 105.1MB, 20.5 B/state, compr.: 2.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 16.0%/100.0%
pnml2lts-mc( 0/ 4): Stored 9983 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 105.1MB (~256.0MB paged-in)
ltl formula name SemanticWebServices-PT-S256P18-LTLFireability-03
ltl formula formula --ltl=/tmp/759/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 198 places, 9732 transitions and 78799 arcs
pnml2lts-mc( 0/ 4): Petri net 15-ont-256-18.net analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.090 real 0.490 user 0.350 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/759/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/759/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/759/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/759/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 206 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 199, there are 9738 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 7451
pnml2lts-mc( 0/ 4): unique transitions count: 15058471
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 7454
pnml2lts-mc( 0/ 4): - cum. max stack depth: 7454
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7454 states 15060098 transitions, fanout: 2020.405
pnml2lts-mc( 0/ 4): Total exploration time 21.810 sec (7.890 sec minimum, 16.740 sec on average)
pnml2lts-mc( 0/ 4): States per second: 342, Transitions per second: 690513
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 102.9MB, 21.2 B/state, compr.: 2.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 15.0%/100.0%
pnml2lts-mc( 0/ 4): Stored 9983 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 102.9MB (~256.0MB paged-in)
ltl formula name SemanticWebServices-PT-S256P18-LTLFireability-04
ltl formula formula --ltl=/tmp/759/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 198 places, 9732 transitions and 78799 arcs
pnml2lts-mc( 0/ 4): Petri net 15-ont-256-18.net analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.150 real 0.440 user 0.330 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/759/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/759/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/759/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/759/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 206 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 199, there are 9738 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 7693
pnml2lts-mc( 0/ 4): unique transitions count: 15547553
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 7696
pnml2lts-mc( 0/ 4): - cum. max stack depth: 7696
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7696 states 15546514 transitions, fanout: 2020.077
pnml2lts-mc( 0/ 4): Total exploration time 24.160 sec (22.830 sec minimum, 23.600 sec on average)
pnml2lts-mc( 0/ 4): States per second: 319, Transitions per second: 643482
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 104.2MB, 20.7 B/state, compr.: 2.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 15.0%/100.0%
pnml2lts-mc( 0/ 4): Stored 9983 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 104.2MB (~256.0MB paged-in)
ltl formula name SemanticWebServices-PT-S256P18-LTLFireability-05
ltl formula formula --ltl=/tmp/759/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 198 places, 9732 transitions and 78799 arcs
pnml2lts-mc( 0/ 4): Petri net 15-ont-256-18.net analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.130 real 0.470 user 0.290 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/759/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/759/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/759/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/759/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 205 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 199, there are 9745 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 6878
pnml2lts-mc( 0/ 4): unique transitions count: 13906501
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 6881
pnml2lts-mc( 0/ 4): - cum. max stack depth: 6881
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6881 states 13929579 transitions, fanout: 2024.354
pnml2lts-mc( 0/ 4): Total exploration time 11.350 sec (7.880 sec minimum, 8.892 sec on average)
pnml2lts-mc( 0/ 4): States per second: 606, Transitions per second: 1227276
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 100.0MB, 22.2 B/state, compr.: 2.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 14.0%/100.0%
pnml2lts-mc( 0/ 4): Stored 9983 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 100.0MB (~256.0MB paged-in)
ltl formula name SemanticWebServices-PT-S256P18-LTLFireability-06
ltl formula formula --ltl=/tmp/759/ltl_6_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 198 places, 9732 transitions and 78799 arcs
pnml2lts-mc( 0/ 4): Petri net 15-ont-256-18.net analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.130 real 0.470 user 0.300 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/759/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/759/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/759/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/759/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 206 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 199, there are 9737 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 6850
pnml2lts-mc( 0/ 4): unique transitions count: 13845871
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 6853
pnml2lts-mc( 0/ 4): - cum. max stack depth: 6853
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6853 states 13853951 transitions, fanout: 2021.589
pnml2lts-mc( 0/ 4): Total exploration time 22.750 sec (8.380 sec minimum, 15.565 sec on average)
pnml2lts-mc( 0/ 4): States per second: 301, Transitions per second: 608965
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 99.8MB, 22.3 B/state, compr.: 2.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 13.0%/100.0%
pnml2lts-mc( 0/ 4): Stored 9983 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 99.8MB (~256.0MB paged-in)
ltl formula name SemanticWebServices-PT-S256P18-LTLFireability-07
ltl formula formula --ltl=/tmp/759/ltl_7_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 198 places, 9732 transitions and 78799 arcs
pnml2lts-mc( 0/ 4): Petri net 15-ont-256-18.net analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.160 real 0.480 user 0.290 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/759/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/759/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/759/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/759/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 205 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 199, there are 9737 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 7653
pnml2lts-mc( 0/ 4): unique transitions count: 15466713
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 7656
pnml2lts-mc( 0/ 4): - cum. max stack depth: 7656
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7656 states 15470478 transitions, fanout: 2020.700
pnml2lts-mc( 0/ 4): Total exploration time 14.940 sec (9.490 sec minimum, 11.948 sec on average)
pnml2lts-mc( 0/ 4): States per second: 512, Transitions per second: 1035507
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 104.0MB, 20.8 B/state, compr.: 2.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 15.0%/100.0%
pnml2lts-mc( 0/ 4): Stored 9983 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 104.0MB (~256.0MB paged-in)
ltl formula name SemanticWebServices-PT-S256P18-LTLFireability-08
ltl formula formula --ltl=/tmp/759/ltl_8_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 198 places, 9732 transitions and 78799 arcs
pnml2lts-mc( 0/ 4): Petri net 15-ont-256-18.net analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.070 real 0.500 user 0.320 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/759/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/759/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/759/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/759/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 206 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 199, there are 9737 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 7151
pnml2lts-mc( 0/ 4): unique transitions count: 14452171
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 7154
pnml2lts-mc( 0/ 4): - cum. max stack depth: 7154
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7154 states 14455203 transitions, fanout: 2020.576
pnml2lts-mc( 0/ 4): Total exploration time 42.200 sec (7.700 sec minimum, 17.715 sec on average)
pnml2lts-mc( 0/ 4): States per second: 170, Transitions per second: 342540
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 101.4MB, 21.7 B/state, compr.: 2.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 14.0%/100.0%
pnml2lts-mc( 0/ 4): Stored 9983 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 101.4MB (~256.0MB paged-in)
ltl formula name SemanticWebServices-PT-S256P18-LTLFireability-09
ltl formula formula --ltl=/tmp/759/ltl_9_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 198 places, 9732 transitions and 78799 arcs
pnml2lts-mc( 0/ 4): Petri net 15-ont-256-18.net analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.180 real 0.400 user 0.430 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/759/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/759/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/759/ltl_9_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/759/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 206 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 199, there are 9748 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 8169
pnml2lts-mc( 0/ 4): unique transitions count: 33019098
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 8172
pnml2lts-mc( 0/ 4): - cum. max stack depth: 8172
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8172 states 33020802 transitions, fanout: 4040.725
pnml2lts-mc( 0/ 4): Total exploration time 45.730 sec (12.340 sec minimum, 35.198 sec on average)
pnml2lts-mc( 0/ 4): States per second: 179, Transitions per second: 722082
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 149.4MB, 14.0 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 33.0%/100.0%
pnml2lts-mc( 0/ 4): Stored 9983 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 149.4MB (~256.0MB paged-in)
ltl formula name SemanticWebServices-PT-S256P18-LTLFireability-10
ltl formula formula --ltl=/tmp/759/ltl_10_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 198 places, 9732 transitions and 78799 arcs
pnml2lts-mc( 0/ 4): Petri net 15-ont-256-18.net analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.090 real 0.490 user 0.310 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/759/ltl_10_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/759/ltl_10_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/759/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/759/ltl_10_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 206 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 199, there are 9733 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 64.0 B/state, compr.: 8.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 9983 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name SemanticWebServices-PT-S256P18-LTLFireability-11
ltl formula formula --ltl=/tmp/759/ltl_11_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 198 places, 9732 transitions and 78799 arcs
pnml2lts-mc( 0/ 4): Petri net 15-ont-256-18.net analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.120 real 0.420 user 0.370 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/759/ltl_11_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/759/ltl_11_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/759/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/759/ltl_11_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 205 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 199, there are 9736 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 8374
pnml2lts-mc( 0/ 4): unique transitions count: 16923854
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 8377
pnml2lts-mc( 0/ 4): - cum. max stack depth: 8377
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8377 states 16923647 transitions, fanout: 2020.252
pnml2lts-mc( 0/ 4): Total exploration time 22.700 sec (20.620 sec minimum, 21.630 sec on average)
pnml2lts-mc( 0/ 4): States per second: 369, Transitions per second: 745535
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 107.7MB, 19.7 B/state, compr.: 2.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 17.0%/100.0%
pnml2lts-mc( 0/ 4): Stored 9983 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 107.7MB (~256.0MB paged-in)
ltl formula name SemanticWebServices-PT-S256P18-LTLFireability-12
ltl formula formula --ltl=/tmp/759/ltl_12_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 198 places, 9732 transitions and 78799 arcs
pnml2lts-mc( 0/ 4): Petri net 15-ont-256-18.net analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.090 real 0.520 user 0.320 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/759/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/759/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/759/ltl_12_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/759/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 205 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 199, there are 9738 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 7817
pnml2lts-mc( 0/ 4): unique transitions count: 15829789
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 7820
pnml2lts-mc( 0/ 4): - cum. max stack depth: 7820
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7820 states 15832124 transitions, fanout: 2024.568
pnml2lts-mc( 0/ 4): Total exploration time 19.180 sec (7.840 sec minimum, 14.980 sec on average)
pnml2lts-mc( 0/ 4): States per second: 408, Transitions per second: 825450
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 104.9MB, 20.5 B/state, compr.: 2.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 15.0%/100.0%
pnml2lts-mc( 0/ 4): Stored 9983 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 104.9MB (~256.0MB paged-in)
ltl formula name SemanticWebServices-PT-S256P18-LTLFireability-13
ltl formula formula --ltl=/tmp/759/ltl_13_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 198 places, 9732 transitions and 78799 arcs
pnml2lts-mc( 0/ 4): Petri net 15-ont-256-18.net analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.130 real 0.400 user 0.340 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/759/ltl_13_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/759/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/759/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/759/ltl_13_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 206 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 199, there are 9736 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 8012
pnml2lts-mc( 0/ 4): unique transitions count: 16192252
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 8015
pnml2lts-mc( 0/ 4): - cum. max stack depth: 8015
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8015 states 16196025 transitions, fanout: 2020.714
pnml2lts-mc( 0/ 4): Total exploration time 22.350 sec (6.910 sec minimum, 11.828 sec on average)
pnml2lts-mc( 0/ 4): States per second: 359, Transitions per second: 724654
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 105.9MB, 20.2 B/state, compr.: 2.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 16.0%/100.0%
pnml2lts-mc( 0/ 4): Stored 9983 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 105.9MB (~256.0MB paged-in)
ltl formula name SemanticWebServices-PT-S256P18-LTLFireability-14
ltl formula formula --ltl=/tmp/759/ltl_14_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 198 places, 9732 transitions and 78799 arcs
pnml2lts-mc( 0/ 4): Petri net 15-ont-256-18.net analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.340 real 0.460 user 0.300 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/759/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/759/ltl_14_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/759/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/759/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 206 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 199, there are 9740 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 7473
pnml2lts-mc( 0/ 4): unique transitions count: 15111017
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 7476
pnml2lts-mc( 0/ 4): - cum. max stack depth: 7476
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7476 states 15112842 transitions, fanout: 2021.514
pnml2lts-mc( 0/ 4): Total exploration time 22.900 sec (6.510 sec minimum, 15.623 sec on average)
pnml2lts-mc( 0/ 4): States per second: 326, Transitions per second: 659949
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 103.1MB, 21.1 B/state, compr.: 2.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 15.0%/100.0%
pnml2lts-mc( 0/ 4): Stored 9983 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 103.1MB (~256.0MB paged-in)
ltl formula name SemanticWebServices-PT-S256P18-LTLFireability-15
ltl formula formula --ltl=/tmp/759/ltl_15_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 198 places, 9732 transitions and 78799 arcs
pnml2lts-mc( 0/ 4): Petri net 15-ont-256-18.net analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.190 real 0.430 user 0.290 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/759/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/759/ltl_15_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/759/ltl_15_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/759/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 205 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 199, there are 9742 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 7715
pnml2lts-mc( 0/ 4): unique transitions count: 31184030
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 7718
pnml2lts-mc( 0/ 4): - cum. max stack depth: 7718
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7718 states 31189904 transitions, fanout: 4041.190
pnml2lts-mc( 0/ 4): Total exploration time 35.870 sec (10.070 sec minimum, 22.930 sec on average)
pnml2lts-mc( 0/ 4): States per second: 215, Transitions per second: 869526
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 104.3MB, 20.7 B/state, compr.: 2.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 15.0%/100.0%
pnml2lts-mc( 0/ 4): Stored 9983 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 104.3MB (~256.0MB paged-in)
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-S256P18"
export BK_EXAMINATION="LTLFireability"
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 SemanticWebServices-PT-S256P18, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r524-tall-171679080700604"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SemanticWebServices-PT-S256P18.tgz
mv SemanticWebServices-PT-S256P18 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;