MCC'2024- Execution of r516-tajo-171654446800292

About the Execution of LTSMin+red for PolyORBLF-PT-S04J06T06

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
13295.752	1551165.00	1966232.00	419.10	FFFTF?TFFFTFFFTF	normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 19K Apr 11 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 11 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 11 17:07 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 8.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 22K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 33K Apr 11 17:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K Apr 11 17:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 90K Apr 11 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 427K Apr 11 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.7K Apr 23 07:43 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 2.6M 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-S04J06T06-LTLFireability-00
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-01
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-02
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-03
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-04
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-05
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-06
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-07
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-08
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-09
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-10
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-11
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-12
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-13
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-14
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717254573635

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:09:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 15:09:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:09:35] [INFO ] Load time of PNML (sax parser for PT used): 392 ms
[2024-06-01 15:09:35] [INFO ] Transformed 618 places.
[2024-06-01 15:09:35] [INFO ] Transformed 3190 transitions.
[2024-06-01 15:09:35] [INFO ] Parsed PT model containing 618 places and 3190 transitions and 21570 arcs in 621 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
[2024-06-01 15:09:35] [INFO ] Reduced 264 identical enabling conditions.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 212 out of 618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 1564/1564 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 614 transition count 1564
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 9 place count 609 transition count 1559
Iterating global reduction 1 with 5 rules applied. Total rules applied 14 place count 609 transition count 1559
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 19 place count 604 transition count 1554
Iterating global reduction 1 with 5 rules applied. Total rules applied 24 place count 604 transition count 1554
Applied a total of 24 rules in 134 ms. Remains 604 /618 variables (removed 14) and now considering 1554/1564 (removed 10) transitions.
Running 1550 sub problems to find dead transitions.
[2024-06-01 15:09:36] [INFO ] Flow matrix only has 1530 transitions (discarded 24 similar events)
// Phase 1: matrix 1530 rows 604 cols
[2024-06-01 15:09:36] [INFO ] Computed 50 invariants in 101 ms
[2024-06-01 15:09:36] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 26/44 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
[2024-06-01 15:09:54] [INFO ] Deduced a trap composed of 135 places in 442 ms of which 30 ms to minimize.
[2024-06-01 15:09:54] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 29 ms to minimize.
[2024-06-01 15:09:56] [INFO ] Deduced a trap composed of 39 places in 174 ms of which 1 ms to minimize.
[2024-06-01 15:09:57] [INFO ] Deduced a trap composed of 292 places in 179 ms of which 2 ms to minimize.
[2024-06-01 15:09:57] [INFO ] Deduced a trap composed of 279 places in 219 ms of which 3 ms to minimize.
[2024-06-01 15:09:58] [INFO ] Deduced a trap composed of 284 places in 364 ms of which 3 ms to minimize.
[2024-06-01 15:09:59] [INFO ] Deduced a trap composed of 300 places in 326 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 600/2134 variables, and 51 constraints, problems are : Problem set: 0 solved, 1550 unsolved in 20104 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 26/32 constraints, State Equation: 0/604 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1550/1550 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1550 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 26/44 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/600 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
[2024-06-01 15:10:13] [INFO ] Deduced a trap composed of 81 places in 85 ms of which 2 ms to minimize.
[2024-06-01 15:10:13] [INFO ] Deduced a trap composed of 81 places in 65 ms of which 1 ms to minimize.
[2024-06-01 15:10:14] [INFO ] Deduced a trap composed of 84 places in 65 ms of which 1 ms to minimize.
[2024-06-01 15:10:14] [INFO ] Deduced a trap composed of 81 places in 58 ms of which 0 ms to minimize.
[2024-06-01 15:10:15] [INFO ] Deduced a trap composed of 81 places in 85 ms of which 1 ms to minimize.
[2024-06-01 15:10:15] [INFO ] Deduced a trap composed of 82 places in 54 ms of which 1 ms to minimize.
[2024-06-01 15:10:16] [INFO ] Deduced a trap composed of 258 places in 279 ms of which 4 ms to minimize.
[2024-06-01 15:10:17] [INFO ] Deduced a trap composed of 102 places in 280 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 600/2134 variables, and 59 constraints, problems are : Problem set: 0 solved, 1550 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 26/32 constraints, State Equation: 0/604 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1550 constraints, Known Traps: 15/15 constraints]
After SMT, in 45069ms problems are : Problem set: 0 solved, 1550 unsolved
Search for dead transitions found 0 dead transitions in 45172ms
[2024-06-01 15:10:21] [INFO ] Flow matrix only has 1530 transitions (discarded 24 similar events)
[2024-06-01 15:10:21] [INFO ] Invariant cache hit.
[2024-06-01 15:10:22] [INFO ] Implicit Places using invariants in 519 ms returned [134, 199, 326, 360, 479, 546]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 530 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 598/618 places, 1554/1564 transitions.
Applied a total of 0 rules in 15 ms. Remains 598 /598 variables (removed 0) and now considering 1554/1554 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45942 ms. Remains : 598/618 places, 1554/1564 transitions.
Support contains 212 out of 598 places after structural reductions.
[2024-06-01 15:10:22] [INFO ] Flatten gal took : 155 ms
[2024-06-01 15:10:22] [INFO ] Flatten gal took : 179 ms
[2024-06-01 15:10:23] [INFO ] Input system was already deterministic with 1554 transitions.
RANDOM walk for 40000 steps (9 resets) in 2089 ms. (19 steps per ms) remains 3/25 properties
BEST_FIRST walk for 40001 steps (8 resets) in 939 ms. (42 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 359 ms. (111 steps per ms) remains 3/3 properties
[2024-06-01 15:10:24] [INFO ] Flow matrix only has 1530 transitions (discarded 24 similar events)
// Phase 1: matrix 1530 rows 598 cols
[2024-06-01 15:10:24] [INFO ] Computed 44 invariants in 39 ms
[2024-06-01 15:10:24] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 15/39 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp22 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 509/548 variables, 12/16 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/548 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 20/568 variables, 12/28 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/568 variables, 0/28 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem AtomicPropp18 is UNSAT
After SMT solving in domain Real declared 596/2128 variables, and 43 constraints, problems are : Problem set: 3 solved, 0 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/598 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 754ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!(X(X(F(p0))))'
Support contains 6 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 1554/1554 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 597 transition count 1553
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 597 transition count 1553
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 596 transition count 1552
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 596 transition count 1552
Applied a total of 4 rules in 121 ms. Remains 596 /598 variables (removed 2) and now considering 1552/1554 (removed 2) transitions.
Running 1548 sub problems to find dead transitions.
[2024-06-01 15:10:25] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-06-01 15:10:25] [INFO ] Computed 44 invariants in 64 ms
[2024-06-01 15:10:25] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 15:10:41] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 30 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 12/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Problem TDEAD220 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1543 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/31 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 6/37 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
[2024-06-01 15:11:08] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/2124 variables, and 38 constraints, problems are : Problem set: 90 solved, 1458 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 2/2 constraints]
After SMT, in 44774ms problems are : Problem set: 90 solved, 1458 unsolved
Search for dead transitions found 90 dead transitions in 44800ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 90 transitions.
[2024-06-01 15:11:10] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
// Phase 1: matrix 1438 rows 596 cols
[2024-06-01 15:11:10] [INFO ] Computed 44 invariants in 21 ms
[2024-06-01 15:11:11] [INFO ] Implicit Places using invariants in 747 ms returned []
[2024-06-01 15:11:11] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-06-01 15:11:11] [INFO ] Invariant cache hit.
[2024-06-01 15:11:12] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:11:24] [INFO ] Implicit Places using invariants and state equation in 13661 ms returned []
Implicit Place search using SMT with State Equation took 14411 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 596/598 places, 1462/1554 transitions.
Applied a total of 0 rules in 18 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59355 ms. Remains : 596/598 places, 1462/1554 transitions.
Stuttering acceptance computed with spot in 434 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-00
Stuttering criterion allowed to conclude after 7808 steps with 5 reset in 70 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-00 finished in 59954 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)||(G(p1)&&(G(p2)||(X(p2)&&F(p3)))))))'
Support contains 56 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 1554/1554 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 597 transition count 1553
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 597 transition count 1553
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 596 transition count 1552
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 596 transition count 1552
Applied a total of 4 rules in 48 ms. Remains 596 /598 variables (removed 2) and now considering 1552/1554 (removed 2) transitions.
Running 1548 sub problems to find dead transitions.
[2024-06-01 15:11:25] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-06-01 15:11:25] [INFO ] Computed 44 invariants in 22 ms
[2024-06-01 15:11:25] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 15:11:40] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 30 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 12/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Problem TDEAD220 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1543 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/31 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 6/37 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
[2024-06-01 15:12:05] [INFO ] Deduced a trap composed of 98 places in 116 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/2124 variables, and 38 constraints, problems are : Problem set: 90 solved, 1458 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 2/2 constraints]
After SMT, in 44713ms problems are : Problem set: 90 solved, 1458 unsolved
Search for dead transitions found 90 dead transitions in 44742ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 90 transitions.
[2024-06-01 15:12:10] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
// Phase 1: matrix 1438 rows 596 cols
[2024-06-01 15:12:10] [INFO ] Computed 44 invariants in 34 ms
[2024-06-01 15:12:10] [INFO ] Implicit Places using invariants in 538 ms returned []
[2024-06-01 15:12:10] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-06-01 15:12:10] [INFO ] Invariant cache hit.
[2024-06-01 15:12:11] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:12:28] [INFO ] Implicit Places using invariants and state equation in 17835 ms returned []
Implicit Place search using SMT with State Equation took 18377 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 596/598 places, 1462/1554 transitions.
Applied a total of 0 rules in 9 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63184 ms. Remains : 596/598 places, 1462/1554 transitions.
Stuttering acceptance computed with spot in 534 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p1), (AND p1 (NOT p2)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p2) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-04 finished in 63755 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((X((F(p0) U X(p1)))&&F(p2))))'
Support contains 38 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 1554/1554 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 597 transition count 1553
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 597 transition count 1553
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 596 transition count 1552
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 596 transition count 1552
Applied a total of 4 rules in 45 ms. Remains 596 /598 variables (removed 2) and now considering 1552/1554 (removed 2) transitions.
Running 1548 sub problems to find dead transitions.
[2024-06-01 15:12:29] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-06-01 15:12:29] [INFO ] Computed 44 invariants in 21 ms
[2024-06-01 15:12:29] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 15:12:43] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 30 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 12/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Problem TDEAD220 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1543 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/31 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 6/37 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
[2024-06-01 15:13:08] [INFO ] Deduced a trap composed of 98 places in 94 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/2124 variables, and 38 constraints, problems are : Problem set: 90 solved, 1458 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 2/2 constraints]
After SMT, in 43548ms problems are : Problem set: 90 solved, 1458 unsolved
Search for dead transitions found 90 dead transitions in 43563ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 90 transitions.
[2024-06-01 15:13:12] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
// Phase 1: matrix 1438 rows 596 cols
[2024-06-01 15:13:12] [INFO ] Computed 44 invariants in 24 ms
[2024-06-01 15:13:13] [INFO ] Implicit Places using invariants in 579 ms returned []
[2024-06-01 15:13:13] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-06-01 15:13:13] [INFO ] Invariant cache hit.
[2024-06-01 15:13:14] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:13:27] [INFO ] Implicit Places using invariants and state equation in 13946 ms returned []
Implicit Place search using SMT with State Equation took 14541 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 596/598 places, 1462/1554 transitions.
Applied a total of 0 rules in 7 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58161 ms. Remains : 596/598 places, 1462/1554 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-05
Product exploration explored 100000 steps with 2838 reset in 676 ms.
Product exploration explored 100000 steps with 2785 reset in 513 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 108 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 203 steps (0 resets) in 21 ms. (9 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 7 factoid took 185 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-06-01 15:13:29] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-06-01 15:13:29] [INFO ] Invariant cache hit.
[2024-06-01 15:13:30] [INFO ] [Real]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-06-01 15:13:30] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 77 ms returned sat
[2024-06-01 15:13:32] [INFO ] [Real]Absence check using state equation in 2378 ms returned sat
[2024-06-01 15:13:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:13:33] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-06-01 15:13:33] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 49 ms returned sat
[2024-06-01 15:13:40] [INFO ] [Nat]Absence check using state equation in 6746 ms returned sat
[2024-06-01 15:13:40] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:13:42] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 15:13:43] [INFO ] [Nat]Added 120 Read/Feed constraints in 3136 ms returned unknown
Could not prove EG (NOT p2)
[2024-06-01 15:13:43] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-06-01 15:13:43] [INFO ] Invariant cache hit.
[2024-06-01 15:13:44] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-06-01 15:13:44] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 57 ms returned sat
[2024-06-01 15:13:45] [INFO ] [Real]Absence check using state equation in 1274 ms returned sat
[2024-06-01 15:13:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:13:46] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-06-01 15:13:46] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 45 ms returned sat
[2024-06-01 15:13:49] [INFO ] [Nat]Absence check using state equation in 3615 ms returned sat
[2024-06-01 15:13:49] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:13:50] [INFO ] [Nat]Added 120 Read/Feed constraints in 465 ms returned sat
[2024-06-01 15:13:51] [INFO ] Deduced a trap composed of 133 places in 714 ms of which 19 ms to minimize.
[2024-06-01 15:13:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 946 ms
[2024-06-01 15:13:51] [INFO ] Computed and/alt/rep : 1008/3943/990 causal constraints (skipped 444 transitions) in 157 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:610)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 15:14:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Support contains 38 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1462/1462 transitions.
Applied a total of 0 rules in 14 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Running 1458 sub problems to find dead transitions.
[2024-06-01 15:14:00] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-06-01 15:14:00] [INFO ] Invariant cache hit.
[2024-06-01 15:14:00] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-06-01 15:14:12] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-06-01 15:14:13] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 1 ms to minimize.
[2024-06-01 15:14:14] [INFO ] Deduced a trap composed of 39 places in 245 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2034 variables, and 35 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 15/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1458/1458 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-06-01 15:14:25] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 1 ms to minimize.
[2024-06-01 15:14:26] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
[2024-06-01 15:14:26] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 1 ms to minimize.
[2024-06-01 15:14:26] [INFO ] Deduced a trap composed of 82 places in 67 ms of which 1 ms to minimize.
[2024-06-01 15:14:26] [INFO ] Deduced a trap composed of 82 places in 77 ms of which 1 ms to minimize.
[2024-06-01 15:14:26] [INFO ] Deduced a trap composed of 82 places in 183 ms of which 1 ms to minimize.
[2024-06-01 15:14:26] [INFO ] Deduced a trap composed of 82 places in 48 ms of which 0 ms to minimize.
[2024-06-01 15:14:36] [INFO ] Deduced a trap composed of 82 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2034 variables, and 43 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 15/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1458 constraints, Known Traps: 11/11 constraints]
After SMT, in 42733ms problems are : Problem set: 0 solved, 1458 unsolved
Search for dead transitions found 0 dead transitions in 42750ms
[2024-06-01 15:14:43] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-06-01 15:14:43] [INFO ] Invariant cache hit.
[2024-06-01 15:14:44] [INFO ] Implicit Places using invariants in 1137 ms returned []
[2024-06-01 15:14:44] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-06-01 15:14:44] [INFO ] Invariant cache hit.
[2024-06-01 15:14:46] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:15:00] [INFO ] Implicit Places using invariants and state equation in 16041 ms returned []
Implicit Place search using SMT with State Equation took 17199 ms to find 0 implicit places.
Running 1458 sub problems to find dead transitions.
[2024-06-01 15:15:00] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-06-01 15:15:00] [INFO ] Invariant cache hit.
[2024-06-01 15:15:00] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-06-01 15:15:13] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:15:13] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 2 ms to minimize.
[2024-06-01 15:15:15] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 10.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 0.0)
(s66 1.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 1.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 1.0)
(s140 0.0)
(s141 1.0)
(s142 1.0)
(s143 0.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 0.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 0.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 1.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 1.0)
(s189 0.0)
(s190 1.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 1.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 8.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 1.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 0.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s283 0.0)
(s284 1.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 1.0)
(s296 1.0)
(s297 0.0)
(s298 1.0)
(s299 1.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 1.0)
(s310 0.0)
(s311 0.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 0.0)
(s319 1.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 1.0)
(s328 0.0)
(s329 1.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 1.0)
(s341 1.0)
(s342 0.0)
(s343 0.0)
(s344 1.0)
(s345 1.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 1.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 1.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2034 variables, and 35 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 15/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1458/1458 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-06-01 15:15:35] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 2 ms to minimize.
[2024-06-01 15:15:35] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:15:35] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-06-01 15:15:36] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:15:36] [INFO ] Deduced a trap composed of 82 places in 70 ms of which 1 ms to minimize.
[2024-06-01 15:15:36] [INFO ] Deduced a trap composed of 82 places in 76 ms of which 1 ms to minimize.
[2024-06-01 15:15:36] [INFO ] Deduced a trap composed of 82 places in 51 ms of which 1 ms to minimize.
[2024-06-01 15:15:47] [INFO ] Deduced a trap composed of 82 places in 75 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2034 variables, and 43 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 15/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1458 constraints, Known Traps: 11/11 constraints]
After SMT, in 62459ms problems are : Problem set: 0 solved, 1458 unsolved
Search for dead transitions found 0 dead transitions in 62470ms
Finished structural reductions in LTL mode , in 1 iterations and 122452 ms. Remains : 596/596 places, 1462/1462 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 84 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 187 steps (0 resets) in 25 ms. (7 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 7 factoid took 173 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-06-01 15:16:03] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-06-01 15:16:03] [INFO ] Invariant cache hit.
[2024-06-01 15:16:04] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2024-06-01 15:16:04] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 48 ms returned sat
[2024-06-01 15:16:07] [INFO ] [Real]Absence check using state equation in 2618 ms returned sat
[2024-06-01 15:16:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:16:08] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-06-01 15:16:08] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 51 ms returned sat
[2024-06-01 15:16:15] [INFO ] [Nat]Absence check using state equation in 6961 ms returned sat
[2024-06-01 15:16:15] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:16:16] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 15:16:17] [INFO ] [Nat]Added 120 Read/Feed constraints in 1908 ms returned sat
[2024-06-01 15:16:17] [INFO ] Deduced a trap composed of 82 places in 199 ms of which 2 ms to minimize.
[2024-06-01 15:16:17] [INFO ] Deduced a trap composed of 82 places in 163 ms of which 2 ms to minimize.
[2024-06-01 15:16:18] [INFO ] Deduced a trap composed of 82 places in 143 ms of which 1 ms to minimize.
[2024-06-01 15:16:18] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 1 ms to minimize.
[2024-06-01 15:16:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1198 ms
[2024-06-01 15:16:18] [INFO ] Computed and/alt/rep : 1008/3943/990 causal constraints (skipped 444 transitions) in 94 ms.
Could not prove EG (NOT p2)
[2024-06-01 15:16:22] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-06-01 15:16:22] [INFO ] Invariant cache hit.
[2024-06-01 15:16:22] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2024-06-01 15:16:22] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 55 ms returned sat
[2024-06-01 15:16:24] [INFO ] [Real]Absence check using state equation in 1315 ms returned sat
[2024-06-01 15:16:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:16:24] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-06-01 15:16:24] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 43 ms returned sat
[2024-06-01 15:16:29] [INFO ] [Nat]Absence check using state equation in 4094 ms returned sat
[2024-06-01 15:16:29] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:16:29] [INFO ] [Nat]Added 120 Read/Feed constraints in 533 ms returned sat
[2024-06-01 15:16:29] [INFO ] Deduced a trap composed of 133 places in 300 ms of which 5 ms to minimize.
[2024-06-01 15:16:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 559 ms
[2024-06-01 15:16:30] [INFO ] Computed and/alt/rep : 1008/3943/990 causal constraints (skipped 444 transitions) in 128 ms.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 2793 reset in 700 ms.
Product exploration explored 100000 steps with 2807 reset in 508 ms.
Applying partial POR strategy [false, false, true, false, true, true]
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 38 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 1462/1462 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 596 transition count 1462
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 36 place count 596 transition count 1462
Deduced a syphon composed of 48 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 48 place count 596 transition count 1462
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 60 place count 584 transition count 1450
Deduced a syphon composed of 36 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 72 place count 584 transition count 1450
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 132 places in 2 ms
Iterating global reduction 1 with 96 rules applied. Total rules applied 168 place count 584 transition count 1450
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 189 place count 563 transition count 1429
Deduced a syphon composed of 114 places in 2 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 210 place count 563 transition count 1429
Deduced a syphon composed of 114 places in 1 ms
Applied a total of 210 rules in 218 ms. Remains 563 /596 variables (removed 33) and now considering 1429/1462 (removed 33) transitions.
Running 1425 sub problems to find dead transitions.
[2024-06-01 15:16:41] [INFO ] Flow matrix only has 1405 transitions (discarded 24 similar events)
// Phase 1: matrix 1405 rows 563 cols
[2024-06-01 15:16:41] [INFO ] Computed 44 invariants in 28 ms
[2024-06-01 15:16:41] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/559 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1425 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/559 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 1425 unsolved
[2024-06-01 15:16:55] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-01 15:16:55] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 2 ms to minimize.
[2024-06-01 15:16:55] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD88 is UNSAT
[2024-06-01 15:16:56] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 0 ms to minimize.
Problem TDEAD114 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD236 is UNSAT
[2024-06-01 15:16:58] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
Problem TDEAD318 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD411 is UNSAT
[2024-06-01 15:16:59] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
Problem TDEAD414 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD586 is UNSAT
[2024-06-01 15:17:00] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
Problem TDEAD643 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD1092 is UNSAT
[2024-06-01 15:17:04] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 7 ms to minimize.
[2024-06-01 15:17:05] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 559/1968 variables, and 44 constraints, problems are : Problem set: 34 solved, 1391 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 19/27 constraints, State Equation: 0/563 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1425/1425 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 34 solved, 1391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 11/11 constraints. Problems are: Problem set: 34 solved, 1391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 10/21 constraints. Problems are: Problem set: 34 solved, 1391 unsolved
Problem TDEAD147 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD1077 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 9/30 constraints. Problems are: Problem set: 40 solved, 1385 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/30 constraints. Problems are: Problem set: 40 solved, 1385 unsolved
Problem TDEAD16 is UNSAT
Problem TDEAD41 is UNSAT
At refinement iteration 4 (OVERLAPS) 29/554 variables, 6/36 constraints. Problems are: Problem set: 42 solved, 1383 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 3/39 constraints. Problems are: Problem set: 42 solved, 1383 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 554/1968 variables, and 39 constraints, problems are : Problem set: 42 solved, 1383 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 13/27 constraints, State Equation: 0/563 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1425 constraints, Known Traps: 9/9 constraints]
After SMT, in 44171ms problems are : Problem set: 42 solved, 1383 unsolved
Search for dead transitions found 42 dead transitions in 44194ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 42 transitions.
[2024-06-01 15:17:25] [INFO ] Redundant transitions in 62 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 563/596 places, 1387/1462 transitions.
Graph (complete) has 3089 edges and 563 vertex of which 521 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.4 ms
Discarding 42 places :
Also discarding 0 output transitions
Deduced a syphon composed of 72 places in 1 ms
Applied a total of 1 rules in 59 ms. Remains 521 /563 variables (removed 42) and now considering 1387/1387 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 521/596 places, 1387/1462 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 44545 ms. Remains : 521/596 places, 1387/1462 transitions.
Support contains 38 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1462/1462 transitions.
Applied a total of 0 rules in 9 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Running 1458 sub problems to find dead transitions.
[2024-06-01 15:17:25] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
// Phase 1: matrix 1438 rows 596 cols
[2024-06-01 15:17:25] [INFO ] Computed 44 invariants in 18 ms
[2024-06-01 15:17:25] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-06-01 15:17:39] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:17:39] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 1 ms to minimize.
[2024-06-01 15:17:41] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2034 variables, and 35 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 15/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1458/1458 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-06-01 15:18:00] [INFO ] Deduced a trap composed of 82 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:18:00] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 3 ms to minimize.
[2024-06-01 15:18:00] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 1)
(s3 1)
(s4 0)
(s5 9)
(s6 1)
(s7 1)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 1)
(s13 0)
(s14 0)
(s15 1)
(s16 1)
(s17 1)
(s18 0)
(s19 1)
(s20 0)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 0)
(s34 1)
(s35 0)
(s36 1)
(s37 0)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 0)
(s47 1)
(s48 1)
(s49 0)
(s50 0)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 0)
(s66 1)
(s67 1)
(s68 0)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 0)
(s74 1)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 1)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 1)
(s94 0)
(s95 1)
(s96 0)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 0)
(s104 0)
(s105 1)
(s106 0)
(s107 1)
(s108 0)
(s109 1)
(s110 1)
(s111 0)
(s112 0)
(s113 1)
(s114 1)
(s115 0)
(s116 0)
(s117 1)
(s118 1)
(s119 1)
(s120 0)
(s121 1)
(s122 0)
(s123 1)
(s124 0)
(s125 0)
(s126 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2034 variables, and 38 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 15/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1458 constraints, Known Traps: 6/6 constraints]
After SMT, in 43319ms problems are : Problem set: 0 solved, 1458 unsolved
Search for dead transitions found 0 dead transitions in 43329ms
[2024-06-01 15:18:09] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-06-01 15:18:09] [INFO ] Invariant cache hit.
[2024-06-01 15:18:09] [INFO ] Implicit Places using invariants in 602 ms returned []
[2024-06-01 15:18:09] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-06-01 15:18:09] [INFO ] Invariant cache hit.
[2024-06-01 15:18:10] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:18:24] [INFO ] Implicit Places using invariants and state equation in 14590 ms returned []
Implicit Place search using SMT with State Equation took 15207 ms to find 0 implicit places.
Running 1458 sub problems to find dead transitions.
[2024-06-01 15:18:24] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-06-01 15:18:24] [INFO ] Invariant cache hit.
[2024-06-01 15:18:24] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-06-01 15:18:37] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-06-01 15:18:37] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2024-06-01 15:18:39] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2034 variables, and 35 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 15/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1458/1458 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-06-01 15:19:00] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 2 ms to minimize.
[2024-06-01 15:19:00] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:19:00] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:19:00] [INFO ] Deduced a trap composed of 82 places in 65 ms of which 1 ms to minimize.
[2024-06-01 15:19:00] [INFO ] Deduced a trap composed of 82 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:19:00] [INFO ] Deduced a trap composed of 82 places in 52 ms of which 0 ms to minimize.
[2024-06-01 15:19:00] [INFO ] Deduced a trap composed of 82 places in 53 ms of which 0 ms to minimize.
[2024-06-01 15:19:11] [INFO ] Deduced a trap composed of 82 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2034 variables, and 43 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 15/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1458 constraints, Known Traps: 11/11 constraints]
After SMT, in 63485ms problems are : Problem set: 0 solved, 1458 unsolved
Search for dead transitions found 0 dead transitions in 63509ms
Finished structural reductions in LTL mode , in 1 iterations and 122065 ms. Remains : 596/596 places, 1462/1462 transitions.
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-05 finished in 419066 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' '!(((!p0&&X(!p1)) U (G((!p0&&X(!p1)))||(X(!p1)&&p2))))'
Support contains 90 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 1554/1554 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 597 transition count 1553
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 597 transition count 1553
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 596 transition count 1552
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 596 transition count 1552
Applied a total of 4 rules in 46 ms. Remains 596 /598 variables (removed 2) and now considering 1552/1554 (removed 2) transitions.
Running 1548 sub problems to find dead transitions.
[2024-06-01 15:19:28] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-06-01 15:19:28] [INFO ] Computed 44 invariants in 33 ms
[2024-06-01 15:19:28] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 15:19:44] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 30 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 12/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Problem TDEAD220 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1543 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/31 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 6/37 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
[2024-06-01 15:20:08] [INFO ] Deduced a trap composed of 98 places in 105 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 10)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 0)
(s11 3)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 0)
(s30 1)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 0)
(s54 0)
(s55 1)
(s56 0)
(s57 4)
(s58 0)
(s59 0)
(s60 1)
(s61 1)
(s62 1)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 2)
(s70 1)
(s71 1)
(s72 1)
(s73 0)
(s74 0)
(s75 1)
(s76 0)
(s77 0)
(s78 2)
(s79 1)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 1)
(s89 2)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 3)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 1)
(s111 1)
(s112 0)
(s113 0)
(s114 1)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 1)
(s120 1)
(s121 0)
(s122 0)
(s123 0)
(s124 1)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 1)
(s131 0)
(s132 0)
(s133 0)
(s134 1)
(s135 1)
(s136 0)
(s137 1)
(s138 0)
(s139 1)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 1)
(s145 1)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 1)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 1)
(s168 0)
(s169 0)
(s170 0)
(s171 1)
(s172 0)
(s173 4)
(s174 0)
(s175 0)
(s176 1)
(s177 0)
(s178 0)
(s179 1)
(s180 0)
(s181 2)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 1)
(s187 0)
(s188 1)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 1)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 1)
(s199 1)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 1)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 3)
(s212 0)
(s213 0)
(s214 9)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 1)
(s223 1)
(s224 0)
(s225 0)
(s226 1)
(s227 1)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 1)
(s233 1)
(s234 1)
(s235 0)
(s236 0)
(s237 0)
(s238 1)
(s239 0)
(s240 0)
(s241 4)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 1)
(s248 0)
(s249 0)
(s250 0)
(s251 2)
(s252 1)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 1)
(s262 0)
(s263 0)
(s264 0)
(s265 1)
(s266 1)
(s267 0)
(s268 1)
(s269 0)
(s270 0)
(s271 1)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 2)
(s278 0)
(s279 0)
(s280 0)
(s281 1)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 1)
(s288 0)
(s289 0)
(s290 0)
(s291 2)
(s292 0)
(s293 1)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 1)
(s300 2)
(s301 0)
(s302 0)
(s303 1)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 1)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 1)
(s317 0)
(s318 0)
(s319 1)
(s320 0)
(s321 0)
(s322 1)
(s323 1)
(s324 1)
(s325 0)
(s326 1)
(s327 0)
(s328 1)
(s329 1)
(s330 0)
(s331 0)
(s332 0)
(s333 1)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 1)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 3)
(s349 0)
(s350 0)
(s351 0)
(s352 2)
(s353 0)
(s354 0)
(s355 4)
(s356 1)
(s357 1)
(s358 4)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 1)
(s365 0)
(s366 1)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 1)
(s372 0)
(s373 1)
(s374 0)
(s375 1)
(s376 0)
(s377 1)
(s378 0)
(s379 1)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 1)
(s385 0)
(s386 0)
(s387 1)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 1)
(s393 1)
(s394 0)
(s395 0)
(s396 1)
(s397 1)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 8)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 4)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 1)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/2124 variables, and 38 constraints, problems are : Problem set: 90 solved, 1458 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 2/2 constraints]
After SMT, in 44603ms problems are : Problem set: 90 solved, 1458 unsolved
Search for dead transitions found 90 dead transitions in 44614ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 90 transitions.
[2024-06-01 15:20:12] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
// Phase 1: matrix 1438 rows 596 cols
[2024-06-01 15:20:12] [INFO ] Computed 44 invariants in 21 ms
[2024-06-01 15:20:13] [INFO ] Implicit Places using invariants in 477 ms returned []
[2024-06-01 15:20:13] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-06-01 15:20:13] [INFO ] Invariant cache hit.
[2024-06-01 15:20:14] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:20:26] [INFO ] Implicit Places using invariants and state equation in 12820 ms returned []
Implicit Place search using SMT with State Equation took 13310 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 596/598 places, 1462/1554 transitions.
Applied a total of 0 rules in 8 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57991 ms. Remains : 596/598 places, 1462/1554 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR p1 (AND p0 (NOT p2))), true, p1]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 1398 ms.
Product exploration explored 100000 steps with 50000 reset in 1266 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (OR p2 (NOT p0))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (OR p2 (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 17 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-06 finished in 60880 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(p0)||X(F((p1&&G(F(p2)))))))'
Support contains 8 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 1554/1554 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 597 transition count 1553
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 597 transition count 1553
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 596 transition count 1552
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 596 transition count 1552
Applied a total of 4 rules in 26 ms. Remains 596 /598 variables (removed 2) and now considering 1552/1554 (removed 2) transitions.
Running 1548 sub problems to find dead transitions.
[2024-06-01 15:20:29] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-06-01 15:20:29] [INFO ] Computed 44 invariants in 23 ms
[2024-06-01 15:20:29] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 15:20:44] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 30 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 12/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Problem TDEAD220 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1543 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/31 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 6/37 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
[2024-06-01 15:21:08] [INFO ] Deduced a trap composed of 98 places in 123 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/2124 variables, and 38 constraints, problems are : Problem set: 90 solved, 1458 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 2/2 constraints]
After SMT, in 44534ms problems are : Problem set: 90 solved, 1458 unsolved
Search for dead transitions found 90 dead transitions in 44546ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 90 transitions.
[2024-06-01 15:21:13] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
// Phase 1: matrix 1438 rows 596 cols
[2024-06-01 15:21:13] [INFO ] Computed 44 invariants in 30 ms
[2024-06-01 15:21:14] [INFO ] Implicit Places using invariants in 541 ms returned []
[2024-06-01 15:21:14] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-06-01 15:21:14] [INFO ] Invariant cache hit.
[2024-06-01 15:21:15] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:21:27] [INFO ] Implicit Places using invariants and state equation in 13759 ms returned []
Implicit Place search using SMT with State Equation took 14323 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 596/598 places, 1462/1554 transitions.
Applied a total of 0 rules in 7 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58906 ms. Remains : 596/598 places, 1462/1554 transitions.
Stuttering acceptance computed with spot in 247 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-08
Stuttering criterion allowed to conclude after 43728 steps with 62 reset in 176 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-08 finished in 59372 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' '!(F(G(p0)))'
Support contains 2 out of 598 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 598/598 places, 1554/1554 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 598 transition count 1512
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 85 place count 556 transition count 1511
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 86 place count 555 transition count 1511
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 86 place count 555 transition count 1439
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 230 place count 483 transition count 1439
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 350 place count 423 transition count 1379
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 353 place count 420 transition count 1376
Iterating global reduction 3 with 3 rules applied. Total rules applied 356 place count 420 transition count 1376
Applied a total of 356 rules in 211 ms. Remains 420 /598 variables (removed 178) and now considering 1376/1554 (removed 178) transitions.
Running 1372 sub problems to find dead transitions.
[2024-06-01 15:21:28] [INFO ] Flow matrix only has 1352 transitions (discarded 24 similar events)
// Phase 1: matrix 1352 rows 420 cols
[2024-06-01 15:21:28] [INFO ] Computed 44 invariants in 13 ms
[2024-06-01 15:21:28] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
[2024-06-01 15:21:39] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:21:40] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 1 ms to minimize.
[2024-06-01 15:21:41] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/1772 variables, and 38 constraints, problems are : Problem set: 0 solved, 1372 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 19/28 constraints, State Equation: 0/420 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1372/1372 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
[2024-06-01 15:21:54] [INFO ] Deduced a trap composed of 35 places in 166 ms of which 1 ms to minimize.
[2024-06-01 15:21:54] [INFO ] Deduced a trap composed of 27 places in 192 ms of which 1 ms to minimize.
[2024-06-01 15:21:54] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 1 ms to minimize.
[2024-06-01 15:21:54] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 1 ms to minimize.
[2024-06-01 15:21:58] [INFO ] Deduced a trap composed of 53 places in 42 ms of which 0 ms to minimize.
[2024-06-01 15:21:58] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 0 ms to minimize.
[2024-06-01 15:21:58] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:21:59] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/416 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
[2024-06-01 15:22:08] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 10)
(s6 0)
(s7 0)
(s8 0)
(s9 1)
(s10 0)
(s11 3)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 1)
(s24 0)
(s25 0)
(s26 1)
(s27 1)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 2)
(s40 4)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/1772 variables, and 47 constraints, problems are : Problem set: 0 solved, 1372 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 19/28 constraints, State Equation: 0/420 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1372 constraints, Known Traps: 12/12 constraints]
After SMT, in 44469ms problems are : Problem set: 0 solved, 1372 unsolved
Search for dead transitions found 0 dead transitions in 44494ms
[2024-06-01 15:22:13] [INFO ] Flow matrix only has 1352 transitions (discarded 24 similar events)
[2024-06-01 15:22:13] [INFO ] Invariant cache hit.
[2024-06-01 15:22:13] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-06-01 15:22:13] [INFO ] Flow matrix only has 1352 transitions (discarded 24 similar events)
[2024-06-01 15:22:13] [INFO ] Invariant cache hit.
[2024-06-01 15:22:14] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:22:22] [INFO ] Implicit Places using invariants and state equation in 9152 ms returned []
Implicit Place search using SMT with State Equation took 9605 ms to find 0 implicit places.
[2024-06-01 15:22:22] [INFO ] Redundant transitions in 78 ms returned []
Running 1372 sub problems to find dead transitions.
[2024-06-01 15:22:22] [INFO ] Flow matrix only has 1352 transitions (discarded 24 similar events)
[2024-06-01 15:22:22] [INFO ] Invariant cache hit.
[2024-06-01 15:22:22] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
[2024-06-01 15:22:34] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:22:35] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/416 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
SMT process timed out in 34231ms, After SMT, problems are : Problem set: 0 solved, 1372 unsolved
Search for dead transitions found 0 dead transitions in 34241ms
Starting structural reductions in SI_LTL mode, iteration 1 : 420/598 places, 1376/1554 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 88652 ms. Remains : 420/598 places, 1376/1554 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-09
Stuttering criterion allowed to conclude after 8595 steps with 0 reset in 34 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-09 finished in 88735 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' '!(F(G((p0||X((p1&&G(p2)))))))'
Support contains 7 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 1554/1554 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 597 transition count 1553
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 597 transition count 1553
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 596 transition count 1552
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 596 transition count 1552
Applied a total of 4 rules in 38 ms. Remains 596 /598 variables (removed 2) and now considering 1552/1554 (removed 2) transitions.
Running 1548 sub problems to find dead transitions.
[2024-06-01 15:22:57] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-06-01 15:22:57] [INFO ] Computed 44 invariants in 20 ms
[2024-06-01 15:22:57] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 15:23:12] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 30 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 12/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Problem TDEAD220 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1543 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/31 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 6/37 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
[2024-06-01 15:23:37] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/2124 variables, and 38 constraints, problems are : Problem set: 90 solved, 1458 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 2/2 constraints]
After SMT, in 44573ms problems are : Problem set: 90 solved, 1458 unsolved
Search for dead transitions found 90 dead transitions in 44584ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 90 transitions.
[2024-06-01 15:23:41] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
// Phase 1: matrix 1438 rows 596 cols
[2024-06-01 15:23:41] [INFO ] Computed 44 invariants in 19 ms
[2024-06-01 15:23:42] [INFO ] Implicit Places using invariants in 515 ms returned []
[2024-06-01 15:23:42] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-06-01 15:23:42] [INFO ] Invariant cache hit.
[2024-06-01 15:23:43] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:23:56] [INFO ] Implicit Places using invariants and state equation in 14147 ms returned []
Implicit Place search using SMT with State Equation took 14676 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 596/598 places, 1462/1554 transitions.
Applied a total of 0 rules in 17 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59319 ms. Remains : 596/598 places, 1462/1554 transitions.
Stuttering acceptance computed with spot in 95 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-11
Stuttering criterion allowed to conclude after 13492 steps with 0 reset in 65 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-11 finished in 59498 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||X(G(p1))))))'
Support contains 3 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 1554/1554 transitions.
Applied a total of 0 rules in 17 ms. Remains 598 /598 variables (removed 0) and now considering 1554/1554 (removed 0) transitions.
Running 1550 sub problems to find dead transitions.
[2024-06-01 15:23:56] [INFO ] Flow matrix only has 1530 transitions (discarded 24 similar events)
// Phase 1: matrix 1530 rows 598 cols
[2024-06-01 15:23:56] [INFO ] Computed 44 invariants in 29 ms
[2024-06-01 15:23:56] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 22/39 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
[2024-06-01 15:24:12] [INFO ] Deduced a trap composed of 124 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:24:12] [INFO ] Deduced a trap composed of 160 places in 169 ms of which 2 ms to minimize.
[2024-06-01 15:24:12] [INFO ] Deduced a trap composed of 135 places in 179 ms of which 2 ms to minimize.
[2024-06-01 15:24:12] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 1 ms to minimize.
[2024-06-01 15:24:13] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 2 ms to minimize.
[2024-06-01 15:24:14] [INFO ] Deduced a trap composed of 290 places in 306 ms of which 3 ms to minimize.
[2024-06-01 15:24:15] [INFO ] Deduced a trap composed of 286 places in 293 ms of which 3 ms to minimize.
[2024-06-01 15:24:15] [INFO ] Deduced a trap composed of 283 places in 271 ms of which 4 ms to minimize.
[2024-06-01 15:24:16] [INFO ] Deduced a trap composed of 295 places in 306 ms of which 4 ms to minimize.
(s247 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 9.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 2.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 2.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 9.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/2128 variables, and 48 constraints, problems are : Problem set: 0 solved, 1550 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 22/27 constraints, State Equation: 0/598 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1550/1550 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1550 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 22/39 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 9/48 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
[2024-06-01 15:24:32] [INFO ] Deduced a trap composed of 82 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:24:32] [INFO ] Deduced a trap composed of 84 places in 54 ms of which 1 ms to minimize.
[2024-06-01 15:24:32] [INFO ] Deduced a trap composed of 82 places in 61 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/2128 variables, and 51 constraints, problems are : Problem set: 0 solved, 1550 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 22/27 constraints, State Equation: 0/598 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1550 constraints, Known Traps: 12/12 constraints]
After SMT, in 44378ms problems are : Problem set: 0 solved, 1550 unsolved
Search for dead transitions found 0 dead transitions in 44396ms
[2024-06-01 15:24:41] [INFO ] Flow matrix only has 1530 transitions (discarded 24 similar events)
[2024-06-01 15:24:41] [INFO ] Invariant cache hit.
[2024-06-01 15:24:41] [INFO ] Implicit Places using invariants in 477 ms returned []
[2024-06-01 15:24:41] [INFO ] Flow matrix only has 1530 transitions (discarded 24 similar events)
[2024-06-01 15:24:41] [INFO ] Invariant cache hit.
[2024-06-01 15:24:43] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:24:53] [INFO ] Implicit Places using invariants and state equation in 12049 ms returned []
Implicit Place search using SMT with State Equation took 12540 ms to find 0 implicit places.
Running 1550 sub problems to find dead transitions.
[2024-06-01 15:24:53] [INFO ] Flow matrix only has 1530 transitions (discarded 24 similar events)
[2024-06-01 15:24:53] [INFO ] Invariant cache hit.
[2024-06-01 15:24:53] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 22/39 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
[2024-06-01 15:25:09] [INFO ] Deduced a trap composed of 124 places in 154 ms of which 2 ms to minimize.
[2024-06-01 15:25:09] [INFO ] Deduced a trap composed of 157 places in 200 ms of which 2 ms to minimize.
[2024-06-01 15:25:09] [INFO ] Deduced a trap composed of 135 places in 165 ms of which 2 ms to minimize.
[2024-06-01 15:25:09] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 1 ms to minimize.
[2024-06-01 15:25:11] [INFO ] Deduced a trap composed of 291 places in 229 ms of which 3 ms to minimize.
[2024-06-01 15:25:11] [INFO ] Deduced a trap composed of 284 places in 232 ms of which 3 ms to minimize.
[2024-06-01 15:25:12] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 2 ms to minimize.
[2024-06-01 15:25:12] [INFO ] Deduced a trap composed of 303 places in 214 ms of which 3 ms to minimize.
[2024-06-01 15:25:13] [INFO ] Deduced a trap composed of 300 places in 206 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 9/48 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/2128 variables, and 48 constraints, problems are : Problem set: 0 solved, 1550 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 22/27 constraints, State Equation: 0/598 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1550/1550 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1550 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 22/39 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 9/48 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
[2024-06-01 15:25:37] [INFO ] Deduced a trap composed of 84 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:25:37] [INFO ] Deduced a trap composed of 82 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:25:39] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 1 ms to minimize.
[2024-06-01 15:25:39] [INFO ] Deduced a trap composed of 82 places in 83 ms of which 1 ms to minimize.
[2024-06-01 15:25:46] [INFO ] Deduced a trap composed of 296 places in 359 ms of which 4 ms to minimize.
[2024-06-01 15:25:46] [INFO ] Deduced a trap composed of 290 places in 319 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/2128 variables, and 54 constraints, problems are : Problem set: 0 solved, 1550 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 22/27 constraints, State Equation: 0/598 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1550 constraints, Known Traps: 15/15 constraints]
After SMT, in 64592ms problems are : Problem set: 0 solved, 1550 unsolved
Search for dead transitions found 0 dead transitions in 64605ms
Finished structural reductions in LTL mode , in 1 iterations and 121567 ms. Remains : 598/598 places, 1554/1554 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-13
Entered a terminal (fully accepting) state of product in 872 steps with 0 reset in 5 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-13 finished in 121691 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(F(p0)))'
Support contains 1 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 1554/1554 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 597 transition count 1553
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 597 transition count 1553
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 596 transition count 1552
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 596 transition count 1552
Applied a total of 4 rules in 22 ms. Remains 596 /598 variables (removed 2) and now considering 1552/1554 (removed 2) transitions.
Running 1548 sub problems to find dead transitions.
[2024-06-01 15:25:58] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-06-01 15:25:58] [INFO ] Computed 44 invariants in 19 ms
[2024-06-01 15:25:58] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 15:26:15] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 30 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 12/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Problem TDEAD220 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1543 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/31 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 6/37 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
[2024-06-01 15:26:39] [INFO ] Deduced a trap composed of 98 places in 164 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/2124 variables, and 38 constraints, problems are : Problem set: 90 solved, 1458 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 2/2 constraints]
After SMT, in 44831ms problems are : Problem set: 90 solved, 1458 unsolved
Search for dead transitions found 90 dead transitions in 44842ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 90 transitions.
[2024-06-01 15:26:43] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
// Phase 1: matrix 1438 rows 596 cols
[2024-06-01 15:26:43] [INFO ] Computed 44 invariants in 18 ms
[2024-06-01 15:26:43] [INFO ] Implicit Places using invariants in 487 ms returned []
[2024-06-01 15:26:43] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-06-01 15:26:43] [INFO ] Invariant cache hit.
[2024-06-01 15:26:44] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:26:59] [INFO ] Implicit Places using invariants and state equation in 15894 ms returned []
Implicit Place search using SMT with State Equation took 16384 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 596/598 places, 1462/1554 transitions.
Applied a total of 0 rules in 9 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61260 ms. Remains : 596/598 places, 1462/1554 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-15
Stuttering criterion allowed to conclude after 31031 steps with 126 reset in 135 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-15 finished in 61520 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((X((F(p0) U X(p1)))&&F(p2))))'
Found a Lengthening insensitive property : PolyORBLF-PT-S04J06T06-LTLFireability-05
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 38 out of 598 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 598/598 places, 1554/1554 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 598 transition count 1510
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 554 transition count 1510
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 88 place count 554 transition count 1462
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 184 place count 506 transition count 1462
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 292 place count 452 transition count 1408
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 295 place count 449 transition count 1405
Iterating global reduction 2 with 3 rules applied. Total rules applied 298 place count 449 transition count 1405
Applied a total of 298 rules in 97 ms. Remains 449 /598 variables (removed 149) and now considering 1405/1554 (removed 149) transitions.
Running 1401 sub problems to find dead transitions.
[2024-06-01 15:27:00] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
// Phase 1: matrix 1381 rows 449 cols
[2024-06-01 15:27:00] [INFO ] Computed 44 invariants in 20 ms
[2024-06-01 15:27:00] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-06-01 15:27:13] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 1 ms to minimize.
[2024-06-01 15:27:13] [INFO ] Deduced a trap composed of 26 places in 208 ms of which 2 ms to minimize.
[2024-06-01 15:27:14] [INFO ] Deduced a trap composed of 55 places in 225 ms of which 2 ms to minimize.
[2024-06-01 15:27:15] [INFO ] Deduced a trap composed of 58 places in 123 ms of which 1 ms to minimize.
[2024-06-01 15:27:22] [INFO ] Deduced a trap composed of 45 places in 130 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/1830 variables, and 44 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-06-01 15:27:28] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 1 ms to minimize.
[2024-06-01 15:27:28] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 2 ms to minimize.
[2024-06-01 15:27:28] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 0 ms to minimize.
[2024-06-01 15:27:28] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:27:32] [INFO ] Deduced a trap composed of 58 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:27:42] [INFO ] Deduced a trap composed of 156 places in 167 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/445 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/1830 variables, and 50 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 20049 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 11/11 constraints]
After SMT, in 45014ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 45027ms
[2024-06-01 15:27:45] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-06-01 15:27:45] [INFO ] Invariant cache hit.
[2024-06-01 15:27:45] [INFO ] Implicit Places using invariants in 603 ms returned []
[2024-06-01 15:27:45] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-06-01 15:27:45] [INFO ] Invariant cache hit.
[2024-06-01 15:27:46] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:27:54] [INFO ] Implicit Places using invariants and state equation in 8961 ms returned []
Implicit Place search using SMT with State Equation took 9567 ms to find 0 implicit places.
Running 1401 sub problems to find dead transitions.
[2024-06-01 15:27:54] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-06-01 15:27:54] [INFO ] Invariant cache hit.
[2024-06-01 15:27:54] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-06-01 15:28:08] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 1 ms to minimize.
[2024-06-01 15:28:09] [INFO ] Deduced a trap composed of 26 places in 259 ms of which 2 ms to minimize.
[2024-06-01 15:28:09] [INFO ] Deduced a trap composed of 55 places in 213 ms of which 2 ms to minimize.
[2024-06-01 15:28:10] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 1 ms to minimize.
[2024-06-01 15:28:21] [INFO ] Deduced a trap composed of 160 places in 248 ms of which 2 ms to minimize.
[2024-06-01 15:28:21] [INFO ] Deduced a trap composed of 168 places in 294 ms of which 2 ms to minimize.
[2024-06-01 15:28:21] [INFO ] Deduced a trap composed of 156 places in 209 ms of which 2 ms to minimize.
[2024-06-01 15:28:22] [INFO ] Deduced a trap composed of 131 places in 209 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/1830 variables, and 47 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-06-01 15:28:37] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 1 ms to minimize.
[2024-06-01 15:28:37] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 1 ms to minimize.
[2024-06-01 15:28:37] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:28:37] [INFO ] Deduced a trap composed of 57 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:28:41] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/445 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-06-01 15:28:55] [INFO ] Deduced a trap composed of 57 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:28:58] [INFO ] Deduced a trap composed of 164 places in 229 ms of which 3 ms to minimize.
[2024-06-01 15:28:58] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 2 ms to minimize.
[2024-06-01 15:28:58] [INFO ] Deduced a trap composed of 162 places in 202 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/1830 variables, and 56 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 17/17 constraints]
After SMT, in 65875ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 65892ms
Starting structural reductions in LI_LTL mode, iteration 1 : 449/598 places, 1405/1554 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 120591 ms. Remains : 449/598 places, 1405/1554 transitions.
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-05
Product exploration explored 100000 steps with 3295 reset in 552 ms.
Product exploration explored 100000 steps with 3334 reset in 574 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 101 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 156 steps (0 resets) in 6 ms. (22 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 7 factoid took 181 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-06-01 15:29:02] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-06-01 15:29:02] [INFO ] Invariant cache hit.
[2024-06-01 15:29:03] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-06-01 15:29:03] [INFO ] [Real]Absence check using 19 positive and 25 generalized place invariants in 60 ms returned sat
[2024-06-01 15:29:04] [INFO ] [Real]Absence check using state equation in 1491 ms returned sat
[2024-06-01 15:29:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:29:05] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-06-01 15:29:05] [INFO ] [Nat]Absence check using 19 positive and 25 generalized place invariants in 161 ms returned sat
[2024-06-01 15:29:09] [INFO ] [Nat]Absence check using state equation in 3898 ms returned sat
[2024-06-01 15:29:09] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:29:10] [INFO ] [Nat]Added 120 Read/Feed constraints in 1291 ms returned sat
[2024-06-01 15:29:11] [INFO ] Computed and/alt/rep : 945/4246/927 causal constraints (skipped 450 transitions) in 95 ms.
[2024-06-01 15:29:13] [INFO ] Added : 5 causal constraints over 1 iterations in 2423 ms. Result :sat
Could not prove EG (NOT p2)
[2024-06-01 15:29:13] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-06-01 15:29:13] [INFO ] Invariant cache hit.
[2024-06-01 15:29:14] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-06-01 15:29:14] [INFO ] [Real]Absence check using 19 positive and 25 generalized place invariants in 64 ms returned sat
[2024-06-01 15:29:15] [INFO ] [Real]Absence check using state equation in 1448 ms returned sat
[2024-06-01 15:29:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:29:16] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-06-01 15:29:16] [INFO ] [Nat]Absence check using 19 positive and 25 generalized place invariants in 43 ms returned sat
[2024-06-01 15:29:17] [INFO ] [Nat]Absence check using state equation in 1448 ms returned sat
[2024-06-01 15:29:17] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:29:18] [INFO ] [Nat]Added 120 Read/Feed constraints in 600 ms returned sat
[2024-06-01 15:29:18] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:29:19] [INFO ] Deduced a trap composed of 27 places in 278 ms of which 2 ms to minimize.
[2024-06-01 15:29:19] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 1 ms to minimize.
[2024-06-01 15:29:19] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:29:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1649 ms
[2024-06-01 15:29:19] [INFO ] Computed and/alt/rep : 945/4246/927 causal constraints (skipped 450 transitions) in 76 ms.
[2024-06-01 15:29:26] [INFO ] Added : 282 causal constraints over 57 iterations in 6407 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 38 out of 449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 1405/1405 transitions.
Applied a total of 0 rules in 12 ms. Remains 449 /449 variables (removed 0) and now considering 1405/1405 (removed 0) transitions.
Running 1401 sub problems to find dead transitions.
[2024-06-01 15:29:26] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-06-01 15:29:26] [INFO ] Invariant cache hit.
[2024-06-01 15:29:26] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-06-01 15:29:39] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2024-06-01 15:29:39] [INFO ] Deduced a trap composed of 26 places in 258 ms of which 3 ms to minimize.
[2024-06-01 15:29:40] [INFO ] Deduced a trap composed of 55 places in 208 ms of which 3 ms to minimize.
[2024-06-01 15:29:41] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 9.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 2.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 1.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 2.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 6.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 2.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 2.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 2.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 3.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 8.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/1830 variables, and 43 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-06-01 15:29:57] [INFO ] Deduced a trap composed of 168 places in 169 ms of which 3 ms to minimize.
[2024-06-01 15:29:57] [INFO ] Deduced a trap composed of 59 places in 83 ms of which 1 ms to minimize.
[2024-06-01 15:29:57] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:29:57] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 0 ms to minimize.
[2024-06-01 15:29:57] [INFO ] Deduced a trap composed of 58 places in 51 ms of which 1 ms to minimize.
[2024-06-01 15:29:59] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:29:59] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 1 ms to minimize.
[2024-06-01 15:30:09] [INFO ] Deduced a trap composed of 156 places in 197 ms of which 2 ms to minimize.
[2024-06-01 15:30:09] [INFO ] Deduced a trap composed of 142 places in 183 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/445 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/1830 variables, and 52 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 13/13 constraints]
After SMT, in 44723ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 44739ms
[2024-06-01 15:30:11] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-06-01 15:30:11] [INFO ] Invariant cache hit.
[2024-06-01 15:30:11] [INFO ] Implicit Places using invariants in 412 ms returned []
[2024-06-01 15:30:11] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-06-01 15:30:11] [INFO ] Invariant cache hit.
[2024-06-01 15:30:12] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:30:20] [INFO ] Implicit Places using invariants and state equation in 8759 ms returned []
Implicit Place search using SMT with State Equation took 9201 ms to find 0 implicit places.
Running 1401 sub problems to find dead transitions.
[2024-06-01 15:30:20] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-06-01 15:30:20] [INFO ] Invariant cache hit.
[2024-06-01 15:30:20] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-06-01 15:30:33] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 1 ms to minimize.
[2024-06-01 15:30:33] [INFO ] Deduced a trap composed of 26 places in 198 ms of which 2 ms to minimize.
[2024-06-01 15:30:34] [INFO ] Deduced a trap composed of 55 places in 169 ms of which 2 ms to minimize.
[2024-06-01 15:30:35] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 1 ms to minimize.
[2024-06-01 15:30:46] [INFO ] Deduced a trap composed of 160 places in 288 ms of which 4 ms to minimize.
[2024-06-01 15:30:47] [INFO ] Deduced a trap composed of 168 places in 210 ms of which 2 ms to minimize.
[2024-06-01 15:30:47] [INFO ] Deduced a trap composed of 156 places in 194 ms of which 2 ms to minimize.
[2024-06-01 15:30:47] [INFO ] Deduced a trap composed of 131 places in 197 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
(s116 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 9.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 2.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/1830 variables, and 47 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-06-01 15:31:01] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 2 ms to minimize.
[2024-06-01 15:31:01] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 1 ms to minimize.
[2024-06-01 15:31:01] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 0 ms to minimize.
[2024-06-01 15:31:02] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 1 ms to minimize.
[2024-06-01 15:31:07] [INFO ] Deduced a trap composed of 57 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/445 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-06-01 15:31:19] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 1 ms to minimize.
[2024-06-01 15:31:22] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 2 ms to minimize.
[2024-06-01 15:31:22] [INFO ] Deduced a trap composed of 164 places in 193 ms of which 2 ms to minimize.
[2024-06-01 15:31:22] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/1830 variables, and 56 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 17/17 constraints]
After SMT, in 64778ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 64796ms
Finished structural reductions in LTL mode , in 1 iterations and 118760 ms. Remains : 449/449 places, 1405/1405 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 114 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 194 steps (0 resets) in 8 ms. (21 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 7 factoid took 181 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-06-01 15:31:25] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-06-01 15:31:25] [INFO ] Invariant cache hit.
[2024-06-01 15:31:26] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-06-01 15:31:26] [INFO ] [Real]Absence check using 19 positive and 25 generalized place invariants in 59 ms returned sat
[2024-06-01 15:31:27] [INFO ] [Real]Absence check using state equation in 1289 ms returned sat
[2024-06-01 15:31:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:31:28] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-06-01 15:31:28] [INFO ] [Nat]Absence check using 19 positive and 25 generalized place invariants in 145 ms returned sat
[2024-06-01 15:31:32] [INFO ] [Nat]Absence check using state equation in 4162 ms returned sat
[2024-06-01 15:31:32] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:31:33] [INFO ] [Nat]Added 120 Read/Feed constraints in 336 ms returned sat
[2024-06-01 15:31:33] [INFO ] Computed and/alt/rep : 945/4246/927 causal constraints (skipped 450 transitions) in 107 ms.
[2024-06-01 15:31:39] [INFO ] Added : 190 causal constraints over 38 iterations in 6163 ms. Result :sat
Could not prove EG (NOT p2)
[2024-06-01 15:31:39] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-06-01 15:31:39] [INFO ] Invariant cache hit.
[2024-06-01 15:31:40] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-06-01 15:31:40] [INFO ] [Real]Absence check using 19 positive and 25 generalized place invariants in 82 ms returned sat
[2024-06-01 15:31:41] [INFO ] [Real]Absence check using state equation in 1552 ms returned sat
[2024-06-01 15:31:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:31:42] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-06-01 15:31:42] [INFO ] [Nat]Absence check using 19 positive and 25 generalized place invariants in 40 ms returned sat
[2024-06-01 15:31:43] [INFO ] [Nat]Absence check using state equation in 1452 ms returned sat
[2024-06-01 15:31:43] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:31:44] [INFO ] [Nat]Added 120 Read/Feed constraints in 588 ms returned sat
[2024-06-01 15:31:44] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:31:45] [INFO ] Deduced a trap composed of 27 places in 273 ms of which 2 ms to minimize.
[2024-06-01 15:31:45] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:31:45] [INFO ] Deduced a trap composed of 58 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:31:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1480 ms
[2024-06-01 15:31:45] [INFO ] Computed and/alt/rep : 945/4246/927 causal constraints (skipped 450 transitions) in 102 ms.
[2024-06-01 15:31:53] [INFO ] Added : 282 causal constraints over 57 iterations in 7452 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 3334 reset in 732 ms.
Product exploration explored 100000 steps with 3285 reset in 628 ms.
Applying partial POR strategy [false, false, true, false, true, true]
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 38 out of 449 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 449/449 places, 1405/1405 transitions.
Applied a total of 0 rules in 49 ms. Remains 449 /449 variables (removed 0) and now considering 1405/1405 (removed 0) transitions.
Running 1401 sub problems to find dead transitions.
[2024-06-01 15:31:55] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-06-01 15:31:55] [INFO ] Invariant cache hit.
[2024-06-01 15:31:55] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-06-01 15:32:08] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2024-06-01 15:32:09] [INFO ] Deduced a trap composed of 26 places in 171 ms of which 2 ms to minimize.
[2024-06-01 15:32:09] [INFO ] Deduced a trap composed of 55 places in 189 ms of which 2 ms to minimize.
[2024-06-01 15:32:10] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 1 ms to minimize.
[2024-06-01 15:32:20] [INFO ] Deduced a trap composed of 160 places in 171 ms of which 2 ms to minimize.
SMT process timed out in 25355ms, After SMT, problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 25369ms
[2024-06-01 15:32:20] [INFO ] Redundant transitions in 24 ms returned []
Running 1401 sub problems to find dead transitions.
[2024-06-01 15:32:20] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-06-01 15:32:20] [INFO ] Invariant cache hit.
[2024-06-01 15:32:20] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-06-01 15:32:34] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 1 ms to minimize.
[2024-06-01 15:32:34] [INFO ] Deduced a trap composed of 26 places in 209 ms of which 2 ms to minimize.
[2024-06-01 15:32:35] [INFO ] Deduced a trap composed of 55 places in 202 ms of which 2 ms to minimize.
[2024-06-01 15:32:36] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 1 ms to minimize.
[2024-06-01 15:32:46] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 2 ms to minimize.
[2024-06-01 15:32:46] [INFO ] Deduced a trap composed of 168 places in 195 ms of which 2 ms to minimize.
[2024-06-01 15:32:46] [INFO ] Deduced a trap composed of 156 places in 190 ms of which 2 ms to minimize.
[2024-06-01 15:32:47] [INFO ] Deduced a trap composed of 131 places in 177 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/1830 variables, and 47 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-06-01 15:33:01] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 1 ms to minimize.
[2024-06-01 15:33:02] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 1 ms to minimize.
[2024-06-01 15:33:02] [INFO ] Deduced a trap composed of 58 places in 34 ms of which 1 ms to minimize.
[2024-06-01 15:33:02] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:33:05] [INFO ] Deduced a trap composed of 57 places in 42 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/445 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-06-01 15:33:18] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 1 ms to minimize.
[2024-06-01 15:33:20] [INFO ] Deduced a trap composed of 164 places in 180 ms of which 2 ms to minimize.
[2024-06-01 15:33:20] [INFO ] Deduced a trap composed of 164 places in 180 ms of which 2 ms to minimize.
[2024-06-01 15:33:20] [INFO ] Deduced a trap composed of 162 places in 187 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/1830 variables, and 56 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 17/17 constraints]
After SMT, in 64685ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 64696ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 90149 ms. Remains : 449/449 places, 1405/1405 transitions.
Support contains 38 out of 449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 1405/1405 transitions.
Applied a total of 0 rules in 6 ms. Remains 449 /449 variables (removed 0) and now considering 1405/1405 (removed 0) transitions.
Running 1401 sub problems to find dead transitions.
[2024-06-01 15:33:25] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-06-01 15:33:25] [INFO ] Invariant cache hit.
[2024-06-01 15:33:25] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-06-01 15:33:38] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-06-01 15:33:38] [INFO ] Deduced a trap composed of 26 places in 247 ms of which 2 ms to minimize.
[2024-06-01 15:33:39] [INFO ] Deduced a trap composed of 55 places in 175 ms of which 2 ms to minimize.
[2024-06-01 15:33:40] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 1 ms to minimize.
[2024-06-01 15:33:49] [INFO ] Deduced a trap composed of 160 places in 164 ms of which 2 ms to minimize.
[2024-06-01 15:33:49] [INFO ] Deduced a trap composed of 168 places in 183 ms of which 2 ms to minimize.
[2024-06-01 15:33:49] [INFO ] Deduced a trap composed of 156 places in 236 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/1830 variables, and 46 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 7/46 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-06-01 15:33:53] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 2 ms to minimize.
[2024-06-01 15:33:53] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 1 ms to minimize.
[2024-06-01 15:33:53] [INFO ] Deduced a trap composed of 58 places in 50 ms of which 0 ms to minimize.
[2024-06-01 15:33:57] [INFO ] Deduced a trap composed of 57 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/445 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/1830 variables, and 50 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 11/11 constraints]
After SMT, in 44564ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 44574ms
[2024-06-01 15:34:10] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-06-01 15:34:10] [INFO ] Invariant cache hit.
[2024-06-01 15:34:10] [INFO ] Implicit Places using invariants in 522 ms returned []
[2024-06-01 15:34:10] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-06-01 15:34:10] [INFO ] Invariant cache hit.
[2024-06-01 15:34:11] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:34:19] [INFO ] Implicit Places using invariants and state equation in 8543 ms returned []
Implicit Place search using SMT with State Equation took 9088 ms to find 0 implicit places.
Running 1401 sub problems to find dead transitions.
[2024-06-01 15:34:19] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-06-01 15:34:19] [INFO ] Invariant cache hit.
[2024-06-01 15:34:19] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-06-01 15:34:31] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 0 ms to minimize.
[2024-06-01 15:34:32] [INFO ] Deduced a trap composed of 26 places in 166 ms of which 2 ms to minimize.
[2024-06-01 15:34:32] [INFO ] Deduced a trap composed of 55 places in 170 ms of which 2 ms to minimize.
[2024-06-01 15:34:33] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 1 ms to minimize.
[2024-06-01 15:34:43] [INFO ] Deduced a trap composed of 160 places in 189 ms of which 2 ms to minimize.
[2024-06-01 15:34:43] [INFO ] Deduced a trap composed of 168 places in 179 ms of which 2 ms to minimize.
[2024-06-01 15:34:43] [INFO ] Deduced a trap composed of 156 places in 180 ms of which 2 ms to minimize.
[2024-06-01 15:34:44] [INFO ] Deduced a trap composed of 131 places in 173 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/1830 variables, and 47 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-06-01 15:35:00] [INFO ] Deduced a trap composed of 58 places in 122 ms of which 3 ms to minimize.
[2024-06-01 15:35:00] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 1 ms to minimize.
[2024-06-01 15:35:00] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 1 ms to minimize.
[2024-06-01 15:35:00] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 2 ms to minimize.
[2024-06-01 15:35:04] [INFO ] Deduced a trap composed of 57 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/445 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-06-01 15:35:16] [INFO ] Deduced a trap composed of 57 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:35:19] [INFO ] Deduced a trap composed of 164 places in 196 ms of which 2 ms to minimize.
[2024-06-01 15:35:19] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 3 ms to minimize.
[2024-06-01 15:35:19] [INFO ] Deduced a trap composed of 162 places in 243 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/1830 variables, and 56 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 17/17 constraints]
After SMT, in 64719ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 64729ms
Finished structural reductions in LTL mode , in 1 iterations and 118402 ms. Remains : 449/449 places, 1405/1405 transitions.
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-05 finished in 504151 ms.
[2024-06-01 15:35:24] [INFO ] Flatten gal took : 76 ms
[2024-06-01 15:35:24] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-01 15:35:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 598 places, 1554 transitions and 7752 arcs took 11 ms.
Total runtime 1549003 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : PolyORBLF-PT-S04J06T06-LTLFireability-05

BK_STOP 1717256124800

--------------------
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
mcc2024
ltl formula name PolyORBLF-PT-S04J06T06-LTLFireability-05
ltl formula formula --ltl=/tmp/2381/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 598 places, 1554 transitions and 7752 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.300 real 0.060 user 0.110 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2381/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2381/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2381/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2381/ltl_0_
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
malloc_consolidate(): unaligned fastbin chunk detected
malloc_consolidate(): unaligned fastbin chunk detected

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-S04J06T06"
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 PolyORBLF-PT-S04J06T06, 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 r516-tajo-171654446800292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S04J06T06.tgz
mv PolyORBLF-PT-S04J06T06 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 ;