Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 27M
-rw-r--r-- 1 mcc users 12K Apr 12 11:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 12 11:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 762K Apr 12 11:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.7M Apr 12 11:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 44K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 143K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K Apr 12 14:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 212K Apr 12 14:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.9M Apr 12 13:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 7.1M Apr 12 13:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K 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 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 14M 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 PolyORBNT-PT-S10J30-LTLCardinality-00
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-01
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-02
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-03
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-04
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-05
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-06
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-07
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-08
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-09
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-10
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-11
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-12
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-13
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-14
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716933183146

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J30
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-28 21:53:04] [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 21:53:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 21:53:05] [INFO ] Load time of PNML (sax parser for PT used): 672 ms
[2024-05-28 21:53:05] [INFO ] Transformed 664 places.
[2024-05-28 21:53:05] [INFO ] Transformed 12050 transitions.
[2024-05-28 21:53:05] [INFO ] Parsed PT model containing 664 places and 12050 transitions and 112559 arcs in 918 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
FORMULA PolyORBNT-PT-S10J30-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 105 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 9 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 655 transition count 1940
Applied a total of 9 rules in 195 ms. Remains 655 /664 variables (removed 9) and now considering 1940/1940 (removed 0) transitions.
Running 1929 sub problems to find dead transitions.
[2024-05-28 21:53:06] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 655 cols
[2024-05-28 21:53:06] [INFO ] Computed 83 invariants in 144 ms
[2024-05-28 21:53:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 643/2586 variables, and 71 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 20096 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/20 constraints, State Equation: 0/655 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1929/929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(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 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s62 1)
(s63 0)
(s64 0)
(s65 1)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 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 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 1)
(s103 9)
(s104 1)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 3)
(s113 0)
(s114 3)
(s115 0)
(s116 0)
(s117 0)
(s118 1)
(s119 1)
(s120 0)
(s121 0)
(s122 0)
(s123 1)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 2)
(s142 0)
(s143 0)
(s145 0)
(s146 0)
(s147 1)
(s148 1)
(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 1)
(s162 0)
(s163 0)
(s164 1)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 1)
(s174 0)
(s175 0)
(s176 1)
(s177 1)
(s178 1)
(s179 0)
(s180 0)
(s181 4)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 1)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 3)
(s211 0)
(s213 1)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 1)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 1)
(s230 0)
(s231 0)
(s232 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 1)
(s244 1)
(s245 0)
(s246 0)
(s247 1)
(s248 1)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 1)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 1)
(s270 10)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 1)
(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 1)
(s292 0)
(s293 1)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 1)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 timeout
0)
(s335 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 643/2586 variables, and 71 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 20053 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/20 constraints, State Equation: 0/655 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/929 constraints, Known Traps: 0/0 constraints]
After SMT, in 58736ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 58800ms
[2024-05-28 21:54:04] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-05-28 21:54:04] [INFO ] Invariant cache hit.
[2024-05-28 21:54:05] [INFO ] Implicit Places using invariants in 937 ms returned []
[2024-05-28 21:54:05] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-05-28 21:54:05] [INFO ] Invariant cache hit.
[2024-05-28 21:54:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:54:13] [INFO ] Implicit Places using invariants and state equation in 7592 ms returned []
Implicit Place search using SMT with State Equation took 8538 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2024-05-28 21:54:13] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-05-28 21:54:13] [INFO ] Invariant cache hit.
[2024-05-28 21:54:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 (/ 2.0 3.0))
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.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)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 (/ 2.0 3.0))
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 9.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 (/ 2.0 3.0))
(s111 0.0)
(s112 4.0)
(s113 0.0)
(s114 4.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 (/ 1.0 3.0))
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 (/ 1.0 3.0))
(s177 1.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 4.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 4.0)
(s211 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 1.0)
(s270 9.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 1.0)
(s324 0.0)
(s325 0.0)
(s326 (/ 2.0 3.0))
(s327 0.0)
(s328 0.0)
(s329 1.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 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 643/2586 variables, and 71 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/20 constraints, State Equation: 0/655 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1929/929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/643 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Problem TDEAD26 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
At refinement iteration 3 (OVERLAPS) 12/655 variables, 12/83 constraints. Problems are: Problem set: 14 solved, 1915 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 655/2586 variables, and 83 constraints, problems are : Problem set: 14 solved, 1915 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 0/655 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/929 constraints, Known Traps: 0/0 constraints]
After SMT, in 79627ms problems are : Problem set: 14 solved, 1915 unsolved
Search for dead transitions found 14 dead transitions in 79671ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in LTL mode, iteration 1 : 655/664 places, 1926/1940 transitions.
Applied a total of 0 rules in 49 ms. Remains 655 /655 variables (removed 0) and now considering 1926/1926 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 147338 ms. Remains : 655/664 places, 1926/1940 transitions.
Support contains 105 out of 655 places after structural reductions.
[2024-05-28 21:55:33] [INFO ] Flatten gal took : 344 ms
[2024-05-28 21:55:33] [INFO ] Flatten gal took : 187 ms
[2024-05-28 21:55:34] [INFO ] Input system was already deterministic with 1926 transitions.
Support contains 102 out of 655 places (down from 105) after GAL structural reductions.
RANDOM walk for 40000 steps (2240 resets) in 2814 ms. (14 steps per ms) remains 28/31 properties
BEST_FIRST walk for 4003 steps (40 resets) in 49 ms. (80 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (40 resets) in 43 ms. (90 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (40 resets) in 32 ms. (121 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (48 resets) in 50 ms. (78 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (40 resets) in 33 ms. (117 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (40 resets) in 28 ms. (138 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (40 resets) in 32 ms. (121 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (40 resets) in 32 ms. (121 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (40 resets) in 25 ms. (153 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (40 resets) in 33 ms. (117 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (39 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (40 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (40 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (38 resets) in 44 ms. (88 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (39 resets) in 314 ms. (12 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (41 resets) in 40 ms. (97 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (40 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (40 resets) in 41 ms. (95 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (40 resets) in 31 ms. (125 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (41 resets) in 29 ms. (133 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (41 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (40 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (40 resets) in 33 ms. (117 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (40 resets) in 29 ms. (133 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (44 resets) in 35 ms. (111 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (39 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (41 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (41 resets) in 30 ms. (129 steps per ms) remains 28/28 properties
[2024-05-28 21:55:35] [INFO ] Flow matrix only has 1917 transitions (discarded 9 similar events)
// Phase 1: matrix 1917 rows 655 cols
[2024-05-28 21:55:35] [INFO ] Computed 83 invariants in 48 ms
[2024-05-28 21:55:35] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp10 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 27 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 1 (OVERLAPS) 224/323 variables, 34/34 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 2/36 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 270/593 variables, 27/63 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 0/63 constraints. Problems are: Problem set: 2 solved, 26 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
At refinement iteration 6 (OVERLAPS) 60/653 variables, 18/81 constraints. Problems are: Problem set: 5 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/653 variables, 0/81 constraints. Problems are: Problem set: 5 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 2/655 variables, 2/83 constraints. Problems are: Problem set: 5 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/655 variables, 0/83 constraints. Problems are: Problem set: 5 solved, 23 unsolved
At refinement iteration 10 (OVERLAPS) 1917/2572 variables, 655/738 constraints. Problems are: Problem set: 5 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2572 variables, 1/739 constraints. Problems are: Problem set: 5 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2572 variables, 0/739 constraints. Problems are: Problem set: 5 solved, 23 unsolved
At refinement iteration 13 (OVERLAPS) 0/2572 variables, 0/739 constraints. Problems are: Problem set: 5 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2572/2572 variables, and 739 constraints, problems are : Problem set: 5 solved, 23 unsolved in 4573 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 655/655 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 28/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 225/322 variables, 34/34 constraints. Problems are: Problem set: 5 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 2/36 constraints. Problems are: Problem set: 5 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 0/36 constraints. Problems are: Problem set: 5 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 270/592 variables, 27/63 constraints. Problems are: Problem set: 5 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/592 variables, 0/63 constraints. Problems are: Problem set: 5 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 61/653 variables, 18/81 constraints. Problems are: Problem set: 5 solved, 23 unsolved
[2024-05-28 21:55:41] [INFO ] Deduced a trap composed of 24 places in 541 ms of which 39 ms to minimize.
[2024-05-28 21:55:42] [INFO ] Deduced a trap composed of 190 places in 583 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/653 variables, 2/83 constraints. Problems are: Problem set: 5 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/653 variables, 0/83 constraints. Problems are: Problem set: 5 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 2/655 variables, 2/85 constraints. Problems are: Problem set: 5 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/655 variables, 0/85 constraints. Problems are: Problem set: 5 solved, 23 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 11 (OVERLAPS) 1917/2572 variables, 655/740 constraints. Problems are: Problem set: 6 solved, 22 unsolved
SMT process timed out in 9820ms, After SMT, problems are : Problem set: 6 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 86 out of 655 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 655/655 places, 1926/1926 transitions.
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 654 transition count 1925
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 653 transition count 1925
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 3 place count 653 transition count 1893
Deduced a syphon composed of 32 places in 14 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 67 place count 621 transition count 1893
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 620 transition count 1892
Applied a total of 69 rules in 325 ms. Remains 620 /655 variables (removed 35) and now considering 1892/1926 (removed 34) transitions.
Running 1881 sub problems to find dead transitions.
[2024-05-28 21:55:45] [INFO ] Flow matrix only has 1883 transitions (discarded 9 similar events)
// Phase 1: matrix 1883 rows 620 cols
[2024-05-28 21:55:45] [INFO ] Computed 82 invariants in 53 ms
[2024-05-28 21:55:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1881 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1881 unsolved
[2024-05-28 21:56:26] [INFO ] Deduced a trap composed of 23 places in 291 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 610/2503 variables, and 73 constraints, problems are : Problem set: 0 solved, 1881 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/620 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1881/1881 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1881 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1881 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1881 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1881 unsolved
[2024-05-28 21:56:34] [INFO ] Deduced a trap composed of 20 places in 354 ms of which 4 ms to minimize.
[2024-05-28 21:56:34] [INFO ] Deduced a trap composed of 19 places in 280 ms of which 2 ms to minimize.
[2024-05-28 21:56:36] [INFO ] Deduced a trap composed of 186 places in 405 ms of which 3 ms to minimize.
[2024-05-28 21:56:37] [INFO ] Deduced a trap composed of 11 places in 646 ms of which 5 ms to minimize.
[2024-05-28 21:56:40] [INFO ] Deduced a trap composed of 144 places in 487 ms of which 5 ms to minimize.
[2024-05-28 21:56:43] [INFO ] Deduced a trap composed of 283 places in 382 ms of which 3 ms to minimize.
[2024-05-28 21:56:43] [INFO ] Deduced a trap composed of 121 places in 500 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 610/2503 variables, and 80 constraints, problems are : Problem set: 0 solved, 1881 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/620 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1881 constraints, Known Traps: 8/8 constraints]
After SMT, in 65608ms problems are : Problem set: 0 solved, 1881 unsolved
Search for dead transitions found 0 dead transitions in 65633ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65965 ms. Remains : 620/655 places, 1892/1926 transitions.
RANDOM walk for 40000 steps (2738 resets) in 2294 ms. (17 steps per ms) remains 5/22 properties
BEST_FIRST walk for 40004 steps (423 resets) in 234 ms. (170 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (431 resets) in 202 ms. (197 steps per ms) remains 2/5 properties
[2024-05-28 21:56:52] [INFO ] Flow matrix only has 1883 transitions (discarded 9 similar events)
[2024-05-28 21:56:52] [INFO ] Invariant cache hit.
[2024-05-28 21:56:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 101/111 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 141/252 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 280/532 variables, 28/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 83/615 variables, 19/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 21:56:52] [INFO ] Deduced a trap composed of 138 places in 480 ms of which 4 ms to minimize.
[2024-05-28 21:56:53] [INFO ] Deduced a trap composed of 20 places in 485 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/615 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/615 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 4/619 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/619 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1883/2502 variables, 619/703 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/2502 variables, 1/704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2502 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/2503 variables, 1/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2503 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/2503 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2503/2503 variables, and 705 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2670 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 620/620 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 101/111 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 141/252 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 280/532 variables, 28/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 83/615 variables, 19/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/615 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/615 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 4/619 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/619 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1883/2502 variables, 619/703 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2502 variables, 1/704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2502 variables, 2/706 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2502 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/2503 variables, 1/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2503 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/2503 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2503/2503 variables, and 707 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2397 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 620/620 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 5080ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1533 steps, including 190 resets, run visited all 2 properties in 67 ms. (steps per millisecond=22 )
Parikh walk visited 2 properties in 76 ms.
Successfully simplified 6 atomic propositions for a total of 14 simplifications.
FORMULA PolyORBNT-PT-S10J30-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 655/655 places, 1926/1926 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 654 transition count 1926
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 653 transition count 1925
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 653 transition count 1925
Applied a total of 3 rules in 99 ms. Remains 653 /655 variables (removed 2) and now considering 1925/1926 (removed 1) transitions.
Running 1914 sub problems to find dead transitions.
[2024-05-28 21:56:58] [INFO ] Flow matrix only has 1916 transitions (discarded 9 similar events)
// Phase 1: matrix 1916 rows 653 cols
[2024-05-28 21:56:58] [INFO ] Computed 82 invariants in 58 ms
[2024-05-28 21:56:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1914 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1914 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2569 variables, and 71 constraints, problems are : Problem set: 0 solved, 1914 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1914/1914 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1914 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1914 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1914 unsolved
[2024-05-28 21:57:47] [INFO ] Deduced a trap composed of 82 places in 219 ms of which 2 ms to minimize.
[2024-05-28 21:57:48] [INFO ] Deduced a trap composed of 84 places in 261 ms of which 3 ms to minimize.
[2024-05-28 21:57:56] [INFO ] Deduced a trap composed of 83 places in 212 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2569 variables, and 74 constraints, problems are : Problem set: 0 solved, 1914 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1914 constraints, Known Traps: 3/3 constraints]
After SMT, in 64042ms problems are : Problem set: 0 solved, 1914 unsolved
Search for dead transitions found 0 dead transitions in 64064ms
[2024-05-28 21:58:02] [INFO ] Flow matrix only has 1916 transitions (discarded 9 similar events)
[2024-05-28 21:58:02] [INFO ] Invariant cache hit.
[2024-05-28 21:58:02] [INFO ] Implicit Places using invariants in 865 ms returned []
[2024-05-28 21:58:02] [INFO ] Flow matrix only has 1916 transitions (discarded 9 similar events)
[2024-05-28 21:58:02] [INFO ] Invariant cache hit.
[2024-05-28 21:58:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:58:15] [INFO ] Implicit Places using invariants and state equation in 12653 ms returned []
Implicit Place search using SMT with State Equation took 13522 ms to find 0 implicit places.
Running 1914 sub problems to find dead transitions.
[2024-05-28 21:58:15] [INFO ] Flow matrix only has 1916 transitions (discarded 9 similar events)
[2024-05-28 21:58:15] [INFO ] Invariant cache hit.
[2024-05-28 21:58:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1914 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1914 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2569 variables, and 71 constraints, problems are : Problem set: 0 solved, 1914 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1914/1914 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1914 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1914 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1914 unsolved
[2024-05-28 21:59:17] [INFO ] Deduced a trap composed of 19 places in 416 ms of which 2 ms to minimize.
[2024-05-28 21:59:19] [INFO ] Deduced a trap composed of 84 places in 225 ms of which 3 ms to minimize.
[2024-05-28 21:59:24] [INFO ] Deduced a trap composed of 84 places in 205 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 1914 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2569 variables, and 74 constraints, problems are : Problem set: 0 solved, 1914 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1914 constraints, Known Traps: 3/3 constraints]
After SMT, in 83914ms problems are : Problem set: 0 solved, 1914 unsolved
Search for dead transitions found 0 dead transitions in 83932ms
Starting structural reductions in LTL mode, iteration 1 : 653/655 places, 1925/1926 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 161628 ms. Remains : 653/655 places, 1925/1926 transitions.
Stuttering acceptance computed with spot in 216 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA PolyORBNT-PT-S10J30-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLCardinality-00 finished in 161926 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 655 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 655/655 places, 1926/1926 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 654 transition count 1891
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 619 transition count 1891
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 70 place count 619 transition count 1857
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 138 place count 585 transition count 1857
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 584 transition count 1856
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 584 transition count 1856
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 144 place count 582 transition count 1854
Applied a total of 144 rules in 270 ms. Remains 582 /655 variables (removed 73) and now considering 1854/1926 (removed 72) transitions.
Running 1843 sub problems to find dead transitions.
[2024-05-28 21:59:40] [INFO ] Flow matrix only has 1845 transitions (discarded 9 similar events)
// Phase 1: matrix 1845 rows 582 cols
[2024-05-28 21:59:40] [INFO ] Computed 82 invariants in 21 ms
[2024-05-28 21:59:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1843 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1843 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/2427 variables, and 72 constraints, problems are : Problem set: 0 solved, 1843 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/582 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1843/1843 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1843 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1843 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1843 unsolved
[2024-05-28 22:00:28] [INFO ] Deduced a trap composed of 248 places in 233 ms of which 3 ms to minimize.
[2024-05-28 22:00:29] [INFO ] Deduced a trap composed of 103 places in 307 ms of which 4 ms to minimize.
[2024-05-28 22:00:31] [INFO ] Deduced a trap composed of 163 places in 353 ms of which 4 ms to minimize.
[2024-05-28 22:00:31] [INFO ] Deduced a trap composed of 81 places in 272 ms of which 3 ms to minimize.
[2024-05-28 22:00:32] [INFO ] Deduced a trap composed of 148 places in 304 ms of which 4 ms to minimize.
[2024-05-28 22:00:32] [INFO ] Deduced a trap composed of 80 places in 262 ms of which 3 ms to minimize.
[2024-05-28 22:00:34] [INFO ] Deduced a trap composed of 81 places in 287 ms of which 4 ms to minimize.
[2024-05-28 22:00:35] [INFO ] Deduced a trap composed of 267 places in 291 ms of which 4 ms to minimize.
[2024-05-28 22:00:35] [INFO ] Deduced a trap composed of 190 places in 281 ms of which 8 ms to minimize.
[2024-05-28 22:00:36] [INFO ] Deduced a trap composed of 169 places in 344 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/2427 variables, and 82 constraints, problems are : Problem set: 0 solved, 1843 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/582 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1843 constraints, Known Traps: 10/10 constraints]
After SMT, in 66366ms problems are : Problem set: 0 solved, 1843 unsolved
Search for dead transitions found 0 dead transitions in 66393ms
[2024-05-28 22:00:46] [INFO ] Flow matrix only has 1845 transitions (discarded 9 similar events)
[2024-05-28 22:00:46] [INFO ] Invariant cache hit.
[2024-05-28 22:00:47] [INFO ] Implicit Places using invariants in 659 ms returned []
[2024-05-28 22:00:47] [INFO ] Flow matrix only has 1845 transitions (discarded 9 similar events)
[2024-05-28 22:00:47] [INFO ] Invariant cache hit.
[2024-05-28 22:00:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:01:00] [INFO ] Implicit Places using invariants and state equation in 13453 ms returned []
Implicit Place search using SMT with State Equation took 14114 ms to find 0 implicit places.
[2024-05-28 22:01:00] [INFO ] Redundant transitions in 139 ms returned []
Running 1843 sub problems to find dead transitions.
[2024-05-28 22:01:00] [INFO ] Flow matrix only has 1845 transitions (discarded 9 similar events)
[2024-05-28 22:01:00] [INFO ] Invariant cache hit.
[2024-05-28 22:01:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1843 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1843 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/572 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1843 unsolved
Problem TDEAD169 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1381 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1401 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1409 is UNSAT
Problem TDEAD1410 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1421 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1426 is UNSAT
Problem TDEAD1427 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1432 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1452 is UNSAT
Problem TDEAD1454 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1476 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1484 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1493 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1505 is UNSAT
Problem TDEAD1508 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1523 is UNSAT
At refinement iteration 3 (OVERLAPS) 10/582 variables, 10/82 constraints. Problems are: Problem set: 601 solved, 1242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 582/2427 variables, and 82 constraints, problems are : Problem set: 601 solved, 1242 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/582 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1843/1843 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 601 solved, 1242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 63/63 constraints. Problems are: Problem set: 601 solved, 1242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 9/72 constraints. Problems are: Problem set: 601 solved, 1242 unsolved
[2024-05-28 22:02:01] [INFO ] Deduced a trap composed of 19 places in 305 ms of which 2 ms to minimize.
[2024-05-28 22:02:01] [INFO ] Deduced a trap composed of 171 places in 507 ms of which 4 ms to minimize.
[2024-05-28 22:02:02] [INFO ] Deduced a trap composed of 88 places in 588 ms of which 4 ms to minimize.
[2024-05-28 22:02:02] [INFO ] Deduced a trap composed of 155 places in 474 ms of which 4 ms to minimize.
[2024-05-28 22:02:04] [INFO ] Deduced a trap composed of 150 places in 324 ms of which 4 ms to minimize.
[2024-05-28 22:02:05] [INFO ] Deduced a trap composed of 178 places in 292 ms of which 4 ms to minimize.
[2024-05-28 22:02:07] [INFO ] Deduced a trap composed of 82 places in 317 ms of which 5 ms to minimize.
[2024-05-28 22:02:09] [INFO ] Deduced a trap composed of 246 places in 292 ms of which 4 ms to minimize.
[2024-05-28 22:02:16] [INFO ] Deduced a trap composed of 15 places in 571 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/572 variables, 9/81 constraints. Problems are: Problem set: 601 solved, 1242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/2427 variables, and 81 constraints, problems are : Problem set: 601 solved, 1242 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/582 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1843 constraints, Known Traps: 9/9 constraints]
After SMT, in 87142ms problems are : Problem set: 601 solved, 1242 unsolved
Search for dead transitions found 601 dead transitions in 87169ms
Found 601 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 601 transitions
Dead transitions reduction (with SMT) removed 601 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 582/655 places, 1253/1926 transitions.
Applied a total of 0 rules in 89 ms. Remains 582 /582 variables (removed 0) and now considering 1253/1253 (removed 0) transitions.
[2024-05-28 22:02:28] [INFO ] Redundant transitions in 81 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 168291 ms. Remains : 582/655 places, 1253/1926 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLCardinality-01
Stuttering criterion allowed to conclude after 50 steps with 4 reset in 3 ms.
FORMULA PolyORBNT-PT-S10J30-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLCardinality-01 finished in 168409 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 655/655 places, 1926/1926 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 654 transition count 1926
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 653 transition count 1925
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 653 transition count 1925
Applied a total of 3 rules in 105 ms. Remains 653 /655 variables (removed 2) and now considering 1925/1926 (removed 1) transitions.
Running 1914 sub problems to find dead transitions.
[2024-05-28 22:02:28] [INFO ] Flow matrix only has 1916 transitions (discarded 9 similar events)
// Phase 1: matrix 1916 rows 653 cols
[2024-05-28 22:02:28] [INFO ] Computed 82 invariants in 63 ms
[2024-05-28 22:02:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1914 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1914 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2569 variables, and 71 constraints, problems are : Problem set: 0 solved, 1914 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1914/1914 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1914 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1914 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1914 unsolved
[2024-05-28 22:03:19] [INFO ] Deduced a trap composed of 82 places in 216 ms of which 2 ms to minimize.
[2024-05-28 22:03:20] [INFO ] Deduced a trap composed of 84 places in 187 ms of which 3 ms to minimize.
[2024-05-28 22:03:29] [INFO ] Deduced a trap composed of 83 places in 141 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2569 variables, and 74 constraints, problems are : Problem set: 0 solved, 1914 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1914 constraints, Known Traps: 3/3 constraints]
After SMT, in 66020ms problems are : Problem set: 0 solved, 1914 unsolved
Search for dead transitions found 0 dead transitions in 66046ms
[2024-05-28 22:03:34] [INFO ] Flow matrix only has 1916 transitions (discarded 9 similar events)
[2024-05-28 22:03:34] [INFO ] Invariant cache hit.
[2024-05-28 22:03:35] [INFO ] Implicit Places using invariants in 938 ms returned []
[2024-05-28 22:03:35] [INFO ] Flow matrix only has 1916 transitions (discarded 9 similar events)
[2024-05-28 22:03:35] [INFO ] Invariant cache hit.
[2024-05-28 22:03:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:03:48] [INFO ] Implicit Places using invariants and state equation in 12784 ms returned []
Implicit Place search using SMT with State Equation took 13728 ms to find 0 implicit places.
Running 1914 sub problems to find dead transitions.
[2024-05-28 22:03:48] [INFO ] Flow matrix only has 1916 transitions (discarded 9 similar events)
[2024-05-28 22:03:48] [INFO ] Invariant cache hit.
[2024-05-28 22:03:48] [INFO ] State equation strengthened by 1 read => feed constraints.

BK_STOP 1716933849918

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../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="PolyORBNT-PT-S10J30"
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 PolyORBNT-PT-S10J30, 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-171654447200491"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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