Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446800299.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 itstools
Input is PolyORBLF-PT-S04J06T08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446800299
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.5M
-rw-r--r-- 1 mcc users 22K Apr 11 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 11 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 127K Apr 11 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 570K Apr 11 16:50 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 13K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 41K Apr 11 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 205K Apr 11 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 138K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 670K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.4K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.5M 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-S04J06T08-LTLCardinality-00
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLCardinality-01
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLCardinality-02
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLCardinality-03
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLCardinality-04
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLCardinality-05
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLCardinality-06
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLCardinality-07
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLCardinality-08
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLCardinality-09
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLCardinality-10
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLCardinality-11
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLCardinality-12
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLCardinality-13
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLCardinality-14
FORMULA_NAME PolyORBLF-PT-S04J06T08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716918706829

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J06T08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-28 17:51:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 17:51:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 17:51:48] [INFO ] Load time of PNML (sax parser for PT used): 297 ms
[2024-05-28 17:51:48] [INFO ] Transformed 792 places.
[2024-05-28 17:51:48] [INFO ] Transformed 4268 transitions.
[2024-05-28 17:51:48] [INFO ] Parsed PT model containing 792 places and 4268 transitions and 28832 arcs in 504 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 350 out of 792 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 788 transition count 2100
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 11 place count 781 transition count 2093
Iterating global reduction 1 with 7 rules applied. Total rules applied 18 place count 781 transition count 2093
Applied a total of 18 rules in 113 ms. Remains 781 /792 variables (removed 11) and now considering 2093/2100 (removed 7) transitions.
Running 2089 sub problems to find dead transitions.
[2024-05-28 17:51:48] [INFO ] Flow matrix only has 2061 transitions (discarded 32 similar events)
// Phase 1: matrix 2061 rows 781 cols
[2024-05-28 17:51:49] [INFO ] Computed 54 invariants in 137 ms
[2024-05-28 17:51:49] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/777 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2089 unsolved
SMT process timed out in 28501ms, After SMT, problems are : Problem set: 0 solved, 2089 unsolved
Search for dead transitions found 0 dead transitions in 28548ms
[2024-05-28 17:52:17] [INFO ] Flow matrix only has 2061 transitions (discarded 32 similar events)
[2024-05-28 17:52:17] [INFO ] Invariant cache hit.
[2024-05-28 17:52:18] [INFO ] Implicit Places using invariants in 657 ms returned [2, 134, 146, 217, 295, 351, 389, 575]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 668 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 773/792 places, 2093/2100 transitions.
Applied a total of 0 rules in 23 ms. Remains 773 /773 variables (removed 0) and now considering 2093/2093 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29410 ms. Remains : 773/792 places, 2093/2100 transitions.
Support contains 350 out of 773 places after structural reductions.
[2024-05-28 17:52:18] [INFO ] Flatten gal took : 237 ms
[2024-05-28 17:52:18] [INFO ] Flatten gal took : 166 ms
[2024-05-28 17:52:19] [INFO ] Input system was already deterministic with 2093 transitions.
Support contains 349 out of 773 places (down from 350) after GAL structural reductions.
RANDOM walk for 40000 steps (9 resets) in 1730 ms. (23 steps per ms) remains 4/27 properties
BEST_FIRST walk for 40003 steps (8 resets) in 329 ms. (121 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (9 resets) in 206 ms. (193 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (9 resets) in 197 ms. (202 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (9 resets) in 271 ms. (147 steps per ms) remains 4/4 properties
[2024-05-28 17:52:20] [INFO ] Flow matrix only has 2061 transitions (discarded 32 similar events)
// Phase 1: matrix 2061 rows 773 cols
[2024-05-28 17:52:20] [INFO ] Computed 46 invariants in 42 ms
[2024-05-28 17:52:20] [INFO ] State equation strengthened by 160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 156/168 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 88/256 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/259 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 17/276 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 9 (OVERLAPS) 478/754 variables, 17/32 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/754 variables, 0/32 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Problem AtomicPropp21 is UNSAT
After SMT solving in domain Real declared 757/2834 variables, and 35 constraints, problems are : Problem set: 4 solved, 0 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 17/27 constraints, State Equation: 0/773 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 293ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 11 simplifications.
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-15 TRUE 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))&&G(p1)) U G(p2))))'
Support contains 68 out of 773 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 773/773 places, 2093/2093 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 765 transition count 2085
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 765 transition count 2085
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 764 transition count 2084
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 764 transition count 2084
Applied a total of 18 rules in 95 ms. Remains 764 /773 variables (removed 9) and now considering 2084/2093 (removed 9) transitions.
Running 2080 sub problems to find dead transitions.
[2024-05-28 17:52:20] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
// Phase 1: matrix 2052 rows 764 cols
[2024-05-28 17:52:20] [INFO ] Computed 46 invariants in 65 ms
[2024-05-28 17:52:20] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/760 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/760 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-05-28 17:52:47] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 16 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 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.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 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 2.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s73 0.0)
(s74 2.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 4.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 2.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 2.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 760/2816 variables, and 38 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 21/29 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/760 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/760 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/760 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-05-28 17:52:57] [INFO ] Deduced a trap composed of 49 places in 506 ms of which 5 ms to minimize.
[2024-05-28 17:52:57] [INFO ] Deduced a trap composed of 82 places in 342 ms of which 5 ms to minimize.
[2024-05-28 17:52:57] [INFO ] Deduced a trap composed of 82 places in 162 ms of which 7 ms to minimize.
[2024-05-28 17:52:57] [INFO ] Deduced a trap composed of 82 places in 122 ms of which 2 ms to minimize.
[2024-05-28 17:52:57] [INFO ] Deduced a trap composed of 82 places in 67 ms of which 1 ms to minimize.
[2024-05-28 17:52:58] [INFO ] Deduced a trap composed of 19 places in 307 ms of which 3 ms to minimize.
[2024-05-28 17:52:58] [INFO ] Deduced a trap composed of 82 places in 83 ms of which 2 ms to minimize.
[2024-05-28 17:53:00] [INFO ] Deduced a trap composed of 130 places in 274 ms of which 4 ms to minimize.
[2024-05-28 17:53:08] [INFO ] Deduced a trap composed of 54 places in 315 ms of which 4 ms to minimize.
[2024-05-28 17:53:09] [INFO ] Deduced a trap composed of 83 places in 73 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 760/2816 variables, and 48 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 21/29 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2080 constraints, Known Traps: 11/11 constraints]
After SMT, in 48467ms problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 48487ms
[2024-05-28 17:53:09] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-05-28 17:53:09] [INFO ] Invariant cache hit.
[2024-05-28 17:53:10] [INFO ] Implicit Places using invariants in 1086 ms returned []
[2024-05-28 17:53:10] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-05-28 17:53:10] [INFO ] Invariant cache hit.
[2024-05-28 17:53:11] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 17:53:41] [INFO ] Performed 383/764 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 17:54:00] [INFO ] Implicit Places using invariants and state equation in 50539 ms returned []
Implicit Place search using SMT with State Equation took 51628 ms to find 0 implicit places.
Running 2080 sub problems to find dead transitions.
[2024-05-28 17:54:00] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-05-28 17:54:00] [INFO ] Invariant cache hit.
[2024-05-28 17:54:00] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/760 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/760 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-05-28 17:54:27] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:54:33] [INFO ] Deduced a trap composed of 131 places in 247 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 760/2816 variables, and 39 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 21/29 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/760 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/760 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/760 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-05-28 17:54:48] [INFO ] Deduced a trap composed of 61 places in 378 ms of which 4 ms to minimize.
[2024-05-28 17:54:48] [INFO ] Deduced a trap composed of 82 places in 354 ms of which 4 ms to minimize.
[2024-05-28 17:54:49] [INFO ] Deduced a trap composed of 82 places in 485 ms of which 5 ms to minimize.
[2024-05-28 17:54:49] [INFO ] Deduced a trap composed of 82 places in 409 ms of which 4 ms to minimize.
[2024-05-28 17:54:50] [INFO ] Deduced a trap composed of 42 places in 257 ms of which 3 ms to minimize.
[2024-05-28 17:54:50] [INFO ] Deduced a trap composed of 49 places in 318 ms of which 4 ms to minimize.
[2024-05-28 17:54:50] [INFO ] Deduced a trap composed of 82 places in 77 ms of which 1 ms to minimize.
[2024-05-28 17:54:50] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 1 ms to minimize.
[2024-05-28 17:54:50] [INFO ] Deduced a trap composed of 83 places in 79 ms of which 1 ms to minimize.
[2024-05-28 17:54:51] [INFO ] Deduced a trap composed of 82 places in 82 ms of which 1 ms to minimize.
[2024-05-28 17:55:03] [INFO ] Deduced a trap composed of 82 places in 69 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 760/2816 variables, and 50 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 21/29 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2080 constraints, Known Traps: 13/13 constraints]
After SMT, in 67989ms problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 68021ms
Starting structural reductions in LTL mode, iteration 1 : 764/773 places, 2084/2093 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 168245 ms. Remains : 764/773 places, 2084/2093 transitions.
Stuttering acceptance computed with spot in 451 ms :[(NOT p2), (NOT p2), true, (NOT p0), (AND p2 (NOT p1)), (NOT p2)]
Running random walk in product with property : PolyORBLF-PT-S04J06T08-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T08-LTLCardinality-00 finished in 168770 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(p0)||(X(p1)&&G(p2))))'
Support contains 101 out of 773 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 773/773 places, 2093/2093 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 765 transition count 2085
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 765 transition count 2085
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 764 transition count 2084
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 764 transition count 2084
Applied a total of 18 rules in 171 ms. Remains 764 /773 variables (removed 9) and now considering 2084/2093 (removed 9) transitions.
Running 2080 sub problems to find dead transitions.
[2024-05-28 17:55:09] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-05-28 17:55:09] [INFO ] Invariant cache hit.
[2024-05-28 17:55:09] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/760 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/760 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-05-28 17:55:37] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 760/2816 variables, and 38 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 21/29 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/760 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/760 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/760 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-05-28 17:55:43] [INFO ] Deduced a trap composed of 82 places in 304 ms of which 3 ms to minimize.
[2024-05-28 17:55:43] [INFO ] Deduced a trap composed of 82 places in 239 ms of which 3 ms to minimize.
[2024-05-28 17:55:44] [INFO ] Deduced a trap composed of 19 places in 304 ms of which 3 ms to minimize.
[2024-05-28 17:55:44] [INFO ] Deduced a trap composed of 49 places in 240 ms of which 3 ms to minimize.
[2024-05-28 17:55:44] [INFO ] Deduced a trap composed of 82 places in 229 ms of which 2 ms to minimize.
[2024-05-28 17:55:44] [INFO ] Deduced a trap composed of 54 places in 229 ms of which 2 ms to minimize.
[2024-05-28 17:55:45] [INFO ] Deduced a trap composed of 82 places in 50 ms of which 1 ms to minimize.
[2024-05-28 17:55:45] [INFO ] Deduced a trap composed of 83 places in 46 ms of which 1 ms to minimize.
[2024-05-28 17:55:45] [INFO ] Deduced a trap composed of 82 places in 54 ms of which 1 ms to minimize.
[2024-05-28 17:55:47] [INFO ] Deduced a trap composed of 139 places in 226 ms of which 8 ms to minimize.
[2024-05-28 17:55:56] [INFO ] Deduced a trap composed of 82 places in 73 ms of which 1 ms to minimize.
[2024-05-28 17:55:56] [INFO ] Deduced a trap composed of 82 places in 76 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 760/2816 variables, and 50 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 21/29 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2080 constraints, Known Traps: 13/13 constraints]
After SMT, in 48209ms problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 48237ms
[2024-05-28 17:55:57] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-05-28 17:55:57] [INFO ] Invariant cache hit.
[2024-05-28 17:55:58] [INFO ] Implicit Places using invariants in 684 ms returned []
[2024-05-28 17:55:58] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-05-28 17:55:58] [INFO ] Invariant cache hit.
[2024-05-28 17:55:59] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 17:56:29] [INFO ] Performed 432/764 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 17:56:49] [INFO ] Implicit Places using invariants and state equation in 50701 ms returned []
Implicit Place search using SMT with State Equation took 51390 ms to find 0 implicit places.
Running 2080 sub problems to find dead transitions.
[2024-05-28 17:56:49] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-05-28 17:56:49] [INFO ] Invariant cache hit.
[2024-05-28 17:56:49] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/760 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/760 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-05-28 17:57:18] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 2 ms to minimize.
[2024-05-28 17:57:24] [INFO ] Deduced a trap composed of 131 places in 227 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 760/2816 variables, and 39 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 21/29 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/760 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/760 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/760 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-05-28 17:57:38] [INFO ] Deduced a trap composed of 61 places in 440 ms of which 8 ms to minimize.
[2024-05-28 17:57:38] [INFO ] Deduced a trap composed of 82 places in 418 ms of which 4 ms to minimize.
[2024-05-28 17:57:39] [INFO ] Deduced a trap composed of 82 places in 418 ms of which 3 ms to minimize.
[2024-05-28 17:57:39] [INFO ] Deduced a trap composed of 82 places in 351 ms of which 4 ms to minimize.
[2024-05-28 17:57:39] [INFO ] Deduced a trap composed of 42 places in 264 ms of which 5 ms to minimize.
[2024-05-28 17:57:40] [INFO ] Deduced a trap composed of 49 places in 275 ms of which 2 ms to minimize.
[2024-05-28 17:57:40] [INFO ] Deduced a trap composed of 82 places in 66 ms of which 1 ms to minimize.
[2024-05-28 17:57:40] [INFO ] Deduced a trap composed of 82 places in 66 ms of which 1 ms to minimize.
[2024-05-28 17:57:40] [INFO ] Deduced a trap composed of 83 places in 68 ms of which 1 ms to minimize.
[2024-05-28 17:57:40] [INFO ] Deduced a trap composed of 82 places in 66 ms of which 2 ms to minimize.
[2024-05-28 17:57:52] [INFO ] Deduced a trap composed of 82 places in 69 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 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 1)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 1)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 1)
(s64 0)
(s65 1)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s73 0)
(s74 1)
(s75 1)
(s76 0)
(s77 0)
(s78 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(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 0)
(s110 1)
(s111 0)
(s112 1)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 2)
(s126 0)
(s127 1)
(s128 0)
(s129 0)
(s130 0)
(s131 1)
(s132 0)
(s133 0)
(s134 1)
(s135 0)
(s136 0)
(s137 1)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 1)
(s168 0)
(s169 0)
(s170 0)
(s171 1)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 0)
(s180 1)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 1)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 1)
(s194 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 1)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 1)
(s217 4)
(s218 0)
(s219 0)
(s220 1)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 1)
(s229 0)
(s230 1)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 1)
(s236 1)
(s237 1)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 1)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 1)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 9)
(s260 0)
(s261 3)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 1)
(s302 1)
(s303 0)
(s304 0)
(s305 1)
(s306 0)
(s307 0)
(s308 0)
(s309 1)
(s310 0)
(s311 1)
(s312 1)
(s313 0)
(s314 0)
(s315 1)
(s316 1)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 1)
(s324 0)
(s325 0)
(s326 0)
(s327 1)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 1)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 4)
(s342 0)
(s343 0)
(s344 0)
(s345 1)
(s346 1)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 1)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 1)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 4)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 8)
(s382 0)
(s383 1)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 1)
(s391 0)
(s392 1)
(s393 9)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 1)
(s405 0)
(s406 0)
(s407 1)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 1)
(s424 1)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 1)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 1)
(s438 0)
(s439 1)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 1)
(s451 1)
(s452 0)
(s453 0)
(s454 1)
(s455 1)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 1)
(s463 0)
(s464 0)
(s465 0)
(s466 1)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 1)
(s479 0)
(s480 0)
(s481 0)
(s482 4)
(s483 0)
(s484 0)
(s485 2)
(s486 0)
(s487 1)
(s488 0)
(s489 0)
(s490 1)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 1)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 1)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 1)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 760/2816 variables, and 50 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 21/29 constraints, State Equation: 0/764 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2080 constraints, Known Traps: 13/13 constraints]
After SMT, in 70571ms problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 70602ms
Starting structural reductions in LTL mode, iteration 1 : 764/773 places, 2084/2093 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 170416 ms. Remains : 764/773 places, 2084/2093 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T08-LTLCardinality-02
Product exploration explored 100000 steps with 10378 reset in 985 ms.
Product exploration explored 100000 steps with 10331 reset in 796 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 p0) (NOT p2) p1), (X (NOT p2)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2 p1))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 171 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 32 steps (0 resets) in 6 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2 p1))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 10 factoid took 184 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
[2024-05-28 17:58:02] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-05-28 17:58:02] [INFO ] Invariant cache hit.
[2024-05-28 17:58:03] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-05-28 17:58:03] [INFO ] [Real]Absence check using 17 positive and 29 generalized place invariants in 74 ms returned sat
[2024-05-28 17:58:06] [INFO ] [Real]Absence check using state equation in 2654 ms returned sat
[2024-05-28 17:58:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:58:07] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-05-28 17:58:08] [INFO ] [Nat]Absence check using 17 positive and 29 generalized place invariants in 131 ms returned sat
[2024-05-28 17:58:12] [INFO ] [Nat]Absence check using state equation in 4774 ms returned unknown
Could not prove EG (NOT p0)
Support contains 57 out of 764 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 764/764 places, 2084/2084 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 764 transition count 2052
Reduce places removed 32 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 48 rules applied. Total rules applied 80 place count 732 transition count 2036
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 96 place count 716 transition count 2036
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 96 place count 716 transition count 1940
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 288 place count 620 transition count 1940
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 432 place count 548 transition count 1868
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 439 place count 541 transition count 1861
Iterating global reduction 3 with 7 rules applied. Total rules applied 446 place count 541 transition count 1861
Applied a total of 446 rules in 291 ms. Remains 541 /764 variables (removed 223) and now considering 1861/2084 (removed 223) transitions.
Running 1857 sub problems to find dead transitions.
[2024-05-28 17:58:13] [INFO ] Flow matrix only has 1829 transitions (discarded 32 similar events)
// Phase 1: matrix 1829 rows 541 cols
[2024-05-28 17:58:13] [INFO ] Computed 46 invariants in 50 ms
[2024-05-28 17:58:13] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
[2024-05-28 17:58:35] [INFO ] Deduced a trap composed of 54 places in 114 ms of which 2 ms to minimize.
[2024-05-28 17:58:35] [INFO ] Deduced a trap composed of 54 places in 122 ms of which 2 ms to minimize.
[2024-05-28 17:58:35] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 2 ms to minimize.
[2024-05-28 17:58:35] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 1 ms to minimize.
[2024-05-28 17:58:35] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 1 ms to minimize.
[2024-05-28 17:58:35] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
[2024-05-28 17:58:35] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
[2024-05-28 17:58:36] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
[2024-05-28 17:58:36] [INFO ] Deduced a trap composed of 33 places in 445 ms of which 6 ms to minimize.
[2024-05-28 17:58:37] [INFO ] Deduced a trap composed of 191 places in 402 ms of which 4 ms to minimize.
[2024-05-28 17:58:37] [INFO ] Deduced a trap composed of 19 places in 276 ms of which 3 ms to minimize.
[2024-05-28 17:58:40] [INFO ] Deduced a trap composed of 195 places in 404 ms of which 4 ms to minimize.
[2024-05-28 17:58:40] [INFO ] Deduced a trap composed of 190 places in 314 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 537/2370 variables, and 55 constraints, problems are : Problem set: 0 solved, 1857 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/541 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1857/1857 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1857 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/537 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
[2024-05-28 17:58:55] [INFO ] Deduced a trap composed of 300 places in 390 ms of which 4 ms to minimize.
[2024-05-28 17:59:01] [INFO ] Deduced a trap composed of 87 places in 473 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 537/2370 variables, and 57 constraints, problems are : Problem set: 0 solved, 1857 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/541 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1857 constraints, Known Traps: 15/15 constraints]
After SMT, in 48747ms problems are : Problem set: 0 solved, 1857 unsolved
Search for dead transitions found 0 dead transitions in 48770ms
[2024-05-28 17:59:01] [INFO ] Flow matrix only has 1829 transitions (discarded 32 similar events)
[2024-05-28 17:59:01] [INFO ] Invariant cache hit.
[2024-05-28 17:59:02] [INFO ] Implicit Places using invariants in 700 ms returned []
[2024-05-28 17:59:02] [INFO ] Flow matrix only has 1829 transitions (discarded 32 similar events)
[2024-05-28 17:59:02] [INFO ] Invariant cache hit.
[2024-05-28 17:59:03] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 17:59:26] [INFO ] Implicit Places using invariants and state equation in 23494 ms returned []
Implicit Place search using SMT with State Equation took 24197 ms to find 0 implicit places.
[2024-05-28 17:59:26] [INFO ] Redundant transitions in 153 ms returned []
Running 1857 sub problems to find dead transitions.
[2024-05-28 17:59:26] [INFO ] Flow matrix only has 1829 transitions (discarded 32 similar events)
[2024-05-28 17:59:26] [INFO ] Invariant cache hit.
[2024-05-28 17:59:26] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
[2024-05-28 17:59:50] [INFO ] Deduced a trap composed of 54 places in 173 ms of which 5 ms to minimize.
[2024-05-28 17:59:50] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
[2024-05-28 17:59:50] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 1 ms to minimize.
[2024-05-28 17:59:50] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 1 ms to minimize.
[2024-05-28 17:59:50] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 1 ms to minimize.
[2024-05-28 17:59:50] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 1 ms to minimize.
[2024-05-28 17:59:50] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
[2024-05-28 17:59:51] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2024-05-28 17:59:51] [INFO ] Deduced a trap composed of 33 places in 261 ms of which 2 ms to minimize.
[2024-05-28 17:59:52] [INFO ] Deduced a trap composed of 190 places in 403 ms of which 4 ms to minimize.
[2024-05-28 17:59:52] [INFO ] Deduced a trap composed of 40 places in 297 ms of which 3 ms to minimize.
[2024-05-28 17:59:54] [INFO ] Deduced a trap composed of 50 places in 458 ms of which 5 ms to minimize.
[2024-05-28 17:59:55] [INFO ] Deduced a trap composed of 91 places in 373 ms of which 3 ms to minimize.
[2024-05-28 17:59:56] [INFO ] Deduced a trap composed of 19 places in 282 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 537/2370 variables, and 56 constraints, problems are : Problem set: 0 solved, 1857 unsolved in 30122 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/541 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1857/1857 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1857 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/537 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
[2024-05-28 18:00:15] [INFO ] Deduced a trap composed of 155 places in 352 ms of which 3 ms to minimize.
[2024-05-28 18:00:15] [INFO ] Deduced a trap composed of 200 places in 386 ms of which 4 ms to minimize.
[2024-05-28 18:00:20] [INFO ] Deduced a trap composed of 300 places in 312 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 537/2370 variables, and 59 constraints, problems are : Problem set: 0 solved, 1857 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/541 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1857 constraints, Known Traps: 17/17 constraints]
After SMT, in 69831ms problems are : Problem set: 0 solved, 1857 unsolved
Search for dead transitions found 0 dead transitions in 69859ms
Starting structural reductions in SI_LTL mode, iteration 1 : 541/764 places, 1861/2084 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143291 ms. Remains : 541/764 places, 1861/2084 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 32 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
[2024-05-28 18:00:36] [INFO ] Flow matrix only has 1829 transitions (discarded 32 similar events)
[2024-05-28 18:00:36] [INFO ] Invariant cache hit.
[2024-05-28 18:00:37] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-28 18:00:37] [INFO ] [Real]Absence check using 18 positive and 28 generalized place invariants in 48 ms returned sat
[2024-05-28 18:00:40] [INFO ] [Real]Absence check using state equation in 2774 ms returned sat
[2024-05-28 18:00:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 18:00:41] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-05-28 18:00:41] [INFO ] [Nat]Absence check using 18 positive and 28 generalized place invariants in 91 ms returned sat
[2024-05-28 18:00:45] [INFO ] [Nat]Absence check using state equation in 4084 ms returned sat
[2024-05-28 18:00:45] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 18:00:46] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 18:00:48] [INFO ] [Nat]Added 160 Read/Feed constraints in 3060 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10379 reset in 717 ms.
Product exploration explored 100000 steps with 10362 reset in 728 ms.
Built C files in :
/tmp/ltsmin2228890408040283663
[2024-05-28 18:00:49] [INFO ] Too many transitions (1861) to apply POR reductions. Disabling POR matrices.
[2024-05-28 18:00:49] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2228890408040283663
Running compilation step : cd /tmp/ltsmin2228890408040283663;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2228890408040283663;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2228890408040283663;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 57 out of 541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 541/541 places, 1861/1861 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 541 transition count 1853
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 533 transition count 1853
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 525 transition count 1845
Applied a total of 32 rules in 105 ms. Remains 525 /541 variables (removed 16) and now considering 1845/1861 (removed 16) transitions.
Running 1841 sub problems to find dead transitions.
[2024-05-28 18:00:53] [INFO ] Flow matrix only has 1813 transitions (discarded 32 similar events)
// Phase 1: matrix 1813 rows 525 cols
[2024-05-28 18:00:53] [INFO ] Computed 46 invariants in 33 ms
[2024-05-28 18:00:53] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/521 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1841 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/521 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1841 unsolved
[2024-05-28 18:01:16] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 1 ms to minimize.
[2024-05-28 18:01:16] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 1 ms to minimize.
[2024-05-28 18:01:16] [INFO ] Deduced a trap composed of 52 places in 51 ms of which 1 ms to minimize.
[2024-05-28 18:01:16] [INFO ] Deduced a trap composed of 53 places in 34 ms of which 1 ms to minimize.
[2024-05-28 18:01:16] [INFO ] Deduced a trap composed of 53 places in 43 ms of which 1 ms to minimize.
[2024-05-28 18:01:16] [INFO ] Deduced a trap composed of 52 places in 36 ms of which 1 ms to minimize.
[2024-05-28 18:01:16] [INFO ] Deduced a trap composed of 52 places in 37 ms of which 1 ms to minimize.
[2024-05-28 18:01:16] [INFO ] Deduced a trap composed of 53 places in 38 ms of which 1 ms to minimize.
[2024-05-28 18:01:17] [INFO ] Deduced a trap composed of 175 places in 295 ms of which 3 ms to minimize.
[2024-05-28 18:01:17] [INFO ] Deduced a trap composed of 174 places in 255 ms of which 2 ms to minimize.
[2024-05-28 18:01:18] [INFO ] Deduced a trap composed of 57 places in 271 ms of which 3 ms to minimize.
[2024-05-28 18:01:20] [INFO ] Deduced a trap composed of 34 places in 397 ms of which 4 ms to minimize.
[2024-05-28 18:01:20] [INFO ] Deduced a trap composed of 78 places in 312 ms of which 4 ms to minimize.
[2024-05-28 18:01:21] [INFO ] Deduced a trap composed of 19 places in 233 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 521/2338 variables, and 56 constraints, problems are : Problem set: 0 solved, 1841 unsolved in 20049 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/525 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1841/1841 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1841 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/521 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1841 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/521 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1841 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/521 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 1841 unsolved
[2024-05-28 18:01:36] [INFO ] Deduced a trap composed of 284 places in 386 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 521/2338 variables, and 57 constraints, problems are : Problem set: 0 solved, 1841 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/525 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1841 constraints, Known Traps: 15/15 constraints]
After SMT, in 49441ms problems are : Problem set: 0 solved, 1841 unsolved
Search for dead transitions found 0 dead transitions in 49457ms
[2024-05-28 18:01:42] [INFO ] Flow matrix only has 1813 transitions (discarded 32 similar events)
[2024-05-28 18:01:42] [INFO ] Invariant cache hit.
[2024-05-28 18:01:43] [INFO ] Implicit Places using invariants in 742 ms returned []
[2024-05-28 18:01:43] [INFO ] Flow matrix only has 1813 transitions (discarded 32 similar events)
[2024-05-28 18:01:43] [INFO ] Invariant cache hit.
[2024-05-28 18:01:45] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 18:02:04] [INFO ] Implicit Places using invariants and state equation in 21298 ms returned []
Implicit Place search using SMT with State Equation took 22041 ms to find 0 implicit places.
[2024-05-28 18:02:04] [INFO ] Redundant transitions in 107 ms returned []
Running 1841 sub problems to find dead transitions.
[2024-05-28 18:02:04] [INFO ] Flow matrix only has 1813 transitions (discarded 32 similar events)
[2024-05-28 18:02:04] [INFO ] Invariant cache hit.
[2024-05-28 18:02:04] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/521 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1841 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/521 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1841 unsolved
[2024-05-28 18:02:25] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 1 ms to minimize.
[2024-05-28 18:02:25] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 1 ms to minimize.
[2024-05-28 18:02:25] [INFO ] Deduced a trap composed of 52 places in 40 ms of which 1 ms to minimize.
[2024-05-28 18:02:25] [INFO ] Deduced a trap composed of 53 places in 36 ms of which 0 ms to minimize.
[2024-05-28 18:02:25] [INFO ] Deduced a trap composed of 53 places in 32 ms of which 1 ms to minimize.
[2024-05-28 18:02:25] [INFO ] Deduced a trap composed of 52 places in 34 ms of which 1 ms to minimize.
[2024-05-28 18:02:25] [INFO ] Deduced a trap composed of 52 places in 32 ms of which 0 ms to minimize.
[2024-05-28 18:02:25] [INFO ] Deduced a trap composed of 283 places in 349 ms of which 4 ms to minimize.
[2024-05-28 18:02:26] [INFO ] Deduced a trap composed of 174 places in 301 ms of which 3 ms to minimize.
[2024-05-28 18:02:26] [INFO ] Deduced a trap composed of 53 places in 32 ms of which 1 ms to minimize.
[2024-05-28 18:02:27] [INFO ] Deduced a trap composed of 33 places in 244 ms of which 2 ms to minimize.
[2024-05-28 18:02:28] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 2 ms to minimize.
[2024-05-28 18:02:33] [INFO ] Deduced a trap composed of 47 places in 348 ms of which 3 ms to minimize.
[2024-05-28 18:02:33] [INFO ] Deduced a trap composed of 99 places in 317 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 521/2338 variables, and 56 constraints, problems are : Problem set: 0 solved, 1841 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/525 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1841/1841 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1841 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/521 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1841 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/521 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1841 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/521 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 1841 unsolved
[2024-05-28 18:03:06] [INFO ] Deduced a trap composed of 284 places in 359 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 521/2338 variables, and 57 constraints, problems are : Problem set: 0 solved, 1841 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/525 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1841 constraints, Known Traps: 15/15 constraints]
After SMT, in 68405ms problems are : Problem set: 0 solved, 1841 unsolved
Search for dead transitions found 0 dead transitions in 68420ms
Starting structural reductions in SI_LTL mode, iteration 1 : 525/541 places, 1845/1861 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140147 ms. Remains : 525/541 places, 1845/1861 transitions.
Built C files in :
/tmp/ltsmin13336275069292860804
[2024-05-28 18:03:13] [INFO ] Too many transitions (1845) to apply POR reductions. Disabling POR matrices.
[2024-05-28 18:03:13] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13336275069292860804
Running compilation step : cd /tmp/ltsmin13336275069292860804;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13336275069292860804;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13336275069292860804;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 18:03:16] [INFO ] Flatten gal took : 120 ms
[2024-05-28 18:03:16] [INFO ] Flatten gal took : 114 ms
[2024-05-28 18:03:16] [INFO ] Time to serialize gal into /tmp/LTL7220566792660419976.gal : 36 ms
[2024-05-28 18:03:16] [INFO ] Time to serialize properties into /tmp/LTL12105325221492706959.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7220566792660419976.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8602853461395276551.hoa' '-atoms' '/tmp/LTL12105325221492706959.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL12105325221492706959.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8602853461395276551.hoa
Detected timeout of ITS tools.
[2024-05-28 18:03:31] [INFO ] Flatten gal took : 69 ms
[2024-05-28 18:03:31] [INFO ] Flatten gal took : 71 ms
[2024-05-28 18:03:31] [INFO ] Time to serialize gal into /tmp/LTL263207771930805733.gal : 12 ms
[2024-05-28 18:03:31] [INFO ] Time to serialize properties into /tmp/LTL1633530586120181030.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL263207771930805733.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1633530586120181030.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !(((F("(IsMonitoring<=((((((QueueJobB_7_6+QueueJobB_4_4)+(QueueJobB_6_5+QueueJobB_4_1))+((QueueJobB_1_1+QueueJobB_7_0)+(QueueJobB_2_2+...1771
Formula 0 simplified : G!"(IsMonitoring<=((((((QueueJobB_7_6+QueueJobB_4_4)+(QueueJobB_6_5+QueueJobB_4_1))+((QueueJobB_1_1+QueueJobB_7_0)+(QueueJobB_2_2+Qu...1761
Detected timeout of ITS tools.
[2024-05-28 18:03:47] [INFO ] Flatten gal took : 115 ms
[2024-05-28 18:03:47] [INFO ] Applying decomposition
[2024-05-28 18:03:47] [INFO ] Flatten gal took : 92 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16274468264400116137.txt' '-o' '/tmp/graph16274468264400116137.bin' '-w' '/tmp/graph16274468264400116137.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16274468264400116137.bin' '-l' '-1' '-v' '-w' '/tmp/graph16274468264400116137.weights' '-q' '0' '-e' '0.001'
[2024-05-28 18:03:47] [INFO ] Decomposing Gal with order
[2024-05-28 18:03:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 18:03:48] [INFO ] Removed a total of 2097 redundant transitions.
[2024-05-28 18:03:48] [INFO ] Flatten gal took : 507 ms
[2024-05-28 18:03:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 463 labels/synchronizations in 55 ms.
[2024-05-28 18:03:48] [INFO ] Time to serialize gal into /tmp/LTL4414593935673677722.gal : 40 ms
[2024-05-28 18:03:48] [INFO ] Time to serialize properties into /tmp/LTL14314808963173547675.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4414593935673677722.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14314808963173547675.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(gu0.IsMonitoring<=((((((gu0.QueueJobB_7_6+gu0.QueueJobB_4_4)+(gu0.QueueJobB_6_5+gu0.QueueJobB_4_1))+((gu0.QueueJobB_1_1+gu0.Qu...2275
Formula 0 simplified : G!"(gu0.IsMonitoring<=((((((gu0.QueueJobB_7_6+gu0.QueueJobB_4_4)+(gu0.QueueJobB_6_5+gu0.QueueJobB_4_1))+((gu0.QueueJobB_1_1+gu0.Queu...2265
Detected timeout of ITS tools.
Treatment of property PolyORBLF-PT-S04J06T08-LTLCardinality-02 finished in 534243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((p0 U p1)&&X(p2))))))'
Support contains 33 out of 773 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 773/773 places, 2093/2093 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 772 transition count 2092
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 772 transition count 2092
Applied a total of 2 rules in 60 ms. Remains 772 /773 variables (removed 1) and now considering 2092/2093 (removed 1) transitions.
Running 2088 sub problems to find dead transitions.
[2024-05-28 18:04:03] [INFO ] Flow matrix only has 2060 transitions (discarded 32 similar events)
// Phase 1: matrix 2060 rows 772 cols
[2024-05-28 18:04:03] [INFO ] Computed 46 invariants in 52 ms
[2024-05-28 18:04:03] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
SMT process timed out in 28868ms, After SMT, problems are : Problem set: 0 solved, 2088 unsolved
Search for dead transitions found 0 dead transitions in 28897ms
[2024-05-28 18:04:32] [INFO ] Flow matrix only has 2060 transitions (discarded 32 similar events)
[2024-05-28 18:04:32] [INFO ] Invariant cache hit.
[2024-05-28 18:04:33] [INFO ] Implicit Places using invariants in 688 ms returned []
[2024-05-28 18:04:33] [INFO ] Flow matrix only has 2060 transitions (discarded 32 similar events)
[2024-05-28 18:04:33] [INFO ] Invariant cache hit.
[2024-05-28 18:04:34] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 18:05:04] [INFO ] Performed 614/772 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 18:05:10] [INFO ] Implicit Places using invariants and state equation in 37270 ms returned []
Implicit Place search using SMT with State Equation took 37961 ms to find 0 implicit places.
Running 2088 sub problems to find dead transitions.
[2024-05-28 18:05:10] [INFO ] Flow matrix only has 2060 transitions (discarded 32 similar events)
[2024-05-28 18:05:10] [INFO ] Invariant cache hit.
[2024-05-28 18:05:10] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
[2024-05-28 18:05:39] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 2 ms to minimize.
[2024-05-28 18:05:46] [INFO ] Deduced a trap composed of 147 places in 223 ms of which 9 ms to minimize.
[2024-05-28 18:05:46] [INFO ] Deduced a trap composed of 138 places in 215 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 768/2832 variables, and 40 constraints, problems are : Problem set: 0 solved, 2088 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 19/28 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2088/2088 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2088 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/768 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/768 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
At refinement iteration 4 (OVERLAPS) 4/772 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 772/2832 variables, and 49 constraints, problems are : Problem set: 0 solved, 2088 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2088 constraints, Known Traps: 3/3 constraints]
After SMT, in 68638ms problems are : Problem set: 0 solved, 2088 unsolved
Search for dead transitions found 0 dead transitions in 68669ms
Starting structural reductions in LTL mode, iteration 1 : 772/773 places, 2092/2093 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135609 ms. Remains : 772/773 places, 2092/2093 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Running random walk in product with property : PolyORBLF-PT-S04J06T08-LTLCardinality-03
Product exploration explored 100000 steps with 19951 reset in 1248 ms.
Product exploration explored 100000 steps with 19992 reset in 873 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 p1 p0 p2), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 125 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 259 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (9 resets) in 485 ms. (82 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 292 ms. (136 steps per ms) remains 1/1 properties
[2024-05-28 18:06:22] [INFO ] Flow matrix only has 2060 transitions (discarded 32 similar events)
[2024-05-28 18:06:22] [INFO ] Invariant cache hit.
[2024-05-28 18:06:22] [INFO ] State equation strengthened by 160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 598/630 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/630 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 83/713 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/713 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 56/769 variables, 21/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/770 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/770 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2830/2832 variables, and 815 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1996 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 770/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 598/630 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 18:06:24] [INFO ] Deduced a trap composed of 54 places in 273 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/630 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/630 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 83/713 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/713 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 769/2832 variables, and 45 constraints, problems are : Problem set: 1 solved, 0 unsolved in 521 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2538ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1)), (G (OR p0 p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (AND (OR (NOT p0) p2) (OR (NOT p1) p2)))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT p2))]
Knowledge based reduction with 8 factoid took 202 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (NOT p1), (NOT p2)]
Support contains 17 out of 772 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 772/772 places, 2092/2092 transitions.
Applied a total of 0 rules in 17 ms. Remains 772 /772 variables (removed 0) and now considering 2092/2092 (removed 0) transitions.
Running 2088 sub problems to find dead transitions.
[2024-05-28 18:06:25] [INFO ] Flow matrix only has 2060 transitions (discarded 32 similar events)
[2024-05-28 18:06:25] [INFO ] Invariant cache hit.
[2024-05-28 18:06:25] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
SMT process timed out in 28050ms, After SMT, problems are : Problem set: 0 solved, 2088 unsolved
Search for dead transitions found 0 dead transitions in 28073ms
[2024-05-28 18:06:53] [INFO ] Flow matrix only has 2060 transitions (discarded 32 similar events)
[2024-05-28 18:06:53] [INFO ] Invariant cache hit.
[2024-05-28 18:06:54] [INFO ] Implicit Places using invariants in 757 ms returned []
[2024-05-28 18:06:54] [INFO ] Flow matrix only has 2060 transitions (discarded 32 similar events)
[2024-05-28 18:06:54] [INFO ] Invariant cache hit.
[2024-05-28 18:06:55] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 18:07:26] [INFO ] Performed 667/772 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 18:07:28] [INFO ] Implicit Places using invariants and state equation in 34557 ms returned []
Implicit Place search using SMT with State Equation took 35319 ms to find 0 implicit places.
Running 2088 sub problems to find dead transitions.
[2024-05-28 18:07:28] [INFO ] Flow matrix only has 2060 transitions (discarded 32 similar events)
[2024-05-28 18:07:28] [INFO ] Invariant cache hit.
[2024-05-28 18:07:28] [INFO ] State equation strengthened by 160 read => feed constraints.

BK_STOP 1716919652761

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-S04J06T08"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is PolyORBLF-PT-S04J06T08, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r290-tajo-171654446800299"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S04J06T08.tgz
mv PolyORBLF-PT-S04J06T08 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;