fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r289-tajo-171654445700340
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for PolyORBLF-PT-S06J06T04

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16206.836 3600000.00 13739258.00 1637.90 TF??F????FF????T normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445700340.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBLF-PT-S06J06T04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445700340
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 16K Apr 11 17:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 11 17:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 221K Apr 11 17:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 855K Apr 11 17:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.5K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 113K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 341K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Apr 11 17:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 11 17:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 483K Apr 11 17:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.1M Apr 11 17:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.9M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716872603808

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J06T04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 05:03:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 05:03:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 05:03:27] [INFO ] Load time of PNML (sax parser for PT used): 892 ms
[2024-05-28 05:03:27] [INFO ] Transformed 506 places.
[2024-05-28 05:03:27] [INFO ] Transformed 7154 transitions.
[2024-05-28 05:03:27] [INFO ] Parsed PT model containing 506 places and 7154 transitions and 59824 arcs in 1143 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 56 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
[2024-05-28 05:03:27] [INFO ] Reduced 4680 identical enabling conditions.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
FORMULA PolyORBLF-PT-S06J06T04-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 186 out of 506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 1774/1774 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 500 transition count 1774
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 497 transition count 1771
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 497 transition count 1771
Applied a total of 12 rules in 285 ms. Remains 497 /506 variables (removed 9) and now considering 1771/1774 (removed 3) transitions.
Running 1765 sub problems to find dead transitions.
[2024-05-28 05:03:28] [INFO ] Flow matrix only has 1747 transitions (discarded 24 similar events)
// Phase 1: matrix 1747 rows 497 cols
[2024-05-28 05:03:28] [INFO ] Computed 48 invariants in 103 ms
[2024-05-28 05:03:28] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/491 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1765 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/491 variables, 17/37 constraints. Problems are: Problem set: 0 solved, 1765 unsolved
[2024-05-28 05:04:03] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 18 ms to minimize.
[2024-05-28 05:04:03] [INFO ] Deduced a trap composed of 81 places in 132 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 491/2244 variables, and 39 constraints, problems are : Problem set: 0 solved, 1765 unsolved in 20132 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/497 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1765/1765 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1765 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/491 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1765 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/491 variables, 17/37 constraints. Problems are: Problem set: 0 solved, 1765 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1765 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1765 unsolved
Problem TDEAD82 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1401 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1420 is UNSAT
Problem TDEAD1421 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1426 is UNSAT
Problem TDEAD1427 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1463 is UNSAT
Problem TDEAD1465 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1508 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1521 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/493 variables, 2/41 constraints. Problems are: Problem set: 166 solved, 1599 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 493/2244 variables, and 41 constraints, problems are : Problem set: 166 solved, 1599 unsolved in 20089 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/497 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1765 constraints, Known Traps: 2/2 constraints]
After SMT, in 59167ms problems are : Problem set: 166 solved, 1599 unsolved
Search for dead transitions found 166 dead transitions in 59269ms
Found 166 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 166 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 166 transitions.
[2024-05-28 05:04:27] [INFO ] Flow matrix only has 1581 transitions (discarded 24 similar events)
// Phase 1: matrix 1581 rows 497 cols
[2024-05-28 05:04:27] [INFO ] Computed 48 invariants in 110 ms
[2024-05-28 05:04:28] [INFO ] Implicit Places using invariants in 531 ms returned []
[2024-05-28 05:04:28] [INFO ] Flow matrix only has 1581 transitions (discarded 24 similar events)
[2024-05-28 05:04:28] [INFO ] Invariant cache hit.
[2024-05-28 05:04:29] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 05:04:44] [INFO ] Implicit Places using invariants and state equation in 16005 ms returned []
Implicit Place search using SMT with State Equation took 16547 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 497/506 places, 1605/1774 transitions.
Applied a total of 0 rules in 37 ms. Remains 497 /497 variables (removed 0) and now considering 1605/1605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76251 ms. Remains : 497/506 places, 1605/1774 transitions.
Support contains 186 out of 497 places after structural reductions.
[2024-05-28 05:04:44] [INFO ] Flatten gal took : 312 ms
[2024-05-28 05:04:45] [INFO ] Flatten gal took : 178 ms
[2024-05-28 05:04:45] [INFO ] Input system was already deterministic with 1605 transitions.
Support contains 170 out of 497 places (down from 186) after GAL structural reductions.
RANDOM walk for 40002 steps (193 resets) in 1660 ms. (24 steps per ms) remains 4/23 properties
BEST_FIRST walk for 40001 steps (101 resets) in 729 ms. (54 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (93 resets) in 227 ms. (175 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (84 resets) in 232 ms. (171 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (91 resets) in 208 ms. (191 steps per ms) remains 4/4 properties
[2024-05-28 05:04:46] [INFO ] Flow matrix only has 1581 transitions (discarded 24 similar events)
[2024-05-28 05:04:46] [INFO ] Invariant cache hit.
[2024-05-28 05:04:46] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 133/198 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 31/229 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 9/238 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 7 (OVERLAPS) 238/476 variables, 17/34 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 7/483 variables, 4/38 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-28 05:04:47] [INFO ] Deduced a trap composed of 100 places in 131 ms of which 2 ms to minimize.
[2024-05-28 05:04:47] [INFO ] Deduced a trap composed of 92 places in 63 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/483 variables, 2/40 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/483 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp19 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 12/495 variables, 9/49 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/495 variables, 0/49 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2076/2078 variables, and 544 constraints, problems are : Problem set: 3 solved, 1 unsolved in 2585 ms.
Refiners :[Positive P Invariants (semi-flows): 21/22 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 495/497 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 344/346 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 83/429 variables, 19/24 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/429 variables, 0/24 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/430 variables, 1/25 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/430 variables, 0/25 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 64/494 variables, 21/46 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/494 variables, 2/48 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-05-28 05:04:49] [INFO ] Deduced a trap composed of 94 places in 101 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/494 variables, 1/49 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/494 variables, 0/49 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/495 variables, 1/50 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/495 variables, 0/50 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2076/2078 variables, and 545 constraints, problems are : Problem set: 3 solved, 1 unsolved in 1977 ms.
Refiners :[Positive P Invariants (semi-flows): 21/22 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 495/497 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 4604ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 120 ms.
Support contains 2 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 1605/1605 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 497 transition count 1580
Reduce places removed 25 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 29 rules applied. Total rules applied 54 place count 472 transition count 1576
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 58 place count 468 transition count 1576
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 58 place count 468 transition count 1520
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 170 place count 412 transition count 1520
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 3 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 272 place count 361 transition count 1469
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 280 place count 361 transition count 1461
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 288 place count 353 transition count 1461
Applied a total of 288 rules in 263 ms. Remains 353 /497 variables (removed 144) and now considering 1461/1605 (removed 144) transitions.
Running 1455 sub problems to find dead transitions.
[2024-05-28 05:04:51] [INFO ] Flow matrix only has 1437 transitions (discarded 24 similar events)
// Phase 1: matrix 1437 rows 353 cols
[2024-05-28 05:04:51] [INFO ] Computed 48 invariants in 52 ms
[2024-05-28 05:04:51] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/347 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1455 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/347 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 1455 unsolved
[2024-05-28 05:05:15] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-28 05:05:15] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-05-28 05:05:16] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 6 ms to minimize.
[2024-05-28 05:05:17] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 3 ms to minimize.
[2024-05-28 05:05:19] [INFO ] Deduced a trap composed of 79 places in 150 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/347 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 1455 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 347/1790 variables, and 42 constraints, problems are : Problem set: 0 solved, 1455 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 19/21 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/353 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1455/1455 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1455 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/347 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1455 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/347 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 1455 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/347 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 1455 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/347 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1455 unsolved
Problem TDEAD779 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1401 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1417 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1420 is UNSAT
Problem TDEAD1427 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/349 variables, 2/44 constraints. Problems are: Problem set: 205 solved, 1250 unsolved
[2024-05-28 05:05:40] [INFO ] Deduced a trap composed of 56 places in 347 ms of which 2 ms to minimize.
[2024-05-28 05:05:40] [INFO ] Deduced a trap composed of 23 places in 298 ms of which 2 ms to minimize.
[2024-05-28 05:05:40] [INFO ] Deduced a trap composed of 21 places in 270 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 3/47 constraints. Problems are: Problem set: 205 solved, 1250 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 349/1790 variables, and 47 constraints, problems are : Problem set: 205 solved, 1250 unsolved in 20056 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/353 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1455 constraints, Known Traps: 8/8 constraints]
After SMT, in 56305ms problems are : Problem set: 205 solved, 1250 unsolved
Search for dead transitions found 205 dead transitions in 56332ms
Found 205 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 205 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 353/497 places, 1256/1605 transitions.
Applied a total of 0 rules in 35 ms. Remains 353 /353 variables (removed 0) and now considering 1256/1256 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56638 ms. Remains : 353/497 places, 1256/1605 transitions.
RANDOM walk for 33315 steps (356 resets) in 516 ms. (64 steps per ms) remains 0/1 properties
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
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' '!((p0 U G(p1)))'
Support contains 33 out of 497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 497/497 places, 1605/1605 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 497 transition count 1584
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 43 place count 476 transition count 1583
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 475 transition count 1583
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 44 place count 475 transition count 1527
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 156 place count 419 transition count 1527
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 2 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 258 place count 368 transition count 1476
Applied a total of 258 rules in 130 ms. Remains 368 /497 variables (removed 129) and now considering 1476/1605 (removed 129) transitions.
Running 1470 sub problems to find dead transitions.
[2024-05-28 05:05:48] [INFO ] Flow matrix only has 1452 transitions (discarded 24 similar events)
// Phase 1: matrix 1452 rows 368 cols
[2024-05-28 05:05:48] [INFO ] Computed 48 invariants in 56 ms
[2024-05-28 05:05:48] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 1470 unsolved
[2024-05-28 05:06:15] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
[2024-05-28 05:06:15] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2024-05-28 05:06:17] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 2 ms to minimize.
[2024-05-28 05:06:19] [INFO ] Deduced a trap composed of 31 places in 191 ms of which 2 ms to minimize.
[2024-05-28 05:06:20] [INFO ] Deduced a trap composed of 28 places in 199 ms of which 2 ms to minimize.
[2024-05-28 05:06:20] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 362/1820 variables, and 43 constraints, problems are : Problem set: 0 solved, 1470 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 16/20 constraints, Generalized P Invariants (flows): 21/28 constraints, State Equation: 0/368 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1470/1470 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1470 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 1470 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 1470 unsolved
[2024-05-28 05:06:32] [INFO ] Deduced a trap composed of 86 places in 156 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1470 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 1)
(s4 1)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 1)
(s15 3)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 1)
(s25 0)
(s26 0)
(s27 0)
(s28 3)
(s29 1)
(s30 1)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 1)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 2)
(s50 0)
(s51 0)
(s52 0)
(s53 1)
(s54 1)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 1)
(s60 1)
(s61 0)
(s62 0)
(s63 0)
(s64 2)
(s65 0)
(s66 1)
(s67 0)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 1)
(s85 0)
(s86 0)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 1)
(s104 0)
(s105 2)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 1)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 3)
(s122 0)
(s123 4)
(s124 1)
(s125 0)
(s126 4)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 2)
(s133 0)
(s134 1)
(s135 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 2)
(s143 0)
(s144 0)
(s145 0)
(s146 1)
(s147 1)
(s148 1)
(s149 0)
(s150 1)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 4)
(s162 0)
(s163 0)
(s164 0)
(s165 1)
(s166 1)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 4)
(s172 0)
(s173 1)
(s174 0)
(s175 0)
(s176 0)
(s178 0)
(s179 1)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 0)
(s185 1)
(s186 0)
(s187 2)
(s188 4)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 9)
(s196 0)
(s197 0)
(s198 1)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 1)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 2)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 4)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 1)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 1)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 362/1820 variables, and 44 constraints, problems are : Problem set: 0 solved, 1470 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 16/20 constraints, Generalized P Invariants (flows): 21/28 constraints, State Equation: 0/368 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1470 constraints, Known Traps: 7/7 constraints]
After SMT, in 53137ms problems are : Problem set: 0 solved, 1470 unsolved
Search for dead transitions found 0 dead transitions in 53155ms
[2024-05-28 05:06:41] [INFO ] Flow matrix only has 1452 transitions (discarded 24 similar events)
[2024-05-28 05:06:41] [INFO ] Invariant cache hit.
[2024-05-28 05:06:42] [INFO ] Implicit Places using invariants in 1069 ms returned [19, 73, 154, 307]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 1087 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 364/497 places, 1476/1605 transitions.
Applied a total of 0 rules in 43 ms. Remains 364 /364 variables (removed 0) and now considering 1476/1476 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 54420 ms. Remains : 364/497 places, 1476/1605 transitions.
Stuttering acceptance computed with spot in 371 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S06J06T04-LTLFireability-01
Entered a terminal (fully accepting) state of product in 79 steps with 0 reset in 10 ms.
FORMULA PolyORBLF-PT-S06J06T04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T04-LTLFireability-01 finished in 54950 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(X(p0)))'
Support contains 11 out of 497 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 497/497 places, 1605/1605 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 493 transition count 1601
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 493 transition count 1601
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 492 transition count 1600
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 492 transition count 1600
Applied a total of 10 rules in 91 ms. Remains 492 /497 variables (removed 5) and now considering 1600/1605 (removed 5) transitions.
Running 1594 sub problems to find dead transitions.
[2024-05-28 05:06:43] [INFO ] Flow matrix only has 1576 transitions (discarded 24 similar events)
// Phase 1: matrix 1576 rows 492 cols
[2024-05-28 05:06:43] [INFO ] Computed 48 invariants in 54 ms
[2024-05-28 05:06:43] [INFO ] State equation strengthened by 112 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-PT-S06J06T04

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 506
TRANSITIONS: 7154
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.469s, Sys 0.038s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.080s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 711
MODEL NAME: /home/mcc/execution/model
506 places, 7154 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is PolyORBLF-PT-S06J06T04, 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 r289-tajo-171654445700340"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S06J06T04.tgz
mv PolyORBLF-PT-S06J06T04 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;